A battery data transmission method and system based on dynamic priority preemption time slots

By employing dynamic priority preemption of time slots and a two-level retransmission strategy, the communication conflicts and real-time issues of traditional BMS systems in node-dense scenarios are resolved. This enables low-latency emergency data transmission, improves system reliability and compatibility, and is suitable for applications such as smart battery systems and electric vehicles.

CN122179904APending Publication Date: 2026-06-09四川新能源汽车创新中心有限公司 +1

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
四川新能源汽车创新中心有限公司
Filing Date
2026-02-11
Publication Date
2026-06-09

Smart Images

  • Figure CN122179904A_ABST
    Figure CN122179904A_ABST
Patent Text Reader

Abstract

The application relates to a battery data transmission method and system based on dynamic priority preemption time slots, which comprises the following steps: calculating the dynamic priority of a distributed node according to the data urgency, historical channel quality and basic priority of the distributed node; pre-empting the battery data transmission time slot according to the dynamic priority to perform battery data transmission; and performing a two-stage retransmission strategy to retransmit the battery data when the data transmission fails. The application breaks through the limitation of the fixed time slot allocation of the traditional time division multiple access communication strategy and adapts to the burst communication demand; when the wireless center node based on dynamic priority preemption performs time slot allocation and battery data retransmission, the communication conflict and real-time contradiction in the dense node scene can be effectively solved through software, the reliability, real-time performance and expandability of the system are significantly improved, and the application is suitable for intelligent battery system, electric vehicle, energy storage power station and other high-performance wireless center node application scenes.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of battery management technology, and specifically to a battery data transmission method and system based on dynamic priority preemption of time slots. Background Technology

[0002] In traditional distributed wireless BMS (Battery Management System) systems, communication protocols often employ a fixed time slot allocation mechanism, where each node transmits data within a predetermined time slot. This approach has the following problems: Severe communication conflicts: In scenarios with dense nodes, fixed time slots cannot flexibly respond to sudden data (such as voltage changes and temperature alarms), resulting in an increased packet collision rate and a significant increase in the system's packet error rate.

[0003] Low retransmission efficiency: Traditional retransmission mechanisms rely on random delays or fixed retransmission intervals, which cannot be dynamically adjusted according to channel conditions, resulting in low retransmission success rates and affecting system reliability.

[0004] Insufficient real-time performance: Emergency data (such as thermal runaway warnings) cannot be transmitted with priority, resulting in significant delays and failing to meet automotive-grade safety requirements.

[0005] Strong hardware dependence: Existing solutions often rely on specific hardware or dedicated circuits, which is not conducive to system compatibility and cost control. Summary of the Invention

[0006] To address the technical challenges in existing technologies, such as resolving communication conflicts in dense node scenarios and balancing the real-time transmission of urgent data, this invention provides a battery data transmission method and system based on dynamic priority preemption of time slots.

[0007] The technical solution of the present invention to solve the above-mentioned technical problems is as follows: A battery data transmission method based on dynamic priority preemption time slots includes the following steps: The dynamic priority of the distributed nodes is calculated based on the data urgency, historical channel quality, and basic priority of the distributed nodes. Battery data transmission time slots are preempted according to the dynamic priority to perform battery data transmission; When data transmission fails, a two-level retransmission strategy is executed to retransmit the battery data.

[0008] The beneficial effects of this invention are: it dynamically calculates node priority based on data urgency and historical channel quality, enabling low-latency transmission of urgent data; and employs a two-level retransmission strategy for data retransmission in case of transmission failure; this invention breaks through the limitations of fixed time slot allocation in traditional time division multiple access communication strategies, adapting to sudden communication needs; when allocating time slots and retransmitting battery data in wireless central nodes based on dynamic priority preemption, it can be implemented solely through software without the need for additional hardware design, effectively resolving communication conflicts and real-time performance contradictions in dense node scenarios, significantly improving the system's reliability, real-time performance, and scalability, and is suitable for high-performance wireless central node application scenarios such as smart battery systems, electric vehicles, and energy storage power stations.

[0009] Based on the above technical solution, the present invention can be further improved as follows.

