A method for dynamically adjusting the size of data window

By dynamically adjusting the data window size in the wireless ad hoc network, and according to priority and service load, the problems of different business priority requirements and control signaling delay overhead in the dedicated Internet of Things are solved, and low latency and high Reliable network transmission.

CN115334004BInactive Publication Date: 2024-12-03HARBIN INST OF TECH +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210921520.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-08-02
Publication Date
2024-12-03
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In the ad hoc networking mode of dedicated Internet of Things, the requirements for multiple services are different and the delay overhead caused by control signaling lead to high network delays, making it difficult to meet the low latency and high successful delivery of high-priority services Rate requirements.

Method used

By exchanging signaling in the control window, we obtain the priority and number of packets to be sent by each node in the next cycle, and dynamically adjust the data window size to ensure low latency and high reliability transmission of high-priority services.

Benefits of technology

It reduces the overall network delay, ensures low latency and high reliability transmission of the highest priority services, improves channel resource utilization, and reduces the delay overhead caused by control signaling.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115334004B_ABST
    Figure CN115334004B_ABST
Patent Text Reader

Abstract

The present invention is a method for dynamically adjusting the size of a data window. The present invention relates to the field of communication technology. In the control window stage, the present invention obtains the data packet priority to be sent by each node in the network in the next cycle and the number of packets with the same priority and the same destination address as the packet through the exchange of CTE and RES. According to the value, the data window size of the next cycle is dynamically adjusted from the two aspects of network load and service priority. During the data window of the next cycle, multiple data packets are continuously sent, thereby reducing the delay overhead caused by control signaling and ensuring the transmission requirements of services with different priorities.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the technical field of communications and is a method for dynamically adjusting the size of a data window. Background Art

[0002] Wireless ad hoc networking uses dynamic networking and wireless relays to achieve interconnection between terminals. It has the advantages of self-organization, strong self-repair capabilities, and high networking efficiency. It can meet application needs in specific situations, supplement and improve the existing wireless communication system, and has important value both in theoretical research and practical application. However, while this new wireless network model brings many advantages, it also faces many challenges.

[0003] Wireless ad hoc networks have been widely used in special and dedicated fields such as emergency communications, disaster search and rescue operations, and farmland detection. This paper considers the ad hoc network mode of the Private Internet of Things (P-IoT), in which control instructions and messages such as voice, images, and text are mainly transmitted. Control instructions require low latency and high successful delivery rate to enable accurate transmission of control instructions, while for information such as voice and images, high throughput and timeliness requirements must be met. When designing the protocol, the priority of business information will be considered to meet the QoS requirements of different businesses, so that high-priority business data can have lower latency and higher successful delivery rate.

[0004] On the other hand, in the ad hoc network mode of the dedicated Internet of Things, the number of node accesses is usually large, and the services are often bursty, so that the competition for wireless media is very fierce. Therefore, in order to improve the flexibility of network access and resource utilization, a multi-channel ad hoc network is introduced here. In a single-channel wireless ad hoc network, the focus is on how to avoid collisions and improve communication efficiency, while in a multi-channel wireless ad hoc network, the focus is on how to allocate channels to different nodes so that they can make full use of channel resources and improve system throughput. In order to achieve successful channel reservation, a multi-channel MAC protocol based on split time slots is used here.

[0005] The multi-channel MAC protocol based on time slot division is divided into alternating control windows and data windows on the time axis. During the control window, all nodes switch to the same control channel to reserve the data channel. After the control window ends, the node switches to the corresponding data channel according to the reservation of the channel in the control window. If the data window is too long, the data channel will be idle and wasteful. If it is too short, the node cannot complete the data transmission on the data channel. Therefore, it is important to set a reasonable data window size. Summary of the invention

[0006] In order to overcome the deficiencies of the prior art, the present invention provides a method for dynamically adjusting the size of a data window in view of the characteristics of different service priority requirements in the self-organizing network mode of a dedicated Internet of Things and the problem of delay overhead caused by control signaling. It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0007] A method for dynamically adjusting the size of a data window, the method comprising the following steps:

