CN106912110B - Single-transmission multi-receiving air interface resource allocation method - Google Patents
Single-transmission multi-receiving air interface resource allocation method Download PDFInfo
- Publication number
- CN106912110B CN106912110B CN201710177932.7A CN201710177932A CN106912110B CN 106912110 B CN106912110 B CN 106912110B CN 201710177932 A CN201710177932 A CN 201710177932A CN 106912110 B CN106912110 B CN 106912110B
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- time slot
- data
- control 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 70
- 238000013468 resource allocation Methods 0.000 title claims abstract description 17
- 230000005540 biological transmission Effects 0.000 claims abstract description 31
- 230000008569 process Effects 0.000 claims abstract description 28
- 230000002860 competitive effect Effects 0.000 claims abstract description 10
- 238000013507 mapping Methods 0.000 claims description 7
- 230000004044 response Effects 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 abstract description 3
- 238000004891 communication Methods 0.000 description 11
- 238000002955 isolation Methods 0.000 description 4
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 239000013598 vector Substances 0.000 description 3
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 2
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 108700026140 MAC combination Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- 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
Abstract
The invention discloses a single-transmission multi-reception air interface resource allocation method, which comprises a control channel allocation process and a data channel allocation process, wherein: control channel allocation procedure: dividing a control channel into a reserved time slot and a competitive time slot in a time domain, and if a node needs to use the control channel at a certain moment, if the node finds that the reserved time slot available for the node is available, directly using the reserved time slot; if no reserved time slot available for the node is found, competing with other nodes for using a competition time slot; data channel allocation procedure: the control channel is used to negotiate out the data channels that can be used. The invention realizes the parallel transmission of the node data by using a multi-channel mode, thereby effectively improving the network capacity; by adopting a multi-channel frequency division multiplexing technology, the mutual interference of neighbor nodes is effectively reduced, and the wireless transmission efficiency is improved; and a TDMA mixed channel access mode is adopted, so that the collision probability of data grouping is effectively reduced, and the efficient transmission of the grouping is realized.
Description
Technical Field
The invention relates to the field of wireless communication, in particular to a single-transmission multi-reception air interface resource allocation 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 lower layer protocol stack of the 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 network layer is responsible for routing maintenance and packet forwarding of nodes, and the physical layer realizes receiving and transmitting of air interface data. The MAC layer is responsible for the allocation of air interface resources, including channel resources and time slot resources. The protocol of the MAC layer directly affects performance indexes such as delay, throughput, channel utilization rate, and the like of the network, so that designing an efficient and reliable MAC protocol is very important to the overall performance of the network.
Currently, the MAC layer protocol mainly has the following classification modes:
1) based on the number of logical channels that the system can use simultaneously, it is divided into single channel and multi-channel protocols.
2) Based on the number of transceiving channels adopted by the communication node, the communication node is divided into a single channel (only one transceiving channel) or a multi-channel protocol (having a plurality of transceiving channels).
3) Based on the scheduling mode, the method is divided into a centralized scheduling mode and a distributed scheduling mode.
4) Based on the channel access mode, the method is divided into a random contention mode, a fixed allocation mode and a mixed mode.
Most of the existing wireless communication nodes are limited by the number of antennas, the sending capacity and the cost, and the network capacity is limited by adopting a single-channel-based mode. With the development of the intelligent antenna technology, the multi-transmission and multi-reception multi-channel mode has great improvement on the network capacity and the communication quality. In the aspect of node-to-resource scheduling, distributed scheduling is suitable for a scene that the node scale is larger and the communication between nodes is more flexible compared with centralized scheduling. In a channel access mode, a contention mechanism adopts a traditional carrier monitoring mode, data packets are easy to generate large collision conflicts, node fairness is not considered enough, a large number of idle monitoring and retransmission mechanisms cause node power consumption to be increased, and communication efficiency is reduced. The allocation-based mode reduces unnecessary interception and conflict in consideration of fairness of resource use, but resource allocation is complex and network synchronization maintenance is difficult.
There are some CSMA-based distributed multi-channel MAC layer resource allocation protocols, such as McMAC, MMAC, etc. The protocol channel allocation modes respectively adopt a parallel frequency hopping mode and a staged frequency hopping mode, and the channel access modes all adopt a CSMA mechanism.
The implementation mode of the McMAC protocol is as follows: the time is divided into small segments and large segments, the small segments are used for detecting idle channels, the large segments are responsible for data transmission, and the boundaries of the large segments carry out frequency hopping. And all the nodes use the same random number generator to calculate the frequency point of the next frequency hopping according to the physical address and the local clock of the nodes. If the node knows the physical addresses and clocks of the surrounding nodes, the frequency point of the next frequency hopping can be obtained. When the frequency points are consistent, the contention transmission of data can be carried out. Therefore, the McMAC protocol determines the frequency of the data channel by using a parallel frequency hopping method, but the McMAC protocol needs to know the physical addresses and clocks of the neighboring nodes at any time and must continuously transmit and receive broadcast messages. Too many broadcast messages occupy more air interface resources, and when the network environment is complex, the node is difficult to accurately acquire the state of the neighbor node.
The MMAC protocol implementation mode is as follows: and using the dedicated control channel to negotiate and determine the frequency point of the data channel. The source node sends ATIM data packet to the destination node, the destination node responds ATIM-ACK message according to the self channel use condition after receiving the ATIM data packet, and finally the source node sends ATIM-RES to the destination node. The MMAC protocol has a PCL (preferred channel list), and the PCL of each node records the use of the channel in the neighbor range and divides the channel into three states: high priority, medium priority and low priority. All the neighbor nodes can receive the negotiation messages in the negotiation process, and update the local PCL according to the messages. And then the source end node and the destination node use a data channel with small service load to perform data competition transmission according to the PCL of the source end node and the destination node. Therefore, the MMAC protocol adopts a special control channel to negotiate, negotiate and update PCL, and the channel load is balanced by selecting a channel with small traffic, so that the bandwidth resource waste caused by competition and avoidance is reduced. But inevitably, the access mode of CSMA is still used in data transmission, and data information has collision and collision, which causes the reduction of network throughput.
There are also TDMA-based MAC layer resource allocation protocols in the prior art, such as the TMMAC protocol. The TMMAC protocol is similar to the MMAC protocol and also adopts a phased frequency hopping mode, and in order to solve the problem of information competition collision on a data channel, a TDMA channel access mode is adopted. The time on the data channel is divided into individual time slots. Before data communication between nodes, frequency points and time slots used for transmission need to be negotiated, so that collision of service data information is avoided. The TMMAC protocol sets the available channels and available time slots of a node to a bit vector, where the channels maintained in the PCL are no longer available, but bit vectors. The nodes determine the optimal communication specific frequency point and time slot by exchanging bit vector information on the control channel. It can be seen that the TMMAC protocol divides the data channels using TDMA scheme, and implements collision-free transmission in traffic data transmission. However, if the network environment is complex and the number of nodes is large, collision of control information is easily caused, and if the control channel is interfered, the performance of the whole network is affected.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to provide a single-transmission multi-reception air interface resource allocation method which can solve the defects in the prior art.
The technical scheme is as follows: the single-transmission multi-receiving air interface resource allocation method comprises a control channel allocation process and a data channel allocation process, wherein:
control channel allocation procedure: dividing a control channel into a reserved time slot and a competitive time slot in a time domain, and if a node needs to use the control channel at a certain moment, if the node finds that the reserved time slot available for the node is available, directly using the reserved time slot; if no reserved time slot available for the node is found, competing with other nodes for using a competition time slot;
data channel allocation procedure: the control channel is used to negotiate out the data channels that can be used.
Further, in the process of allocating the control channel, the method for the node to compete with other nodes for using the contention slot includes: the node contends for available contention slots according to contention probability: if the contention is successful, using the contention slot; otherwise, the contention probability is updated and the next available contention slot is selected for contention.
Further, the contention probability is determined by the service priority, the number of nodes supported by the system, and the number of neighbor nodes of the node.
Further, if the contention is unsuccessful, the contention probability is reduced by half and the next available contention slot is selected for contention.
Further, in the process of allocating the control channel, the method for the node to compete with other nodes for using the contention slot includes the following steps:
s1.1: the node selects a countdown window, randomly selects a value in the countdown window as the countdown time, wherein the countdown time is the maximum number of time slots which can be skipped by the node in the countdown process;
s2.1: the node skips the competition time slots one by one according to the count-down time, if the node finds the available reserved time slot in the skipping process, the node stops the count-down time and directly uses the reserved time slot; if the node skips all the skippable time slots according to the countdown number and does not find available reserved time slots, the node uses the currently available competitive time slots for negotiation, if the negotiation fails, the size of the countdown window is adjusted, and then the negotiation is carried out again until the negotiation is successful.
Further, in step S2.1, the size of the countdown window is adjusted to double the countdown window.
Further, the reserved time slot is obtained by allocating an available fixed time slot to the corresponding node, and the available fixed time slot is allocated to the corresponding node by equation (1):
F(x,y)＝(x+y)％K (1)
in the formula (1), F (x, y) is the number of the node to which the fixed timeslot is allocated, x is the number of the fixed timeslot, y is the fixed timeslot mapping period or 0, the fixed timeslot mapping period is a value obtained by dividing x by K, and K is the total number of nodes.
Further, the data channel allocation procedure includes the steps of:
s1.2: after selecting a control channel and a corresponding time slot through a control channel allocation process, a sending node switches the sending channel of the sending node to the selected control channel and sends RTS information on the corresponding time slot; the RTS information at least carries a sending node identifier, a receiving node identifier, the length of data requested to be sent and selected data channel information;
s2.2: if the receiving node receives the RTS information, switching a sending channel of the receiving node to a control channel selected by the sending node, and then sending CTS information to the sending node; the CTS information at least carries a sending node identification, a receiving node identification, a data length allowed to be sent and confirmed data channel information;
s3.2: the receiving node switches its transmitting channel and a receiving channel to the selected data channel;
s4.2: after receiving the CTS information, the sending node switches a sending channel and a receiving channel thereof to a selected data channel for data transmission; if the sending node does not successfully receive the CTS information, the control channel and the time slot are replaced, and then the step S1.2 is returned;
s5.2: after receiving the data, the receiving node sends ACK information to the sending node on the selected data channel; the ACK information at least carries the data correctness, the received response and the channel quality information of the transmission;
s6.2: after the sending node receives the ACK information, if the data transmitted this time is found to be correctly received, the transmission is completed; otherwise, the data channel is reselected and the process returns to step S1.2.
Has the advantages that: compared with the prior art, the invention has the following beneficial effects:
(1) the invention realizes the parallel transmission of the node data by using a multi-channel mode, thereby effectively improving the network capacity;
(2) the invention adopts the multi-channel frequency division multiplexing technology, effectively reduces the mutual interference of the neighbor nodes and improves the wireless transmission efficiency;
(3) the invention adopts a TDMA mixed channel access mode, effectively reduces the collision probability of data packets and realizes the efficient transmission of the packets.
Drawings
FIG. 1 is a topology model of 8 nodes according to an embodiment of the present invention;
FIG. 2 is a diagram of time domain isolation scheme control channel allocation for 8 nodes in accordance with an embodiment of the present invention;
FIG. 3 is a diagram of a time domain overlapping scheme control channel allocation for 8 nodes according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating the occupation of time-frequency resources by nodes in a final system according to an embodiment of the present invention;
fig. 5 shows the occupation of time-frequency resources by nodes in another final system according to another 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 specific embodiment discloses a single-transmission multi-reception air interface resource allocation method, which comprises a control channel allocation process and a data channel allocation process, wherein:
control channel allocation procedure: dividing a control channel into a reserved time slot and a competition time slot in a time domain, wherein the length of the reserved time slot and the length of the competition time slot both meet the requirement of completing at least one complete data channel allocation negotiation process; at a certain moment, if a node needs to use a control channel, if the node discovers that a reserved time slot available for the node exists, the node directly uses the reserved time slot; if no reserved time slot available for the node is found, competing with other nodes for using a competition time slot;
data channel allocation procedure: the control channel is used to negotiate out the data channels that can be used.
In the process of allocating the control channel, two methods for the node to compete with other nodes to use the competitive time slot are provided, wherein the first method is a competitive method based on probability, and the second method is a competitive method based on a countdown window.
The competition method based on the probability comprises the following steps: the node contends for available contention slots according to contention probability: if the contention is successful, using the contention slot; otherwise, the contention probability is reduced by half and the next available contention slot is selected for contention. The contention probability is determined by the service priority, the number of nodes supported by the system, and the number of neighbor nodes of the node. The contention probability ranges between Pmin and Pmax, which are determined by the configuration, and the equal probability is characterized when Pmin is Pmax. The initial probability of the node is Pmax.
The competition method based on the countdown window comprises the following steps:
s1.1: the node selects a countdown window, randomly selects a value in the countdown window as the countdown time, wherein the countdown time is the maximum number of time slots which can be skipped by the node in the countdown process;
s2.1: the node skips the competition time slots one by one according to the count-down time, if the node finds the available reserved time slot in the skipping process, the node stops the count-down time and directly uses the reserved time slot; if the node skips all the skippable time slots according to the countdown number and does not find available reserved time slots, the node uses the currently available contention time slot to carry out negotiation, if the negotiation fails, the countdown window is expanded by one time, and then the negotiation is carried out again until the negotiation is successful. The variation range of the countdown window is between CWmin and CWMax, and after one successful negotiation, the countdown window is recovered to CWin; the values of CWmin and CWMax are generated by the configuration, indicating that the countdown window does not change when CWmin equals CWMax. The initial value of the countdown window is CWmin.
Wherein the reserved time slot is obtained by allocating an available fixed time slot to the corresponding node, and the available fixed time slot is allocated to the corresponding node by equation (1):
F(x,y)＝(x+y)％K (1)
in the formula (1), F (x, y) is the number of the node to which the fixed timeslot is allocated, x is the number of the fixed timeslot, y is the fixed timeslot mapping period or 0, the fixed timeslot mapping period is a value obtained by dividing x by K, and K is the total number of nodes.
The data channel allocation procedure includes the steps of:
s1.2: after selecting a control channel and a corresponding time slot through a control channel allocation process, a sending node switches the sending channel of the sending node to the selected control channel and sends RTS information on the corresponding time slot; the RTS information at least carries a sending node identifier, a receiving node identifier, the length of data requested to be sent and selected data channel information;
s2.2: if the receiving node receives the RTS information, switching a sending channel of the receiving node to a control channel selected by the sending node, and then sending CTS information to the sending node; the CTS information at least carries a sending node identification, a receiving node identification, a data length allowed to be sent and confirmed data channel information;
s3.2: the receiving node switches its transmitting channel and a receiving channel to the selected data channel;
s4.2: after receiving the CTS information, the sending node switches a sending channel and a receiving channel thereof to a selected data channel for data transmission; if the sending node does not successfully receive the CTS information, the control channel and the time slot are replaced, and then the step S1.2 is returned;
s5.2: after receiving the data, the receiving node sends ACK information to the sending node on the selected data channel; the ACK information at least carries the data correctness, the received response and the channel quality information of the transmission;
s6.2: after the sending node receives the ACK information, if the data transmitted this time is found to be correctly received, the transmission is completed; otherwise, the data channel is reselected and the process returns to step S1.2.
In this embodiment, there is a default assumption that the number of control channels is less than or equal to the number of data channels, and the number of control channels is less than or equal to the number of receiving channels. When the number of control channels is greater than one-half of the number of system nodes, the advantages of multiple control channels are not apparent. Therefore, the following rules should be satisfied among the number of channels, the number of channels and the number of nodes in the system:
1) the control channel number W satisfies formula (2):
W＝MIN(Roundown(M/2),Roundown(K/2)) (2)
in the formula (2), M is the total number of channels, and N is the total number of receiving channels;
2) the total number of required receiving channels N' satisfies formula (3):
N’＝MIN((N-1),W)+1 (3)
3) the number of data channels is (M-W)
From the above constraints, it can be seen that when the number of available channels is less than 2 × N-1 or the number of nodes in the system is less than 2 × N-1, N '< N, i.e. the number of required receiving channels is less than the number of actually provided receiving channels, and in this case, as long as N-N' receiving channels are closed, the above-described scheme of the present embodiment can be fully applied without modification in principle.
In fig. 1, the total number of nodes K is 8, the total number of receiving channels N is 4, and the total number of channels M is 6. The specific allocation scheme of the control channel reserved time slot may adopt a time domain isolation scheme, as shown in fig. 2. The number of data channels, M-N + 1-3, is denoted by FD1-FD3, respectively. The receive channels Rx1-Rx3 are selected for receiving the control channels FC1-FC 3. The receive channel Rx4 switches between the data channels FD1-FD3 based on the negotiation results.
Assuming that at the t0 slot boundary, node 1 has data to send to node 0, the control channel allocation process is: node 1 inquires to t0 according to fig. 2 that the slot control channel FC2 reserves the slot for itself. The data channel allocation procedure includes the steps of:
s1.21: then node 1 switches the transmission channel Tx to the control channel FC2 and then sends RTS information to node 0; RTS information at least carries the identifier of the node 1, the identifier of the node 0, the selected data channel number FD1 and the occupied time length of 10 ms;
s2.21: if the node 0 receives RTS information, the transmitting channel Tx of the node 0 is switched to a control channel FC2, and then CTS information is transmitted to the node 1; the CTS information at least carries the identifier of the node 1, the identifier of the node 0, the confirmed data channel number FD1 and the occupied time length of 10 ms;
s3.21: node 0 switches its transmit Tx and receive Rx channels 4 to the data channel FD 1;
s4.21: after receiving the CTS information, the node 1 switches its transmit channel Rx4 and receive channel Tx to the data channel FD1 for data transmission; if the node 1 does not successfully receive the CTS information, the control channel and the time slot are replaced, and then the step S1.21 is returned;
s5.21: after receiving the data, the node 0 sends ACK information to the node 1 on a data channel FD1, otherwise, sends NACK information; the ACK information at least carries the data correctness, the received response and the channel quality information of the transmission;
s6.21: after the node 1 receives the ACK information, if the data transmitted this time is found to be correctly received, the transmission is completed; after receiving the NACK message, the node 1 reselects the data channel and returns to step S1.21.
Assuming that at the t1 slot boundary, node 1 has data to send to node 0, the control channel allocation process is: if the node is configured to be in the probability mode, the node 1 respectively performs transmission attempts at FC1/FC2/FC3 of the t1 time slot according to the transmission probability of the node 1, if the transmission probability of the node 1 is greater than a transmission threshold, the competition time slot is successful, and if not, the node enters the next resource for competition; if the node is configured in the countdown window mode, the node 1 randomly generates a countdown, and if the countdown window mode is 2, the node 1 selects the FC2 of the t1 time slot for transmission; if the countdown is 4, the node 1 selects FC1 of the t3 slot to transmit; if the countdown is 7, node 1 transmits using the control channel resources reserved for itself at time t 4. The data channel allocation process is the same as that described above, and will not be described herein.
In addition, the specific allocation scheme of the control channel reserved time slot may also adopt a time domain isolation scheme, as shown in fig. 3.
Assume that at the t0 slot boundary, node 1 has data intended for node 0. Since there is a reserved slot allocated to node 1 at time t0, node 1 can directly use the t0/FC3 resource.
Assume that at the t1 slot boundary, node 1 has data intended for node 0. Because there is no reserved slot for node 1 from the t1 slot to the t4 slot, node 1 needs to contend for the slot in the following order: t1/FC1, t1/FC3, t2/FC2, t3/FC1, t3/FC3, t4/FC 2; the other processing is the same as the time domain isolation scheme.
Fig. 4 and 5 show the occupation of time-frequency resources by nodes in two final systems, where the value of y is calculated according to the fixed time slot mapping period. In the figure, a- > b in the control time slot represents that the node a initiates resource negotiation to the node b, and a- > b in the data time slot represents that the node a sends data to the node b and the node b replies to the node a.
Claims (7)
1. A single-transmission multi-receiving air interface resource allocation method is characterized in that: comprising a control channel allocation procedure and a data channel allocation procedure, wherein:
control channel allocation procedure: dividing a control channel into a reserved time slot and a competitive time slot in a time domain, and if a node needs to use the control channel at a certain moment, if the node finds that the reserved time slot available for the node is available, directly using the reserved time slot; if no reserved time slot available for the node is found, competing with other nodes for using a competition time slot;
data channel allocation procedure: negotiating out a data channel which can be used by using a control channel;
in the process of allocating the control channel, the method for the node to compete with other nodes for using the competitive time slot comprises the following steps:
s1.1: the node selects a countdown window, randomly selects a value in the countdown window as the countdown time, wherein the countdown time is the maximum number of time slots which can be skipped by the node in the countdown process;
s2.1: the node skips the competition time slots one by one according to the count-down time, if the node finds the available reserved time slot in the skipping process, the node stops the count-down time and directly uses the reserved time slot; if the node skips all the skippable time slots according to the countdown number and does not find available reserved time slots, the node uses the currently available competitive time slots for negotiation, if the negotiation fails, the size of the countdown window is adjusted, and then the negotiation is carried out again until the negotiation is successful.
2. The single-transmission multi-reception air interface resource allocation method according to claim 1, characterized in that: in the process of allocating the control channel, the method for the node to compete with other nodes for using the competitive time slot comprises the following steps: the node contends for available contention slots according to contention probability: if the contention is successful, using the contention slot; otherwise, the contention probability is updated and the next available contention slot is selected for contention.
3. The single-transmission multi-reception air interface resource allocation method according to claim 2, characterized in that: the contention probability is determined by the service priority, the number of nodes supported by the system, and the number of neighbor nodes of the node.
4. The single-transmission multi-reception air interface resource allocation method according to claim 2, characterized in that: if the contention is unsuccessful, the contention probability is reduced by half and the next available contention slot is selected for contention.
5. The single-transmission multi-reception air interface resource allocation method according to claim 1, characterized in that: in step S2.1, the size of the countdown window is adjusted to double the countdown window.
6. The single-transmission multi-reception air interface resource allocation method according to claim 1, characterized in that: the reserved time slots are obtained by allocating available fixed time slots to the corresponding nodes, and the available fixed time slots are allocated to the corresponding nodes by the following formula (1):
F(x,y)＝(x+y)％K (1)
in the formula (1), F (x, y) is the number of the node to which the fixed timeslot is allocated, x is the number of the fixed timeslot, y is the fixed timeslot mapping period or 0, the fixed timeslot mapping period is a value obtained by dividing x by K, and K is the total number of nodes.
7. The single-transmission multi-reception air interface resource allocation method according to claim 1, characterized in that: the data channel allocation procedure comprises the steps of:
s1.2: after selecting a control channel and a corresponding time slot through a control channel allocation process, a sending node switches the sending channel of the sending node to the selected control channel and sends RTS information on the corresponding time slot; the RTS information at least carries a sending node identifier, a receiving node identifier, the length of data requested to be sent and selected data channel information;
s2.2: if the receiving node receives the RTS information, switching a sending channel of the receiving node to a control channel selected by the sending node, and then sending CTS information to the sending node; the CTS information at least carries a sending node identification, a receiving node identification, a data length allowed to be sent and confirmed data channel information;
s3.2: the receiving node switches its transmitting channel and a receiving channel to the selected data channel;
s4.2: after receiving the CTS information, the sending node switches a sending channel and a receiving channel thereof to a selected data channel for data transmission; if the sending node does not successfully receive the CTS information, the control channel and the time slot are replaced, and then the step S1.2 is returned;
s5.2: after receiving the data, the receiving node sends ACK information to the sending node on the selected data channel; the ACK information at least carries the data correctness, the received response and the channel quality information of the transmission;
s6.2: after the sending node receives the ACK information, if the data transmitted this time is found to be correctly received, the transmission is completed; otherwise, the data channel is reselected and the process returns to step S1.2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710177932.7A CN106912110B (en) | 2017-03-23 | 2017-03-23 | Single-transmission multi-receiving air interface resource allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710177932.7A CN106912110B (en) | 2017-03-23 | 2017-03-23 | Single-transmission multi-receiving air interface resource allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106912110A CN106912110A (en) | 2017-06-30 |
| CN106912110B true CN106912110B (en) | 2020-02-18 |
Family
ID=59194558
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710177932.7A Active CN106912110B (en) | 2017-03-23 | 2017-03-23 | Single-transmission multi-receiving air interface resource allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106912110B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113518321B (en) * | 2020-04-09 | 2022-10-25 | 北京紫光展锐通信技术有限公司 | Resource selection method and device for auxiliary link, storage medium and terminal |
| CN115348672B (en) * | 2022-10-20 | 2023-03-24 | 中国人民解放军国防科技大学 | Communication method, communication device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101772092A (en) * | 2009-01-06 | 2010-07-07 | 大唐移动通信设备有限公司 | Method and apparatus for dynamic assignment of reserved resources of uplink control channel |
| CN102695265A (en) * | 2012-01-09 | 2012-09-26 | 河南科技大学 | Hybrid mechanism media access control (MAC) protocol communication method based on wireless sensor network |
| CN103747006A (en) * | 2014-01-20 | 2014-04-23 | 沈阳化工大学 | Medium access control method of wireless control network |
| CN105873130A (en) * | 2016-05-30 | 2016-08-17 | 电子科技大学 | Time slot competition method for multi-hop self-organizing network |
| CN105873170A (en) * | 2016-04-15 | 2016-08-17 | 北京航空航天大学 | Multichannel medium access control method of cognitive radio mobile self-organized network |
-
2017
- 2017-03-23 CN CN201710177932.7A patent/CN106912110B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101772092A (en) * | 2009-01-06 | 2010-07-07 | 大唐移动通信设备有限公司 | Method and apparatus for dynamic assignment of reserved resources of uplink control channel |
| CN102695265A (en) * | 2012-01-09 | 2012-09-26 | 河南科技大学 | Hybrid mechanism media access control (MAC) protocol communication method based on wireless sensor network |
| CN103747006A (en) * | 2014-01-20 | 2014-04-23 | 沈阳化工大学 | Medium access control method of wireless control network |
| CN105873170A (en) * | 2016-04-15 | 2016-08-17 | 北京航空航天大学 | Multichannel medium access control method of cognitive radio mobile self-organized network |
| CN105873130A (en) * | 2016-05-30 | 2016-08-17 | 电子科技大学 | Time slot competition method for multi-hop self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106912110A (en) | 2017-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4806721B2 (en) | Distributed wireless media access control protocol for ad hoc networks | |
| EP2232938B1 (en) | Flexible mac superframe structure and beaconing method | |
| US9351301B2 (en) | Maintenance of time slot usage indicators and self-organizing networking | |
| JP5136590B2 (en) | Wireless communication system, wireless communication apparatus, wireless communication method, and computer program | |
| Bilstrup et al. | Scalability issues of the MAC methods STDMA and CSMA of IEEE 802.11 p when used in VANETs | |
| US7535919B2 (en) | Wireless communication method adapting priority for transmitting packets in WPAN | |
| Huang et al. | RC-MAC: A receiver-centric MAC protocol for event-driven wireless sensor networks | |
| US10932281B2 (en) | Dynamic scheduling method for guaranteeing quality of service depending on network transmission traffic in large-scale IOT environment and system using the same | |
| Dibaei et al. | Full-duplex medium access control protocols in wireless networks: A survey | |
| CN102104875B (en) | A kind of Novel cognitive radio multi-channel MAC protocol method | |
| KR20040082588A (en) | MAC protocol layer module of mobile terminal in MANET and method for transmitting/receiving frame thereof | |
| CN102695287A (en) | VANET (vehicular ad-hoc network) media access control method | |
| EP2545728B1 (en) | Radio communication device and radio communication method | |
| CN106912110B (en) | Single-transmission multi-receiving air interface resource allocation method | |
| Li et al. | MAC-SCC: Medium access control with a separate control channel for multihop wireless networks | |
| CN106936557B (en) | Wireless channel resource allocation method | |
| JP4222143B2 (en) | Wireless communication system, wireless communication apparatus, wireless communication method, and computer program | |
| KR102467945B1 (en) | Method and apparatus for TDMA(time division multiple access) resource scheduling in wireless network | |
| JP4333346B2 (en) | Wireless communication system, wireless communication apparatus, wireless communication method, and computer program | |
| Ouladdjedid et al. | CSSA MAC: carrier sense with slotted-Aloha multiple access MAC in vehicular network | |
| Li et al. | Dynamic TDMA Slot Assignment Protocol for ulti op oc etworks | |
| Zhao et al. | Offloading channel allocation to terminals in high-density IoTs for next generation networks | |
| Chen | Reliable transmission strategy based on channel access in WSN | |
| Xiuxian et al. | CTDMA: Color-aware TDMA Network System For Low latency and High Throughput in Dense D2D Wireless Network | |
| Royo et al. | Enhancing collision resolution for large-scale IEEE 802.15. 4 networks |
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 |
Effective date of registration: 20230905 Granted publication date: 20200218 |
|
| PP01 | Preservation of patent right | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20240119 Granted publication date: 20200218 |
|
| PD01 | Discharge of preservation of patent |