[0010] Furthermore, the urgency of the data is determined by the data type.

[0011] Furthermore, the historical channel quality and the basic priority are both provided by the central node.

[0012] Furthermore, the distributed nodes are battery cell monitoring terminals, and the central node is a battery cluster coordinator.

[0013] Furthermore, the dynamic priority of the distributed nodes is calculated based on their data urgency, historical channel quality, and basic priority, using the following formula: ; in, This indicates the dynamic priority. Indicates the basic priority, This indicates the historical channel quality. Indicates the urgency of the data. The weighting coefficients representing the historical channel quality, The weighting coefficient represents the urgency of the data.

[0014] Furthermore, the historical channel quality refers to the historical packet loss rate or communication success rate.

[0015] Furthermore, the battery data transmission time slot is preempted according to the dynamic priority to perform battery data transmission, including the following steps: The distributed node with higher dynamic priority preempts the battery data transmission time slot of the distributed node with lower dynamic priority, and automatically extends the battery data transmission time slot of the preempted distributed node to perform battery data transmission.

[0016] Furthermore, the two-level retransmission strategy includes a fixed-delay retransmission strategy and a multiple retransmission strategy. The battery data is retransmitted using a two-level retransmission strategy, including the following steps: If the data transmission failure is the first failure, the battery data will be retransmitted using the fixed delay retransmission strategy. If the data transmission fails twice or more, the battery data will be retransmitted using the aforementioned retransmission strategy.

[0017] Furthermore, the multiple retransmission strategy includes an exponential backoff algorithm and a priority boosting mechanism; The retransmission of battery data using the aforementioned multiple retransmission strategy includes the following steps: The retransmission delay time is calculated using the number of retransmissions through the exponential backoff algorithm. The priority enhancement mechanism is used to increase the transmission priority of the battery data, and the battery data is retransmitted according to the retransmission delay time.

[0018] To address the aforementioned technical problems, this invention provides a battery data transmission system based on dynamic priority preemption time slots, the specific technical content of which is as follows: A battery data transmission system based on dynamic priority preemption time slots includes distributed nodes and a central node, wherein the distributed nodes and the central node communicate via a wireless communication broadcast channel. The central node is used to publish historical channel quality and basic priority to the distributed nodes; The distributed node is used to calculate its own dynamic priority based on its own data urgency, the historical channel quality, and the basic priority. The distributed nodes are also used to preempt battery data transmission time slots according to the dynamic priority for battery data transmission; when data transmission fails, a two-level retransmission strategy is executed to retransmit the battery data. Attached Figure Description

[0019] Figure 1 This is a flowchart illustrating a battery data transmission method based on dynamic priority preemption of time slots in an embodiment of the present invention. Figure 2 This is a flowchart illustrating the process of preempting battery data transmission time slots according to the dynamic priority in an embodiment of the present invention; Figure 3 This is a flowchart of the two-level retransmission strategy in an embodiment of the present invention; Figure 4 This is a schematic diagram of a battery data transmission system based on dynamic priority preemption of time slots in an embodiment of the present invention. Detailed Implementation

[0020] The principles and features of the present invention are described below with reference to the accompanying drawings. The examples given are only for explaining the present invention and are not intended to limit the scope of the present invention.

[0021] like Figure 1 As shown, a battery data transmission method based on dynamic priority preemption time slots includes the following steps: S1. Calculate the dynamic priority of the distributed nodes based on their data urgency, historical channel quality, and basic priority. The data urgency is determined by the data type, and both the historical channel quality and basic priority are provided by the central node. The distributed nodes are battery cell monitoring terminals, and the central node is a battery cluster coordinator. The historical channel quality refers to the historical packet loss rate or communication success rate.

[0022] The dynamic priority of the distributed nodes is calculated based on their data urgency, historical channel quality, and basic priority, using the following formula: ; in, This indicates the dynamic priority. Indicates the basic priority, This indicates the historical channel quality. Indicates the urgency of the data. The weighting coefficients representing the historical channel quality, The weighting coefficient represents the urgency of the data.

