CN108093469B - Distributed access method of wireless transmission system based on TDMA - Google Patents
Distributed access method of wireless transmission system based on TDMA Download PDFInfo
- Publication number
- CN108093469B CN108093469B CN201611046324.4A CN201611046324A CN108093469B CN 108093469 B CN108093469 B CN 108093469B CN 201611046324 A CN201611046324 A CN 201611046324A CN 108093469 B CN108093469 B CN 108093469B
- Authority
- CN
- China
- Prior art keywords
- time slot
- node
- slot
- network
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 35
- 235000008694 Humulus lupulus Nutrition 0.000 claims abstract description 11
- 238000012544 monitoring process Methods 0.000 claims abstract description 3
- 238000010276 construction Methods 0.000 claims description 3
- 230000001360 synchronised effect Effects 0.000 claims description 2
- 230000008569 process Effects 0.000 abstract description 9
- 238000004088 simulation Methods 0.000 description 7
- 230000008859 change Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 230000003993 interaction Effects 0.000 description 4
- 239000002699 waste material Substances 0.000 description 4
- OOIBFPKQHULHSQ-UHFFFAOYSA-N (3-hydroxy-1-adamantyl) 2-methylprop-2-enoate Chemical compound C1C(C2)CC3CC2(O)CC1(OC(=O)C(=C)C)C3 OOIBFPKQHULHSQ-UHFFFAOYSA-N 0.000 description 3
- 108700026140 MAC combination Proteins 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000002860 competitive effect Effects 0.000 description 2
- 230000000670 limiting effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000002829 reductive effect Effects 0.000 description 1
- 230000000717 retained effect Effects 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W56/00—Synchronisation arrangements
- H04W56/001—Synchronization between nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a distributed access method of an elastic long-distance wireless transmission system based on TDMA, the system works according to the following steps: firstly, accessing a network by a node, monitoring and synchronizing the starting time of a frame; secondly, the node sends network access request information at the initial time slot of the next frame, waits for the neighbor node to broadcast time slot occupation information, and constructs the time slot occupation condition of the neighbor node in two hops; thirdly, the node occupies the time slot according to the ID of the node and a time slot selection algorithm, and broadcasts an occupation result; and fourthly, after the two-hop neighbor finishes updating the new node information, the node accesses the network and transmits the information according to a time slot transmission algorithm. The frame structure, the node network access process and the time slot transmission algorithm provided by the invention can obtain higher throughput and have higher transmission stability in the elastic long-distance transmission network.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a distributed access method of a TDMA-based elastic long-distance wireless transmission system.
Background
MAC layer access techniques for ad hoc networks can be broadly divided into two categories: competitive and planned. Corresponding implementations are CSMA and TDMA techniques, respectively. Due to the randomness of the access mode of the competitive protocol, when the network load is high, the collision probability is high, and the throughput is greatly influenced. The TDMA protocol is characterized in that each node transmits in a fixed time slot, and each time slot only has one node to transmit in a collision range, so that collision is avoided, but overhead of additional topology information interaction is introduced. The two protocols have advantages and disadvantages under different network environments, and the invention mainly considers the distributed access method of the elastic long-distance wireless transmission system based on the TDMA.
The TDMA-based MAC layer wireless transmission technology can be classified into two broad categories, centralized and distributed, wherein the distributed TDMA is further classified into two implementation manners, namely topology-dependent and topology-transparent. The TDMA technology relying on the topological structure mainly aims to design an information interaction strategy between nodes, and due to the existence of the 'hidden terminal' problem, the TDMA technology relies on the topological knowledge of two-hop neighbors to ensure that the distributed allocation of time slots is completed on the premise of no transmission collision, and when the network topological structure is changed, additional control information is needed to complete the updating and maintenance of the topological structure. The TDMA technology with a transparent topological structure does not depend on the current topological structure of the network, only needs the number K of summary points in the network and the maximum neighbor number D of each node, is suitable for the TDMA network with super-high elasticity, and cannot avoid collision, so that a large amount of time slot waste is generated at the relatively stable stage of the network, and the throughput is influenced.
The search of the prior art shows that, in the new Channel Access method of Ad Hoc Networks, a time slot random Access strategy based on a hash algorithm is provided in ANew Approach to Channel Access Scheduling for Ad Hoc Networks published in Proceedings of the 7th annual Access conference on Mobile computing and networking of LiChun Bao et al, so that collision is avoided, and fairness of Access channels of nodes is proved. MH Chaudhary, et al, in 2013 IEEE MILCOM published Progressive Decentralized TDMA based MAC of Join optimization of Slot Allocation and Frame Lengths (distributed TDMA MAC protocol: optimization of Slot Allocation and Slot length), proposes a TDMA access strategy for adjusting a Frame structure adaptively according to the actual topology of a network, and the strategy can flexibly expand and shorten the Frame length according to the actual number of two-hop neighbors of a node and the Slot occupation, thereby improving the throughput. However, for an elastic network with a large network topology change (the number of nodes in the network has large fluctuation), time slots of many nodes are reselected due to frequent frame length conversion, so that the stability of the network is affected, and meanwhile, the generation of idle time slots cannot be avoided, and the waste of the time slots is caused.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a distributed access method of a TDMA-based elastic long-distance wireless transmission system, which adopts a fixed frame length strategy, and nodes adopt a Hash transmission algorithm to access unoccupied time slots except for being allocated with a fixed time slot in each time slot period.
In order to achieve the purpose, the technical scheme adopted by the invention is as follows:
a distributed access method of a TDMA-based resilient long-distance wireless transmission system, which works according to the following steps:
firstly, before a new node accesses a network, the initial time of a frame is synchronized by monitoring;
the new node firstly monitors before accessing the network, and performs clock synchronization including the start time of the frame with other nodes in the network, wherein the clock synchronization can be completed in a mode of GPS and the like, and the start position of the first time slot of the frame is obtained. The frame structure is as shown in figure 1 of the specification, the length of the frame is fixed, the specific length depends on the maximum node number N contained in a two-hop transmission range in the network, the frame is divided into a control time slot and a data time slot, the control time slot is mainly used for maintaining topology information, and the data time slot is used for transmitting data. The details are as follows:
REQ/SUG slot: the time slot is used for transmitting two kinds of information, the first kind is network access request information which contains the ID of a new node and is used for informing surrounding neighbor nodes to request network access; and the other is time slot selection result information, when the node hash time slot network access fails, the node needs to transmit the ID of the node and the actually selected time slot result. The hash slot refers to: calculating a time slot selection result through a Hash algorithm; when the node hash time slot fails to access the network, the following steps are carried out: and when the time slot selection result calculated by the node through the Hash algorithm conflicts with other nodes in the network.
INF (information) slot: each frame period contains N INF (information) time slots which are used for the nodes to transmit the ID information of the nodes and the neighboring nodes of one hop around, and the time slots of the part are mainly used for maintaining topology information.
CONFIRM slot: and the new node sends the information about the success or failure of the Hash time slot in the time slot, and simultaneously sends the IDs of the neighboring nodes of one hop around and the occupation condition of the time slot.
TUNE slot: if the surrounding neighbor nodes receive the information of the hash time slot failure of the new node, the neighbor nodes can send TUNE signals in the TUNE time slot and inform the result of the hash time slot failure of the two-hop nodes.
DATA slot: the method is mainly used for data transmission.
Step two, the new node sends network access request information at the initial time slot of the next frame, waits for the neighbor node to broadcast the time slot occupation information, and constructs the time slot occupation condition of the neighbor node in two hops;
the new node sends a network access request in a REQ/SUG time slot, in the next INF (information) time slot, the neighbor nodes broadcast the IDs of the new node and the neighbor nodes of one hop around and the time slot occupation situation in the corresponding INF time slot, each node in the network can keep the IDs of the neighbor nodes and the corresponding occupied time slots in the two-hop transmission range, and the neighbor nodes broadcast the information of the new node and the neighbor nodes of one hop, so that the new node can complete the construction of the neighbor IDs of two hops around and the occupied time slot table after the INF time slot is finished. Fig. 2 shows the neighbor information retained by the node 1 under the current topology.
Because the topological structure is unknown, the addition of a new node may cause two nodes which are not originally communicated to become communicated (to become a two-hop neighbor relation), and if the two nodes occupy the same time slot, collision may be caused. For the situation, the new node detects the occurrence of collision in the INF slot, and broadcasts in the confirm slot which slot the collision occurred, and after receiving the information in the confirm, the node generating the collision checks the unoccupied slot, randomly selects the unoccupied slot, and broadcasts its own slot adjustment result in the INF slot of the next frame period.
And if not, repeating the step two until the new node ensures that the new node receives the time slot occupation information of all the neighbor nodes without collision.
And step three, the new node occupies the time slot according to the ID of the new node and a time slot selection algorithm, namely selects the time slot and broadcasts an occupation result.
The new node selects time slot through time slot selection algorithm, the specific process is that the time slot occupied by the new node is firstly selected according to the modulo Hash algorithm given in the formula I, the Hash time slot result is compared with the time slot occupied condition of the neighbor in two hops, and if no conflict occurs, Hash time slot success information and the ID and time slot selection information of the neighbor in one hop are broadcasted in the confirm time slot of the current frame. The reason why the ID and slot selection information of the one-hop neighbor need to be broadcast here is: the addition of the new node may cause that two nodes which are not originally connected become connected (a non-two-hop neighbor relationship becomes a two-hop neighbor relationship), and the new node needs to notify the existence of the nodes, so as to ensure the integrity of the topology information. The one-hop neighbor node will not send a tune signal in the tune time slot, if the two-hop neighbor does not receive the tune signal or detects a collision in the tune time slot, the time slot selection result corresponding to the new node is updated according to the formula. In this state, the new node completes the time slot selection, successfully accesses the network, broadcasts the self and a neighbor ID and time slot selection condition in the INF time slot of the next frame period, and is used for maintaining topology information.
New node ID mod data time slot total length N formula one
Where mod is the remainder operator.
When a new node selects a time slot through a time slot selection algorithm, if the new node finds that the time slot is occupied by other neighbor nodes, hash time slot failure information and a time slot selection result of a one-hop neighbor are broadcasted in a confirm time slot, and after receiving the hash time slot failure information, the neighbor nodes send a tune signal in a tune time slot shown in a current frame structure and inform two-hop neighbor nodes of the result of the hash time slot failure of the new node. Meanwhile, the new node broadcasts its own slot selection result in the REQ/SUG slot of the next frame period. In this state, the neighbor node marks the new node as the time slot not yet selected, and finishes updating the time slot occupation information of the new node after receiving the time slot selection result information sent by the new node.
And step four, the two-hop neighbor node completes information updating of the new node, the new node accesses the network and transmits the information according to a time slot transmission algorithm.
The node adopts a time slot transmission algorithm to occupy time slots and complete data transmission, and the method specifically comprises the following steps: and if the node hash time slot is successful according to the time slot selection result in the last step, successfully accessing the network in the frame period of the sending request, and transmitting the new node in the selected time slot, and meanwhile, judging whether the new node transmits the unoccupied time slot according to the time slot occupation result of the neighbor in two hops. If the node hash time slot fails, network access is completed in the next frame period, whether transmission is performed or not can be judged for the unoccupied time slot through a time slot hash transmission algorithm in the period, and time slot selection is completed in the next frame period. After finishing the time slot selection, the node sends the ID time slot information of the node and the neighbor in the corresponding INF time slot.
For the unoccupied time slots, the adopted hash time slot transmission algorithm has the specific working process that: each node holds ID information of two-hop nodes, and for an unoccupied time slot, each node calculates a priority value priority for itself and all neighbors in two hops according to a linear congruence method (formula II), wherein ID represents the unique ID of each node in the network, used _ slot _ num is the number of data time slots which have passed at present, and a, c and m are parameters. The linear congruence method requires that parameters a and c are relatively prime and are far less than m (more than 30 times), under the condition, the fairness of transmission of a node access channel can be guaranteed by adopting the linear congruence method to carry out random access, and the linear congruence method is widely applied to an algorithm for generating uniformly distributed random numbers. If the priority value of the node is greater than the priority values of all other nodes in the two-hop neighbor, the node acquires the access right of the current time slot, otherwise, the node does not perform data transmission, wherein the node can be any node in the network, such as a new node and a node existing in the network
priority＝(a*(id+used_slot_num)2+ c) mod m formula two
Compared with the prior art, the invention has the following beneficial effects:
the invention adopts a scheme combining fixed access and random access, adopts a fixed frame length scheme, and adopts a linear congruence method to access unoccupied time slots, compared with a completely random TDMA access scheme, the invention reduces the network access delay and the interaction amount of additional control information, compared with a scheme dynamically adjusting the frame length, the network is more stable, the waste of idle time slots is reduced, the throughput is ensured, and simultaneously, the problem of time slot reselection when the node adjusts the length of the frame according to the actual topological condition is avoided. On the other hand, the time slot selection algorithm adopted by the invention enables the time slot of partial nodes in the network to have a mapping relation with the node ID, and the frame length with fixed length avoids the extra interaction of the frame length information, thereby effectively reducing the length of the control information packet and further improving the throughput.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
fig. 1 is a schematic diagram of a frame structure.
Fig. 2 is a table of occupied time slot conditions of neighboring nodes held by a node.
Fig. 3 and 4 show embodiments of timeslot selection according to the present invention.
Fig. 5 is a slot transmission algorithm embodiment of the present invention.
Fig. 6 is a comparison graph of simulation experiment results of a fully connected network (top) and a multi-hop network (bottom).
FIG. 7 is a flow chart of the present invention.
In fig. 6:
PD-MAC stands for Transmission protocol 1 in the literature
HD-MAC represents the protocol corresponding to the invention
HAMA denotes the transport protocol 2 in the prior art document
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that variations and modifications can be made by persons skilled in the art without departing from the spirit of the invention. All falling within the scope of the present invention.
In this embodiment, a time slot selection algorithm flow is described with two node network access situations in fig. 3 and fig. 4, in this example, a frame length is 16, a node topology structure inherent in a network is shown as a solid line connection, a number in a node represents an ID allocated to the node, in fig. 3, the node 1 accesses a network at a certain time, network access request information is sent in a REQ/SUG time slot of a next frame period, after receiving a request of the node 1, the node 3 and the node 5 broadcast slot occupation information of itself and a one-hop neighbor in an INF time slot, specifically, the node 3 broadcasts IDs and slot occupation situations of the node 3, the node 9, the node 7, the node 1, and the node 5 broadcasts IDs and slot occupation situations of the node 5, the node 1, the node 3, the node 9, and the node 13. After the INF time slot, the node 1 receives the IDs and time slot occupation information of all two-hop neighbors (the node 3, the node 5, the node 7, the node 9 and the node 13), the two-hop neighbor nodes (the node 7, the node 9 and the node 13) of the node 1 receive the ID information of the node 1, the node 1 selects the time slot according to a Hash time slot selection algorithm and sends Hash time slot success information and the IDs and time slot occupation conditions of the node 1 and the one-hop neighbor nodes (the node 3 and the node 5) in a confirm time slot, the node 3 and the node 5 update the time slot occupied by the node 1 after receiving the information of the node 1 to be the time slot 1, and in the tune time slot, the two-hop neighbor nodes 7, the node 9 and the node 13 of the node 1 do not detect tune information or collision, so that the time slot occupied by the node 1 is the time slot 1, and the node 1 completes network entry and occupies the time slot 1, and carrying out time slot access according to a Hash time slot transmission algorithm, wherein each node transmits in the allocated fixed time slot, and simultaneously accesses the unoccupied time slots in a random access mode.
In fig. 4, the node 19 accesses the network at a certain time, and also firstly sends a network access request and receives INF information, which is different from fig. 3 in that the hash slot transmission algorithm detects that the occupied slot collides with the node 3, so that hash slot failure information and the IDs and slot occupancy of the one- hop neighbor nodes 3 and 5 are broadcast in the confirm slot. After receiving the hash failure information, the node 3 and the node 5 may send a tune signal in the tune time slot, and the two-hop neighbor node 7, the node 9, and the node 13 detect the tune signal and perform corresponding updating, in this time slot period, the node 19 may perform random access to an unoccupied time slot, and send a time slot selection result 0 in the REQ/SUG time slot of the next time slot period, and when the control time slot of the next frame period is finished, the two-hop neighbor completes updating the information accessed to the node 19, and the node 19 successfully accesses the network.
In this embodiment, the time slot transmission algorithm is explained by the topology structure in fig. 5, two nodes exist in the network, the node IDs are 2 and 3 respectively, the time slot length N is set to 4, and according to the time slot selection algorithm, the node 2 is allocated to the time slot 2, and the node 3 is allocated to the time slot 3. In each frame period, node 2 transmits data in the allocated time slot 2, and node 3 transmits in the allocated time slot 3. In addition, for the unoccupied time slots 1 and 4, the nodes 2 and 3 calculate the priority value according to the current number k of the elapsed time slots and the self ID and the linear congruence formula of the formula II, if the node 2 is larger than the node 3, the node 2 obtains the access right of the current time slot, otherwise, the node 3 obtains the access right of the current idle time slot.
In addition, in this embodiment, the network is modeled by an opnet network simulation tool, and the protocol algorithm is completed in the node model, thereby implementing the MAC layer channel access rule. The embodiment mainly simulates two networks, namely a fully-connected network and a multi-hop network. All nodes in the fully-connected network are in one-hop neighbor relation, data can be directly sent from one node to another node, and the data in the multi-hop network can reach a destination only by being forwarded. Under the two network structures, the protocol in the invention is compared with the existing MAC layer protocol (HAMA, PD-MAC) based on the fixed time slot transmission technology in throughput.
The environmental parameters of this embodiment are:
(1) each node in the network is assigned a unique ID
(2) The transmission distance of the node is 1km, and the transmission bandwidth is 2Mbps
(3) The length of the control time slot is 1ms, and the length of the data time slot is 8ms
(4) The size of the data packet is 10000 bits, and only one data packet can be transmitted in one data time slot
(5) The frame length adopted by the protocol is 24, which is larger than the maximum number of two-hop neighbors
(6) The data arrival rate of each node is 0.01, the Poisson distribution is obeyed, the arrival rate can ensure that data transmission exists when the data obtains the channel access right, and the data adopts the principle of first-in first-out.
(7) The total simulation time is 40s
In the simulation configuration of the full-link network, the maximum number of nodes contained in the network in the elastic change process is 10, two nodes exist in the network in the initial state, and the rest nodes are accessed to the network at random time after the network is initialized. After all the nodes are accessed to the network, the nodes with random number exit the network at random time, the simulation of the dynamic adding and leaving change process of the nodes in the actual network is completed, and in the whole process, the change of the overall throughput of the network is observed and compared with the performance of different protocols in the elastic network.
In the network configuration of the multi-hop communication network, the maximum number of nodes contained in the network in the process of elastic change is 20, the network is initially provided with two nodes, the rest nodes are accessed into the network at random time and random positions, the construction of the multi-hop network is completed, after all the nodes are accessed into the network, the nodes with random numbers exit the network at random time, and in the whole process, the change of the overall throughput of the network is observed and compared with the performances of different protocols in the elastic network.
In the configuration process of the two networks, the initial state network has only two nodes, for the protocol in the invention, each node calculates the time slot serial number which should be occupied through the ID of the node, and simultaneously, the idle time slot is accessed by adopting the algorithm described in the previous part. For the configuration of the existing MAC protocol, in PD-MAC, the initialization frame length of each node is 4, and two nodes are manually configured to occupy time slot 1 and time slot 2, respectively, and the time slot allocation and selection of the network initialization part are completed through the above steps, in HAMA, the number of data time slots per frame period is 32, and 160 control time slots are required to be calculated through the maximum number of nodes.
Fifty times of simulation are respectively carried out on two topological structures in the embodiment, after the average value is obtained, the simulation result is shown in fig. 6, in two networks, when the protocol provided by the invention faces the dynamic access and the departure of the nodes, the throughput is less influenced, because the departure of the nodes in the existing protocol can cause the waste of time slots, and the system can effectively improve the total throughput of the network under the elastic network environment.
While the present invention has been described in detail with reference to the preferred embodiments, it should be understood that the above description should not be taken as limiting the invention. Various modifications and alterations to this invention will become apparent to those skilled in the art upon reading the foregoing description. Accordingly, the scope of the invention should be determined from the following claims.
Claims (9)
1. A distributed access method for a TDMA-based resilient long-range wireless transmission system, comprising:
firstly, before a new node accesses a network, the initial time of a frame is synchronized by monitoring;
secondly, the new node sends network access request information at the initial time slot of the next frame, waits for the neighbor node to broadcast time slot occupation information, and constructs the time slot occupation condition of the neighbor node in two hops;
thirdly, the new node selects time slots according to the ID of the new node and the occupation condition of the time slots of the neighbor nodes in the two hops, and broadcasts a time slot selection result;
the length of the frame is fixed, and the specific time slot of the frame is as follows:
REQ/SUG slot: the first type is network access request information which contains the ID of the new node to inform the surrounding neighbor nodes of requesting network access; the second is time slot selection result information, when the Hash time slot of the node fails to access the network, the node needs to transmit the ID of the node and the actually selected time slot result; the hash slot refers to: calculating a time slot selection result through a Hash algorithm; when the node hash time slot fails to access the network, the following steps are carried out: when the time slot selection result calculated by the node through the Hash algorithm conflicts with other nodes in the network;
an INF time slot: the node transmits the ID information of the node and the ID information of the neighboring nodes of one hop around, each frame period comprises N INF time slots, and N represents the maximum node number contained in a two-hop transmission range in the network;
CONFIRM slot: the new node sends information about whether the Hash time slot is successful or not in the CONFIRM time slot, and sends IDs (identity) of surrounding one-hop neighbor nodes and the time slot occupation condition;
TUNE slot: if surrounding neighbor nodes receive the information of the hash time slot failure of the new node, the neighbor nodes can send a TUNE signal in the TUNE time slot, and the TUNE signal is used for informing the result of the hash time slot failure of the two-hop node;
DATA slot: for data transmission.
2. The distributed access method for a TDMA-based resilient long-range wireless transmission system according to claim 1, comprising:
and fourthly, after the two-hop neighbor nodes finish updating the ID information of the new node, the new node can access the idle time slot, and after the two-hop neighbor nodes finish updating the time slot selection result information of the new node, the new node accesses the network and transmits the information.
3. The distributed access method for a TDMA-based resilient long-range wireless transmission system according to claim 1, wherein in said first step, the new node first listens before accessing the network, synchronizes its clock with the rest of the nodes in the network, and obtains the start position of the first timeslot of the frame.
4. The distributed access method of the resilient long-distance wireless transmission system based on TDMA according to claim 1, wherein in the second step, the new node sends network access request information in REQ/SUG slot of frame structure, in the next INF slot, the neighbor node broadcasts ID of itself and neighbor nodes of one hop around and slot occupation status, after INF slot, the new node completes construction of neighbor nodes ID of two hop around and slot occupation status table of neighbor nodes in two hop.
5. The distributed access method for a TDMA-based flexible long-distance wireless transmission system according to claim 4, wherein in said second step, the new node detects the collision occurred in the INF slot and broadcasts in the confirm slot which slot the collision occurred, and the node which generated the collision checks the unoccupied slot after receiving the information in the confirm and randomly selects and broadcasts its own slot adjustment result in the INF slot of the next frame period;
and if not, the second step is repeatedly executed until the new node ensures that the new node receives the time slot occupation information of all the neighbor nodes without collision.
6. The distributed access method for a TDMA-based resilient long-range wireless transmission system according to claim 1, wherein in said third step, a new node performs time slot selection by a time slot selection algorithm;
the time slot selection algorithm is specifically as follows:
new node ID mod data time slot total length N formula one
Wherein mod is a remainder operator;
and the new node selects the occupied time slot according to the formula I, the time slot selection result is compared with the occupied conditions of the time slots of the neighbor nodes in two hops, and if no conflict occurs, the confirm time slot in the frame structure broadcasts the success information of the Hash time slot, the ID of the neighbor node in one hop and the corresponding time slot selection result information.
7. The distributed access method for the TDMA-based resilient long-distance wireless transmission system according to claim 6, wherein in said third step, when the new node performs the slot selection through said slot selection algorithm, if the new node finds that the slot is occupied by the rest of the nodes, the new node broadcasts the hash slot failure information and the slot selection result of the one-hop neighbor node in the slot, and after receiving the hash slot failure information, the neighbor node sends a tune signal in the tune slot in the frame structure to notify the two-hop neighbor node of the result of the hash slot failure of the new node; the new node will send its own slot selection result in the REQ/SUG slot of the next frame period.
8. The distributed access method for the TDMA-based resilient long-range wireless transmission system according to claim 2, wherein in said fourth step, the node performs the time slot occupation using the time slot transmission algorithm to complete the data transmission;
the time slot transmission algorithm specifically comprises the following steps:
according to the time slot selection result in the third step, if the hash time slot of the new node is successful, the new node successfully accesses the network in the frame period and transmits in the selected time slot, and according to the time slot occupation condition of the neighbor node in two hops, the new node adopts a competition mode to perform time slot occupation transmission on the unoccupied time slot;
if the hash time slot of the new node fails, the time slot selection is completed in the next frame period, and whether the unoccupied time slot can be transmitted or not can be judged in the period.
9. The distributed access method for a TDMA-based resilient long-range wireless transmission system according to claim 8, wherein in said fourth step, each node in the network holds ID information of two-hop neighbor nodes for unoccupied timeslots, and for unoccupied timeslots, each node calculates a priority value priority according to the following formula for two pairs of itself and all neighbor nodes within two hops:
priority＝(a*(id+used_slot_num)2+ c) modm formula two
Wherein ID represents the ID of the node; used _ slot _ num represents the number of data slots that have currently passed; a, c and m are parameters; the parameters a and c are coprime, and a < < m, c < < m;
if the priority value of the node is greater than the priority values of all nodes in the two-hop neighbor node, the node acquires the access right of the current time slot; otherwise, no data transmission is performed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611046324.4A CN108093469B (en) | 2016-11-22 | 2016-11-22 | Distributed access method of wireless transmission system based on TDMA |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611046324.4A CN108093469B (en) | 2016-11-22 | 2016-11-22 | Distributed access method of wireless transmission system based on TDMA |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108093469A CN108093469A (en) | 2018-05-29 |
| CN108093469B true CN108093469B (en) | 2020-11-06 |
Family
ID=62170956
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611046324.4A Expired - Fee Related CN108093469B (en) | 2016-11-22 | 2016-11-22 | Distributed access method of wireless transmission system based on TDMA |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108093469B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11425549B2 (en) * | 2017-07-17 | 2022-08-23 | Weihua Zhuang | Method of managing single-hop and multi-hop broadcast in vehicular communication networks and device therefor |
| CN111093291B (en) * | 2018-10-24 | 2023-06-20 | 北京小米松果电子有限公司 | TDMA ad hoc network, construction method thereof, node and storage medium |
| CN109219144B (en) * | 2018-11-09 | 2022-11-11 | 北京通广龙电子科技有限公司 | Method for distributing distributed resources of wireless Ad-hoc network |
| CN109600189B (en) * | 2018-12-11 | 2020-06-30 | 齐俊宇 | Time slot scheduling method based on time division multiple access TDMA protocol and self-organizing network control system |
| CN109714812B (en) * | 2019-01-07 | 2021-04-27 | 西安电子科技大学 | Low-power-consumption distributed medium access control method based on TDMA |
| CN111050290A (en) * | 2019-12-20 | 2020-04-21 | 上海有个机器人有限公司 | Multi-device communication method, medium, terminal and device based on time division multiple access |
| CN113037937B (en) * | 2019-12-25 | 2023-04-07 | 鹤壁天海电子信息系统有限公司 | Voice conference communication method and device based on centerless ad hoc network |
| CN111093217A (en) * | 2019-12-30 | 2020-05-01 | 洛阳师范学院 | Lightweight interference measurement algorithm based on TDMA |
| CN112383491B (en) * | 2020-11-06 | 2024-02-06 | 北京升哲科技有限公司 | Method, device, equipment and storage medium for determining broadcast time slot |
| CN113038623B (en) * | 2021-03-02 | 2022-11-04 | 桂林电子科技大学 | Improved method of distributed TDMA (time division multiple Access) adjacent node sensing and network access mechanism |
| CN114051267B (en) * | 2021-11-22 | 2023-10-13 | 深圳市吉祥腾达科技有限公司 | Method for optimizing time division multiplexing based on network bridge spacing |
| CN114448549B (en) * | 2022-01-28 | 2023-11-24 | 华力智芯(成都)集成电路有限公司 | Ad hoc network dynamic TDMA control time slot allocation method based on neighbor node information |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282256A (en) * | 2007-04-06 | 2008-10-08 | 华为技术有限公司 | Method and node for establishing time slot in wireless mesh network |
| CN103929824A (en) * | 2014-03-26 | 2014-07-16 | 中国人民解放军总参谋部第六十三研究所 | Wireless network node neutral access dynamic configuration method |
| CN105554887A (en) * | 2015-12-09 | 2016-05-04 | 电子科技大学 | Wireless MESH network distributed resource distribution method based on TDMA |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8059563B2 (en) * | 2008-07-31 | 2011-11-15 | Aruba Networks, Inc. | Assigning slots in a mesh network |
-
2016
- 2016-11-22 CN CN201611046324.4A patent/CN108093469B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282256A (en) * | 2007-04-06 | 2008-10-08 | 华为技术有限公司 | Method and node for establishing time slot in wireless mesh network |
| CN103929824A (en) * | 2014-03-26 | 2014-07-16 | 中国人民解放军总参谋部第六十三研究所 | Wireless network node neutral access dynamic configuration method |
| CN105554887A (en) * | 2015-12-09 | 2016-05-04 | 电子科技大学 | Wireless MESH network distributed resource distribution method based on TDMA |
Non-Patent Citations (1)
| Title |
|---|
| 基于TDMA的无线Mesh网络时隙分配算法研究与实现;邱鹏飞;《电子科技大学硕士学位论文》;20160331;第3.1.4节和第4.4.3节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108093469A (en) | 2018-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| CN108235437B (en) | Wireless mobile self-organizing network channel time slot scheduling and distributing method | |
| US7142527B2 (en) | System and method for transmission scheduling using network membership information and neighborhood information | |
| JP4105090B2 (en) | System and method for collision-free transmission scheduling using proximity information and advertised transmission time | |
| KR100757260B1 (en) | Method for implementing scatter-net in wireles personal area network | |
| US9281865B2 (en) | Efficient network discovery in frequency hopping networks | |
| Huang et al. | RC-MAC: A receiver-centric MAC protocol for event-driven wireless sensor networks | |
| AU2002313823A1 (en) | System and method for collision-free transmission scheduling using neighborhood information and advertised transmission times | |
| JP2008172784A (en) | Dynamic link management of data path in a mobile ad hoc network | |
| CN109996189B (en) | System for cooperative repetition of broadcast messages | |
| EP1371183B1 (en) | System and method for transmission scheduling using network membership information and neighborhood information | |
| Diab et al. | Hybrid multi-channel mac protocol for wireless sensor networks: Interference rate evaluation | |
| Minet et al. | An adaptive schedule for TSCH networks in the industry 4.0 | |
| Pavkovic et al. | Cluster-directed acyclic graph formation for ieee 802.15. 4 in multihop topologies | |
| Wang et al. | HD-MAC: A throughput enhancing TDMA-based protocol in high dynamic environments | |
| US10772095B1 (en) | Optimized unicast and broadcast communication in TSCH primary and secondary networks | |
| KR20100006314A (en) | Method for transmitting and receiving data using multi-channel in wireless sensor networks | |
| Diab et al. | Channel allocation evaluation for a multi-channel MAC protocol | |
| Vishnevsky et al. | Beaconing for MDA support in IEEE 802.11 s mesh networks | |
| Bhuiyan et al. | I-MAC: Energy efficient intelligent MAC protocol for wireless sensor networks | |
| Seo et al. | Distributed TDMA MAC Protocol with Source-Driven Combined Resource Allocation in Ad Hoc Networks | |
| Loscri | A new distributed scheduling scheme for wireless mesh networks | |
| Loscri | MAC schemes for ad-hoc wireless networks | |
| Li et al. | A State-Interactive MAC Layer TDMA Protocol Based on Smart Antennas | |
| Mu et al. | Performance Modeling and Analysis of Wireless Multi-hop Hierarchical Ad Hoc Network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201106 |