Target wakeup time service period scheduling method and system based on Wi-Fi7

Abstract

Disclosed are a Wi-Fi7-based target wake-up time service period scheduling method and system, relating to the technical field of information, comprising: an access point receiving a buffer status report of each terminal, the buffer status report of each terminal comprising a data volume to be transmitted, a data priority and link status information; with minimization of the total energy consumption of the system as a target, a constraint condition is preset based on a to-be-transmitted data volume, and a transmission link combination and a service period duration are allocated to each terminal by using a genetic algorithm; and distributing a service period time window for each terminal according to the data priority, reserving a protection interval in adjacent service periods, and notifying the terminal to output a scheduling result through a trigger frame or a beacon frame.

Description

Technical Field

[0001] The present invention relates to the field of information technology, and in particular to a target wake-up time service period scheduling method and system based on Wi-Fi 7. Background Art

[0002] Since the 1990s, Wi-Fi technology, as the core technology of wireless local area networks, has undergone a continuous evolution from basic data transmission to high-throughput and low-latency services. With the popularization of rich media applications and the surge in device access density, Wi-Fi technology has achieved a milestone breakthrough with its seventh-generation standard, Wi-Fi 7 (IEEE 802.11be). Building on Wi-Fi 6 (802.11ax), this standard introduces three key technologies: 320MHz channel bandwidth, 4096-QAM high-order modulation technology, and Multi-Link Operation (MLO). Its theoretical peak throughput reaches 23Gbps (approximately three times higher than Wi-Fi 6) and significantly reduces transmission latency, providing technical support for high-bandwidth, low-latency scenarios.

[0003] MLO technology allows devices to simultaneously connect to access points across multiple frequency bands, including 2.4GHz, 5GHz, and 6GHz, effectively improving network throughput and transmission reliability. However, the multi-link parallel operation significantly increases device power consumption, especially for battery-powered mobile devices, severely limiting the practical application of MLO technology.

[0004] To reduce energy consumption, Wi-Fi standards have introduced the Target Wake Time (TWT) mechanism since 802.11ah. TWT is a key energy-saving technology for Wi-Fi networks and has been used since 802.11ah was introduced. TWT coordinates the communication time between terminals and access points (APs), reducing device wake-up frequency, thereby extending battery life and improving network efficiency.

[0005] Existing TWT service period scheduling methods have significant limitations: the solution for single-link multi-user scenarios can only optimize wake-up scheduling within a single frequency band, and cannot coordinate resource allocation across links, resulting in frequent switching of multi-link devices between different frequency bands, causing service period overlap and air interface resource competition; while the scheduling solution for multi-link single-user scenarios can optimize the multi-link coordination of a single device, it ignores the transmission demand conflicts between multiple users, and is prone to serious channel resource fragmentation in dense deployment scenarios, weakening the energy-saving effect of TWT. Summary of the Invention

[0006] In order to solve the deficiencies mentioned in the above background technology, the purpose of the present invention is to provide a target wake-up time service period scheduling method and system based on Wi-Fi7.

[0007] In a first aspect, the purpose of the present invention can be achieved by the following technical solution: a target wake-up time service period scheduling method based on Wi-Fi 7, the method comprising the following steps:

[0008] The access point receives a buffer status report from each terminal, wherein the buffer status report from each terminal includes the amount of data to be transmitted, data priority, and link status information;

[0009] With the goal of minimizing the total energy consumption of the system, a genetic algorithm is used to allocate transmission link combinations and service durations to each terminal based on the preset constraints of the amount of data to be transmitted.

[0010] A service period time window is allocated to each terminal according to data priority, and a protection interval is reserved during adjacent service periods. The terminal is notified of the output scheduling result through a trigger frame or beacon frame.

[0011] In conjunction with the first aspect, in certain implementations of the first aspect, the method further includes: the steps of the genetic algorithm are as follows:

[0012] Using a two-dimensional matrix encoding method, each individual solution is represented as the time slot allocation scheme of the terminal in each link;

[0013] Generate an initial population, where each individual corresponds to a link combination and time slot allocation scheme;

[0014] The fitness function is defined as the negative of the sum of the total energy consumption of the system and the constraint penalty term, where the penalty term includes weighted penalties for unmet data volume requirements and service period capacity exceeding limits;