[0023] S2. Preempt the battery data transmission time slot according to the dynamic priority to perform battery data transmission; The process of preempting battery data transmission time slots according to the dynamic priority for battery data transmission includes the following steps: The distributed node with higher dynamic priority preempts the battery data transmission time slot of the distributed node with lower dynamic priority, and automatically extends the battery data transmission time slot of the preempted distributed node to perform battery data transmission.

[0024] The time slot preemption mechanism is as follows: The system allocates initial time slots to each node within each communication cycle. A high-priority node can preempt a low-priority node's time slot under the following conditions: the central node allocates an initial time slot to each node; the node has insufficient remaining time slots in the current cycle to complete data packet transmission; the data of the preempted node is not urgent and can be deferred to the next available time slot. After successful preemption, the preempted node automatically deferred to the next available time slot, and the system ensures timing continuity by reserving time (e.g., 10ms). This preemption mechanism is a distributed preemption mechanism, determined and executed autonomously by the SCA.

[0025] likeFigure 2 As shown, the process begins at the start of the communication cycle. The system first calculates a dynamic priority for all nodes, incorporating data urgency and historical channel quality, and sorts them accordingly. Then, the system allocates initial time slots to nodes in priority order. The core preemption judgment module evaluates the real-time transmission needs of high-priority nodes against the current time slot resources. If the preemption conditions are met (e.g., insufficient remaining time slots and a lower priority node in the target time slot), a time slot preemption operation is performed, and the preempted node is automatically deferred to a subsequent idle time slot. If no preemption is needed, all nodes send data according to the original plan. This process ensures that communication resources are dynamically and intelligently tilted towards the nodes that need data most, thereby optimizing real-time performance and reliability at the system level.

[0026] Table 1 Dynamic Time Slot Allocation Timing Table As shown in Table 1, the time sequence table visually illustrates the execution effect of the dynamic priority preemption mechanism on the timeline with a concrete example. Within a communication cycle, node B, with the highest priority (priority=4), preempts node A's originally scheduled time slot resource in time slot 1 to send data. This action triggers the postponement mechanism, and node A's data transmission is automatically adjusted to time slot 2. Meanwhile, node C, with the lowest priority, is able to send data concurrently with node A in time slot 2 as originally planned, since its time slot was not preempted. This time sequence table clearly demonstrates that this invention, through dynamic scheduling, effectively breaks the rigidity of fixed time slot allocation, enabling urgent data to be transmitted instantly, while ensuring that all nodes' data is ultimately successfully sent through the postponement mechanism.

[0027] S3. When data transmission fails, a two-level retransmission strategy is executed to retransmit the battery data.

[0028] The two-level retransmission strategy includes a fixed-delay retransmission strategy and a multiple retransmission strategy. The battery data is retransmitted using a two-level retransmission strategy, including the following steps: If the data transmission failure is the first failure, the battery data will be retransmitted using the fixed delay retransmission strategy. If the data transmission fails twice or more, the battery data will be retransmitted using the aforementioned retransmission strategy.

[0029] The multiple retransmission strategy includes an exponential backoff algorithm and a priority boosting mechanism; The retransmission of battery data using the aforementioned multiple retransmission strategy includes the following steps: The retransmission delay time is calculated using the number of retransmissions through the exponential backoff algorithm. The priority enhancement mechanism is used to increase the transmission priority of the battery data, and the battery data is retransmitted according to the retransmission delay time.

[0030] Intelligent retransmission control mechanism When data transmission fails (e.g., no acknowledgment is received or a collision is detected), the node initiates a two-stage retransmission strategy: First retransmission: A fixed timeslot offset strategy is adopted, that is, after the originally scheduled transmission timeslot, a fixed number of timeslots is delayed (e.g., offset by 2 timeslots) before the first retransmission attempt. This strategy aims to quickly attempt to recover data with lower computational overhead and latency.

[0031] If the first retransmission fails after two or more retransmissions, a more complex adaptive retransmission phase is initiated. This phase integrates the exponential backoff algorithm and the priority boosting mechanism.

