5G wireless body area network priority dynamic spectrum access method
By introducing service priority grouping and dynamic duty cycle adjustment mechanisms into the wireless body area network, combined with centralized scheduling and adaptive conflict coordination access mechanisms, the problems of WBAN spectrum resource scarcity and transmission stability are solved, achieving efficient spectrum utilization and service quality assurance.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- BEIJING CHANGKUN TECHNOLOGY LTD
- Filing Date
- 2026-02-27
- Publication Date
- 2026-04-28
AI Technical Summary
Existing wireless body area networks (WBANs) face spectrum resource shortages. Static spectrum management cannot adapt to rapidly changing dynamic environments, dynamic spectrum allocation algorithms are highly complex, and classic spectrum access algorithms cannot guarantee reliable transmission of high-priority services in high-density, multi-priority scenarios, leading to decreased transmission stability.
A service priority grouping mechanism is adopted to divide terminal devices into high-priority groups and low-priority groups. A dynamic duty cycle adjustment mechanism and an adaptive conflict coordination access mechanism are introduced. Through centralized scheduling and an adaptive multi-level backoff mechanism, spectrum resource allocation is optimized.
While ensuring the quality of high-priority services, it significantly reduces data transmission conflicts within the system, improves spectrum utilization efficiency and system stability, and is suitable for deployment of WBAN terminals with limited computing and energy.
Smart Images
Figure CN121940889A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of 5G communication technology, and more specifically, to a method for priority dynamic spectrum access in 5G wireless body area networks. Background Technology
[0002] Wireless Body Area Networks (WBANs), as a short-range wireless communication technology centered on the human body and integrating sensing, communication, and mobility, have become one of the research hotspots in the field of smart healthcare.
[0003] With the continuous growth in the number of WBAN terminals and traffic volume, spectrum resources are becoming increasingly scarce, posing challenges to system capacity. To address these issues, some researchers have adopted static methods for spectrum management; however, these methods cannot adapt to the rapidly changing dynamic environment of WBAN. Other researchers have proposed dynamic spectrum allocation methods, which can adapt well to the rapidly changing environment of WBAN communication, but their high algorithm complexity makes them unsuitable for deployment on terminal devices with average performance. With the integration of artificial intelligence and communication networks, spectrum access algorithms based on reinforcement learning (RL) have become a research hotspot. However, RL methods generally suffer from slow convergence speed, high computational complexity, high energy consumption, and the need for large amounts of training data, posing challenges for deployment on computationally and energy-constrained WBAN terminals.
[0004] Classic spectrum access algorithms such as Listen-Before-Talk (LBT) and CSAT have advantages such as simple computation, no training required, and easy deployment. However, they still have shortcomings in high-density, multi-priority WBAN scenarios: LBT cannot guarantee reliable transmission of high-priority services; although CSAT simplifies the protocol and prioritizes primary users, its fixed duty cycle and lack of coordination and competition mechanism with secondary users lead to increased conflicts and decreased transmission stability. Therefore, there is an urgent need for a spectrum access method with dynamic resource adjustment to improve overall spectrum utilization efficiency and system stability. Summary of the Invention
[0005] In view of this, the present invention proposes a 5G wireless body area network priority dynamic spectrum access method. By grouping terminals according to service priorities, introducing a dynamic duty cycle adjustment mechanism based on real-time load, and designing an adaptive conflict coordination access mechanism for low-priority terminals, the method can significantly reduce data transmission conflicts within the system while ensuring the service quality of high-priority services.
[0006] To achieve the above objectives, this invention proposes a 5G wireless body area network priority dynamic spectrum access method, comprising: All terminal devices are divided into high-priority and low-priority groups according to the service quality requirements of the business. The system communication time is divided into several scheduling cycles, and the scheduling cycles are further divided into a high-priority dedicated transmission phase and a low-priority contention transmission phase. At the beginning of each scheduling cycle, the duration ratio of the high-priority dedicated transmission phase to the low-priority contention transmission phase is adjusted according to the real-time service load of the high-priority group and the dynamic duty cycle. During the high-priority dedicated transmission phase, a centralized scheduling method is used to allocate transmission time slots to high-priority terminals; During the low-priority contention transmission phase, low-priority terminals use an adaptive multi-level backoff and recovery mechanism based on carrier sensing to access the channel.
[0007] Furthermore, the high-priority group carries services with stringent requirements for latency and reliability, including emergency alarms for vital signs and remote surgical control signals; The low-priority group carries services with relatively relaxed requirements for latency and reliability, including routine physiological parameter monitoring and historical data reporting.
[0008] Furthermore, during the high-priority dedicated transmission phase, only high-priority group terminals are allowed to send data, while during the low-priority contention transmission phase, low-priority group terminals are allowed to access the channel and send data in a contention-based manner.
[0009] Furthermore, the high-priority dedicated transmission phase The calculation formula is The low-priority contention transmission phase The calculation formula is ; in, D For dynamic duty cycle, The scheduling period is [number].
[0010] Furthermore, the dynamic duty cycle D The calculation method is as follows:
[0011] In the formula, n This indicates the number of data packets waiting to be sent in the high-priority group scheduling queue at the current moment; This represents the maximum depth of the high-priority queue. and These are the preset lower and upper limits for the duty cycle, respectively.
[0012] Furthermore, the centralized scheduling method for the high-priority dedicated transmission phase includes polling, fixed time slot allocation, priority-based static scheduling, or earliest deadline first algorithm. The scheduled terminal does not need to compete for channel space in the specified time slot and can directly send data.
[0013] Furthermore, the adaptive multi-level backoff and recovery mechanism for low-priority terminals includes the following steps: Initialize the competition window to its minimum value. ; Before sending data, the terminal listens to the channel. If the channel is idle, it randomly selects a backoff time slot to wait. If the channel is still idle after the backoff ends, it sends data. If the transmission fails, the contention window will be doubled and a new backoff slot will be selected; If sent successfully consecutively Ks The next data packet will halve the contention window; If the same data frame fails consecutively Kd If the frame is discarded, the contention window will be reset. .
[0014] Furthermore, at the beginning of each scheduling cycle, the base station sends the dynamic duty cycle of the current cycle and the start time of the low-priority contention transmission phase to all terminals via broadcast signaling.
[0015] Furthermore, the adjustment method of the dynamic duty cycle is not limited to a linear formula, but also includes a lookup table method or a prediction algorithm based on historical load.
[0016] Compared with the prior art, the beneficial effects of the present invention are as follows: This invention provides a dedicated contention-free transmission phase for high-priority services, avoiding delays and packet loss caused by contention conflicts and ensuring the communication quality of critical services.
[0017] By adopting a dynamic duty cycle adjustment mechanism based on real-time load, the system resource allocation can closely follow changes in business needs. This avoids the waste of fixed resource allocation in traditional CSAT and overcomes the shortcomings of pure competition mechanisms (such as LBT) that suffer from a sharp drop in performance under heavy load, resulting in a significant improvement in overall spectrum efficiency.
[0018] The low-priority terminal adaptive multi-level backoff and recovery mechanism designed in this invention can quickly suppress contention intensity after a conflict occurs and gradually restore access enthusiasm during consecutive successes, effectively controlling conflict propagation and improving efficiency. Channel utilization and transmission stability during the phase.
[0019] The core control logic of the method of this invention is located on the base station side. The terminal side only needs to execute simple rules (listening, backoff, state update), without the need for complex calculation or training processes. The algorithm has low complexity and is very suitable for deployment of WBAN terminal devices with limited processing power and energy. Attached Figure Description
[0020] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the invention. In the drawings: Figure 1 This is a schematic diagram of the WBAN system composition in an embodiment of the present invention; Figure 2 This is a schematic diagram of the dynamic periodic frame structure in an embodiment of the present invention; Figure 3 This is a schematic diagram of the adaptive multi-level backoff and recovery mechanism for low-priority groups in an embodiment of the present invention; Figure 4 This is an overall workflow diagram in an embodiment of the present invention. Detailed Implementation
[0021] Exemplary embodiments of the present disclosure will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the disclosure to those skilled in the art. It should be noted that, unless otherwise specified, the embodiments and features described herein can be combined with each other. The present invention will now be described in detail with reference to the accompanying drawings and embodiments.
[0022] Example 1 This embodiment proposes a 5G wireless body area network priority dynamic spectrum access method, including: Step S1: System modeling and terminal priority grouping.
[0023] Suppose a WBAN system consists of one base station and N terminal devices. The base station divides all terminals into two categories based on the quality of service requirements of the services carried by each terminal: High-priority group: Carries services with stringent requirements for latency and reliability, such as emergency alarms for vital signs and remote surgical control signals.
[0024] Low priority group: Carries services with relatively relaxed requirements for latency and reliability, such as routine physiological parameter monitoring and historical data reporting.
[0025] Packet information is maintained by the base station and can be notified to the terminal via signaling.
[0026] Step S2: Construct a dynamic periodic frame structure, as shown in the frame structure diagram. Figure 2 As shown.
[0027] The system communication time is divided into continuous, equal-length scheduling periods. Within each cycle, time resources are dynamically divided into two phases: High-priority dedicated transmission phase During this period, only high-priority group terminals are allowed to send data.
[0028] Low-priority contention transmission phase During this period, low-priority group terminals are allowed to access the channel and transmit data in a contention-based manner.
[0029] in , , D It is a dynamic duty cycle, the value of which is calculated and determined by the base station based on the current network status at the beginning of each scheduling cycle.
[0030] Step S3: Dynamic Duty Cycle D Adjustment mechanism.
[0031] Dynamic duty cycle D The adjustment is based on the real-time service load of the high-priority group, aiming to balance the guarantee requirements of high-priority services with the access opportunities of low-priority services. The calculation formula is as follows:
[0032] In the formula, n This indicates the number of data packets waiting to be sent in the high-priority group scheduling queue at the current moment; This represents the maximum depth (capacity) of the high-priority queue. To ensure that low-priority groups receive the minimum necessary access opportunities, the duty cycle is usually set based on the minimum bandwidth requirements of low-priority services, and the value range is generally from 0.1 to 0.3. To prevent high-priority groups from excessively consuming resources and to ensure long-term system fairness, the duty cycle upper limit, while also considering signaling overhead control, is typically set between 0.7 and 0.9. This formula makes... D It can grow smoothly with the increase in high-priority business volume and adaptively adjust the degree of resource allocation.
[0033] Dynamic duty cycle D The calculation is not limited to the linear formula mentioned above; a lookup table method or a prediction algorithm based on historical load can also be used.
[0034] Step S4: Contention-free access control for high-priority groups.
[0035] exist During this phase, the base station uses a centralized scheduling method (such as polling or fixed time slot allocation) to allocate specific transmission time slots to high-priority terminals. The scheduled terminals do not need to compete for channel space in the designated time slot and can directly transmit data, thereby ensuring the reliability and low latency of their transmission.
[0036] The scheduling method for high-priority groups is not limited to round-robin; priority-based static scheduling or the earliest deadline first (EDF) algorithm can also be used.
[0037] Step S5: Improved contention access control for low-priority groups.
[0038] The access process for low-priority groups is as follows: Figure 3 As shown. In During this phase, low-priority terminals employ distributed contention-based access using carrier sensing. To reduce the probability of collisions and improve the access success rate, an adaptive multi-level backoff and recovery mechanism is proposed. This mechanism is embedded in each low-priority terminal, and the specific rules are as follows: Initialization: Each terminal maintains a contention window value. CW The initial value is ; Channel access: The terminal listens to the channel before transmitting. If the channel is idle, it will transmit in [0, ... CW Randomly select a backoff time slot within the range of -1] to wait; if the channel is still idle after the backoff ends, then send data.
[0039] Collision backoff: If no acknowledgment (ACK) is received after data transmission, it is determined that a transmission collision or failure has occurred, and backoff is executed: CW Updated to and in the new CW Select a new backoff value within the range.
[0040] Gradual recovery: If the terminal successfully sends data continuously Ks Secondary data packets (e.g.) Ks =3), then will CW Halve, i.e. update to This allows for a gradual increase in access enthusiasm when channel conditions are favorable.
[0041] In the backoff mechanism of the low priority group, the increment factor of the contention window CW is not limited to 2, and the decrement factor is not limited to 1 / 2. It can be dynamically adjusted according to the network conditions.
[0042] Discard and reset: If the same data frame experiences consecutive Kd The first transmission failed (e.g.) Kd If =7), then discard the frame and... CW Reset to This avoids unnecessary retransmissions that consume too many resources.
[0043] Step S6: Collaborative Workflow.
[0044] The overall system workflow diagram is as follows: Figure 4 As shown, at the beginning of each scheduling period, the base station performs the following operations: 1. Collect the status information of high-priority groups and calculate the dynamic duty cycle for the current period. D .
[0045] 2. Determine and The duration is determined, and scheduling information is generated.
[0046] 3. Broadcast signaling (such as beacon frames) D , The start time of the phase and other parameters are notified to all terminals.
[0047] 4. In During this phase, high-priority terminals are scheduled to send data without contention based on the scheduling results.
[0048] 5. Enter After the initial phase, low-priority terminals will compete for access independently according to the improved contention access mechanism. The base station will only be responsible for receiving data and will not participate in the specific contention scheduling.
[0049] Example 2 This embodiment presents a specific WBAN medical monitoring scenario and elaborates on the implementation process of the present invention. The system consists of a base station and several wearable medical sensor terminals.
[0050] 1. System Initialization and Parameter Configuration After the base station starts up, it broadcasts network beacons, and each sensor reports its service type and QoS requirements. For example: ECG monitoring terminals and emergency blood oxygen alarm terminals → are assigned to the high-priority group (HPG). Body temperature monitoring terminals and motion sensing terminals → classified as low priority group (LPG). The base station is configured with the following system parameters: Scheduling cycle = 20ms Dynamic duty cycle range = 0.2, = 0.75 HPG queue depth limit = 15 LPG Competition Window = 8, = 512 Continuous successful windowing threshold Ks = 3, maximum number of retransmissions Kd = 5 2. Status reporting and maintenance Each HPG terminal periodically reports its queue status (number of packets to be sent) to the base station.
[0051] The base station maintains a global HPG queue status table and updates it periodically.
[0052] 3. Dynamic scheduling cycle execution process (based on the first...) k (Taking the cycle as an example) Step 1: Duty Cycle Calculation and Resource Allocation The base station reads the total number of pending HPG packets. n = 7 Calculate the dynamic duty cycle: D = 0.2 + (0.75 - 0.2) × (7 / 15) ≈ 0.457 Divide into time periods: = 0.457 × 20 ms ≈ 9.14 ms, = 20 - 9.14 = 10.86ms Step 2: Broadcasting Dispatch Information At the start of the cycle, the base station broadcasts the following information via beacon frames: Periodic number k Duty cycle D = 0.457 Start time offset t = 9.14ms HPG current scheduling sequence (e.g., ECG1 → Blood Oxygen 1 → ECG2) Step 3: Contention-Free HPG Transmission Phase Within the time frame of 0~9.14ms: The base station sends an "authorized transmission" command to the ECG1 terminal according to the scheduling sequence.
[0053] After receiving the instruction, the ECG1 terminal immediately sends data packets in the allocated time slot without needing to listen to the channel.
[0054] The base station sends an ACK response after receiving the data.
[0055] Repeat the above process until all HPG terminals in the scheduling sequence have completed their transmissions.
[0056] Step 4: LPG Adaptive Contention Access Phase During the period from 9.14 to 20ms: After all LPG terminals synchronize their time, they begin executing the improved contention access process.
[0057] Taking body temperature monitoring terminal A as an example: 1. Listen to the channel; if idle, start from the current... CW = 8, randomly select the number of retreat slots b = 3.
[0058] 2. Listen again after 3 time slots. If it is still idle, send data.
[0059] 3. If an ACK is received, record the number of consecutive successful attempts. success_cnt Add 1, if success_cnt If Ks = 3, then update. CW =max( CW / 2, )=4; 4. If no ACK is received, a conflict is determined, and an update is performed. CW = = 16, record the number of failures fail_cnt ,like fail_cnt > Kd = 5, then discard the packet and reset. CW = 8.
[0060] During this phase, the base station only receives data and replies with ACKs, and does not participate in the scheduling contention process.
[0061] Step 5: Cycle Switching and State Reset At the end of the k-th cycle, the base station clears the HPG scheduled count and prepares for the next cycle calculation.
[0062] LPG terminals maintain their current status. CW, success_cnt, failure_cnt The state is carried over to the next cycle. Continue to use it during this phase.
[0063] 4. Dynamic Adaptability and Anomaly Handling If the HPG queue becomes empty in the next cycle ( n = 0), then D = D When min=0.2, the system allocates more resources to LPG contention for access.
[0064] If a new terminal appears in the network, the base station will assign it a priority and add it to the corresponding group through a registration mechanism.
[0065] If a sudden change in channel quality leads to consecutive collisions in the LPG, its CW It will increase rapidly, effectively reducing the probability of conflict and maintaining system stability.
[0066] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that modifications or equivalent substitutions can still be made to the specific implementation of the present invention. Any modifications or equivalent substitutions that do not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.
Claims
1. A method for priority dynamic spectrum access in a 5G wireless body area network, characterized in that, include: All terminal devices are divided into high-priority and low-priority groups according to the service quality requirements of the business. The system communication time is divided into several scheduling cycles, and the scheduling cycles are further divided into a high-priority dedicated transmission phase and a low-priority contention transmission phase. At the beginning of each scheduling cycle, the duration ratio of the high-priority dedicated transmission phase to the low-priority contention transmission phase is adjusted according to the real-time service load of the high-priority group and the dynamic duty cycle. During the high-priority dedicated transmission phase, a centralized scheduling method is used to allocate transmission time slots to high-priority terminals; During the low-priority contention transmission phase, low-priority terminals use an adaptive multi-level backoff and recovery mechanism based on carrier sensing to access the channel.
2. The method according to claim 1, characterized in that, The high-priority group carries services with stringent requirements for latency and reliability, including emergency alarms for vital signs and remote surgical control signals; The low-priority group carries services with relatively relaxed requirements for latency and reliability, including routine physiological parameter monitoring and historical data reporting.
3. The method according to claim 1, characterized in that, During the high-priority dedicated transmission phase, only high-priority group terminals are allowed to send data, while during the low-priority contention transmission phase, low-priority group terminals are allowed to access the channel and send data in a contention-based manner.
4. The method according to claim 1, characterized in that, The high-priority dedicated transmission phase The calculation formula is: The low-priority contention transmission phase The calculation formula is: ; in, D For dynamic duty cycle, The scheduling period is [number].
5. The method according to claim 1, characterized in that, The dynamic duty cycle D The calculation method is as follows: ， In the formula, n This indicates the number of data packets waiting to be sent in the high-priority group scheduling queue at the current moment; This represents the maximum depth of the high-priority queue. and These are the preset lower and upper limits of the duty cycle, respectively.
6. The method according to claim 1, characterized in that, The centralized scheduling methods for the high-priority dedicated transmission phase include polling, fixed time slot allocation, priority-based static scheduling, or earliest deadline first algorithm. The scheduled terminal does not need to compete for channel space in the specified time slot and can directly send data.
7. The method according to claim 1, characterized in that, The adaptive multi-level backoff and recovery mechanism for low-priority terminals includes the following steps: Initialize the competition window to its minimum value. ; Before sending data, the terminal listens to the channel. If the channel is idle, it randomly selects a backoff time slot to wait. If the channel is still idle after the backoff ends, it sends data. If the transmission fails, the contention window will be doubled and a new backoff slot will be selected; If sent successfully consecutively Ks The next data packet will halve the contention window; If the same data frame fails consecutively Kd If the frame is discarded, the contention window will be reset. .
8. The method according to claim 1, characterized in that, At the beginning of each scheduling cycle, the base station sends the dynamic duty cycle of the current cycle and the start time of the low-priority contention transmission phase to all terminals via broadcast signaling.
9. The method according to claim 1, characterized in that, The method for adjusting the dynamic duty cycle is not limited to a linear formula, but also includes a lookup table method or a prediction algorithm based on historical load.