[0015] Evolve the population through tournament selection, single-point crossover, and directed mutation operations until the maximum number of iterations is met

[0016] In combination with the first aspect, in certain implementations of the first aspect, the method further includes: allocating a service period time window to each terminal according to the data priority according to a service period time window allocation rule of:

[0017] High-priority terminals are preferentially allocated earlier transmission windows, and the service time windows of the same link are strictly non-overlapping.

[0018] In combination with the first aspect, in certain implementations of the first aspect, the method further includes: the reserved protection interval is 1 time slot to alleviate clock drift and accommodate burst traffic, thereby reducing data retransmission rate.

[0019] In combination with the first aspect, in certain implementations of the first aspect, the method further includes: calculating the transmission rate of the link based on the Shannon formula:

[0020]

[0021] Among them B j is the bandwidth of link j, Pt j is the transmission power of link j, h j is the channel gain; I j is the wireless interference power of each link, N0 is the noise power spectral density;

[0022] The time required to transmit a data packet is:

[0023] T j =T PHY +t j +T SIFS +T ACK (2)

[0024] where t j is the time required for link transmission, T PHY The time required to transmit the physical header for each packet, T ACK The time it takes for the access point to reply with an acknowledgment frame, T SIFS is the short frame interval.

[0025] In combination with the first aspect, in certain implementations of the first aspect, the method further includes: activating a radio interface required for the current transmission task during the transmission of the data, wherein the power consumption of the radio interface is determined by the working state of the STA, the working state of the STA including a sleep state and an active state, and the active state including a transmission state, a receiving state, and an idle state; wherein Pt i,j 、Pr i,j 、Pid i,j 、Ps i,j are the power of transmission, reception, idle and sleep states respectively, t i,j The time required to transmit uplink data, T PHY The time required to transmit the physical header, T BF is the beacon frame transmission time, T ACK The time it takes for the access point to reply with an acknowledgment frame.

[0026] In combination with the first aspect, in certain implementations of the first aspect, the method further includes: calculating the energy consumed by the terminal when the device sends uplink data for each packet transmitted as shown in the following formula (3):

[0027]

[0028] Including physical header time and MAC part time;

[0029] The energy consumed by the terminal receiving includes the energy consumption of beacon frame reception and confirmation frame reception, as shown in formula (4):

[0030]

[0031] Formula (5) is the energy consumption of the terminal in idle state:

[0032]

[0033] Formula (6) is the energy consumption of the terminal in sleep state:

[0034]

[0035] Formula (7) represents the energy consumption of terminal i:

[0036] E i =Et i +Er i +Eid i +Es i (7)

[0037] Formula (8) represents the total energy consumption of the system terminal side:

[0038]

[0039] The optimization problem is expressed as:

[0040] P:minE(9)

[0041]

[0042] In a second aspect, in order to achieve the above-mentioned objectives, the present invention discloses a target wake-up time service period scheduling system based on Wi-Fi 7, comprising:

[0043] a data receiving module, configured to receive, at an access point, a buffer status report from each terminal, wherein the buffer status report from each terminal includes information on the amount of data to be transmitted, data priority, and link status;

[0044] The data allocation module is used to allocate a transmission link combination and service period length to each terminal using a genetic algorithm based on preset constraints on the amount of data to be transmitted, with the goal of minimizing the total energy consumption of the system;

[0045] The terminal scheduling module is used to allocate a service period time window to each terminal according to data priority, reserve a protection interval between adjacent service periods, and notify the terminal of the output scheduling result through a trigger frame or a beacon frame.

[0046] In another aspect of the present invention, in order to achieve the above-mentioned purpose, a terminal device is disclosed, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor. The memory stores a computer program capable of running on the processor. When the processor loads and executes the computer program, it adopts the above-mentioned target wake-up time service period scheduling method based on Wi-Fi 7.

[0047] In another aspect of the present invention, in order to achieve the above-mentioned purpose, a computer-readable storage medium is disclosed, in which a computer program is stored. When the computer program is loaded and executed by a processor, the target wake-up time service period scheduling method based on Wi-Fi 7 as described above is adopted.

[0048] Beneficial effects of the present invention:

[0049] The present invention can significantly reduce the overall energy consumption of the system by dynamically allocating link combinations, service period durations, and interface sleep control through genetic algorithms. By allocating an independent service period time window to each terminal and synchronizing the multi-link beacon frame transmission intervals, the service period overlap problem in the traditional solution is completely solved, and network reliability is improved. One time slot is reserved as a protection interval during adjacent services, which can not only alleviate the window misalignment caused by clock drift, but also dynamically accommodate burst traffic. It supports the IEEE 802.11be standard protocol, adapts to multi-link and multi-user scenarios, and can be expanded to high-density deployment networks. Through dynamic link selection (single link, dual link or triple link combination) and precise time slot allocation, the proportion of idle time slots is reduced and resource utilization is enhanced. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, those skilled in the art can derive other drawings based on these drawings without inventive effort.

[0051] Figure 1 Schematic diagram of the process of the present invention;

[0052] Figure 2 Schematic diagram of the topological structure of the present invention

[0053] Figure 3 This is a schematic diagram of the service period time slot division of the present invention;

[0054] Figure 4 Schematic diagram of the genetic algorithm flow of the present invention;

[0055] Figure 5 This is a schematic diagram of the target wake-up mechanism workflow of the present invention;

[0056] Figure 6 This is a schematic diagram of the convergence of the present invention;

[0057] Figure 7 This is a schematic diagram of the relationship between the number of terminals and energy consumption in the present invention;

[0058] Figure 8 This is a schematic diagram showing the relationship between the amount of data cached by the terminal and energy consumption of the present invention;

[0059] Figure 9 This is a schematic diagram of the relationship between the service period and energy consumption of the present invention;

[0060] Figure 10 Schematic diagram of the system structure of the present invention. DETAILED DESCRIPTION

[0061] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making any creative efforts shall fall within the scope of protection of the present invention.

[0062] Example 1:

[0063] like Figure 1 As shown, a target wake-up time service period scheduling method based on Wi-Fi 7 includes the following steps:

[0064] S101: An access point receives a buffer status report from each terminal, wherein the buffer status report of each terminal includes the amount of data to be transmitted, data priority, and link status information. The multi-link device access point evaluates available link combinations, comprehensively considers the transmission capacity and power of each link, and selects the link combination with the lowest energy consumption and service duration while satisfying the transmission task.

[0065] Consider a wireless network system consisting of a single multi-link device access point and n multi-link device stations.

[0066] The present invention sets all links to send beacon frames under a unified time base and maintains completely consistent service period start and end times. Each service period is divided into n equal-length time slots, and centralized scheduling is used to ensure that only one terminal is allowed to transmit data on each link within each time slot. Figure 3 shown.

[0067] The present invention designs an intelligent interface status management mechanism. During the data transmission process, only the radio interface required for the current transmission task is activated, and the remaining interfaces always remain in a low-power sleep state; when the selected interface completes data transmission, the system will immediately switch it to sleep mode.

[0068] S102: With the goal of minimizing the total energy consumption of the system, based on preset constraints on the amount of data to be transmitted, a transmission link combination and service duration are allocated to each terminal using a genetic algorithm;

[0069] The steps of the genetic algorithm are as follows:

[0070] Using a two-dimensional matrix coding method, each individual solution is represented as the time slot allocation scheme of the terminal in each link;

[0071] Generate an initial population, where each individual corresponds to a link combination and time slot allocation scheme;

[0072] The fitness function is defined as the negative of the sum of the total energy consumption of the system and the constraint penalty term, where the penalty term includes weighted penalties for unmet data volume requirements and service period capacity exceeding limits;

[0073] The population is evolved through tournament selection, single-point crossover, and directed mutation operations until the maximum number of iterations is met.

[0074] S103: Allocate a service period time window to each terminal according to data priority, reserve a guard interval between adjacent service periods, and notify the terminal of the output scheduling result through a trigger frame or a beacon frame.

[0075] The allocation rule of the service period time window for allocating the service period time window to each terminal according to the data priority is:

[0076] High-priority terminals are preferentially allocated earlier transmission windows, and the service time windows of the same link are strictly non-overlapping.

[0077] The calculation of the transmission rate of the link is based on Shannon's formula:

[0078]