[0032] The exponential backoff algorithm effectively avoids further collisions among multiple nodes after consecutive failures by dynamically adjusting the retransmission waiting window. Specifically, the retransmission delay of a node increases exponentially with the number of retransmissions. The calculation formula can be expressed as: in, Count the current retransmission count (starting from the second retransmission). Indicates from 0 to Choose a random integer between these two values. This is the length of a standard timeslot. This random backoff mechanism disperses the retransmission times of conflicting nodes, significantly reducing the probability of another collision.

[0033] Priority enhancement involves increasing the dynamic priority of a node during exponential backoff (e.g., by adding a fixed value to the original priority). After the priority enhancement period ends, the node will have the right to preempt time slots from lower-priority nodes, allowing it to access the channel more quickly and retransmit critical data.

[0034] The aforementioned intelligent retransmission control mechanism, through the evolution of strategies from "fixed delay" to "adaptive backoff and preemption," achieves a balance between retransmission success rate and overall system efficiency, exhibiting superior robustness, especially under network congestion or poor channel quality. The retransmission decisions (retransmission time, retransmission method) are made entirely locally by the SCA, demonstrating its intelligence and autonomy.

[0035] like Figure 3As shown, when a node detects a data transmission failure, the system first determines the number of retransmissions and then initiates different retransmission strategies. For the first retransmission, a fixed time slot offset strategy is used to attempt data recovery with low overhead. If the first retransmission also fails, a more aggressive second and subsequent retransmission phase begins. The core of this phase combines the exponential backoff algorithm with a priority boosting mechanism. The exponential backoff algorithm calculates the waiting time using a random window that grows exponentially with the number of retransmissions, effectively dispersing conflicting nodes. Simultaneously, the boosting of a node's priority grants it the ability to preempt idle time slots from lower-priority nodes. These two mechanisms work together to ensure that, in a continuous conflict environment, retransmission requests are both intelligently delayed to avoid congestion and prioritized after the waiting period, thus greatly improving the probability and timeliness of successful retransmissions. This invention dynamically calculates node priorities based on data urgency and historical channel quality, enabling low-latency transmission of urgent data. It overcomes the limitations of traditional TDMA's fixed time slot allocation, adapting to sudden communication demands. Combining fixed latency with an exponential backoff strategy improves retransmission success rate; a priority-boosting mechanism ensures priority scheduling of retransmitted data, effectively addressing channel conflicts. It is implemented purely in firmware, is hardware-independent, and all logic is implemented in the MCU firmware, compatible with general-purpose BLE chips (such as ARM Cortex-M0 core chips), requiring no hardware circuit modification, thus reducing cost and development difficulty. The system boasts excellent compatibility and scalability, supporting dynamic node joining, leaving, and automatic networking, making it suitable for large-scale battery pack scenarios. It can be seamlessly integrated with existing BMS systems, supporting full lifecycle monitoring and control of batteries. This invention overcomes the limitations of fixed time slot allocation in traditional time-division multiple access communication strategies, adapting to sudden communication demands. When allocating time slots and retransmitting battery data based on dynamic priority preemption in wireless central nodes, it can be achieved solely through software, without requiring additional hardware design. This effectively resolves communication conflicts and real-time performance contradictions in dense node scenarios, significantly improving system reliability, real-time performance, and scalability. It is suitable for high-performance wireless central node applications such as smart battery systems, electric vehicles, and energy storage power stations.

[0036] like Figure 4 As shown, in some other embodiments, a battery data transmission system based on dynamic priority preemption time slots is also provided, including distributed nodes and a central node, wherein the distributed nodes and the central node communicate through a wireless communication broadcast channel: The central node is used to publish historical channel quality and basic priority to the distributed nodes; The distributed node is used to calculate its own dynamic priority based on its own data urgency, the historical channel quality, and the basic priority. The distributed nodes are also used to preempt battery data transmission time slots according to the dynamic priority for battery data transmission; when data transmission fails, a two-level retransmission strategy is executed to retransmit the battery data.