[0008] Step 1: In the control window, according to the 802.11DCF mechanism, control signaling is exchanged in the kth cycle, and the priority and number of packets to be sent by each node in the k+1th cycle are obtained through the exchange of control signaling;

[0009] Step 2: The node continuously sends packets in the kth cycle according to the data window size estimated in the k-1th cycle;

[0010] Step 3: Estimate the data window size of the k+1th cycle. After the data window of the kth cycle ends, enter the control window phase of the k+1th transmission cycle and repeat steps 1 to 3.

[0011] Preferably, the step 1 is specifically:

[0012] Step 1.1: The current cycle is the kth cycle. In order to realize the statistics of the priority and number of packets to be sent by the node in the k+1th cycle, an extended field is added to the CTS and RES frames. The next packet state {p k+1 ,n k+1}, where p k+1 Indicates the priority of the packet to be sent in the k+1th cycle, n k+1 It represents the number of packets to be sent in the k+1th cycle. The number is the statistics of a given node in the kth cycle. It is known that the priority p of the first packet to be sent in the k+1th cycle k+1 and the destination address, n k+1 is equal to the number of packets with the same priority and destination address as the first packet; each node locally maintains a packet vector {…, NPS i ,…},NPS iis the grouping state of node i in the next cycle, and LNPSV is determined by the NPS of neighboring nodes within one hop;

[0013] Step 1.2: In the control window phase of the kth cycle, the node with data frames to be sent will send an RTS. After receiving the RTS, the receiving node calculates the next packet state NPS, updates the locally maintained LNPSV, and sets the next packet state value in the NPS field of the CTS, and sends the CTS.

[0014] Step 1.3: After receiving the CTS frame, the sending node reads the NPS field in the CTS frame and updates the NPS value to the local LNPSV. The sending node then starts counting the next packet state locally, updates the counted value to the LNPSV, places the value in the NPS field in the RES frame, and sends a RES.

[0015] Step 1.4: The sending and receiving nodes will obtain the packet sending status of the receiving node and the sending node in the next cycle through CTS and RES respectively for the neighboring nodes within one hop range, and update the obtained NPS field value on the local LNPSV.

[0016] Preferably, after the node has sent a packet with the same priority and the same destination address as the first packet sent, if there is still time left in the data window, the node continues to send a packet with the next priority and the same destination address as the first packet.

[0017] Preferably, when the remaining time in the data window is insufficient to send all packets with the same priority and the same destination address, the sending of the remaining packets is canceled, and competition is restarted in the control window of the next cycle.

[0018] Preferably, the step 3 is specifically:

[0019] At the end of the control window of the kth cycle, LNPSV stores the priority and number of packets to be sent by nodes within one hop in the k+1th cycle, and dynamically adjusts the size of the data window according to the difference in priority and number of packets;

[0020] If there is no highest priority service in LNPSV, the average number of packets to be sent by each node is taken, the maximum number of packets that can be sent by each channel is M, and the number of data frames transmitted on each channel is expressed by the following formula:

[0021]

[0022] The length of the data packet is fixed, so the time to transmit a data packet on the data channel is expressed by the following formula:

[0023] T data=L+H+SIFS+δ+ACK+DIFS+δ

[0024] Among them, H is the time of transmitting the MAC layer and physical layer overhead introduced, L is the time of transmitting data payload, and ACK represents the time of transmitting ACK packet;

[0025] The size of the data window is determined by the following formula:

[0026] T DW =T data ·N trans

[0027] Preferably, the size of the data window is related to two factors. One is the number of data frames transmitted on each channel, that is, N trans , and the second is the time to transmit a data frame on the data channel, denoted by T data express.

[0028] Preferably, when there is a highest priority service in LNPSV, N trans The number of the highest priority service packets is taken. If there are multiple highest priority services, the maximum value is taken.