[0079] Among them B j is the bandwidth of link j, Pt j is the transmission power of link j, h j is the channel gain; I j is the wireless interference power of each link, N0 is the noise power spectral density;

[0080] The time required to transmit a data packet is:

[0081] T j =T PHY +t j +T SIFS +T ACK (2)

[0082] where t jis the time required for link transmission, T PHY The time required to transmit the physical header for each packet, T ACK The time it takes for the access point to reply with an acknowledgment frame, T SIFS is the short frame interval.

[0083] The power consumption of the radio interface mainly depends on the working state of the STA, including the sleep state and the active state. The active state is further divided into the following three states: transmission state, reception state and idle state. i,j 、Pr i,j 、Pid i,j 、Ps i,j are the power of transmission, reception, idle and sleep states respectively, t i,j The time required to transmit uplink data, T PHY The time required to transmit the physical header, T BF is the beacon frame transmission time, T ACK The time it takes for the access point to reply with an acknowledgment frame.

[0084] The energy consumed by the terminal when sending uplink data to the device is calculated by transmitting one packet at a time as shown in the following formula (3):

[0085]

[0086] Including physical header time and MAC part time;

[0087] The energy consumed by the terminal receiving includes the energy consumption of beacon frame reception and confirmation frame reception, as shown in formula (4):

[0088]

[0089] Formula (5) is the energy consumption of the terminal in idle state:

[0090]

[0091] Formula (6) is the energy consumption of the terminal in sleep state:

[0092]

[0093] Formula (7) represents the energy consumption of terminal i:

[0094] E i =Et i +Er i +Eid i +Es i (7)

[0095] Formula (8) represents the total energy consumption of the system terminal side:

[0096]

[0097] The optimization problem is expressed as:

[0098] P:minE(9)

[0099]

[0100] During the sleep period, STAs will have data arriving in the buffer area. The service period needs to fully transmit the data arriving during the sleep period. This is because if it cannot be fully transmitted, the remaining data will be accumulated and transmitted in the next service period. In the long run, this may cause the STA buffer to overflow and affect the queuing stability. Therefore, constraint C1 means that the amount of data that can be transmitted in the service period allocated to each terminal is greater than the amount of data to be transmitted in the buffer area, where D i represents the amount of data arriving at terminal i during the sleep period, Tsp i,j is the service duration allocated to terminal i on link j.

[0101] Since the service time windows allocated to each terminal in this scheme do not overlap, that is, only one terminal is arranged to transmit data on the same link at the same time, constraint C2 means that the sum of the service time allocated to each terminal on each link cannot exceed the service time that can be allocated on each link. j is the total service duration that can be allocated to link j.

[0102] This paper uses a genetic algorithm (GA) to solve the problem of optimizing multi-terminal link allocation and service duration. A genetic algorithm (GA) is an optimization algorithm based on the principles of natural selection and genetics, and is a type of evolutionary algorithm. It simulates the selection, crossover, and mutation processes of biological evolution to gradually optimize the solution. It is applicable to a variety of optimization problems, including continuous, discrete, linear, and nonlinear.

[0103] The algorithm is divided into 4 steps, the process is as follows Figure 5 The parameters are shown in Table 1.

[0104] Table 1: Algorithm parameters

[0105]

[0106] 1. Coding

[0107] This scheme adopts a two-dimensional matrix encoding method to encode each individual X into a two-dimensional matrix, which represents a service period (SP) time slot allocation scheme. Among them, the matrix element x i,j represents the number of time slots allocated to terminal i on link j.

[0108]

[0109] 2. Population initialization

[0110] Population initialization aims to generate a set of feasible solutions with diversity to enhance the global search capability of the algorithm.

[0111] Each terminal randomly selects a valid link combination from its available link set, and calculates the required minimum number of slots based on the selected link combination and link transmission rate, thus generating an initial solution. Multiple initial solutions are generated in the same way to form an initial population. For each terminal, the initialization process first randomly selects a valid link combination from the available link set. After the link is selected, the minimum number of slots is calculated based on the link transmission rate R. j And the amount of data to be transmitted D i , t slot is the time length of an SP time slot. The minimum number of time slots required by the STA is calculated using formula 1.13 to generate an initial solution.

[0112]

[0113] Repeat the above individual solution generation process N times (N is the population size) to form the initial population P = {X1, X2, ..., X N}.