[0037] The wireless communication architecture consists of distributed nodes, namely distributed BMS nodes (i.e., monitoring terminals on smart battery cells, referred to as SCA (Smart Cell Agent) in this invention), and a central node, namely the central BMS (i.e., access point, referred to as BCC (Battery Cluster Coordinator) in this invention). It uses a BLE (Bluetooth Low Energy) broadcast channel for periodic data reporting and control command distribution. The core control logic of the system is distributed between the SCA and BCC, achieving dynamic communication scheduling through collaborative work.

[0038] A basic Time Division Multiple Access (TDMA) timing framework is established as the foundation of the communication system. The system's communication time is divided into periodic cycles, and each cycle is further divided into several time slots of fixed length. The central BMS statically allocates an initial, non-overlapping transmission time slot to each distributed node (SCA), thereby providing a conflict-free basic communication schedule for all nodes under ideal conditions.

[0039] TDMA (Time Division Multiple Access) is a classic communication channel-sharing technique. It divides the wireless signal into repeating periods (called "frames") in the time domain, and each frame is further divided into several non-overlapping time slots. Each distributed BMS node is allocated a specific time slot for data transmission. This mechanism avoids conflicts caused by multiple nodes transmitting data simultaneously, providing an orderly foundation for wireless communication.

[0040] Functionality implemented in the distributed BMS node (SCA): Local priority calculation: Each SCA independently calculates the initial urgency of its data based on its local battery data (such as voltage and temperature) and preset rules.

[0041] Channel monitoring and collision detection: SCA monitors the channel to determine whether its data has been successfully sent or needs to be retransmitted.

[0042] Exponential backoff calculation and execution: When the retransmission condition is triggered, SCA executes the exponential backoff algorithm locally to determine a random waiting time.

[0043] In the preemption decision and execution process, the high-priority SCA initiates preemption of the broadcast channel autonomously after meeting the local determination conditions.

[0044] Functions implemented in the central BMS (BCC): Global view maintenance and synchronization: BCC is responsible for broadcasting the global clock synchronization signal (time synchronization), maintaining the above-mentioned basic TDMA timing framework, and allocating initial, non-overlapping communication time slots for all SCAs.

[0045] Historical channel quality assessment: BCC calculates the historical packet loss rate of each SCA based on the received data packets and broadcasts this information to each SCA at the beginning of the communication cycle.

[0046] In the final arbitration and learning process, the BCC receives all data but does not directly participate in the real-time arbitration of each transmission slot. By analyzing long-term communication quality, the BCC can adjust global parameters used for priority calculation (such as weighting coefficients). ), and optimize system performance through broadcasting in the next cycle.

[0047] Collaborative working mechanism: At the start of the cycle, the BCC broadcasts the time synchronization signal and global information (such as historical packet loss rate), marking the beginning of a new TDMA cycle.

[0048] Priority calculation: Each SCA uses local urgency information and global information issued by BCC to independently calculate its own dynamic priority according to a unified priority formula.

[0049] Distributed preemption allows higher-priority SCAs to preempt lower-priority SCAs' time slots without BCC authorization, based on a distributed protocol. The preempted SCA then automatically postpones its transmission.

[0050] Distributed retransmission (SCA) allows nodes to break fixed time slot allocations under specific conditions, thereby achieving more flexible and efficient communication scheduling. A failed transmission SCA autonomously selects a fixed offset or exponential backoff strategy based on the locally maintained retransmission count, and autonomously attempts to retransmit or preempt after the backoff period ends.

[0051] In other embodiments, a storage medium is also provided, which stores a computer program or computer instructions that, when executed by a computer's processor, implement the steps of the above-described battery data transmission method based on dynamic priority preemption time slots.

[0052] The storage medium can be an internal storage unit of any data processing device described in any of the foregoing embodiments, such as a hard disk or memory. The storage medium can also be an external storage device of any data processing device, such as a plug-in hard disk, smart memory card, SD card, flash memory card, etc., mounted on the device. Furthermore, the storage medium can include both internal storage units and external storage devices of any data processing device. The computer-readable storage medium is used to store the computer program and other programs and data required by the data processing device, and can also be used to temporarily store data that has been output or will be output.