[0029] A system for dynamically adjusting the size of a data window, the system comprising:

[0030] A switching module, wherein the switching module exchanges control signaling in the kth cycle according to the 802.11DCF mechanism in the control window, and obtains the priority and number of packets to be sent by each node in the k+1th cycle through the exchange of control signaling;

[0031] A grouping module, wherein the grouping module continuously sends packets through the node in the kth cycle according to the data window size estimated in the k-1th cycle;

[0032] A data window determination module estimates the data window size of the k+1th cycle and enters the control window phase of the k+1th transmission cycle after the data window of the kth cycle ends.

[0033] A computer-readable storage medium stores a computer program, which is executed by a processor to implement a method for dynamically adjusting the size of a data window.

[0034] A computer device comprises a memory and a processor, wherein a computer program is stored in the memory, and when the processor runs the computer program stored in the memory, the processor executes a method for dynamically adjusting the size of a data window.

[0035] The present invention has the following beneficial effects:

[0036] In order to reduce the delay overhead caused by control signaling and guarantee the service requirements of different priorities, the present invention dynamically adjusts the data window of the next cycle according to the priority and service load, thereby reducing the overall delay of the network and ensuring low delay and high reliability of the highest priority service.

[0037] In the control window stage, the present invention obtains the data packet priority to be sent by each node in the network in the next cycle and the number of packets with the same priority and the same destination address as the packet through the exchange of CTE and RES. According to the value, the data window size of the next cycle is dynamically adjusted from the two aspects of network load and service priority. During the data window of the next cycle, multiple data packets are continuously sent, thereby reducing the delay overhead caused by control signaling and ensuring the transmission requirements of services with different priorities. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0039] Figure 1 Flowchart for dynamically adjusting the size of the data window;

[0040] Figure 2 The network delay performance before and after the dynamic adjustment of the data window size obtained by simulation;

[0041] Figure 3 The latency performance of priority 3 before and after dynamically adjusting the data window size obtained by simulation;

[0042] Figure 4 The latency performance of priority 8 before and after dynamically adjusting the data window size obtained by simulation;

[0043] Figure 5 The successful arrival rate performance of priority 8 before and after dynamically adjusting the data window size obtained by simulation. DETAILED DESCRIPTION

[0044] The technical solution of the present invention will be described clearly and completely below 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 creative work are within the scope of protection of the present invention.

[0045] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

[0046] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0047] In addition, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0048] The present invention is described in detail below in conjunction with specific embodiments. Specific embodiment one:

[0050] according to Figures 1 to 5 As shown, the specific optimization technical solution adopted by the present invention to solve the above technical problems is: the present invention relates to a method for dynamically adjusting the size of a data window.

[0051] A method for dynamically adjusting the size of a data window, the method comprising the following steps:

[0052] Step 1: In the control window, according to the 802.11DCF mechanism, control signaling is exchanged in the kth cycle. And through the exchange of control signaling, the priority and number of packets to be sent by each node in the k+1th cycle are obtained;

[0053] Step 2: The node continuously sends packets in the kth cycle according to the data window size estimated in the k-1th cycle;

[0054] The step 2 is specifically as follows:

[0055] If the node has sent a packet with the same priority and the same destination address as the first packet sent, and there is enough time left in the data window, the node will continue to send a packet with the next priority and the same destination address as the first packet. Correspondingly, if the remaining time in the data window is not enough to send all packets with the same priority and the same destination address, the sending of the remaining packets will be canceled and the competition will be restarted in the control window of the next cycle. In this way, channel resources can be fully utilized and the service delay can be further reduced.

[0056] Step 3: Estimate the data window size of the k+1th cycle. After the data window of the kth cycle ends, enter the control window phase of the k+1th transmission cycle and repeat steps 1, 2, and 3. Specific embodiment 2:

[0058] The difference between the second embodiment of the present application and the first embodiment is that:

[0059] The step 1 is specifically as follows:

[0060] The current cycle is the kth cycle. In order to realize the statistics of the priority and number of packets to be sent by the node in the k+1th cycle, an extended field is added to the CTS and RES frames - the next packet state (NPS) {p k+1 ,n k+1}, where p k+1 Indicates the priority of the packet to be sent in the k+1th cycle, n k+1 It represents the number of packets to be sent in the k+1th cycle. This number is the statistics of a given node in the kth cycle. First, we can know the priority p of the first packet to be sent in the k+1th cycle. k+1 and the destination address, n k+1 It is equal to the number of packets with the same priority and destination address as the first packet. Each node maintains a local nextpacket state vector (LNPSV) {…, NPS i ,…},NPS i is the grouping state of node i in the next cycle, and LNPSV is determined by the NPS of neighboring nodes within one hop.

[0061] First, in the control window phase of the kth cycle, the node with data frames to send will send an RTS. After receiving the RTS, the receiving node will calculate its own next packet state NPS, update the locally maintained LNPSV, and set the next packet state value in the NPS field of the CTS, and send the CTS.

[0062] After receiving the CTS frame, the sending node reads the NPS field in the CTS frame and updates the NPS value to the local LNPSV. The sending node then starts counting the next packet state locally and updates the counted value to the LNPSV. Subsequently, the value is placed in the NPS field in the RES frame and the RES is sent.

[0063] The sending and receiving nodes will obtain the packet sending status of the receiving node and the sending node in the next cycle through CTS and RES respectively from the neighboring nodes within one hop range, and update the obtained NPS field value on the local LNPSV. Specific embodiment three:

[0065] The difference between the third embodiment of the present application and the second embodiment is that:

[0066] When a node has sent a packet with the same priority and the same destination address as the first packet sent, and there is still time left in the data window, the node continues to send a packet with the next priority and the same destination address as the first packet. Specific embodiment four:

[0068] The difference between the fourth embodiment of the present application and the third embodiment is that:

[0069] When the remaining time in the data window is not enough to send all packets with the same priority and the same destination address, the sending of the remaining packets is canceled and competition is resumed in the control window of the next cycle. Specific embodiment five:

[0071] The difference between the fifth embodiment of the present application and the fourth embodiment is that:

[0072] The step 3 is specifically as follows:

[0073] At the end of the control window of the kth cycle, LNPSV stores the priority and number of packets to be sent by nodes within one hop in the k+1th cycle, and dynamically adjusts the size of the data window according to the priority and number of packets. The size of the data window is related to two factors: the number of data frames transmitted on each channel, that is, N. trans , and the second is the time to transmit a data frame on the data channel, denoted by T data express.

[0074] In order to ensure the highest priority service, that is, the low latency of the control instruction service, if the highest priority service is found in LNPSV, N transTake the number of the highest priority service packets. If there are multiple highest priority services, take the maximum value. If there is no highest priority service in LNPSV, in order to improve the throughput of voice and video services, the number of packets to be sent by each node will be averaged here, but the data window size at this time has an upper limit. The maximum number of packets that can be sent by each channel is M. This is done to prevent the highest priority service arriving during the data window from waiting too long. Therefore, the number of data frames transmitted on each channel is shown in the formula.

[0075]

[0076] Assuming that the length of the data packet is fixed, the time to transmit a data packet on the data channel is expressed as

[0077] T data =L+H+SIFS+δ+ACK+DIFS+δ

[0078] Where H is the time for transmitting the overhead of the MAC layer and the physical layer, L is the time for transmitting the data payload, and ACK represents the time for transmitting the ACK packet.

[0079] It can be obtained that the size of the data window is

[0080] T DW =T data ·N trans

[0081] The feasibility of the present invention is verified by simulation. The simulation conditions are set as shown in Table 1 and Table 2.

[0082] Table 1. Simulation conditions

[0083]

[0084] Table 2. Priority business ratio

[0085]

[0086]