[0114] 3. Evaluate individual fitness

[0115] The fitness function is used to measure the optimization potential of an individual, and its design directly affects the convergence of the algorithm and the quality of the solution. The present invention uses a penalty function method to deal with constrained optimization problems. The fitness function is defined as follows: Evaluating fitness is a crucial step. The design and calculation of the fitness function directly affect the performance of the genetic algorithm and the quality of the final solution. Equation 1.14 is the fitness function, where E is the total energy consumption measured at the terminal, P is the penalty term for the constraint condition, P1 is the penalty term for constraint C1, and P2 is the penalty term for constraint C2. Among them, λ1 and λ2 are weight coefficients used to balance energy consumption and the penalty term for the constraint condition.

[0116] Fitness=-(E+P) (14)

[0117] P=λ1P1+λ2P2 (15)

[0118]

[0119] 4. Select

[0120] In order to improve selection efficiency and maintain population diversity, this scheme adopts tournament selection. The steps are as follows:

[0121] Each time, k individuals are randomly selected from the current population.

[0122] Compare their fitness values ​​and select the best individual as the parent candidate.

[0123] Repeat the above process until a sufficient number of parent individuals are selected.

[0124] The computational complexity of this method is O(k)O(k), which is suitable for large-scale optimization problems and can effectively avoid the problem of super individuals dominating the population.

[0125] 5. Cross

[0126] Crossover enhances global search capabilities by reorganizing parental genetic information. This solution employs a single-point crossover, randomly selecting a crossover point and splitting the chromosomes of the two parent individuals at that point. The gene segments at the crossover point are exchanged to generate two new offspring individuals. This method maintains the structure of feasible solutions while promoting exploration of the solution space and avoiding premature convergence.

[0127] 6. Mutation

[0128] The mutation operation enhances local search capabilities by introducing random perturbations, preventing the population from falling into local optima. For each offspring individual, several gene positions are randomly selected with probability P and the selected gene positions are mutated.

[0129] Assign a service period time window.

[0130] Terminals are sorted by traffic priority from high to low, and time windows are allocated one by one. After allocating a time window to a terminal, a time slot is left free before allocating a service window to the next terminal. The freed-up time slot mitigates the risk of overlapping adjacent SP windows caused by beacon frame synchronization errors, clock drift, or inter-link propagation delays, and serves as a resilient buffer to temporarily accommodate bursts of traffic.

[0131] Specifically, the present invention will be further described below through examples:

[0132] The present invention simulates the nodes and links of the wireless local area network protocol through the MATLAB simulation platform to systematically verify the performance of the solution.

[0133] The bandwidths of the three links in the simulation experiment are 20 MHz, 40 MHz, and 80 MHz, respectively. The energy consumption of a station's wireless network interface varies in different states, generally classified as transmitting, receiving, idle, and dormant. The main simulation parameters are shown in Table 2.

[0134] Table 2 Simulation parameter settings for the multi-link TWT mechanism energy-saving solution

[0135]

[0136] Figure 6 It shows that as the number of iterations increases, the STA energy consumption decreases and tends to be stable. When the population size is 100, convergence can be achieved in about 10 iterations, and the energy consumption index obtained at each convergence is also relatively stable, indicating that this scheme can achieve convergence within a smaller number of iterations and obtain a more ideal and stable performance index through lower algorithm complexity.

[0137] Figure 7 The results show that as the number of terminals increases, the total system energy consumption increases monotonically. Among them, the Proportional Fair Scheduling (PF) scheme has the highest energy consumption. The algorithm balances fairness and throughput by dynamically adjusting user priorities. This frequent priority switching causes STAs to repeatedly transition between sleep and active states, generating additional state transition energy consumption. While the Maximum Rate Scheduling scheme reduces the number of state transitions, its resource allocation strategy causes terminals with lower transmission rates to remain in an idle waiting state for extended periods. The Random Scheduling scheme, lacking an optimized link selection mechanism, does not select the optimal link combination for transmission, resulting in higher transmission energy consumption compared to this scheme. In contrast, this scheme coordinates link combinations based on the number of terminals and allocates service periods to terminals based on the amount of data cached, reducing both transmission and idle state energy consumption.

