CN106936557B - Wireless channel resource allocation method - Google Patents
Wireless channel resource allocation method Download PDFInfo
- Publication number
- CN106936557B CN106936557B CN201710178252.7A CN201710178252A CN106936557B CN 106936557 B CN106936557 B CN 106936557B CN 201710178252 A CN201710178252 A CN 201710178252A CN 106936557 B CN106936557 B CN 106936557B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- occupied
- source node
- data channel
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000013468 resource allocation Methods 0.000 title abstract description 10
- 230000005540 biological transmission Effects 0.000 claims abstract description 19
- 101001128969 Homo sapiens Neuron navigator 1 Proteins 0.000 claims description 35
- 102100031225 Neuron navigator 1 Human genes 0.000 claims description 35
- 101000582002 Homo sapiens Neuron navigator 2 Proteins 0.000 claims description 21
- 102100030465 Neuron navigator 2 Human genes 0.000 claims description 21
- 238000004891 communication Methods 0.000 abstract description 43
- 230000006866 deterioration Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000003068 static effect Effects 0.000 description 4
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008570 general process Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012545 processing Methods 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
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
- H04L5/0055—Physical resource allocation for ACK/NACK
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- 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/52—Allocation or scheduling criteria for wireless resources based on load
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a wireless channel resource allocation method, which comprises the four steps of determining the maximum symbol number, applying for the wireless channel resource of a node before sending data, confirming the wireless channel resource by a target node and sending data by a source node. By the invention, the data transmission requirement of the wireless communication node can be satisfied in time, the negotiation frequency is reduced, the control information overhead on the negotiation channel is reduced, and the situation that the negotiation channel has larger collision probability to become a performance bottleneck due to more control information when the network load is larger is avoided. When the network load is light, the arrival frequency of the data packet is slow, and the invention does not cause performance deterioration; when the network load is larger, the arrival frequency of the data packet is faster, the invention can utilize the resources distributed once as much as possible, improve the throughput of the wireless communication network, reduce the total sending times of the communication nodes so as to reduce the power consumption of the communication nodes, and simultaneously reduce the whole communication time delay of the wireless communication network.
Description
Technical Field
The present invention relates to the field of wireless communication, and in particular, to a method for allocating wireless channel resources.
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. The protocol of the MAC layer directly affects performance indexes such as delay, throughput, channel utilization rate, and the like of the network, and therefore, it is very important to the overall performance of the network to select a suitable wireless channel resource allocation method.
A Medium Access Control (MAC) protocol of a wireless communication network mainly solves two problems of access control and wireless resource allocation of nodes, and a CSMA/CA competition mechanism is mostly adopted in the mainstream technology in the aspect of access control; in the channel allocation, for a multi-channel wireless communication network, appropriate channel resources are allocated to different communication nodes and the time length of occupying the channel resources is determined.
The current wireless channel allocation method focuses on how to allocate channel resources for different communication nodes, i.e. select a suitable channel, and little relates to how to allocate time domain resources of the communication nodes, i.e. how to occupy the time length of the channel resources.
In the prior art, a method for allocating reserved time slots exists, which is based on a pre-divided time slot structure, when the number of communication nodes in a wireless communication network changes or needs change, other nodes, namely a receiver, judge whether the node occupies the reserved time slots or not after receiving a reserved time slot request, if the node does not occupy the reserved time slots, no processing is carried out for returning, otherwise, whether the node should give up the occupied reserved time slots or not is calculated according to a preset algorithm; if the calculation result is that the reservation time slot should be abandoned, replying a reservation request to the requester, abandoning the reservation time slot, confirming that the reservation is successful after the requester receives the reply reservation request, and finishing the transfer of the reservation time slot; under the condition that a plurality of reservation requests exist in the network at the same time, the nodes in the network can process in sequence according to the sequence of time slot numbers. The allocation method still needs to be based on a pre-divided time slot structure, so that each wireless communication node in the network needs to perform time synchronization to correctly use the reserved time slot, and the method is not suitable for a wireless communication network without time synchronization. Meanwhile, the neighbor nodes of the non-target communication node of the source communication node need to reply messages to the source communication node when receiving the reservation time slot request, and the overhead on the negotiation channel is increased.
There is also a conventional CSMA/CA scheme in the prior art, which separates the negotiation channel from the data channel, i.e. assuming that there are N available channels, one of the negotiation channels is selected, and the remaining N-1 are used as data channels. In a traditional CSMA/CA mechanism, a source communication node sends RTS request wireless resources on a negotiation channel before sending data, wherein the RTS request wireless resources carry selected data channels and the time length occupied by the request; after receiving the RTS frame, the target communication node allocates a time slot resource of the application length to the source communication node on the applied data channel, which is simply how long to apply for allocation. In the scheme, the data transmission requirements of the wireless communication nodes are dynamically changed, confirmation messages are replied from the source communication node to the target communication node after the source communication node applies for resources, the source node may generate new data transmission requirements, the new data transmission requirements need to be applied for resources for multiple times in this way, the number of negotiation times is increased, the load of a negotiation channel is increased for the whole network, meanwhile, the probability of conflict on the negotiation channel is increased, the power saving of the communication nodes is not facilitated for a single communication node, and meanwhile, the new data requirements are not timely met, namely, the communication delay is increased.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to provide a wireless channel resource allocation method which can solve the defects in the prior art.
The technical scheme is as follows: the invention relates to a wireless channel resource allocation method, which comprises the following steps:
s1: determining the maximum number of symbols;
s2: before sending data, a source node selects a data channel, and sends an RTS frame to a target node on a negotiation channel obtained by competition, wherein the RTS frame carries the number of symbols of data to be sent of the source node, the maximum number of symbols of channel resources which can be occupied by the source node and a data channel required to be occupied by the source node;
s3: after receiving the RTS frame, other nodes except the target node maintain the information of NAV1 and NAV 2: in the NAV1 information, setting a data channel which is required to be occupied by a source node and carried in an RTS frame to an occupied state, wherein an occupied time period is from the moment when the node receives the RTS frame to the moment when the source node finishes transmitting data; in the NAV2 information, setting a data channel which is required to be occupied by a source node and carried in an RTS frame to be in an occupied state, wherein the occupied time period is from the moment when the node receives the RTS frame to the moment when the data transmission of the maximum symbol length of the source node is finished;
s4: after receiving the RTS frame, if the time period of the data channel required to be occupied by the source node is found to be free from conflict with NAV1 information maintained by the target node, the target node sends a CTS frame to the source node, wherein the CTS frame carries the number of symbols of data to be sent by the source node, the maximum number of symbols of channel resources which can be occupied by the source node and the data channel required to be occupied by the source node;
s5: after receiving the CTS frame, other nodes except the source node maintain the information of NAV1 and NAV 2: in the NAV1 information, setting a data channel which is required to be occupied by a source node and carried in a CTS frame to an occupied state, wherein the occupied time period is from the moment when the node receives the CTS frame to the moment when the source node finishes transmitting data; in the NAV2 information, setting a data channel which is carried in a CTS frame and is required to be occupied by a source node to be in an occupied state, wherein the occupied time period is from the moment when the node receives the CTS frame to the moment when the transmission of the data with the maximum symbol length of the source node is finished;
s6: after receiving the CTS frame, the source node judges whether new data is to be sent to the target node: if yes, the source node packs the new data and the data to be sent in the step S2 in the maximum symbol length range, and sends the new data and the data to be sent to the target node together with the number and length information of the data packets; otherwise, the data to be sent in step S2 is directly sent to the target node.
Further, in step S1, the maximum number of symbols is preset.
Further, in step S1, the maximum symbol number Smax is calculated according to statistical information of data arrival conditions of the source node, as shown in equation (1):
Smax＝max([Prate×Lavg×t×100]×Lavg，Lreq) (1)
in the formula (1), Prate is the counted number of data packets arriving at the source node per second, Lavg is the average packet length within the counted time, t is the time length of each symbol, and Lreq is the symbol bit of the current data to be sent; [] Indicating rounding up.
Further, in step S2, the number of symbols of the data to be sent by the source node includes the number of symbols occupied by the target node to reply ACK.
Further, in step S2, the source node selects a data channel according to the following method:
s2.1: the source node determines whether there is a data channel in the NAV2 information that is not marked as occupied: if yes, randomly selecting a data channel; otherwise, performing step S2.2;
s2.2: the source node determines whether there is a data channel in the NAV1 information that is not marked as occupied: if yes, go to step S2.3; otherwise, canceling the sending of the RTS frame;
s2.3: judging whether the data channels which are not marked as the occupied state in the NAV1 information are a plurality of channels: if the number of the data channels is multiple, selecting one data channel according to any one of the following two modes; if one, directly selecting the data channel;
the first method is as follows: calculating the distance between the ending time point of the data to be transmitted and the ending time point of each data channel which is not marked as an occupied state in the NAV1 information: if the distances are not all equal, selecting a data channel corresponding to the maximum distance; otherwise, randomly selecting a data channel;
the second method comprises the following steps: calculating the distance between the ending time point of the data to be transmitted and the ending time point of each data channel which is not marked as an occupied state in the NAV2 information: if the distances are not all equal, selecting a data channel corresponding to the minimum distance; otherwise, a data channel is randomly selected.
Has the advantages that: compared with the prior art, the invention has the following beneficial effects:
1) by the method and the device, the data sending requirement of the wireless communication node can be met in time, the negotiation frequency is 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 due to more control information when the network load is higher is avoided;
2) when the network load is light, the arrival frequency of the data packet is slow, and the invention does not cause performance deterioration; when the network load is larger, the arrival frequency of the data packet is faster, the invention can utilize the resources distributed once as much as possible, improve the throughput of the wireless communication network, reduce the total sending times of the communication nodes so as to reduce the power consumption of the communication nodes, and simultaneously reduce the whole communication time delay of the wireless communication network.
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 in accordance with an embodiment of the present invention;
FIG. 4 is a general process flow diagram in accordance with an embodiment of the present invention;
fig. 5 is a flow chart of data channel selection according to an embodiment of the present invention.
Detailed Description
The technical scheme of the invention is further described in the following by combining the attached drawings and the detailed description.
The present embodiment discloses a method for allocating wireless channel resources, as shown in fig. 4, including the following steps:
s1: determining the maximum number of symbols;
s2: before sending data, a source node selects a data channel, and sends an RTS frame to a target node on a negotiation channel obtained by competition, wherein the RTS frame carries the number of symbols of data to be sent of the source node, the maximum number of symbols of channel resources which can be occupied by the source node and a data channel required to be occupied by the source node; the symbol number of the data to be sent by the source node comprises the symbol number occupied by the target node for replying the ACK;
s3: after receiving the RTS frame, other nodes except the target node maintain the information of NAV1 and NAV 2: in the NAV1 information, setting a data channel which is required to be occupied by a source node and carried in an RTS frame to an occupied state, wherein an occupied time period is from the moment when the node receives the RTS frame to the moment when the source node finishes transmitting data; in the NAV2 information, setting a data channel which is required to be occupied by a source node and carried in an RTS frame to be in an occupied state, wherein the occupied time period is from the moment when the node receives the RTS frame to the moment when the data transmission of the maximum symbol length of the source node is finished;
s4: after receiving the RTS frame, if the time period of the data channel required to be occupied by the source node is found to be free from conflict with NAV1 information maintained by the target node, the target node sends a CTS frame to the source node, wherein the CTS frame carries the number of symbols of data to be sent by the source node, the maximum number of symbols of channel resources which can be occupied by the source node and the data channel required to be occupied by the source node;
s5: after receiving the CTS frame, other nodes except the source node maintain the information of NAV1 and NAV 2: in the NAV1 information, setting a data channel which is required to be occupied by a source node and carried in a CTS frame to an occupied state, wherein the occupied time period is from the moment when the node receives the CTS frame to the moment when the source node finishes transmitting data; in the NAV2 information, setting a data channel which is carried in a CTS frame and is required to be occupied by a source node to be in an occupied state, wherein the occupied time period is from the moment when the node receives the CTS frame to the moment when the transmission of the data with the maximum symbol length of the source node is finished;
s6: after receiving the CTS frame, the source node judges whether new data is to be sent to the target node: if yes, the source node packs the new data and the data to be sent in the step S2 in the maximum symbol length range, and sends the new data and the data to be sent to the target node together with the number and length information of the data packets; otherwise, the data to be sent in step S2 is directly sent to the target node.
In step S1, the maximum number of symbols may be determined in a static determination manner or a dynamic determination manner.
The static determination mode is to preset the maximum number of symbols, and the static determination mode is executed only once when the node is powered on.
The dynamic determination mode is to calculate the maximum symbol number Smax 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), Prate is the counted number of data packets arriving at the source node per second, Lavg is the average packet length within the counted time, t is the time length of each symbol, and Lreq is the symbol bit of the current data to be sent; [] Indicating rounding up. This is performed once before each data transmission.
In step S2, the source node selects a data channel according to the following method:
s2.1: the source node determines whether there is a data channel in the NAV2 information that is not marked as occupied: if yes, randomly selecting a data channel; otherwise, performing step S2.2;
s2.2: the source node determines whether there is a data channel in the NAV1 information that is not marked as occupied: if yes, go to step S2.3; otherwise, canceling the sending of the RTS frame;
s2.3: judging whether the data channels which are not marked as the occupied state in the NAV1 information are a plurality of channels: if the number of the data channels is multiple, selecting one data channel according to any one of the following two modes; if one, directly selecting the data channel;
the first method is as follows: calculating the distance between the ending time point of the data to be transmitted and the ending time point of each data channel which is not marked as an occupied state in the NAV1 information: if the distances are not all equal, selecting a data channel corresponding to the maximum distance; otherwise, randomly selecting a data channel;
the second method comprises the following steps: calculating the distance between the ending time point of the data to be transmitted and the ending time point of each data channel which is not marked as an occupied state in the NAV2 information: if the distances are not all equal, selecting a data channel corresponding to the minimum distance; otherwise, a data channel is randomly selected.
In this embodiment, "node" is a short for "wireless communication node", and the node includes wireless communication devices such as a wireless terminal, a wireless relay, and a base station, and may be configured in various forms such as single-transmission and double-reception, double-transmission and double-reception, multiple-transmission and multiple-reception, and the like.
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.
A mode of setting a negotiation channel is adopted in a wireless communication network so as to quickly obtain the occupation condition of an adjacent node channel and quickly finish a channel negotiation process. Fig. 3 is a diagram illustrating NAV information maintenance, and fig. 5 is a flowchart illustrating data channel selection.
Example 1:
assuming that node a has 5 symbols of data to transmit to node B at a certain time, the radio channel resource allocation method includes the steps of:
s1: determining the maximum symbol number to be 100 by adopting a static determination mode;
s2: before sending data, a node A queries NAV2 information to obtain that 3 data channels fb, fc and fd are idle, then a channel fd is randomly selected from the three data channels as a data channel, an RTS frame is sent to a node B on a negotiation channel obtained by competition, and the RTS frame carries the symbol number 7 of data to be sent of the node A, the maximum symbol number 100 of channel resources which can be occupied by the node A and the data channel fd which is required to be occupied by the node A; the symbol number 7 of the data to be transmitted of the node A comprises the transceiving conversion of 1 symbol, the ACK frame of 1 symbol and the data to be transmitted of 5 symbols;
s3: after receiving the RTS frame, the one-hop neighbor node E, F of node a maintains the information of NAV1 and NAV2, respectively: in the NAV1 message, the data channel fd is set to the occupied state, occupying the time period t1～t1+6 is the time t when the node receives RTS frame1Starting to finish the data transmission t to be sent of the node A1+ 6; in the NAV2 information, the data channel that node a carried in RTS frame requires to occupy is set to occupied state, occupying time period t1～t1+99 is the time t when the node receives the RTS frame1T starting from the end of the maximum symbol length data transmission of node A1+99；
S4: after receiving the RTS frame, the node B queries NAV1 information of a data channel fd maintained by itself, finds that fd is not occupied by other nodes after t, and then sends a CTS frame to the node a on a negotiation channel, where the CTS frame carries the number of symbols 7 of data to be sent by the node a, the maximum number of symbols 100 of channel resources that can be occupied by the node a, and the data channel fd that the node a requires to occupy;
s5: after receiving the CTS frame, the one-hop neighbor node C, D of the node B maintains the information of NAV1 and NAV2, respectively: in the NAV1 information, setting the data channel fd, which is required to be occupied by the node a carried in the CTS frame, to an occupied state for an occupied time period t2～t2+6 is the moment t when the node receives the CTS frame2Starting to finish the data transmission t to be sent of the node A2+ 6; in the NAV2 information, setting the data channel fd, which is required to be occupied by the node a carried in the CTS frame, to an occupied state for an occupied time period t2～t2+99 is the time t when the node receives the CTS frame2T starting from the end of the maximum symbol length data transmission of node A2+99；
S6: after receiving the CTS frame, the node a finds that two new packets of data are to be sent to the node B, the lengths of the two new packets of data are 10 symbols and 70 symbols, and it can be known through calculation that the number of symbols of the three packets of data is less than the maximum number of symbols, so that the two new packets of data are packed together with the data to be sent in step S2, and carry the number 3 of data packets, the length information 5 symbol, the 10 symbols, and the 70 symbols, and are sent to the node B on the data channel fd.
Example 2:
assuming that node a has 5 symbols of data to transmit to node B at a certain time, the radio channel resource allocation method includes the steps of:
s1: determining the maximum number of symbols by dynamic determination, and setting Prate as 100, Lavg as 10 and t as 36 × 10-6In the equation (1), 15 symbols are substituted for the second symbol and the Lreq, and the maximum symbol number Smax obtained by calculation is 40 symbols;
s2: before sending data, a node A queries NAV2 information to obtain that 3 data channels fb, fc and fd are idle, then a channel fd is randomly selected from the three data channels as a data channel, an RTS frame is sent to a node B on a negotiation channel obtained by competition, and the RTS frame carries the symbol number 7 of data to be sent of the node A, the maximum symbol number 40 of channel resources which can be occupied by the node A and the data channel fd which is required to be occupied by the node A; the symbol number 7 of the data to be transmitted of the node A comprises the transceiving conversion of 1 symbol, the ACK frame of 1 symbol and the data to be transmitted of 5 symbols;
s3: after receiving the RTS frame, the one-hop neighbor node E, F of node a maintains the information of NAV1 and NAV2, respectively: in the NAV1 message, the data channel fd is set to the occupied state, occupying the time period t1～t1+6 is the time t when the node receives RTS frame1Starting to finish the data transmission t to be sent of the node A1+ 6; in the NAV2 information, the data channel that node a carried in RTS frame requires to occupy is set to occupied state, occupying time period t1～t1+39 is the time t when the node receives RTS frame1T starting from the end of the maximum symbol length data transmission of node A1+39；
S4: after receiving the RTS frame, the node B queries NAV1 information of a data channel fd maintained by itself, finds that fd is not occupied by other nodes after t, and then sends a CTS frame to the node a on a negotiation channel, where the CTS frame carries symbol number 7 of data to be sent by the node a, maximum symbol number 40 of channel resources that can be occupied by the node a, and the data channel fd that the node a requires to occupy;
s5: after receiving the CTS frame, the one-hop neighbor node C, D of the node B maintains the information of NAV1 and NAV2, respectively: in the NAV1 information, setting the data channel fd, which is required to be occupied by the node a carried in the CTS frame, to an occupied state for an occupied time period t2～t2+6 is the moment t when the node receives the CTS frame2Starting to finish the data transmission t to be sent of the node A2+ 6; in the NAV2 information, setting the data channel fd, which is required to be occupied by the node a carried in the CTS frame, to an occupied state for an occupied time period t2～t2+39 is the time t when the node receives the CTS frame2T starting from the end of the maximum symbol length data transmission of node A2+39；
S6: after receiving the CTS frame, node a finds that there are two new packets of data to be sent to node B, the lengths of which are 10 symbols and 70 symbols, respectively, and it can be known through calculation that the number of symbols of these three packets of data is greater than the maximum number of symbols, so that only the first packet of data can be packed together with the data to be sent in step S2, and the data to be sent is sent to node B on data channel fd, carrying data packet number 2, length information 5 symbols, and 10 symbols.
Claims (4)
1. A method for allocating radio channel resources, comprising: the method comprises the following steps:
s1: determining the maximum number of symbols;
s2: before sending data, a source node selects a data channel, and sends an RTS frame to a target node on a negotiation channel obtained by competition, wherein the RTS frame carries the number of symbols of data to be sent of the source node, the maximum number of symbols of channel resources which can be occupied by the source node and a data channel required to be occupied by the source node;
in step S2, the source node selects a data channel according to the following method:
s2.1: the source node determines whether there is a data channel in the NAV2 information that is not marked as occupied: if yes, randomly selecting a data channel; otherwise, performing step S2.2;
s2.2: the source node determines whether there is a data channel in the NAV1 information that is not marked as occupied: if yes, go to step S2.3; otherwise, canceling the sending of the RTS frame;
s2.3: judging whether the data channels which are not marked as the occupied state in the NAV1 information are a plurality of channels: if the number of the data channels is multiple, selecting one data channel according to any one of the following two modes; if one, directly selecting the data channel;
the first method is as follows: calculating the distance between the ending time point of the data to be transmitted and the ending time point of each data channel which is not marked as an occupied state in the NAV1 information: if the distances are not all equal, selecting a data channel corresponding to the maximum distance; otherwise, randomly selecting a data channel;
the second method comprises the following steps: calculating the distance between the ending time point of the data to be transmitted and the ending time point of each data channel which is not marked as an occupied state in the NAV1 information: if the distances are not all equal, selecting a data channel corresponding to the minimum distance; otherwise, randomly selecting a data channel;
s3: after receiving the RTS frame, other nodes except the target node maintain the information of NAV1 and NAV 2: in the NAV1 information, setting a data channel which is required to be occupied by a source node and carried in an RTS frame to an occupied state, wherein an occupied time period is from the moment when the node receives the RTS frame to the moment when the source node finishes transmitting data; in the NAV2 information, setting a data channel which is required to be occupied by a source node and carried in an RTS frame as an occupied state, wherein the occupied time period is the time when the node receives the RTS frame and the maximum symbol number data transmission of the source node is finished;
s4: after receiving the RTS frame, if the time period of the data channel required to be occupied by the source node is found to be free from conflict with NAV1 information maintained by the target node, the target node sends a CTS frame to the source node, wherein the CTS frame carries the number of symbols of data to be sent by the source node, the maximum number of symbols of channel resources which can be occupied by the source node and the data channel required to be occupied by the source node;
s5: after receiving the CTS frame, other nodes except the source node maintain the information of NAV1 and NAV 2: in the NAV1 information, setting a data channel which is required to be occupied by a source node and carried in a CTS frame to an occupied state, wherein the occupied time period is from the moment when the node receives the CTS frame to the moment when the source node finishes transmitting data; in the NAV2 information, setting a data channel which is carried in a CTS frame and is required to be occupied by a source node to be in an occupied state, wherein the occupied time period is from the moment when the node receives the CTS frame to the moment when the maximum symbol number data transmission of the source node is finished;
s6: after receiving the CTS frame, the source node judges whether new data is to be sent to the target node: if yes, the source node packages the new data and the data to be sent in the step S2 in the maximum symbol number range, and sends the new data and the data to be sent to the target node together with the number and length information of the data packets; otherwise, the data to be sent in step S2 is directly sent to the target node.
2. The method of claim 1, wherein: in step S1, the maximum number of symbols is preset.
3. The method of claim 1, wherein: in step S1, the maximum symbol number Smax is calculated according to statistical information of data arrival conditions of the source node, as shown in equation (1):
Smax ＝ max([Prate×Lavg×t×100]×Lavg， Lreq) (1)
in the formula (1), Prate is the counted number of data packets arriving at the source node per second, Lavg is the average packet length within the counted time, t is the time length of each symbol, and Lreq is the number of symbols of the current data to be sent; [] Indicating rounding up.
4. The method of claim 1, wherein: in step S2, the number of symbols of the data to be sent by the source node includes the number of symbols occupied by the target node to reply ACK.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710178252.7A CN106936557B (en) | 2017-03-23 | 2017-03-23 | Wireless channel resource allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710178252.7A CN106936557B (en) | 2017-03-23 | 2017-03-23 | Wireless channel resource allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106936557A CN106936557A (en) | 2017-07-07 |
| CN106936557B true CN106936557B (en) | 2020-04-03 |
Family
ID=59425134
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710178252.7A Active CN106936557B (en) | 2017-03-23 | 2017-03-23 | Wireless channel resource allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106936557B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107819555B (en) * | 2017-11-16 | 2021-05-11 | 江苏中科羿链通信技术有限公司 | Optimized wireless channel negotiation method |
| CN112436928B (en) * | 2020-11-23 | 2023-11-03 | 北京中航通用科技有限公司 | Data transmission method and device |
| CN114995625B (en) * | 2021-08-11 | 2023-05-12 | 荣耀终端有限公司 | System power consumption control method and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003026221A1 (en) * | 2001-09-16 | 2003-03-27 | Commprize Ventures Limited | System and method for introducing sectored transceiving into wireless networks |
| CN1462524A (en) * | 2001-05-15 | 2003-12-17 | 皇家菲利浦电子有限公司 | Overlapping network allocation vector (ONAV) for avoiding collision in IEEE 802.00 WLAN operating under HCF |
| CN101356775A (en) * | 2005-06-08 | 2009-01-28 | 阿瓦雅技术公司 | Avoiding exposed node problems in wireless local area networks |
| CN104105216A (en) * | 2013-04-09 | 2014-10-15 | 华为终端有限公司 | Resource reservation method and device |
-
2017
- 2017-03-23 CN CN201710178252.7A patent/CN106936557B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1462524A (en) * | 2001-05-15 | 2003-12-17 | 皇家菲利浦电子有限公司 | Overlapping network allocation vector (ONAV) for avoiding collision in IEEE 802.00 WLAN operating under HCF |
| WO2003026221A1 (en) * | 2001-09-16 | 2003-03-27 | Commprize Ventures Limited | System and method for introducing sectored transceiving into wireless networks |
| CN101356775A (en) * | 2005-06-08 | 2009-01-28 | 阿瓦雅技术公司 | Avoiding exposed node problems in wireless local area networks |
| CN104105216A (en) * | 2013-04-09 | 2014-10-15 | 华为终端有限公司 | Resource reservation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106936557A (en) | 2017-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3968724A1 (en) | Frame transmission method and device using multiple random backoff operation in broadband wireless communication network | |
| US7616602B2 (en) | Method and system for wireless local area network (LAN) communication using virtual time division multiple access (TDMA) | |
| Kim et al. | Coordinated multichannel MAC protocol for vehicular ad hoc networks | |
| US7535919B2 (en) | Wireless communication method adapting priority for transmitting packets in WPAN | |
| KR101251992B1 (en) | Quality of service provisioning using periodic channel time allocation | |
| CN104994583A (en) | Multi-channel MAC protocol method based on cluster mechanism in vehicular Ad hoc network | |
| CN102695287A (en) | VANET (vehicular ad-hoc network) media access control method | |
| US11122624B2 (en) | Pre-packet arrival channel contention | |
| KR101122616B1 (en) | Method to improve throughput and power consumption efficiency in wireless communication systems | |
| WO2015081718A1 (en) | Communication processing method and apparatus for wireless network | |
| CN106936557B (en) | Wireless channel resource allocation method | |
| Abdalla et al. | Space-orthogonal frequency-time medium access control (SOFT MAC) for VANET | |
| Zhu et al. | Enhanced MAC protocol to support multimedia traffic in cognitive wireless mesh networks | |
| CN106879031A (en) | A kind of channel wireless radio multi Mesh network resource negotiation method based on double receipts single-shots | |
| CN116033485B (en) | Communication method of wireless networking and wireless ad hoc network system | |
| Yang et al. | Performance analysis of multi-channel MAC with single transceiver for the next generation WLAN | |
| Bi et al. | Medium access control for QoS provisioning in vehicle-to-infrastructure communication networks | |
| CN106912110B (en) | Single-transmission multi-receiving air interface resource allocation method | |
| US20220295546A1 (en) | Method and device for transmitting frame through extended channel in broadband wireless communication network | |
| CN107819555B (en) | Optimized wireless channel negotiation method | |
| Li et al. | MAC-SCC: a medium access control protocol with separate control channel for reconfigurable multi-hop wireless networks | |
| CN110856141A (en) | Reliable and effective vehicle-mounted self-organizing network multi-channel MAC protocol | |
| Kumar | A comprehensive analysis of MAC protocols for Manet | |
| WO2015062270A1 (en) | Wireless communications method and wireless communications device | |
| Ali et al. | An RSU controlled IEEE 802.11 ac based MAC protocol for multi-vehicle uplink transmission in VANET |
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: 20200403 |
|
| PD01 | Discharge of preservation of patent | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20240119 Granted publication date: 20200403 |