[0087] The simulation results according to the above parameters are as follows Figure 2 to Figure 5 As shown, Figure 2 The network latency performance before and after each dynamic adjustment of the data window size, Figure 3 To dynamically adjust the data window size before and after the priority 3 delay performance, Figure 4 To dynamically adjust the data window size before and after the priority 8 delay performance, Figure 5The performance of the successful arrival rate of priority 8 before and after dynamically adjusting the data window size. From the figure, we can see that the MAC protocol based on dynamic control of the data window has a significant improvement in latency performance. It mainly reduces the latency of low-priority services. The low latency and high successful arrival rate of high-priority services can still be effectively guaranteed. Specific embodiment six:

[0089] The difference between the sixth embodiment of the present application and the fifth embodiment is that:

[0090] The size of the data window is related to two factors. One is the number of data frames transmitted on each channel, that is, N. trans , and the second is the time to transmit a data frame on the data channel, denoted by T data express. Specific embodiment seven:

[0092] The difference between the seventh embodiment of the present application and the sixth embodiment is that:

[0093] When there is a service with the highest priority in LNPSV, N trans The number of the highest priority service packets is taken. If there are multiple highest priority services, the maximum value is taken. Specific embodiment eight:

[0095] The difference between the eighth embodiment of the present application and the seventh embodiment is only that:

[0096] The present invention provides a system for dynamically adjusting the size of a data window, wherein the system comprises:

[0097] A switching module, wherein the switching module exchanges control signaling in the kth cycle according to the 802.11DCF mechanism in the control window, and obtains the priority and number of packets to be sent by each node in the k+1th cycle through the exchange of control signaling;

[0098] A grouping module, wherein the grouping module continuously sends packets through the node in the kth cycle according to the data window size estimated in the k-1th cycle;

[0099] A data window determination module estimates the data window size of the k+1th cycle and enters the control window phase of the k+1th transmission cycle after the data window of the kth cycle ends. Specific embodiment nine:

[0101] The difference between the ninth embodiment of the present application and the eighth embodiment is that:

[0102] The present invention provides a computer-readable storage medium on which a computer program is stored. The program is executed by a processor to implement a method for dynamically adjusting the size of a data window. Specific embodiment ten:

[0104] The difference between the tenth embodiment of the present application and the ninth embodiment is that:

[0105] The present invention provides a computer device, comprising a memory and a processor, wherein a computer program is stored in the memory, and when the processor runs the computer program stored in the memory, the processor executes a method for dynamically adjusting the size of a data window.

[0106] In the description of this specification, the description of reference terms such as "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or N embodiments or examples in a suitable manner. In addition, those skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples without contradiction. In addition, the terms "first" and "second" are used only for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, the features defined as "first" and "second" can explicitly or implicitly include at least one of the features. In the description of the present invention, the meaning of "N" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined. Any process or method description in the flowchart or otherwise described herein may be understood to represent a module, fragment or portion of code including one or more executable instructions for implementing the steps of a custom logic function or process, and the scope of the preferred embodiment of the present invention includes other implementations, in which the functions may not be performed in the order shown or discussed, including in a substantially simultaneous manner or in a reverse order according to the functions involved, which should be understood by a person skilled in the art of the art to which the embodiments of the present invention belong. The logic and / or steps represented in the flowchart or otherwise described herein, for example, may be considered as a sequenced list of executable instructions for implementing the logic function, and may be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples (a non-exhaustive list) of computer-readable media include the following: an electrical connection having one or N wirings (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM).In addition, the computer readable medium can even be paper or other suitable medium on which the program can be printed, because the program can be obtained electronically, for example, by optically scanning the paper or other medium, then editing, interpreting or processing in other suitable ways as necessary, and then storing it in a computer memory. It should be understood that the various parts of the present invention can be implemented with hardware, software, firmware, or a combination thereof. In the above-mentioned embodiment, N steps or methods can be implemented with software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented with hardware, as in another embodiment, any one of the following technologies known in the art or their combination can be used to implement: a discrete logic circuit with a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit with a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0107] A person of ordinary skill in the art can understand that all or part of the steps carried by the method of the above-mentioned embodiment can be completed by instructing the relevant hardware through a program, and the program can be stored in a computer-readable storage medium, and the program, when executed, includes one or a combination of the steps of the method embodiment. In addition, each functional unit in each embodiment of the present invention can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into one module. The above-mentioned integrated module can be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0108] The above is only a preferred implementation of a method for dynamically adjusting the size of a data window. The protection scope of a method for dynamically adjusting the size of a data window is not limited to the above embodiment. All technical solutions under this idea belong to the protection scope of the present invention. It should be pointed out that for those skilled in the art, several improvements and changes without departing from the principle of the present invention should also be regarded as the protection scope of the present invention.