[0138] Figure 8 Comparisons of total terminal-side energy consumption as a function of buffered data volume under four scheduling schemes are presented. Experimental data show that as the amount of data buffered by the terminal increases, the energy consumption of each scheme increases. This is primarily due to the positive correlation between transmission time and data volume. Compared to other schemes, our scheme has the lowest energy consumption. When the amount of data buffered by the terminal is large, the energy consumption of the random scheduling scheme is significantly affected by link selection, while the terminal link selection under proportional fair scheduling and maximum rate scheduling remains unchanged, resulting in a smaller impact. This scheme coordinates links based on the amount of data buffered by the terminal and allocates service durations to the terminal based on the amount of data buffered, reducing both transmission energy consumption and idle state energy consumption.

[0139] Figure 9The mechanism by which service period duration affects the energy consumption characteristics of various scheduling schemes is revealed. Proportional Fair Scheduling and Maximum Rate Scheduling experience a significant increase in energy consumption as the service period increases. This is because as the service period length increases, the number of time slots allocated to terminals exceeds the actual number of time slots required, resulting in increased idle state energy consumption. However, the random link scheme and the proposed scheme allocate service period time slots based on the amount of data buffered by the terminal. Increasing the service period length does not lead to an increase in idle energy consumption. When sufficient service period time slots are available, the proposed scheme can more flexibly select links with lower energy consumption. Therefore, increasing the service period length actually reduces the proposed scheme's energy consumption.

[0140] Example 2: In order to achieve the above purpose, Figure 10 As shown, based on the first embodiment, the present invention discloses a target wake-up time service period scheduling system based on Wi-Fi 7, including:

[0141] The data receiving module 11 is configured to receive a buffer status report from each terminal at the access point, wherein the buffer status report from each terminal includes the amount of data to be transmitted, data priority, and link status information;

[0142] The data allocation module 12 is configured to allocate a transmission link combination and a service period to each terminal using a genetic algorithm based on preset constraints on the amount of data to be transmitted, with the goal of minimizing the total energy consumption of the system;

[0143] The terminal scheduling module 13 is used to allocate a service period time window to each terminal according to data priority, reserve a protection interval between adjacent service periods, and notify the terminal of the output scheduling result through a trigger frame or a beacon frame.

[0144] Based on the same inventive concept, the present invention also provides a computer device, which includes: one or more processors and a memory for storing one or more computer programs; the program includes program instructions, and the processor is used to execute the program instructions stored in the memory. The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. It is the computing core and control core of the terminal, which is used to implement one or more instructions, specifically for loading and executing one or more instructions in a computer storage medium to implement the above method.

