CN116133152A - Multi-dimensional channel access method and device for high-speed carrier ad hoc network data link - Google Patents
Multi-dimensional channel access method and device for high-speed carrier ad hoc network data link Download PDFInfo
- Publication number
- CN116133152A CN116133152A CN202211613488.6A CN202211613488A CN116133152A CN 116133152 A CN116133152 A CN 116133152A CN 202211613488 A CN202211613488 A CN 202211613488A CN 116133152 A CN116133152 A CN 116133152A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- data
- stage
- time slot
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 230000005540 biological transmission Effects 0.000 claims abstract description 41
- 230000004044 response Effects 0.000 claims abstract description 36
- 230000008569 process Effects 0.000 claims abstract description 8
- 238000012544 monitoring process Methods 0.000 claims abstract description 5
- 230000007246 mechanism Effects 0.000 claims description 12
- 238000013468 resource allocation Methods 0.000 claims description 10
- 230000008859 change Effects 0.000 claims description 5
- 230000003111 delayed effect Effects 0.000 claims description 3
- 108091006146 Channels Proteins 0.000 abstract description 58
- 238000004891 communication Methods 0.000 abstract description 17
- 230000003993 interaction Effects 0.000 abstract description 6
- 230000011664 signaling Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 7
- 238000013461 design Methods 0.000 description 6
- 238000005562 fading Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 108700026140 MAC combination Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 239000004927 clay Substances 0.000 description 1
- 230000001010 compromised effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000000670 limiting effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000002829 reductive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
-
- 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
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a method and a device for accessing a multidimensional channel of a data link of a high-speed carrier ad hoc network, which relate to the field of communication networks. Comprises the following three stages: a stage of reserving information; a Response stage, wherein information is collected; and a Data stage, transmitting Data. The access method comprises the following steps: s1, initializing all nodes, monitoring a network and completing network synchronization operation; s2, detecting the state of the network, responding according to different states, and transmitting data; and S3, after the data transmission stage is finished, the network enters a Claim stage of the next time frame, and the process goes to S2. The invention solves the problems of low communication efficiency and poor concealment of control channel signaling interaction in the single-channel transmission mode. Based on the method, the channel utilization efficiency and the robustness of the high-speed carrier ad hoc network under the complex electromagnetic environment condition can be obviously improved, and the method is suitable for the self-adaptive channel access of the high-speed carrier data link network.
Description
Technical Field
The invention relates to the field of communication networks, in particular to a method and a device for accessing a multidimensional channel of a data link of a high-speed carrier ad hoc network.
Background
TDMA is an acronym for Time Division Multiple Access time division multiple access, which divides time into periodic frames (frames), each Frame is subdivided into a number of time slots, and signals are transmitted to a central station, and under the condition that timing and synchronization are satisfied, the central station can receive signals of mobile terminals in each time slot respectively without scrambling. Meanwhile, signals sent to a plurality of mobile terminals by the central station are sequentially arranged to be transmitted in specific time slots, and each mobile terminal can distinguish and receive signals sent to the mobile terminal from the combined signals only by receiving the signals in the designated time slots. TDMA has advantages over FDMA such as high quality of communication signals, better security, and greater system capacity, but it must have accurate timing and synchronization to ensure proper communication between the mobile terminal and the central station, which is technically complex.
TDMA access modes can be classified into static access modes and dynamic access modes according to habits. The static access mode allocates the fixed time slot number and the time slot block position of each station according to the station functions and the number in the network scene. The dynamic access mode refers to a mode for dynamically adjusting the time slot allocation condition in the network operation process, and is more complex. TDMA control protocol allows for a pre-allocation of time slots with a fixed number of stations and achieves a good transmission rate without change.
TDMA channel access protocols can be divided into single channel, dual channel and multi-channel protocols. In a single channel protocol, all signals are transmitted on the same channel. In order to reduce collisions, the channel may be divided into a control channel and a data channel, the control signal and the data signal being transmitted separately, avoiding collisions of the data signal and the control signal.
However, the single-channel transmission mode has the defects of low communication efficiency, frequent control channel signaling interaction, poor concealment and the like, so that the single-channel transmission mode is not suitable for a complex electromagnetic environment countermeasure scene of a front line high-speed carrier ad hoc network, and is more suitable for civil and rear transmission.
Disclosure of Invention
The invention aims to: a method and a device for accessing a multidimensional channel of a data link of a high-speed carrier ad hoc network are provided to solve the problems in the prior art.
The technical scheme of the invention is realized as follows:
in a first aspect, a method for accessing a multidimensional channel of a data link of a high-speed carrier ad hoc network is provided, and the method comprises the following three stages:
a stage of Claim, reservation information:
when a certain preset node needs To Send information on a reserved channel, sending an RTS (Request To Send abbreviated) packet in a corresponding micro time slot of a Claim subframe, wherein the Request quantity and the emergency degree are indicated in the packet, and the node sending the RTS packet is an active node at the moment; the other nodes are in a interception state;
after one round of interception of time slots 1 to n, confirming the position of an active node in a one-hop range and request information thereof;
the Response phase, collecting information:
in the Response subframe, each node gathers, classifies and intercepts all request information within a one-hop range heard in the stage of Claim, and operates an allocation algorithm to calculate a usable time slot number; if a node is an active node, after the Response phase, if the node competes for a data time slot, the node immediately sends data in the next data time slot;
data stage, transmitting Data:
each active node sends information in sequence in a time slot marked as "Send", receives information in other time slots, and the inactive node is in a state of receiving information or an idle state in a data time slot stage; the next frame begins and each node in the network again repeats the algorithm starting from the Claim stage.
In a further embodiment of the first aspect, a method for accessing a multidimensional channel of a data link of a high-speed carrier ad hoc network is further provided, including the following steps:
s1, initializing all nodes, monitoring a network and completing network synchronization operation;
s2, detecting the state of the network, responding according to different states, and transmitting data;
and S3, after the data transmission stage is finished, the network enters a Claim stage of the next time frame, and the process goes to S2.
In a further embodiment of the first aspect, before performing the multi-dimensional channel access method, checking a slot allocation constraint scenario, the slot allocation constraint scenario comprising at least the following definitions:
a. the high-speed carrier self-organizing network has no control center in the MAC layer, and adopts a distributed resource allocation mode;
b. all nodes of the network are provided with a transmitter and a plurality of receivers, can be switched and operated on a plurality of independent sub-frequencies, and the high-speed carrier transceiver is provided with a frequency hopping/time hopping function;
c. each upper layer packet may be mapped to a certain priority of the MAC layer.
In a further embodiment of the first aspect, the slot allocation constraint scenario further comprises the following definition:
d. abstracting the time frame structure into a Claim stage, a Response stage and a Data stage;
wherein the Claim stage and the Response stage are used as the leading stage of the time frame structure; the Data phase serves as a Data slot of the time frame structure.
In a further embodiment of the first aspect, the request preamble is used for a node in the network to send an RTS request according to the state of its own packet buffer queue;
the response preamble is used for each node to calculate the available time slot according to the collected information operation allocation algorithm;
the data time slot is used for the node to send the packet according to the allocation result.
The request preamble is divided into N sub time slots, the number from 1 to N is respectively corresponding to the nodes from 1 to N, and the node with the X number is called as a main node of the data time slot with the X number, and the data time slot with the X number is called as a main time slot of the node with the X number; where N is the total number of nodes.
In a further embodiment of the first aspect, the responding according to the different states in S2 includes:
a) If the network state is the Claim stage of the time frame, each node sends an RTS packet in the corresponding micro time slot of the node according to the request condition of the buffer area of the node, and receives other node information in other micro time slots;
b) If the network state is the Response stage of the time frame, each node gathers, classifies and intercepts all the collected request information within a one-hop range, and calculates the usable time slot number;
c) If the network state is the Data phase of the time frame, each node can send Data in its own available time slot, and other time slots receive information or sleep.
In a further embodiment of the first aspect, the method further comprises a multi-channel slot reclamation mechanism, the multi-channel slot reclamation mechanism comprising:
introducing a time slot recoverable mark bit, and when the node actively leaves the network, marking the time slot recoverable mark position 1; when the node is passively disconnected, a delay mechanism is started, the delay is delayed for a preset time Td, and if the node is not recovered yet, a time slot recoverable mark position 1 is obtained;
when the current traffic of the node has ended or is a state change, the time slots that are no longer used are released.
In a further embodiment of the first aspect, for the case that the service such as unexpected exit of the node is suddenly interrupted, if the one-hop neighbor node does not receive the message sent by the node within a predetermined length of time, it is assumed that the node exits the system, new time slot allocation information after the time slot release of the node is sent out, and meanwhile, the time slot allocation information sent by other nodes is synthesized to perform final judgment;
if all the neighboring nodes assume that the node exits the system, the node is considered to have exited the system, so that the time slot of the node is released and the node is re-participated in the allocation; otherwise, updating is carried out according to the received time slot allocation information.
In a second aspect, a multi-dimensional channel access device for a high-speed carrier ad hoc network data link is provided, and the device comprises an initialization module, a response module and a repetition module.
The initialization module is used for controlling all nodes to initialize, monitoring the network and completing the network synchronization operation;
the response module is used for detecting the state of the network, responding according to different states and transmitting data;
the response module makes a response process according to different states:
if the network state is the Claim stage of the time frame, each node sends an RTS packet in the corresponding micro time slot of the node according to the request condition of the buffer area of the node, and receives other node information in other micro time slots;
if the network state is the Response stage of the time frame, each node gathers, classifies and intercepts all the collected request information within a one-hop range, and calculates the usable time slot number;
if the network state is the Data phase of the time frame, each node can send Data in the available time slot, and other time slots receive information or sleep;
and after the data transmission stage is finished, the network enters a Claim stage of the next time frame, and the response module is shifted to continuously complete the response operation of the next stage.
In a third aspect, a computer readable storage medium is provided, where at least one executable instruction is stored, where the executable instruction when executed on an electronic device causes the electronic device to perform the operations of the high-speed carrier ad hoc network data link multidimensional channel access method according to the first aspect.
The beneficial effects are that: the invention provides a method and a device for accessing a multidimensional channel of a data link of a high-speed carrier ad hoc network, which solve the problems that a single-channel transmission mode has low communication efficiency and frequent control channel signaling interaction is bad. Based on the method, the channel utilization efficiency and robustness of the high-speed carrier ad hoc network under the complex electromagnetic environment condition can be obviously improved, and the method is suitable for the self-adaptive channel access of the Internet of vehicles.
Drawings
Fig. 1 is a schematic diagram of a time frame structure of a slot resource allocation in one embodiment.
Fig. 2 is a diagram of a TDMA time frame structure in one embodiment.
FIG. 3 is a diagram of a Claim subframe in one embodiment.
Fig. 4 is a flow chart of slot resource allocation in one embodiment.
Fig. 5 is a diagram of reservation information transmission information in one embodiment.
FIG. 6 is a schematic diagram of SPMA in one embodiment.
FIG. 7 is a SPMA architecture diagram in one embodiment.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the invention may be practiced without one or more of these details. In other instances, well-known features have not been described in detail in order to avoid obscuring the invention.
In the single channel MAC protocol, once the channels collide, the whole system becomes unusable and the anti-interference capability of the system is greatly compromised.
If the shared channel is divided into a plurality of sub-channels, a contention conflict is generated on one sub-channel, and other sub-channels can continue to operate unaffected, thus improving the reliability of the system.
Therefore, how to provide a reliable multi-dimensional channel access method for a data link of a high-speed carrier ad hoc network, which solves the problems of low communication efficiency and poor frequent concealment of control channel signaling interaction in the traditional single-channel transmission mode is a key point of the application. The present solution is described in detail below by way of examples.
The following embodiment firstly designs a typical application scene of the high-speed carrier ad hoc network, and describes key design elements in the scene, wherein the key design elements mainly comprise a frequency hopping function, a one-transmission-multiple-reception function, a network distributed control function, a simplified time frame structure and the like. And secondly, designing and describing a time frame structure. A time slot resource allocation mechanism based on TDMA+SPMA mixing meeting the setting condition of a high-speed carrier scene is provided, and time slot recovery is designed and described. Finally, the key interface of the channel access is also designed and described.
Embodiment one: time slot allocation constraint condition scene and time frame structure design
Firstly, it should be clear that the resource allocation algorithm is only aimed at the link that network nodes use network resources according to the distributed TDMA allocation algorithm, so that the research and implementation of the algorithm are based on a series of preconditions, and the preconditions of the high-speed carrier ad hoc network scenario are as follows:
1. the high-speed carrier self-organizing network has no control center at the MAC layer and adopts a distributed resource allocation mode.
There is no control center for communication or function in the network, and each node uses network resources in a distributed manner.
2. All nodes of the network have 1 transmitter and multiple receivers and are capable of fast switching and operation on multiple independent sub-frequencies (channels), and the high speed carrier transceiver has high speed frequency/time hopping functions.
To realize "simultaneous multi-reception and transmission" must be provided with a multi-channel mechanism and corresponding hardware device support, the embodiment sets "multi-reception and transmission" to "four-reception and transmission", that is, all nodes have 1 transmitter and 4 receivers, and the four receivers have different beam directions and can work simultaneously.
Each node in the network moves at high speed, and the topology of the network may change rapidly locally.
The network is in a complex and changeable electromagnetic environment, and the channel quality between any two nodes can be rapidly and seriously deteriorated due to interference, shielding and the like.
The upper layer application is sensitive to network time delay, the network time delay needs to be controlled in the ms order, the distance between network nodes is larger, and the distribution range can reach 1 km-500 km.
3. Each upper layer packet may be mapped to a certain priority of the MAC layer.
Our resource allocation algorithm incorporates a prioritized quality of service control mechanism, so it is desirable that the packet can be mapped to some information priority defined by the MAC layer when arriving at the MAC layer.
4. Simplified time frame structure
In researching the resource allocation algorithm, the complex MAC base protocol control flow and the time frame structure are ignored, and the frame structure is abstracted into three parts of a request declaration phase (Claim preamble), a response phase (response preamble) and a Data phase (Data slot), as shown in fig. 1.
The request preamble is used for sending RTS requests by the nodes in the network according to the state of the self packet buffer queue, the response preamble is used for each node to calculate the self available time slot according to the collected information operation allocation algorithm, and the data time slot is used for the nodes to send packets according to the allocation result. In general, the request preamble may be divided into N sub (micro) slots (N is the total number of nodes), numbered from 1 to N, corresponding to nodes 1 to N, respectively, and called node X as the master node of data slot X, which is the master slot of node X.
Claim stage
On the reservation channel: if a certain node has information to send, sending an RTS packet in the corresponding time slot of the Claim subframe, wherein the RTS packet comprises node m, the sending request number and priority information, and other nodes are in a interception state as shown in fig. 2 and 3. Since all nodes send RTS packets only in their own corresponding minislots, collisions between RTS packets do not occur.
Response phase
In Response sub-frames, each node gathers, classifies, intercepts and the like all request information within a one-hop range heard in the Claim stage, and runs an allocation algorithm to calculate a time slot number which can be used by itself.
Data phase
Each active node sends information in sequence in a time slot marked as an S, receives information in other time slots (unless packets of other nodes are not received), the inactive node which receives the packets is in a state of receiving information in the information phase, and the inactive node which does not receive the packets is in an idle state in the information phase. The next frame begins and each node in the network again repeats the algorithm starting from the Claim stage.
5. Channel description
The algorithm assumes that each node has multiple communication channels, i.e., each node has multiple transceivers, that can receive signals simultaneously over multiple frequencies. Meanwhile, the scheme does not consider the interference among channels, assuming that a plurality of users can coexist in each time slot during data receiving and transmitting and multipath data transmission, and mutual interference can be generated. In the preamble stage of the time frame, the algorithm assumes that all information is received and transmitted only on the No. 0 channel, the scheme is hereinafter abbreviated as the reserved channel, and note that the concept is only valid in the preamble stage, and all channels in the data transmission stage are the same.
6. Time frame, slot length specification
The time frame length is not variable in the present algorithm, and the time slot size in each time frame is determined by the size of the data packet and the amount of propagation delay in the system. Considering the protection time required by the system overlapping transmission, the algorithm is designed to set more than 1 complete data packet to be sent in each time slot.
7. Distributed algorithm
The same scheduling algorithm is arranged in each node, and each node runs the algorithm according to the obtained request information within the two-hop range and participates in the competition time slot.
8. Other description
Each node has channel quality measurement capability, and can select a proper rate file according to the channel quality, and the rate file is slowly changed relative to the allocation of time slot resources, so that the time slot resources are not considered in the scheduling process because the rate file is not changed suddenly due to the degradation of a certain instantaneous channel. Typical rate ranges for this embodiment are 2Mbps, 1Mbps, 500kbps, 200kbps. The power threshold of the receiver of each node is calibrated and set, so that the receiving model considers that the receiving is good and the channel is stable as long as there is no resource conflict and each node is within the range of each other in the node time slot resource allocation flow. The maximum network bandwidth of the network system of the single channel is 2Mbps.
9. Channel resource availability conditions
When the network is accessed by adopting a TDMA mode, the time is divided into frames. Each frame can be divided into a plurality of time slots according to different factors such as network scale, so the problem of time slot allocation is to allocate time slot resources to objects in a network according to different network environments, and the objects are divided into links and nodes.
If there are N nodes in the high-speed carrier ad hoc network, i, j represent two nodes in the network, when the value of the signal-to-noise ratio SNR between the nodes i and j is greater than a certain set threshold value gamma 0 When we can consider that node i and node j can communicate directly.
Wherein P is i Is the transmit power of node i, L ij Is the path loss between node i and node j, N r Is a spatial white noise affecting parameter.
In a high-speed carrier wireless network environment, two nodes communicate, and in addition to being affected by noise and environmental factors such as fast fading and slow fading, the two nodes also receive interference from other communication nodes in the network, and the node interference can cause interruption of node communication in some cases. Thus, only if the signal-to-interference ratio SIR of the communication link is greater than a certain set threshold gamma 1 When this link is enabled to communicate normally.
Wherein the summation term is the sum of the interference caused by other nodes in the network.
In an Ad hoc network, when two or more than two neighboring nodes transmit data simultaneously in the same time slot, or when two or more than two neighboring nodes transmit data simultaneously to the same node, data collision occurs, so the network needs to schedule and allocate the time slot.
Embodiment two: multi-channel time slot scheduling algorithm
The flow chart of the time slot scheduling algorithm of the node is shown in fig. 4.
The flow of the algorithm run by all nodes is as follows:
1. all nodes are initialized, monitor the network and complete the network synchronization operation.
2. Detecting the state of the network and responding according to the different states:
a) If the network state is the class time stage of the time frame, each node sends RTS packets in its corresponding micro time slot according to its own buffer request condition, and receives other node information in other micro time slots. Because of the large communication range of the scene network, the network nodes are in one-hop range, and each node can collect information of other nodes.
b) If the network state is the Response time stage of the time frame, each node gathers, classifies, intercepts and the like all the collected request information within the range of one hop (whole network), and runs an allocation algorithm to calculate the usable time slot number.
c) If the network state is the data transmission time phase of the time frame, each node can transmit data in its own available time slot, and other time slots receive information or sleep.
3. After the data transmission stage is finished, the network enters a clay time stage of the next time frame, and the process is shifted to a flow 2.
The flow of each stage is described as follows:
reservation information-Claim stage
On the reservation channel: if a certain node needs to send information, sending an RTS packet in the corresponding micro time slot of the Claim subframe, wherein the request quantity and the emergency degree are indicated in the packet, and other nodes are in a listening state as shown in fig. 5. Since all nodes transmit RTS packets only in their own corresponding slots, collisions between RTS packets do not occur. We call the node that sent the RTS packet in the Claim subframe an active node. Through a round of listening from time slots 1 through n, all nodes know which active nodes are within 1-hop range and also collect the request information of each node.
The information is collected-Response phase
In Response sub-frames, each node gathers, classifies, intercepts and the like all request information within a one-hop range heard in the Claim stage, and runs an allocation algorithm to calculate a time slot number which can be used by itself. We assume that all nodes in the network multiplex time slots as much as possible. If a node is an active node, after the Response phase, if the node competes for a data slot, it can immediately transmit data in the next data slot. Contention extends between all active nodes within 1 hop, and we use a mechanism called statistical priority multiple access (Statistical Priority-based Multiple Access, SPMA for short) to contend for network resources.
The multi-channel time slot scheduling algorithm combines a statistical priority and a bandwidth reservation mechanism, can dynamically allocate network resources, and ensures the shortest time delay transmission of high-priority data. Each node can analyze the statistical information of the data transmission quantity of each priority in a period of time, timely repartition the proportion of each priority time slot, and adjust the bandwidth percentage occupied by various service data, thereby adapting to the continuously changing communication requirement. To guarantee the quality of service (Quality of Service, qoS) of priority traffic, we set the following rules to prioritize urgent requests over non-urgent requests:
1) Requests of different urgency compete simultaneously, and requests of high urgency always have higher priority than requests of low urgency.
2) When the priority of the requests with the same service emergency degree is compared, the requests are ordered according to node numbers.
3) The node numbers in each time frame have certain priority, and the priority sequence of each node number can rotate periodically to ensure fairness.
Each active node runs an algorithm to determine its available time slots according to the request information in the RTS, and identifies "Send words on these available time slots.
Send Data- -Data phase
Each active node sends information in sequence in a time slot marked as "Send", receives information in other time slots, and the inactive node is in a state of receiving information or an idle state in a data time slot stage. The next frame begins and each node in the network again repeats the algorithm starting from the Claim stage.
Embodiment III: multi-channel time slot reclamation mechanism
If a node has completed tactical tasks to leave the network, the time slot resources occupied by the node need to be recovered to integrate and optimize the time-frequency resources of the network. Both army Link16 and TTNT have designs for time-slot resource reclamation. And after the node leaves the network or the time slot occupation is not carried out for a long time, the time slot resource is recovered and distributed to other nodes if necessary. The method comprises the steps that a time slot recoverable flag bit is introduced into a protocol, and when a node actively leaves the network, the time slot recoverable flag bit is at a 1 position. When the node passively gets off the network, a delay mechanism is started, the delay is delayed for a certain time Td, and if the node recovery is not realized, the time slot recoverable mark position 1 is obtained.
When the current traffic of the node has ended or is a state change (e.g., knocked down, quiesced, etc.), the unused time slots are released. Under normal conditions, since all message flows contain the occupied period information of the message flow in the time slot allocation information, when the occupied period is reached, the occupied time slots can be released. Thus, the neighbor node can know in which time frame these slots can be reserved by the message. For the situation that the service such as unexpected exit of the node is suddenly interrupted, if the neighbor node of one hop does not receive the message sent by the node within a certain length of time (for example, the length of three time frames of the node), the node is assumed to exit the system, new time slot allocation information is sent out after the time slot of the node is released, and meanwhile, the time slot allocation information sent by other nodes is synthesized to carry out final judgment. If all its neighbors assume that it exits the system, then it is considered that the node has exited the system, freeing its time slot for re-participation in the allocation. Otherwise, updating is carried out according to the received time slot allocation information.
Embodiment four: interface design for multi-channel access module
Interface with data transmission part
When data is transmitted, the data transmission module constructs the data into a complete access data block, then the complete access data block is assembled into a downlink kDataType structure format, and the complete access data block is placed into an interaction queue appointed by the access module according to an access protocol appointed by the data. When data is received, for the data received by the TDMA access protocol, the TDMA module can put the data into an uplink queue TdmaUpLinkDataQuue, and a structure body of the data in the queue is named TdmaUpLinkDataType.
The queue definition of the data transmission part and the access module is shown in table 1.
Table 1 queue definition for data transfer portion and access module
| Queues | Description of the invention |
| SpmaDownlinkDataQueue | Interface queue for data from data transmission module to SPMA access module |
| TdmaDownlinkDataQueue | Interface queue for data from a data transmission module to a TDMA access module |
| TdmaUplinkDataQueue | Interface queue for data from TDMA access module to data transmission module |
The DownlinkDataType structure definition format is shown in table 2.
Table 2 DownlinkDatatype structural formats
Interface to physical layer
The interface between the SPMA access module and the physical layer is related register configuration, and related control of data transmission is completed. Including data rate, transmit power, antenna selection, setting of status registers, etc.
Table 3 register interface of SPMA Access Module and physical layer
The TDMA access module receives an interruption of the physical layer every other time slot, which is one of the interfaces of the TDMA access module and the physical layer. Furthermore, the transmission and reception of TDMA access methods involves the control and management of the associated registers.
Table 4 register interface of TDMA access module and physical layer
Fifth embodiment: multi-channel statistical priority access
Multi-channel Statistical Priority (SPMA) access is shown in fig. 6, and the access mode uses a priority-based algorithm to reserve partial throughput for high-priority data and implement flow control by deferring the transmission of low-priority data.
SPMA performs transmission control by maintaining certain low priority messages as required and maintains traffic in a preferred area (preferred operating region). The method can ensure stable transmission by controlling the channel transmission quality, gradually and smoothly reduce the communication quality when the application transmission requirement increases, and ensure the transmission throughput of high-priority data.
The protocol consists of 8 priority queues, priority contention rollback window, priority threshold, channel occupation statistic, receiving and transmitting antennas and corresponding distributed control algorithm. The multi-channel access protocol expands the service quality to the MAC layer, and establishes a priority queue; and the channel occupation statistics are obtained through the interaction of the MAC layer and the physical layer to determine the transmission of the data packet. The channel occupancy statistics are used to count the activity level of a communication channel over a predetermined period of time. The simplified structure of this protocol can be represented as fig. 7 (simplified SPMA architecture diagram).
When the high layer has packet transmission or receives the forwarding packet, the packet enters a corresponding priority queue according to a certain rule, then the channel occupation statistical value is compared with a corresponding priority threshold, and if the channel occupation statistical value is lower than the priority threshold, the packet is sent; if the channel occupancy statistic is higher than the priority threshold, the priority class waits for a random back-off time Td, and after the back-off time Td is reduced to zero, the node checks the channel occupancy statistic again for transmission. When high priority data arrives within the back-off time, the back-off timer pauses and the channel occupancy value is immediately compared with a corresponding high priority threshold to determine the transmission of the newly arrived high priority packet.
While the invention has been shown and described with reference to certain preferred embodiments, it is not to be construed as limiting the invention itself. Various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. The method for accessing the multidimensional channel of the data link of the high-speed carrier ad hoc network is characterized by comprising at least three stages:
a stage of Claim, reservation information:
when a certain preset node needs to send information on a reserved channel, sending an RTS packet in a corresponding micro time slot of a Claim subframe, wherein the request quantity and the emergency degree are indicated in the packet, and the node sending the RTS packet is an active node at the moment; the other nodes are in a interception state;
after one round of interception of time slots 1 to n, confirming the position of an active node in a one-hop range and request information thereof;
the Response phase, collecting information:
in the Response subframe, each node gathers, classifies and intercepts all request information within a one-hop range heard in the stage of Claim, and operates an allocation algorithm to calculate a usable time slot number; if a node is an active node, after the Response phase, if the node competes for a data time slot, the node immediately sends data in the next data time slot;
data stage, transmitting Data:
each active node sends information in sequence in a time slot marked as "Send", receives information in other time slots, and the inactive node is in a state of receiving information or an idle state in a data time slot stage; the next frame begins and each node in the network again repeats the algorithm starting from the Claim stage.
2. The method for accessing the multidimensional channel of the data link of the high-speed carrier ad hoc network is characterized by comprising the following steps:
s1, initializing all nodes, monitoring a network and completing network synchronization operation;
s2, detecting the state of the network, responding according to different states, and transmitting data;
and S3, after the data transmission stage is finished, the network enters a Claim stage of the next time frame, and the process goes to S2.
3. The multi-dimensional channel access method according to claim 2, characterized in that before executing the multi-dimensional channel access method, a slot allocation constraint scenario is checked, said slot allocation constraint scenario comprising at least the following definitions:
a. the high-speed carrier self-organizing network has no control center in the MAC layer, and adopts a distributed resource allocation mode;
b. all nodes of the network are provided with a transmitter and a plurality of receivers, can be switched and operated on a plurality of independent sub-frequencies, and the high-speed carrier transceiver is provided with a frequency hopping/time hopping function;
c. each upper layer packet may be mapped to a certain priority of the MAC layer.
4. The multi-dimensional channel access method of claim 3 wherein the slot allocation constraint scenario further comprises the following definitions:
d. abstracting the time frame structure into a Claim stage, a Response stage and a Data stage;
wherein the Claim stage and the Response stage are used as the leading stage of the time frame structure; the Data phase serves as a Data slot of the time frame structure.
5. The multi-dimensional channel access method of claim 4, wherein:
the request preamble is used for sending an RTS request by a node in the network according to the state of the self packet buffer queue;
the response preamble is used for each node to calculate the available time slot according to the collected information operation allocation algorithm;
the data time slot is used for the node to send the packet according to the allocation result;
the request preamble is divided into N sub time slots, the number from 1 to N is respectively corresponding to the nodes from 1 to N, and the node with the X number is called as a main node of the data time slot with the X number, and the data time slot with the X number is called as a main time slot of the node with the X number; where N is the total number of nodes.
6. The multi-dimensional channel access method according to claim 2, wherein the responding procedure according to the different states in S2 comprises:
a) If the network state is the Claim stage of the time frame, each node sends an RTS packet in the corresponding micro time slot of the node according to the request condition of the buffer area of the node, and receives other node information in other micro time slots;
b) If the network state is the Response stage of the time frame, each node gathers, classifies and intercepts all the collected request information within a one-hop range, and calculates the usable time slot number;
c) If the network state is the Data phase of the time frame, each node can send Data in its own available time slot, and other time slots receive information or sleep.
7. The multi-dimensional channel access method according to claim 1 or 2, further comprising a multi-channel slot reclamation mechanism comprising:
introducing a time slot recoverable mark bit, and when the node actively leaves the network, marking the time slot recoverable mark position 1; when the node is passively disconnected, a delay mechanism is started, the delay is delayed for a preset time Td, and if the node is not recovered yet, a time slot recoverable mark position 1 is obtained;
when the current traffic of the node has ended or is a state change, the time slots that are no longer used are released.
8. The multi-dimensional channel access method of claim 7, further comprising:
for the situation that the services such as unexpected exit of the node are suddenly interrupted, if the one-hop neighbor node does not receive the message sent by the node within the time of a preset length, the node is assumed to exit the system, new time slot allocation information is sent out after the time slot of the node is released, and meanwhile, the time slot allocation information sent by other nodes is synthesized to carry out final judgment;
if all the neighboring nodes assume that the node exits the system, the node is considered to have exited the system, so that the time slot of the node is released and the node is re-participated in the allocation; otherwise, updating is carried out according to the received time slot allocation information.
9. A high-speed carrier ad hoc network data link multidimensional channel access device, comprising:
the initialization module is used for controlling all nodes to initialize, monitoring the network and completing the network synchronization operation;
the response module is used for detecting the state of the network, responding according to different states and transmitting data;
the response module makes a response process according to different states:
if the network state is the Claim stage of the time frame, each node sends an RTS packet in the corresponding micro time slot of the node according to the request condition of the buffer area of the node, and receives other node information in other micro time slots;
if the network state is the Response stage of the time frame, each node gathers, classifies and intercepts all the collected request information within a one-hop range, and calculates the usable time slot number;
if the network state is the Data phase of the time frame, each node can send Data in the available time slot, and other time slots receive information or sleep;
and the repeating module is used for entering a Claim stage of the next time frame after the data transmission stage is finished, and switching to the response module to continuously finish the response operation of the next stage.
10. A computer readable storage medium having stored therein at least one executable instruction that when executed on an electronic device causes the electronic device to perform the operations of the high speed carrier ad hoc data link multidimensional channel access method of any one of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211613488.6A CN116133152A (en) | 2022-12-15 | 2022-12-15 | Multi-dimensional channel access method and device for high-speed carrier ad hoc network data link |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211613488.6A CN116133152A (en) | 2022-12-15 | 2022-12-15 | Multi-dimensional channel access method and device for high-speed carrier ad hoc network data link |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116133152A true CN116133152A (en) | 2023-05-16 |
Family
ID=86303662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211613488.6A Pending CN116133152A (en) | 2022-12-15 | 2022-12-15 | Multi-dimensional channel access method and device for high-speed carrier ad hoc network data link |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116133152A (en) |
-
2022
- 2022-12-15 CN CN202211613488.6A patent/CN116133152A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6967944B2 (en) | Increasing link capacity via concurrent transmissions in centralized wireless LANs | |
| US7373162B2 (en) | Methods of controlling transmission power levels in air interface channels | |
| KR20060123199A (en) | Inter-cell interference mitigation technique using reservation indicators | |
| Kamruzzaman | An energy efficient multichannel MAC protocol for cognitive radio ad hoc networks | |
| CN111818652B (en) | Channel resource allocation method of multi-transceiver multi-channel wireless Ad Hoc network | |
| WO2004084434A1 (en) | Multi-hop time reservation using adaptive control for energy efficiency | |
| US20220346112A1 (en) | Method of logical channel prioritization to support sidelink relay | |
| KR20040082588A (en) | MAC protocol layer module of mobile terminal in MANET and method for transmitting/receiving frame thereof | |
| CN107182070B (en) | Wireless network channel quality updating and transmitting method | |
| Jurdak et al. | U‐MAC: a proactive and adaptive UWB medium access control protocol | |
| Kalil et al. | SWITCH: A multichannel MAC protocol for cognitive radio ad hoc networks | |
| Li et al. | MAC-SCC: Medium access control with a separate control channel for multihop wireless networks | |
| Lasowski et al. | A multi channel synchronization approach in dual radio vehicular ad-hoc networks | |
| Yeh et al. | A time space division multiple access (TSDMA) protocol for multihop wireless networks with access points | |
| CN112398555B (en) | Incremental resource application and allocation method and system | |
| CN106851853B (en) | Multi-access control method and control device for multi-hop centerless network | |
| CN116133152A (en) | Multi-dimensional channel access method and device for high-speed carrier ad hoc network data link | |
| KR102467945B1 (en) | Method and apparatus for TDMA(time division multiple access) resource scheduling in wireless network | |
| CN104640226B (en) | Multiple services resource regulating method and device are based under a kind of cognition relay system | |
| Júnior et al. | Sm3-mac: a multichannel collision-free mac protocol for wireless sensor networks | |
| CN110022562B (en) | Distributed channel allocation control method for mobile ad hoc network | |
| Zhang et al. | Receiver initiated MAC design for ad hoc networks based on multiuser detection | |
| Kamruzzaman et al. | Energy efficient cognitive radio MAC protocol for battlefield communications | |
| Mishra et al. | A qos provisioning mac protocol for cognitive radio network | |
| Yang et al. | Node activation with polling channel access |
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 |