CN107819555B - An optimized wireless channel negotiation method - Google Patents
An optimized wireless channel negotiation method Download PDFInfo
- Publication number
- CN107819555B CN107819555B CN201711139144.5A CN201711139144A CN107819555B CN 107819555 B CN107819555 B CN 107819555B CN 201711139144 A CN201711139144 A CN 201711139144A CN 107819555 B CN107819555 B CN 107819555B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- source node
- target node
- sent
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 230000005540 biological transmission Effects 0.000 claims abstract description 81
- 238000012790 confirmation Methods 0.000 claims description 22
- 238000004891 communication Methods 0.000 abstract description 21
- 238000010586 diagram Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 4
- 101001128969 Homo sapiens Neuron navigator 1 Proteins 0.000 description 3
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 3
- 102100031225 Neuron navigator 1 Human genes 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 101000582002 Homo sapiens Neuron navigator 2 Proteins 0.000 description 2
- 101100465000 Mus musculus Prag1 gene Proteins 0.000 description 2
- 102100030465 Neuron navigator 2 Human genes 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1887—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1664—Details of the supervisory signal the supervisory signal being transmitted together with payload signals; piggybacking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1854—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1874—Buffer management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
- H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1835—Buffer management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明公开了一种优化的无线信道协商方法，无线通信节点的数据发送不必每次都去竞争信道，能够充分利用已分配的数据信道资源，减少了协商次数，降低了协商信道上的控制信息开销，避免网络负载较大时协商信道因为控制信息较多从而冲突概率较大成为性能瓶颈。并且，数据传输过程协商时考虑了对端的数据发送需求及数据优先级，使得目标通信节点的高优先级数据发送需求能够及时满足。
The invention discloses an optimized wireless channel negotiation method. The data transmission of the wireless communication node does not need to compete for the channel every time, the allocated data channel resources can be fully utilized, the number of negotiation times is reduced, and the control information on the negotiation channel is reduced. Overhead, to avoid the negotiated channel becoming a performance bottleneck due to the high collision probability due to more control information when the network load is heavy. Moreover, the data transmission requirement and data priority of the opposite end are considered during the negotiation of the data transmission process, so that the high-priority data transmission requirement of the target communication node can be satisfied in time.
Description
Technical Field
The present invention relates to the field of wireless communication, and in particular, to an optimized wireless channel negotiation method.
Background
Compared with the traditional wireless communication network, the wireless self-organizing network has the characteristics of rapid networking, low requirement on infrastructure and strong destruction resistance, and is widely applied to the fields of military communication, rescue and disaster resistance, intelligent transportation and the like.
Similar to the OSI model of the TCP/IP protocol stack, the underlying protocol stack of a wireless ad hoc network can also be divided into a physical layer (PHY), a medium access control layer (MAC) and a network layer (NET), where the MAC layer is responsible for access control and radio resource allocation. Most of MAC layer mainstream of the existing wireless ad hoc network adopts a CSMA/CA competition mechanism, but under the standard CSMA/CA mechanism, nodes need to compete for a channel again each time when data needs to be sent, when a plurality of nodes need to send more data packets at the same time, the data of each node is sent in a burst random manner, the probability of collision and retransmission is increased rapidly, and the effective transmission efficiency of the channel is reduced.
Synchronous TDD mode in prior art: based on the pre-divided time slot structure, the communication nodes in the wireless communication network can only carry out resource negotiation in the respectively appointed exclusive time slot, and the other nodes do not allow transmission in the period. After the data resources are negotiated by the negotiation channel, the nodes of the two communication parties switch to the data channel to transmit the data. When a node has data to send, it needs to wait for the time slot assigned by the node to arrive before negotiating the data resource.
The conventional CSMA/CA mechanism in the prior art: each time when a node has data to send, channel monitoring is needed, and the node can send an RTS frame to request to send the data only when a channel (DIFS + CW) is idle for a period of time. And after receiving the RTS frame, the target communication node replies a CTS frame confirmation after waiting for SIFS time. And after receiving the CTS frame, the source communication node waits for the SIFS time and starts to transmit data on the data channel. And after the target communication node correctly receives the data of the source communication node, the target communication node waits for an SIFS reply ACK. This concludes the data transfer process. This process needs to be repeated each time a node transmits data.
Disclosure of Invention
The purpose of the invention is as follows: it is an object of the present invention to provide an optimized wireless channel negotiation method that solves the drawbacks of the prior art.
The technical scheme is as follows: the optimized wireless channel negotiation method comprises the following steps:
s1: after the source node applies to the data channel, the data frame is sent to the target node through the data channel, and a frame header of the data frame carries relevant information required by a frame body, a buffer empty-full mark to be sent from the source node to the target node after the transmission and the priority of the residual data from the source node to the target node after the transmission;
s2: after receiving a data frame sent by a source node, a target node generates an ACK frame and sends the ACK frame to the source node, wherein the ACK frame carries confirmation information of data sent by the source node, indication information of whether the source node is allowed to continue sending, a buffer empty/full flag to be sent from the target node to the source node after the transmission and the priority of the residual data from the target node to the source node after the transmission, and if the data with the highest priority of the target node is sent to the source node and the priority of the data with the highest priority of the target node is higher than the priority of the residual data from the source node to the target node, the ACK frame also carries the data with the highest priority of the target node;
s3: after receiving the ACK frame sent by the target node, the source node performs the following operations:
s3.1: processing the data in the buffer to be sent according to the confirmation information mark in the ACK frame sent by the target node: deleting the data which is confirmed to be received by the target node from the to-be-sent buffer, and keeping the data which is not received by the target node in the to-be-sent buffer;
s3.2: if the source node finds that the ACK frame sent by the target node carries data, the step S3.3 is continued; otherwise, go to step S3.4;
s3.3: judging whether the target node allows the source node to continue sending: if the data is allowed to be sent to the target node, generating an ACK frame to be sent to the target node, and then performing step S4, wherein the ACK frame carries confirmation information of data sent by the target node, indication information of whether the target node is allowed to continue sending, a buffer empty/full flag to be sent from the source node to the target node after the current transmission, and the priority of the remaining data from the source node to the target node after the current transmission, and if the data with the highest priority of the source node is sent to the target node and the priority of the data with the highest priority of the source node is higher than the priority of the remaining data from the target node to the source node, the ACK frame also carries the data with the highest priority of the source node; if not, generating an ACK frame to be sent to the target node, and then performing step S4, wherein the ACK frame carries confirmation information of data sent by the target node, a buffer empty/full flag to be sent from the source node to the target node after the transmission, and a priority of the remaining data from the source node to the target node after the transmission;
s3.4: judging whether the target node allows the source node to continue sending: if the data is allowed to be sent to the target node, generating an ACK frame and sending the ACK frame to the target node, and then performing step S4, wherein the ACK frame carries indication information whether the target node is allowed to continue sending, a buffer empty/full flag to be sent from the source node to the target node after the current transmission and the priority of the remaining data from the source node to the target node after the current transmission, and if the data with the highest priority of the source node is sent to the target node and the priority of the data with the highest priority of the source node is higher than the priority of the remaining data from the target node to the source node, the ACK frame also carries the data with the highest priority of the source node; if not, ending;
s4: after receiving the ACK frame sent by the source node, the target node performs the following operations:
s4.1: processing the data in the buffer to be sent according to the confirmation information mark in the ACK frame sent by the source node: deleting the data which is confirmed to be received by the source node from the to-be-sent buffer, and reserving the data which is not received by the source node in the to-be-sent buffer;
s4.2: if the target node finds that the ACK frame sent by the source node carries data, the step S4.3 is continued; otherwise, go to step S4.4;
s4.3: judging whether the source node allows the target node to continue sending: if the data is allowed to be sent to the source node, generating an ACK frame and sending the ACK frame to the source node, and then returning to the step S3, wherein the ACK frame carries confirmation information of data sent by the source node, indication information of whether the data is allowed to be sent continuously by the source node, a buffer empty/full flag to be sent from the target node to the source node after the transmission, and the priority of the remaining data from the target node to the source node after the transmission, and if the data with the highest priority of the target node is sent to the source node and the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, the data with the highest priority of the target node is also carried in the ACK frame; if not, generating an ACK frame to be sent to the source node, and then returning to the step S3, wherein the ACK frame carries confirmation information of data sent by the source node, a buffer empty/full flag to be sent from the target node to the source node after the transmission, and a priority of the remaining data from the target node to the source node after the transmission;
s4.4: judging whether the source node allows the target node to continue sending: if the data is allowed to be sent to the source node, generating an ACK frame and sending the ACK frame to the source node, and then returning to the step S3, wherein the ACK frame carries indication information whether the source node is allowed to continue sending, a buffer empty/full flag to be sent from the target node to the source node after the transmission and the priority of the remaining data from the target node to the source node after the transmission, and if the data with the highest priority of the target node is sent to the source node and the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, the ACK frame also carries the data with the highest priority of the target node; if not, the process is ended.
Further, in step S1, if there is new data to be sent to the target node before the source node sends the data frame, the new data is framed together with the original data frame within a range not exceeding the maximum number of symbols, and the data frame to be sent is formed and sent to the target node.
Further, in the steps S2, S4.3 and S4.4, the indication information indicating whether the source node is allowed to continue sending is determined by the following method: if the buffer to be sent of the target node is not empty, the data with the highest priority of the target node is not the data sent to the source node, and the highest priority of the target node is higher than the priority of the residual data from the source node to the target node, indicating that the source node is not allowed to continue sending; otherwise, indicating the source node to allow the continuous transmission;
in steps S3.3 and S3.4, the indication information indicating whether the target node is allowed to continue sending is determined by the following method: if the buffer to be sent of the source node is not empty, the data with the highest priority of the source node is not the data sent to the target node, and the highest priority of the source node is higher than the priority of the residual data from the target node to the source node, indicating that the target node is not allowed to continue sending; otherwise, the target node is instructed to allow the transmission to continue.
Further, in step S2, if the data with the highest priority of the target node is the data sent to the source node, the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, and the time domain length of the ACK frame carrying the data with the highest priority of the target node does not exceed the time domain boundary determined by the maximum symbol number, the ACK frame also carries the data with the highest priority of the target node;
in the steps S3.3 and S3.4, if the data with the highest priority of the source node is the data which is sent to the target node, the priority of the data with the highest priority of the source node is higher than the priority of the remaining data from the target node to the source node, and the time domain length of the ACK frame carrying the data with the highest priority of the source node does not exceed the time domain boundary determined by the maximum symbol number, the ACK frame also carries the data with the highest priority of the source node;
in the steps S4.3 and S4.4, if the data with the highest priority of the target node is the data which is sent to the source node, the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, and the time domain length of the ACK frame carrying the data with the highest priority of the target node does not exceed the time domain boundary determined by the maximum symbol number, the ACK frame also carries the data with the highest priority of the target node.
Further, the maximum number of symbols is preset.
Further, the maximum symbol number is calculated according to statistical information of data arrival conditions of the source node, as shown in formula (1):
in formula (1), Smax is the maximum symbol number of channel resources that can be occupied by a source node, Prate is a statistically obtained data packet arrival rate, Lavg is an average packet length within a statistical time, t is a time domain length of each symbol, and Lreq is the symbol number of current data to be transmitted; [] Indicating rounding up and max indicating the maximum value.
Has the advantages that: the invention discloses an optimized wireless channel negotiation method, which has the following beneficial effects compared with the prior art:
1) the data transmission of the wireless communication node does not need to compete for the channel every time, the allocated data channel resources can be fully utilized, the negotiation times are reduced, the control information overhead on the negotiation channel is reduced, and the situation that the negotiation channel has higher collision probability to become a performance bottleneck because of more control information when the network load is larger is avoided;
2) the data transmission requirement and the data priority of the opposite end are considered during negotiation in the data transmission process, so that the high-priority data transmission requirement of the target communication node can be met in time.
Drawings
Fig. 1 is a topology diagram of a wireless network according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a wireless communication node according to an embodiment of the present invention;
fig. 3 is a diagram illustrating NAV information maintenance according to an embodiment of the present invention.
Detailed Description
The technical solution of the present invention will be further described with reference to the following detailed description and the accompanying drawings.
The specific embodiment discloses an optimized wireless channel negotiation method, which comprises the following steps:
s1: after the source node applies to the data channel, the data frame is sent to the target node through the data channel, and a frame header of the data frame carries relevant information required by a frame body, a buffer empty-full mark to be sent from the source node to the target node after the transmission and the priority of the residual data from the source node to the target node after the transmission;
s2: after receiving a data frame sent by a source node, a target node generates an ACK frame and sends the ACK frame to the source node, wherein the ACK frame carries confirmation information of data sent by the source node, indication information of whether the source node is allowed to continue sending, a buffer empty/full flag to be sent from the target node to the source node after the transmission and the priority of the residual data from the target node to the source node after the transmission, and if the data with the highest priority of the target node is sent to the source node and the priority of the data with the highest priority of the target node is higher than the priority of the residual data from the source node to the target node, the ACK frame also carries the data with the highest priority of the target node;
s3: after receiving the ACK frame sent by the target node, the source node performs the following operations:
s3.1: processing the data in the buffer to be sent according to the confirmation information mark in the ACK frame sent by the target node: deleting the data which is confirmed to be received by the target node from the to-be-sent buffer, and keeping the data which is not received by the target node in the to-be-sent buffer;
s3.2: if the source node finds that the ACK frame sent by the target node carries data, the step S3.3 is continued; otherwise, go to step S3.4;
s3.3: judging whether the target node allows the source node to continue sending: if the data is allowed to be sent to the target node, generating an ACK frame to be sent to the target node, and then performing step S4, wherein the ACK frame carries confirmation information of data sent by the target node, indication information of whether the target node is allowed to continue sending, a buffer empty/full flag to be sent from the source node to the target node after the current transmission, and the priority of the remaining data from the source node to the target node after the current transmission, and if the data with the highest priority of the source node is sent to the target node and the priority of the data with the highest priority of the source node is higher than the priority of the remaining data from the target node to the source node, the ACK frame also carries the data with the highest priority of the source node; if not, generating an ACK frame to be sent to the target node, and then performing step S4, wherein the ACK frame carries confirmation information of data sent by the target node, a buffer empty/full flag to be sent from the source node to the target node after the transmission, and a priority of the remaining data from the source node to the target node after the transmission;
s3.4: judging whether the target node allows the source node to continue sending: if the data is allowed to be sent to the target node, generating an ACK frame and sending the ACK frame to the target node, and then performing step S4, wherein the ACK frame carries indication information whether the target node is allowed to continue sending, a buffer empty/full flag to be sent from the source node to the target node after the current transmission and the priority of the remaining data from the source node to the target node after the current transmission, and if the data with the highest priority of the source node is sent to the target node and the priority of the data with the highest priority of the source node is higher than the priority of the remaining data from the target node to the source node, the ACK frame also carries the data with the highest priority of the source node; if not, ending;
s4: after receiving the ACK frame sent by the source node, the target node performs the following operations:
s4.1: processing the data in the buffer to be sent according to the confirmation information mark in the ACK frame sent by the source node: deleting the data which is confirmed to be received by the source node from the to-be-sent buffer, and reserving the data which is not received by the source node in the to-be-sent buffer;
s4.2: if the target node finds that the ACK frame sent by the source node carries data, the step S4.3 is continued; otherwise, go to step S4.4;
s4.3: judging whether the source node allows the target node to continue sending: if the data is allowed to be sent to the source node, generating an ACK frame and sending the ACK frame to the source node, and then returning to the step S3, wherein the ACK frame carries confirmation information of data sent by the source node, indication information of whether the data is allowed to be sent continuously by the source node, a buffer empty/full flag to be sent from the target node to the source node after the transmission, and the priority of the remaining data from the target node to the source node after the transmission, and if the data with the highest priority of the target node is sent to the source node and the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, the data with the highest priority of the target node is also carried in the ACK frame; if not, generating an ACK frame to be sent to the source node, and then returning to the step S3, wherein the ACK frame carries confirmation information of data sent by the source node, a buffer empty/full flag to be sent from the target node to the source node after the transmission, and a priority of the remaining data from the target node to the source node after the transmission;
s4.4: judging whether the source node allows the target node to continue sending: if the data is allowed to be sent to the source node, generating an ACK frame and sending the ACK frame to the source node, and then returning to the step S3, wherein the ACK frame carries indication information whether the source node is allowed to continue sending, a buffer empty/full flag to be sent from the target node to the source node after the transmission and the priority of the remaining data from the target node to the source node after the transmission, and if the data with the highest priority of the target node is sent to the source node and the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, the ACK frame also carries the data with the highest priority of the target node; if not, the process is ended.
In step S1, if there is new data to be sent to the target node before the source node sends the data frame, the new data and the original data frame are framed together within a range not exceeding the maximum number of symbols, and a data frame to be sent is formed and sent to the target node.
In steps S2, S4.3 and S4.4, the indication information of whether the source node is allowed to continue sending is determined by the following method: if the buffer to be sent of the target node is not empty, the data with the highest priority of the target node is not the data sent to the source node, and the highest priority of the target node is higher than the priority of the residual data from the source node to the target node, indicating that the source node is not allowed to continue sending; otherwise, indicating the source node to allow the continuous transmission;
in steps S3.3 and S3.4, the indication information whether the target node is allowed to continue sending is determined by the following method: if the buffer to be sent of the source node is not empty, the data with the highest priority of the source node is not the data sent to the target node, and the highest priority of the source node is higher than the priority of the residual data from the target node to the source node, indicating that the target node is not allowed to continue sending; otherwise, the target node is instructed to allow the transmission to continue.
In step S2, if the data with the highest priority of the target node is the data sent to the source node, the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, and the time domain length of the ACK frame carrying the data with the highest priority of the target node does not exceed the time domain boundary determined by the maximum symbol number, the ACK frame also carries the data with the highest priority of the target node;
in steps S3.3 and S3.4, if the data with the highest priority of the source node is the time domain boundary determined by the maximum symbol number, which is sent to the target node, the priority of the data with the highest priority of the source node is higher than the priority of the remaining data from the target node to the source node, and the time domain length of the ACK frame carrying the data with the highest priority of the source node does not exceed the maximum symbol number, the ACK frame also carries the data with the highest priority of the source node;
in steps S4.3 and S4.4, if the data with the highest priority of the target node is the time domain boundary determined by the maximum symbol number, which is sent to the source node, and the priority of the data with the highest priority of the target node is higher than the priority of the remaining data from the source node to the target node, and the time domain length of the ACK frame carrying the data with the highest priority of the target node does not exceed the maximum symbol number, the ACK frame also carries the data with the highest priority of the target node.
There are two ways to determine the maximum number of symbols: firstly, a static determination mode is adopted, namely the maximum symbol number is preset; the second is a dynamic determination mode, that is, the determination mode is calculated according to the statistical information of the data arrival condition of the source node, as shown in formula (1):
Smax＝max([Prate×Lavg×t×100]×Lavg，Lreq)(1)
in the formula (1), Smax is the maximum number of symbols of a channel resource occupied by a source node, Prate is a data packet arrival rate obtained through statistics, Lavg is an average packet length in a statistical time, t is a time domain length of each symbol, and Lreq is the number of symbols of current data to be sent; [] Indicating rounding up and max indicating the maximum value.
The technical solution of the present invention is further described below by taking a wireless communication network as an example.
Fig. 1 is a wireless communication network in which there are 6 nodes, node a, node B, node C, node D, node E and node F. The connecting line between two adjacent nodes in fig. 1 indicates that the two nodes are adjacent nodes to each other. Each node is configured as shown in fig. 2, and can transmit and receive wireless signals to and from any direction by using an omni-directional antenna. Fig. 3 is a diagram illustrating NAV information maintenance.
Assuming that a node a has data with 5 symbols at a certain time and needs to send to a node B, the node a starts to apply for wireless channel resources, that is, the node a monitors and competes for a negotiation channel, if the competition is successful, the node a sends an RTS frame to the node B on the negotiation channel, and the RTS frame carries a time length 7 symbol for applying for occupying the data channel, a time length 100 symbol for occupying the data channel maximally, a selected data channel fd, and a destination address node B. Wherein, the 7 symbols comprise a frame header and an ACK frame length, and the time length of the maximum occupied data channel is determined by a static determination mode.
After receiving the RTS frame, the one-hop neighbor nodes E and F of the node a keep silent update on the data channel fd in the t-t +6 time period to their NAV1 information, and keep silent update on the data channel fd in the t-t +99 time period to their NAV2 information.
After receiving the RTS frame sent by the node a, the target communication node B queries NAV1 information of the data channel fd maintained by itself for discovery, and if fd is not occupied by other nodes after time t, the node B replies a CTS frame on the negotiation channel for confirmation, where the CTS frame carries the node a applying for occupying the data channel fd, the time period t-t +6 for applying for occupying the data channel, and the time period of occupying the maximum data channel is t-t + 99.
After receiving the CTS frame, the one-hop neighbor nodes C and D of the node B keep silent update on the data channel fd in the t-t +6 time period to their NAV1 information, and keep silent update on the data channel fd in the t-t +99 time period to their NAV2 information.
After receiving the CTS frame from the node B, the source communication node a finds that two additional packets of data are added to the data to be transmitted at this time, the length of each packet is 10 symbols and 20 symbols, the node a determines that the allocated time length 100 symbols is enough to carry the original 1 packet and the newly added 2 packets of data, the node a packs the 3 packets of data together, and carries the number of the packets of data in the header of the data frame as 3, the length of each packet is 5 symbols, 10 symbols and 20 symbols, and the buffer empty-full mark C from a to B to be transmitted is markedflagAfter all, the remaining data priority is set to be the lowest, and node a sends the data header together with the 3 packets of data to node B on data channel fd.
Assuming that a target communication node B successfully receives data sent by a node A, the node B generates corresponding ACK information, wherein the ACK information comprises response information of 3-packet data sent by the node A, assuming that only 2-th packet data is not successfully transmitted, the response information is ACK/Nack/ACK, if no other data is sent in a buffer to be sent of the node B, the ACK frame does not carry extra data information, and meanwhile, the ACK frame carries indication information allowing the node A to continue sending, a buffer to be sent from B to A after the current transmission is marked as empty, and the priority of the remaining data is lowest; after A receives the ACK, it directly starts the retransmission of the 2 nd data packet, and at the same time, the data packet number carried in the data frame head is 1, the length is 10 symbols, and A to B waiting buffer empty-full mark CflagAfter all, the remaining data priority is set to be the lowest, and node a sends the data header together with the 3 packets of data to node B on data channel fd. Assuming that the node B successfully receives the data and no other data needs to be sent, the node B generates corresponding ACK information without carrying the ACK informationAdditional data information, in addition, indication information which is allowed to be continuously sent by the node A, a buffer mark to be sent from B to A after the transmission is empty, and the priority of the residual data is the lowest; after the ACK is received, the transmission is completed.
Assuming that after receiving the data frame sent by the node a, the node B finds that only the 2 nd packet data is unsuccessfully transmitted and there are 15 symbols of data to be sent to the node a, the following information is carried in the ACK frame: acknowledgement information (Ack/Nack/Ack) of 3 data packets, data information of 15 symbols, indication information allowing the node a to continue sending, a buffer mark to be sent from B to a after the transmission is empty, and the priority of the remaining data is the lowest; assuming that the node a correctly receives the ACK frame, if a finds that data is sent along with the path, a generates a corresponding ACK frame, and meanwhile, finds that data indicating 10 symbols in the received ACK frame needs to be retransmitted, the ACK frame sent by a carries the following information: acknowledgement information (Ack) of 1 data packet, retransmission data information of 10 symbols, indication information allowing the node B to continue sending, a pending transmission buffer flag from a to B after the current transmission is empty, and the priority of the remaining data is lowest; if the B successfully receives the ACK frame, the B sends the ACK frame to the A for response, the frame carries acknowledgement information (ACK) of 1 data packet, indication information allowing the node A to continue sending, a buffer mark to be sent from the B to the A after the transmission is empty, and the priority of the residual data is the lowest; after receiving the ACK frame, the node a completes the transmission.
Assuming that the node B finds that all 3 data packets are successfully received, and meanwhile the to-be-sent buffered data of the node B includes data from B to a and data from B to C, but the data priority from B to C is high, the node B carries the following information in the ACK frame fed back to the node a: acknowledgement information (Ack/Ack) of 3 data packets, indication information which does not allow the node A to continue sending, a buffer mark to be sent from B to A after the current transmission is non-empty, and the priority of the remaining data is the priority of the data from B to A; after receiving the ACK frame, the node a finds that the transmission is not allowed to continue, and therefore does not care whether the buffer to be transmitted has data any more, and considers that the transmission is completed.
Assuming that after receiving the data frame sent by the node a, the node B finds that all 3 data packets are successfully received, and in addition, data with 25 symbols is to be sent to the node a, the following information is carried in the ACK frame: acknowledgement information (Ack/Ack) of 3 data packets, data information of 25 symbols, indication information allowing the node A to continue sending, a buffer mark to be sent from B to A after the transmission is empty, and the priority of the remaining data is the lowest; assuming that the node a correctly receives the ACK frame, if a finds that data is sent along with the path, a generates a corresponding ACK frame, and at the same time, a finds that new data of 12 symbols arrives in its own pending buffer, the ACK frame sent by a carries the following information: acknowledgement information (Ack) of 1 data packet, newly transmitted data information of 12 symbols, indication information allowing the node B to continue sending, a buffer mark to be sent from A to B after the current transmission is empty, and the priority of the residual data is the lowest; if the B successfully receives the ACK frame, the B sends the ACK frame to the A for response, the frame carries acknowledgement information (ACK) of 1 data packet, indication information allowing the node A to continue sending, a buffer mark to be sent from the B to the A after the transmission is empty, and the priority of the residual data is the lowest; after receiving the ACK frame, the node a completes the transmission.
After the data transmission is finished, the node again negotiates with the channel competition resource and negotiates with the data transmission resource of other nodes.
In addition, in some wireless systems, the longest frame may be constrained, and in the above example, assuming that the constrained node transmits a data frame of a maximum of 20 symbols at a time, the node needs to modify the pending buffer flag and the remaining data priority.
Claims (5)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711139144.5A CN107819555B (en) | 2017-11-16 | 2017-11-16 | An optimized wireless channel negotiation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711139144.5A CN107819555B (en) | 2017-11-16 | 2017-11-16 | An optimized wireless channel negotiation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107819555A CN107819555A (en) | 2018-03-20 |
| CN107819555B true CN107819555B (en) | 2021-05-11 |
Family
ID=61609861
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711139144.5A Expired - Fee Related CN107819555B (en) | 2017-11-16 | 2017-11-16 | An optimized wireless channel negotiation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107819555B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111901247A (en) * | 2020-07-15 | 2020-11-06 | 广东电网有限责任公司 | A data transmission method and device |
| CN118338453B (en) * | 2024-05-16 | 2024-12-06 | 深圳鹏龙通科技有限公司 | Channel access method, device, electronic equipment and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104303572A (en) * | 2012-05-04 | 2015-01-21 | 交互数字专利控股公司 | Coexistence management service for spectrum sharing |
| CN106879031A (en) * | 2017-03-23 | 2017-06-20 | 江苏中科羿链通信技术有限公司 | A kind of channel wireless radio multi Mesh network resource negotiation method based on double receipts single-shots |
| CN106936557A (en) * | 2017-03-23 | 2017-07-07 | 江苏中科羿链通信技术有限公司 | A kind of wireless channel resource allocation |
| CN106961701A (en) * | 2017-03-23 | 2017-07-18 | 江苏中科羿链通信技术有限公司 | A kind of wireless channel machinery of consultation and system |
| CN107040962A (en) * | 2017-04-18 | 2017-08-11 | 江苏中科羿链通信技术有限公司 | A kind of adaptive wireless channel negotiation method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102196447B (en) * | 2010-03-03 | 2015-06-03 | 中兴通讯股份有限公司 | Allocation method and system of wireless channels for packet services |
| US9363753B2 (en) * | 2011-07-19 | 2016-06-07 | Qualcomm Incorporated | Sleep mode for user equipment relays |
| CN104507167B (en) * | 2014-12-08 | 2018-12-14 | 上海华为技术有限公司 | A kind of wireless resource allocation methods, node and system |
| US10419191B2 (en) * | 2016-01-15 | 2019-09-17 | New York University | Systems, methods, and computer-readable media utilizing an improved radio frame design and MAC layer for ultra-low latency |
-
2017
- 2017-11-16 CN CN201711139144.5A patent/CN107819555B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104303572A (en) * | 2012-05-04 | 2015-01-21 | 交互数字专利控股公司 | Coexistence management service for spectrum sharing |
| CN106879031A (en) * | 2017-03-23 | 2017-06-20 | 江苏中科羿链通信技术有限公司 | A kind of channel wireless radio multi Mesh network resource negotiation method based on double receipts single-shots |
| CN106936557A (en) * | 2017-03-23 | 2017-07-07 | 江苏中科羿链通信技术有限公司 | A kind of wireless channel resource allocation |
| CN106961701A (en) * | 2017-03-23 | 2017-07-18 | 江苏中科羿链通信技术有限公司 | A kind of wireless channel machinery of consultation and system |
| CN107040962A (en) * | 2017-04-18 | 2017-08-11 | 江苏中科羿链通信技术有限公司 | A kind of adaptive wireless channel negotiation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107819555A (en) | 2018-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7394920B2 (en) | Communication devices, communication methods and integrated circuits | |
| JP7427170B2 (en) | In-time and in-frequency RTA packet duplication | |
| TWI459754B (en) | Method of crowding management in wireless mesh network | |
| CN102905309B (en) | A kind of relay communication method based on cooperative MAC protocol in vehicle self-organizing network | |
| KR102798990B1 (en) | Avoiding contention collisions for real-time application traffic | |
| JP7679488B2 (en) | Sharing EDCA TXOP with RTA traffic | |
| CN101123754B (en) | Wireless system, wireless communication apparatus and communication method | |
| CN102056325B (en) | Multiple access method based on multiple-input multiple-output antenna | |
| CN102300257A (en) | Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network | |
| KR102805087B1 (en) | TS behavior for RTA session management | |
| US12342392B2 (en) | Sharing an EDCA TXOP with RTA traffic | |
| KR20230136219A (en) | Limited target wake time service period ends | |
| US7649911B2 (en) | Method of data handling in a WLAN | |
| US7912032B2 (en) | System and method for communicating within a wireless communication network | |
| CN106879031B (en) | A kind of channel wireless radio multi Mesh network resource negotiation methods based on double receipts single-shots | |
| CN105007586B (en) | The adaptive competition window method of adjustment of double factor of wireless sense network SMAC agreements | |
| CN107819555B (en) | An optimized wireless channel negotiation method | |
| CN106936557B (en) | Wireless channel resource allocation method | |
| CN101141176B (en) | Distributed acquisition multi-access method | |
| CN105474570A (en) | Data transmission method and device | |
| CN103856981B (en) | Method for dynamically utilizing data packet aggregation transmission based on network state | |
| CN114615645A (en) | A Task Offloading Fairness Transmission Method Based on Packet Type Recognition | |
| CN113630810A (en) | High dynamic network MAC layer communication method | |
| WO2008012789A1 (en) | Method for reduced latency wireless communication having reduced latency and increased range and handoff performance between different transmitting stations | |
| WO2015062270A1 (en) | Wireless communications method and wireless communications device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20230905 Granted publication date: 20210511 |
|
| PD01 | Discharge of preservation of patent | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20240119 Granted publication date: 20210511 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210511 |