[0145] It should be further explained that, based on the same inventive concept, the present invention also provides a computer storage medium having a computer program stored thereon, which executes the above method when executed by a processor. The storage medium can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electrical, magnetic, infrared, or semiconductor system, device or component, or any combination thereof. More specific examples (a non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present invention, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, device or component.

[0146] Throughout this specification, references to terms such as "one embodiment," "example," or "specific example" indicate that a specific feature, structure, material, or characteristic described in conjunction with that embodiment or example is included in at least one embodiment or example of the present disclosure. In this specification, schematic representations of these terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.

[0147] The above shows and describes the basic principles, main features and advantages of the present disclosure. Those skilled in the art should understand that the present disclosure is not limited to the above embodiments. The above embodiments and descriptions are merely illustrative of the principles of the present disclosure. Various changes and improvements may be made to the present disclosure without departing from the spirit and scope of the present disclosure, and such changes and improvements shall fall within the scope of the present disclosure.

Claims

1. A target wake-up time service period scheduling method based on Wi-Fi 7, characterized in that: The method comprises the following steps: The access point receives a buffer status report from each terminal, wherein the buffer status report from each terminal includes the amount of data to be transmitted, data priority, and link status information; With the goal of minimizing the total energy consumption of the system, a genetic algorithm is used to allocate transmission link combinations and service durations to each terminal based on the preset constraints of the amount of data to be transmitted. A service period time window is allocated to each terminal according to data priority, and a protection interval is reserved during adjacent service periods. The terminal is notified of the output scheduling result through a trigger frame or beacon frame.

2. The method for scheduling target wake-up time service period based on Wi-Fi 7 according to claim 1, characterized in that: The steps of the genetic algorithm are as follows: Using a two-dimensional matrix encoding method, each individual solution is represented as the time slot allocation scheme of the terminal in each link; Generate an initial population, where each individual corresponds to a link combination and time slot allocation scheme; The fitness function is defined as the negative of the sum of the total energy consumption of the system and the constraint penalty term, where the penalty term includes weighted penalties for unmet data volume requirements and service period capacity exceeding limits; The population is evolved through tournament selection, single-point crossover, and directed mutation operations until the maximum number of iterations is met.

3. The method for scheduling target wake-up time service period based on Wi-Fi 7 according to claim 1, characterized in that: The allocation rule of the service period time window for allocating the service period time window to each terminal according to the data priority is: High-priority terminals are preferentially allocated earlier transmission windows, and the service time windows of the same link are strictly non-overlapping.

4. The method for scheduling target wake-up time service period based on Wi-Fi 7 according to claim 1, characterized in that: The reserved protection interval is 1 time slot, which is used to alleviate clock drift and accommodate burst traffic, thereby reducing the data retransmission rate.

5. The method for scheduling target wake-up time service period based on Wi-Fi 7 according to claim 1, characterized in that: The calculation of the transmission rate of the link is based on Shannon's formula: Among them B j is the bandwidth of link j, Pt j is the transmission power of link j, h j is the channel gain; I j is the wireless interference power of each link, N0 is the noise power spectral density; The time required to transmit a data packet is: T j =T PHY +t j +T SIFS +T ACK (2) where t j is the time required for link transmission, T PHY The time required to transmit the physical header for each packet, T ACK The time it takes for the access point to reply with an acknowledgment frame, T SIFS is the short frame interval.

6. The method for scheduling target wake-up time service period based on Wi-Fi 7 according to claim 1, characterized in that: During the data transmission process, the radio interface required for the current transmission task is activated. The power consumption of the radio interface is determined by the working state of the STA. The working state of the STA includes a dormant state and an active state. The active state includes a transmitting state, a receiving state, and an idle state. i,j 、Pr i,j 、Pid i,j 、Ps i,j are the power of transmission, reception, idle and sleep states respectively, t i,j The time required to transmit uplink data, T PHY The time required to transmit the physical header, T BF is the beacon frame transmission time, T ACK The time it takes for the access point to reply with an acknowledgment frame.

7. The method for scheduling target wake-up time service period based on Wi-Fi 7 according to claim 1, characterized in that: The energy consumed by the terminal when sending uplink data to the device is calculated by transmitting one packet at a time as shown in the following formula (3): Including physical header time and MAC part time; The energy consumed by the terminal receiving includes the energy consumption of beacon frame reception and confirmation frame reception, as shown in formula (4): Formula (5) is the energy consumption of the terminal in idle state: Formula (6) is the energy consumption of the terminal in sleep state: Formula (7) represents the energy consumption of terminal i: E i =One i +Is i +Owned i +Es i (7) Formula (8) represents the total energy consumption of the system terminal side: The optimization problem is expressed as: P:minE(9) 8. A target wake-up time service period scheduling system based on Wi-Fi 7, characterized in that: include: a data receiving module, configured to receive, at an access point, a buffer status report from each terminal, wherein the buffer status report from each terminal includes information on the amount of data to be transmitted, data priority, and link status; The data allocation module is used to allocate a transmission link combination and service period length to each terminal using a genetic algorithm based on preset constraints on the amount of data to be transmitted, with the goal of minimizing the total energy consumption of the system; The terminal scheduling module is used to allocate a service period time window to each terminal according to data priority, reserve a protection interval between adjacent service periods, and notify the terminal of the output scheduling result through a trigger frame or a beacon frame.

9. A terminal device comprising a memory, a processor, and a computer program stored in the memory and capable of running on the processor, characterized in that: The memory stores a computer program that can be run on a processor. When the processor loads and executes the computer program, a target wake-up time service period scheduling method based on Wi-Fi 7 according to any one of claims 1 to 7 is adopted.

10. A computer-readable storage medium storing a computer program, wherein: When the computer program is loaded and executed by the processor, a target wake-up time service period scheduling method based on Wi-Fi 7 according to any one of claims 1 to 7 is adopted.

Images