[0053] In other embodiments, a computer is also provided, including a memory and one or more processors, wherein executable code is stored in the memory, and when the one or more processors execute the executable code, the steps of the above-described battery data transmission method based on dynamic priority preemption time slots are implemented.

[0054] The memory can be an internal storage unit of any data processing device described in any of the foregoing embodiments, such as a hard disk or RAM. The memory can also be an external storage device of any data processing device, such as a plug-in hard disk, smart memory card, SD card, flash memory card, etc., mounted on the device. Furthermore, the memory can include both internal storage units and external storage devices of any data processing device. The memory is used to store the computer program and other programs and data required by the data processing device, and can also be used to temporarily store data that has been output or will be output.

[0055] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the concept and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A battery data transmission method based on dynamic priority preemption time slots, characterized in that, Includes the following steps: The dynamic priority of the distributed nodes is calculated based on the data urgency, historical channel quality, and basic priority of the distributed nodes. Battery data transmission time slots are preempted according to the dynamic priority to perform battery data transmission; When data transmission fails, a two-level retransmission strategy is executed to retransmit the battery data.

2. The battery data transmission method based on dynamic priority preemption time slots according to claim 1, characterized in that, The urgency of the data is determined by the data type.

3. The battery data transmission method based on dynamic priority preemption time slots according to claim 1, characterized in that, The historical channel quality and the basic priority are both provided by the central node.

4. The battery data transmission method based on dynamic priority preemption time slots according to claim 3, characterized in that, The distributed nodes are individual battery monitoring terminals, and the central node is a battery cluster coordinator.

5. The battery data transmission method based on dynamic priority preemption time slots according to claim 1, characterized in that, The dynamic priority of the distributed nodes is calculated based on their data urgency, historical channel quality, and basic priority, using the following formula: ; in, This indicates the dynamic priority. Indicates the basic priority, This indicates the historical channel quality. Indicates the urgency of the data. The weighting coefficients representing the historical channel quality, The weighting coefficient represents the urgency of the data.

6. The battery data transmission method based on dynamic priority preemption time slots according to claim 5, characterized in that, The historical channel quality refers to the historical packet loss rate or communication success rate.

7. The battery data transmission method based on dynamic priority preemption time slots according to claim 1, characterized in that, The process of preempting battery data transmission time slots according to the dynamic priority for battery data transmission includes the following steps: The distributed node with higher dynamic priority preempts the battery data transmission time slot of the distributed node with lower dynamic priority, and automatically extends the battery data transmission time slot of the preempted distributed node to perform battery data transmission.

8. The battery data transmission method based on dynamic priority preemption time slots according to claim 1, characterized in that, The two-level retransmission strategy includes a fixed-delay retransmission strategy and a multiple retransmission strategy. The battery data is retransmitted using a two-level retransmission strategy, including the following steps: If the data transmission failure is the first failure, the battery data will be retransmitted using the fixed delay retransmission strategy. If the data transmission fails twice or more, the battery data will be retransmitted using the aforementioned retransmission strategy.

9. The battery data transmission method based on dynamic priority preemption time slots according to claim 8, characterized in that, The multiple retransmission strategy includes an exponential backoff algorithm and a priority boosting mechanism; The retransmission of battery data using the aforementioned multiple retransmission strategy includes the following steps: The retransmission delay time is calculated using the number of retransmissions through the exponential backoff algorithm. The priority enhancement mechanism is used to increase the transmission priority of the battery data, and the battery data is retransmitted according to the retransmission delay time.

10. A system employing the battery data transmission method based on dynamic priority preemption time slots as described in any one of claims 1 to 9, characterized in that, It includes distributed nodes and a central node, and the distributed nodes and the central node communicate through a wireless communication broadcast channel: The central node is used to publish historical channel quality and basic priority to the distributed nodes; The distributed node is used to calculate its own dynamic priority based on its own data urgency, the historical channel quality, and the basic priority. The distributed nodes are also used to preempt battery data transmission time slots according to the dynamic priority for battery data transmission; when data transmission fails, a two-level retransmission strategy is executed to retransmit the battery data.