Claims

1. A method for dynamically adjusting the size of a data window, characterized in that: The method comprises the following steps: Step 1: In the control window, according to the 802.11DCF mechanism, control signaling is exchanged in the kth cycle, and the priority and number of packets to be sent by each node in the k+1th cycle are obtained through the exchange of control signaling; The step 1 is specifically as follows: Step 1.1: The current cycle is the kth cycle. In order to realize the statistics of the priority and number of packets to be sent by the node in the k+1th cycle, an extended field is added to the CTS and RES frames. The next packet state {p k+1 ,n k+1 }, where p k+1 Indicates the priority of the packet to be sent in the k+1th cycle, n k+1 It represents the number of packets to be sent in the k+1th cycle. The number is the statistics of a given node in the kth cycle. It is known that the priority p of the first packet to be sent in the k+1th cycle k+1 and the destination address, n k+1 It is equal to the number of packets with the same priority and destination address as the first packet; each node locally maintains a packet vector LNPSV{…,NPS i ,…},NPS i is the grouping state of node i in the next cycle, and LNPSV is determined by the NPS of neighboring nodes within one hop; Step 1.2: In the control window phase of the kth cycle, the node with data frames to be sent will send an RTS. After receiving the RTS, the receiving node calculates the next packet state NPS, updates the locally maintained LNPSV, and sets the next packet state value in the NPS field of the CTS, and sends the CTS. Step 1.3: After receiving the CTS frame, the sending node reads the NPS field in the CTS frame and updates the NPS value to the local LNPSV. The sending node then starts counting the next packet state locally, updates the counted value to the LNPSV, places the value in the NPS field in the RES frame, and sends a RES. Step 1.4: The sending and receiving nodes obtain the packet sending status of the receiving node and the sending node in the next cycle through CTS and RES respectively for the neighboring nodes within one hop range, and update the obtained NPS field value on the local LNPSV; Step 2: The node continuously sends packets in the kth cycle according to the data window size estimated in the k-1th cycle; Step 3: Estimate the data window size of the k+1th cycle. After the data window of the kth cycle ends, enter the control window phase of the k+1th transmission cycle and repeat steps 1 to 3. The step 3 is specifically as follows: At the end of the control window of the kth cycle, LNPSV stores the priority and number of packets to be sent by nodes within one hop in the k+1th cycle, and dynamically adjusts the size of the data window according to the difference in priority and number of packets; If there is no highest priority service in LNPSV, the average number of packets to be sent by each node is taken, the maximum number of packets that can be sent by each channel is M, and the number of data frames transmitted on each channel is expressed by the following formula: The length of the data packet is fixed, so the time to transmit a data packet on the data channel is expressed by the following formula: T data =L+H+SIFS+δ+ACK+DIFS+δ Among them, H is the time of transmitting the MAC layer and physical layer overhead introduced, L is the time of transmitting data payload, and ACK represents the time of transmitting ACK packet; The size of the data window is determined by the following formula: T DW =T data ·N trans 。 2. The method for dynamically adjusting the size of a data window according to claim 1, wherein: When a node has sent a packet with the same priority and the same destination address as the first packet sent, and there is still time left in the data window, the node continues to send a packet with the next priority and the same destination address as the first packet.

3. The method for dynamically adjusting the size of a data window according to claim 2, wherein: When the remaining time in the data window is not enough to send all packets with the same priority and the same destination address, the sending of the remaining packets is canceled and competition is resumed in the control window of the next cycle.

4. The method for dynamically adjusting the size of a data window according to claim 1, wherein: The size of the data window is related to two factors. One is the number of data frames transmitted on each channel, that is, N. trans , and the second is the time to transmit a data frame on the data channel, denoted by T data express.

5. The method for dynamically adjusting the size of a data window according to claim 4, characterized in that: When there is a service with the highest priority in LNPSV, N trans The number of the highest priority service packets is taken. If there are multiple highest priority services, the maximum value is taken.

6. A system for dynamically adjusting the size of a data window, characterized by: The system comprises: A switching module, wherein the switching module exchanges control signaling in the kth cycle according to the 802.11DCF mechanism in the control window, and obtains the priority and number of packets to be sent by each node in the k+1th cycle through the exchange of control signaling; The current cycle is the kth cycle. In order to realize the statistics of the priority and number of packets to be sent by the node in the k+1th cycle, an extended field is added to the CTS and RES frames. The next packet state {p k+1 ,n k+1 }, where p k+1 Indicates the priority of the packet to be sent in the k+1th cycle, n k+1 It represents the number of packets to be sent in the k+1th cycle. The number is the statistics of a given node in the kth cycle. It is known that the priority p of the first packet to be sent in the k+1th cycle k+1 and the destination address, n k+1 It is equal to the number of packets with the same priority and destination address as the first packet; each node locally maintains a packet vector LNPSV{…,NPS i ,…},NPS i is the grouping state of node i in the next cycle, and LNPSV is determined by the NPS of neighboring nodes within one hop; In the control window phase of the kth cycle, the node with data frames to send will send RTS. After receiving the RTS, the receiving node calculates the next packet state NPS, updates the locally maintained LNPSV, and sets the next packet state value in the NPS field of CTS, and sends CTS. After receiving the CTS frame, the sending node reads the NPS field in the CTS frame and updates the NPS value to the local LNPSV. The sending node then starts counting the next packet state locally, updates the counted value to the LNPSV, places the value in the NPS field in the RES frame, and sends a RES. The receiving and sending nodes will obtain the packet sending status of the receiving and sending nodes in the next cycle through CTS and RES respectively for the neighboring nodes within one hop range, and update the obtained NPS field value on the local LNPSV; A grouping module, wherein the grouping module continuously sends packets through the node in the kth cycle according to the data window size estimated in the k-1th cycle; A data window determination module, wherein the data window determination module estimates the data window size of the k+1th cycle and enters the control window phase of the k+1th transmission cycle after the data window of the kth cycle ends; At the end of the control window of the kth cycle, LNPSV stores the priority and number of packets to be sent by nodes within one hop in the k+1th cycle, and dynamically adjusts the size of the data window according to the difference in priority and number of packets; If there is no highest priority service in LNPSV, the average number of packets to be sent by each node is taken, the maximum number of packets that can be sent by each channel is M, and the number of data frames transmitted on each channel is expressed by the following formula: The length of the data packet is fixed, so the time to transmit a data packet on the data channel is expressed by the following formula: T data =L+H+SIFS+δ+ACK+DIFS+δ Among them, H is the time of transmitting the MAC layer and physical layer overhead introduced, L is the time of transmitting data payload, and ACK represents the time of transmitting ACK packet; The size of the data window is determined by the following formula: T DW =T data ·N trans 。 7. A computer-readable storage medium having a computer program stored thereon, characterized in that: The program is executed by a processor to implement a method for dynamically adjusting the size of a data window as described in claims 1-5.

8. A computer device, characterized in that: The method comprises a memory and a processor, wherein a computer program is stored in the memory, and when the processor runs the computer program stored in the memory, the processor executes a method for dynamically adjusting the size of a data window according to claims 1-5.