CN106658735B - Long propagation time delay wireless link time slot allocation method based on TDMA - Google Patents
Long propagation time delay wireless link time slot allocation method based on TDMA Download PDFInfo
- Publication number
- CN106658735B CN106658735B CN201710021841.4A CN201710021841A CN106658735B CN 106658735 B CN106658735 B CN 106658735B CN 201710021841 A CN201710021841 A CN 201710021841A CN 106658735 B CN106658735 B CN 106658735B
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- frame
- synchronous
- network access
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0685—Clock or time synchronisation in a node; Intranode synchronisation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Time-Division Multiplex Systems (AREA)
Abstract
The invention discloses a TDMA-based long-propagation time-delay wireless link time slot allocation method, which mainly solves the problems of low throughput rate and low channel utilization rate of the conventional long-propagation time-delay wireless self-organizing network. The implementation scheme is as follows: 1. initializing a node; 2. judging whether the node receives a synchronization frame, if so, performing network access synchronization on the node, otherwise, establishing a network by taking a local clock as a reference; 3. after synchronization is completed, the nodes automatically generate a superframe structure, and the local time is divided into a plurality of different functional time slots; 4. and the node judges whether the current time slot is a service time slot, if so, the node receives and transmits data, and otherwise, the node updates network information. The invention adopts TDMA as a channel access mode, so that the nodes can access the channel without conflict, and through a transmission mechanism and a data frame queue scheduling mechanism, the network throughput rate and the channel utilization rate are improved, the queuing time delay of data frames is reduced, and the invention can be used for a time division multiple access self-organizing network.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a time slot allocation method which can be used for a time division multiple access TDMA self-organizing network.
Background
The conventional time slot allocation method is to allocate a number of time slots in a frame to a certain node in the network, where the node transmits data in the time slots and receives data in the remaining time slots. Under the condition of a long propagation delay wireless link, such as an inter-satellite link of a satellite ad hoc network, the TDMA protocol needs to set the guard interval of one time slot to be long enough to ensure that data transmission of a certain node in a certain time slot does not affect data transmission of a certain node in the next time slot, and the time duration of the time slot is increased due to the increase of the time duration of the guard interval. When the propagation delay of a wireless link is longer than the transmission delay, the guard interval duration will reach more than half of the time slot duration, in this case, the network throughput rate and the channel utilization rate are both low, and the queuing delay of data frames is large, so the existing TDMA protocol cannot meet the self-organizing network with high traffic demand, and meanwhile, the protocol real-time performance is poor due to the long time slot duration.
At present, in a satellite ad hoc network, most of MAC protocols adopted among satellites are based on a CSMA/CA mechanism of IEEE 802.11, and under such a mechanism, the problems of low network throughput and low channel utilization rate also exist, the time for accessing a channel is generally long, and the queuing delay of data frames is large.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a TDMA-based long propagation delay wireless link time slot allocation method, so that under the condition that the propagation delay is greater than the transmission delay wireless link, the network throughput rate and the channel utilization rate are improved, and the queuing delay of data frames is reduced.
The technical scheme of the invention is to improve the channel access mode of the existing satellite self-organizing network, and adopts a contention-free TDMA mode to access the channel; aiming at the characteristic that the inter-satellite link propagation delay is often larger than the transmission delay, a retransmission mechanism is introduced, namely, when the node A transmits data to the node B, the node B also transmits the data to the node A, and each time slot of a TDMA protocol is distributed to a pair of nodes in a network, so that the network throughput rate and the channel utilization rate are improved; and through adding the data frame queue scheduling mechanism based on frame structure of the system, reduce the queuing delay of the data frame, its implementation step includes:
(1) initializing the nodes:
(1a) setting the node state as asynchronous;
(1b) setting the number of network establishment failures as 0;
(2) judging whether the node receives a synchronous frame in m superframe periods, if so, executing the step (3), otherwise, executing the step (4),
(3) and (3) carrying out network access synchronization by the nodes:
(3a) starting a superframe timer to finish coarse synchronization of network access synchronization;
(3b) sending a network access request frame to request network access, and waiting for a network access response frame of a synchronous frame source node;
(3c) judging whether a network access response frame is received, if so, executing the step (3d), otherwise, executing the step (3 f);
(3d) subtracting the time of sending the last bit of the network access request frame from the time of starting to receive the first bit of the network access response frame to obtain the link propagation delay of the source node address in the synchronization frame, subtracting the link propagation delay from the original superframe starting time to obtain a new superframe starting time, finishing fine synchronization, and setting the node state as synchronization;
(3e) automatically generating a superframe structure according to the number of network nodes in the synchronous frame and the neighbor information, and executing the step (5);
(3f) randomly waiting for s superframe periods, and returning to the step (2), wherein
(4) The nodes establish a network by taking a local clock as a reference clock:
(4a) in s superframe periods, judging whether the node receives the synchronous frame, if so, returning to the step (3), otherwise, executing the step (4b), wherein
(4b) Starting a superframe timer, starting a synchronous time slot, and sending a synchronous frame in a synchronous sub-time slot of the synchronous time slot;
(4c) judging whether the network access request sub-time slot of the synchronous time slot receives a network access request frame, if so, executing the step (4d), otherwise, executing the step (4 f);
(4d) sending a network access response frame in the network access response sub-time slot of the synchronous time slot;
(4e) automatically generating a superframe structure according to the source node address of the network access request frame, finishing the synchronous time slot and executing the step (5);
(4f) adding 1 to the number of network establishment failures;
(4g) judging whether the network building failure times are larger than or equal to the maximum node number in the network, if so, executing the step (4a), otherwise, returning to the step (2);
(5) the node receives or sends data:
(5a) starting a service time slot, judging whether the address of the node belongs to the node group of the service time slot, if so, executing the step (5b), otherwise, executing the step (5 g);
(5b) judging whether the link propagation delay with another node except the node in the node group is greater than the sum of the physical layer transmission delay and the antenna transceiving conversion time, if so, executing the step (5c), otherwise, executing the step (5 e);
(5c) adopting a sending mechanism, scheduling a data frame of which the destination node is another node in the node group from the data frame queue, and sending the data frame in the sending sub-time slot of the service time slot;
(5d) receiving a data frame of another node except the node in the node group in the receiving sub-time slot of the service time slot, and executing the step (5 h);
(5e) judging whether the node is the main sending node of the service time slot or not according to the parity of the multiframe number and the parity of the time slot number, if so, executing the step (5f), otherwise, executing the step (5 g);
(5f) dispatching the first frame data at the head of the queue from the data frame queue, sending the first frame data in the sending sub-time slot of the service time slot, and executing the step (5 h);
(5g) receiving a data frame on a channel at a service time slot;
(5h) when the current service time slot is finished, judging whether the next time slot is a service time slot, if so, executing the step (5a), otherwise, executing the step (6);
(6) starting a synchronous time slot, judging whether the current synchronous time slot is the synchronous time slot of the node, if so, executing the step (7), otherwise, executing the step (8);
(7) the node broadcasts the information of the network:
(7a) the node constructs a synchronous frame according to the information of the network;
(7b) transmitting a synchronization frame in a synchronization sub-slot of a synchronization slot;
(7c) judging whether the network access request sub-time slot of the synchronous time slot receives a network access request frame, if so, executing the step (7d), otherwise, the node waits until the synchronous time slot is finished, and returning to the step (5);
(7d) sending a network access response frame in the network access response sub-time slot of the synchronous time slot;
(7e) automatically generating a new superframe structure according to the source node address of the network access request frame, ending the synchronous time slot and returning to the step (5);
(8) the node updates the information of the network:
(8a) the node receives the synchronous frames of other nodes in the synchronous sub-time slot of the synchronous time slot;
(8b) subtracting the original superframe starting time from the first bit time of the received synchronous frame to obtain a new link propagation delay with a synchronous frame source node;
(8c) automatically generating a new superframe structure according to the number of network nodes and neighbor information in the synchronous frame;
(8d) judging whether the network access response sub-time slot of the current synchronous time slot receives the network access response frame, if so, executing the step (8e), otherwise, the node waits until the current synchronous time slot is finished, and returning to the step (5);
(8e) and (5) automatically generating a new superframe structure according to the destination node address in the network access response frame, ending the synchronous time slot and returning to the step (5).
Compared with the prior art, the invention has the following advantages:
first, the invention, because of adopting TDMA technology to access the channel, overcomes the conflict collision problem caused by the prior art that the node accesses the channel through the competition mode based on CSMA/CA, so that all the nodes in the invention can send and receive data in the allocated time slot without conflict, and the speed and efficiency of accessing the channel are improved.
Secondly, because the invention introduces a sending mechanism and allocates each time slot of the TDMA protocol to the nodes in the network according to a new strategy, the problem that the CSMA/CA mechanism and the traditional TDMA mechanism have low network throughput and channel utilization under the condition that the propagation delay is higher than the transmission delay in the prior art is solved, so that any pair of nodes in the network can simultaneously send data to each other and receive the data of the other side in the allocated time slot under the condition that the link propagation delay is greater than the transmission delay, and the network throughput and the channel utilization are improved.
Thirdly, because the invention introduces a data frame queue scheduling mechanism based on a system frame structure, the problem that the queuing time delay of the data frames in the queue is larger because the node only has one frame data to be dequeued and sent in one multiframe in the prior art is solved, so that any node in the invention has multi-frame data to be dequeued and sent in one multiframe, and the queuing time delay of the data frames is reduced.
Drawings
FIG. 1 is a flow chart of an implementation of the present invention;
FIG. 2 is a diagram illustrating the structure of three types of control frames in the present invention;
FIG. 3 is a diagram of the structure of the synchronization time slot and the traffic time slot in the present invention;
FIG. 4 is a diagram illustrating the structure of an automatically generated superframe according to the present invention;
FIG. 5 is a schematic diagram of the present invention of the hair-up mechanism;
Detailed Description
The present invention will be described in further detail below with reference to the accompanying drawings.
The use scene of the invention is a wireless self-organizing network with long propagation delay, such as a satellite self-organizing network, supposing that 4 satellites are in space, the 4 satellites are nodes in the satellite self-organizing network, each network node divides local time into a plurality of superframes according to the time slot allocation method provided by the invention, divides each superframe into a plurality of multiframes, divides each multiframe into a plurality of time slots with different functions, and each network node implements the implementation steps of the invention in the superframe to complete the establishment of the satellite self-organizing network, realize conflict-free high-speed communication among the nodes, and enable the network to have the characteristics of high throughput and high channel utilization rate.
The steps for carrying out the present invention are described in further detail with reference to fig. 1.
(1a) Setting the node state as asynchronous;
(1b) and setting the network establishment failure times to be 0.
the synchronization frame refers to a control frame used by a node to complete coarse synchronization of network access synchronization and update link propagation delay with other nodes in a network, and the structure of the synchronization frame is shown in fig. 2(a), and the synchronization frame includes a first training sequence, a source node address, a network node number, neighbor information, and a check sequence CRC, where:
the first training sequence is used for judging whether the received control frame is a synchronous frame;
the source node address is used for recording the node address for sending the synchronous frame;
the number of the network nodes is used for recording the number of the nodes of the network where the nodes sending the synchronous frames are located;
neighbor information for recording addresses of each node in a network where the node sending the synchronization frame is located;
the check sequence CRC is used for error correction of the data frame.
And 3, carrying out network access synchronization by the nodes.
(3a) Starting a superframe timer to finish coarse synchronization of network access synchronization;
(3b) sending a network access request frame to request network access, and waiting for a network access response frame of a synchronous frame source node;
the network access request frame is as follows: the structure of the control frame is shown in fig. 2(b), and the control frame includes a second training sequence, a destination node address, a source node address, a type field, and a check sequence CRC, where the second training sequence is used to determine whether a received control frame is a network access request frame or a network access response frame; the destination node address is used for recording the destination node address of the network access request frame or the network access response frame; and the type field is used for distinguishing the network access request frame and the network access response frame.
The network access response frame is as follows: the structure of the control frame sent to the source node of the network access request frame when the node responds to the network access request and completes the fine synchronization of the network access synchronization is as shown in fig. 2(c), and the control frame includes a second training sequence, a destination node address, a source node address, a type field, and a check sequence CRC.
(3c) And (4) judging whether a network access response frame is received, if so, executing the step (3d), and otherwise, executing the step (3 f).
(3d) Subtracting the time of sending the last bit of the network access request frame from the time of starting to receive the first bit of the network access response frame to obtain the link propagation delay of the source node address in the synchronization frame, subtracting the link propagation delay from the original superframe starting time to obtain a new superframe starting time, finishing fine synchronization, and setting the node state as synchronization;
(3e) automatically generating a superframe structure according to the number of network nodes in the synchronous frame, the neighbor information and the start time of a new superframe after fine synchronization:
(3e1) a node divides a superframe into x multiframes, wherein x is the maximum node number in the network;
(3e2) dividing a multiframe into a synchronous time slot BSn and (x-1) order plus service time slots, wherein n is a multiframe number;
(3e3) dividing each synchronization time slot into a synchronization sub-time slot, a network access request sub-time slot and a network access response sub-time slot, as shown in fig. 3(a), wherein the synchronization sub-time slot is used for transmitting or receiving a synchronization frame, the network access request sub-time slot is used for transmitting or receiving a network access request frame, and the network access response sub-time slot is used for transmitting or receiving a network access response frame;
(3e4) dividing each service time slot into a transmitting sub-time slot and a receiving sub-time slot, as shown in fig. 3(b), wherein the transmitting sub-time slot is used for transmitting a data frame, and the receiving sub-time slot is used for receiving the data frame transmitted by using a peer-to-peer mechanism;
(3e5) the method comprises the steps that a synchronous time slot BSn is distributed to a node with a node address of n, a service time slot is sequentially distributed to a pair of nodes corresponding to each link in a network, in the pair of nodes, the node with the smaller node address serves as a main node of the service time slot, and the node with the larger node address serves as a secondary node of the service time slot; distributing service time slots for each link according to the sequence of distributing service time slots to all links of the node with the smaller node address and distributing service time slots to all links of the node with the larger node address; if all links have idle service time slots after being allocated, the idle service time slots are reallocated once according to the rule until all the time slots are allocated, and the automatically generated superframe structure is shown in figure 4 and the step 5 is executed;
(3f) randomly waiting for s superframe periods, and returning to step 2, wherein
And 4, establishing a network by the node by taking the local clock as a reference clock.
(4a) In s superframe periods, judging whether the node receives the synchronous frame, if so, returning to the step 3, otherwise, executing the step (4b), wherein
(4b) Starting a superframe timer, starting a synchronous time slot, and sending a synchronous frame in a synchronous sub-time slot of the synchronous time slot;
(4c) judging whether the network access request sub-time slot of the synchronous time slot receives a network access request frame, if so, executing the step (4d), otherwise, executing the step (4 e);
(4d) sending a network access response frame in a network access response sub-time slot of the synchronous time slot, automatically generating a superframe structure according to the source node address of the network access request frame, finishing the synchronous time slot and executing the step 5;
(4e) adding 1 to the number of network establishment failures;
(4f) and (4) judging whether the network establishment failure times are more than or equal to the maximum node number in the network, if so, returning to the step (4a), otherwise, returning to the step 2.
And 5, the node receives or transmits the data.
(5a) Starting a service time slot, judging whether the address of the node belongs to the node group of the service time slot, if so, executing the step (5b), otherwise, executing the step (5 g);
(5b) judging whether the link propagation delay with another node except the node in the node group is greater than the sum of the physical layer transmission delay and the antenna transceiving conversion time, if so, executing the step (5c), otherwise, executing the step (5 e);
(5c) adopting a sending mechanism, scheduling a data frame of which the destination node is another node in the node group from the data frame queue, and sending the data frame in the sending sub-time slot of the service time slot;
the sending mechanism, as shown in fig. 5, refers to: any two nodes in the network send a frame of data to each other at the same time and receive the data of each other at the same time, and because the link propagation delay is greater than the sum of the physical layer transmission delay and the antenna transceiving conversion time, the two nodes do not generate collision between the sending data and the receiving data;
(5d) receiving a data frame of another node except the node in the node group in the receiving sub-time slot of the service time slot, and executing the step (5 h);
(5e) judging whether the node is the main sending node of the service time slot or not according to the parity of the multiframe number and the parity of the time slot number, if so, executing the step (5f), otherwise, executing the step (5 g);
(5f) dispatching the first frame data at the head of the queue from the data frame queue, sending the first frame data in the sending sub-time slot of the service time slot, and executing the step (5 h);
(5g) receiving a data frame on a channel at a service time slot;
(5h) and (5) judging whether the next time slot is the service time slot or not when the current service time slot is finished, if so, executing the step (5a), and otherwise, executing the step 6.
And 6, starting the synchronous time slot, judging whether the current synchronous time slot is the synchronous time slot of the node, if so, executing the step 7, otherwise, executing the step 8.
And 7, broadcasting the information of the network where the node is located by the node.
(7a) The node constructs a synchronous frame according to the information of the network;
(7b) transmitting a synchronization frame in a synchronization sub-slot of a synchronization slot;
(7c) judging whether the network access request sub-time slot of the synchronous time slot receives a network access request frame, if so, executing the step (7d), otherwise, the node waits until the synchronous time slot is finished, and returning to the step 5;
(7d) and (5) sending a network access response frame in the network access response sub-time slot of the synchronous time slot, automatically generating a new superframe structure according to the source node address of the network access request frame, ending the synchronous time slot, and returning to the step 5.
And 8, the node updates the information of the network.
(8a) The node receives the synchronous frames of other nodes in the synchronous sub-time slot of the synchronous time slot;
(8b) subtracting the original superframe starting time from the first bit time of the received synchronous frame to obtain a new link propagation delay with a synchronous frame source node, and automatically generating a new superframe structure according to the number of network nodes and neighbor information in the synchronous frame;
(8c) judging whether the network access response sub-time slot of the current synchronous time slot receives the network access response frame, if so, executing the step (8d), otherwise, the node waits until the current synchronous time slot is finished, and returning to the step 5;
(8d) and (5) automatically generating a new superframe structure according to the destination node address in the network access response frame, ending the synchronous time slot and returning to the step 5.
The foregoing description is only an example of the present invention and should not be construed as limiting the invention, as it will be apparent to those skilled in the art that various modifications and variations in form and detail can be made without departing from the principle and structure of the invention after understanding the present disclosure and the principles, but such modifications and variations are considered to be within the scope of the appended claims.
Claims (6)
1. A long propagation time delay wireless link time slot distribution method based on TDMA includes the following steps:
(1) initializing the nodes:
(1a) setting the node state as asynchronous;
(1b) setting the number of network establishment failures as 0;
(2) judging whether the node receives a synchronous frame in m superframe periods, if so, executing the step (3), otherwise, executing the step (4),
(3) and (3) carrying out network access synchronization by the nodes:
(3a) starting a superframe timer to finish coarse synchronization of network access synchronization;
(3b) sending a network access request frame to request network access, and waiting for a network access response frame of a synchronous frame source node;
(3c) judging whether a network access response frame is received, if so, executing the step (3d), otherwise, executing the step (3 f);
(3d) subtracting the time of sending the last bit of the network access request frame from the time of starting to receive the first bit of the network access response frame to obtain the link propagation delay of the source node address in the synchronization frame, subtracting the link propagation delay from the original superframe starting time to obtain a new superframe starting time, finishing fine synchronization, and setting the node state as synchronization;
(3e) automatically generating a superframe structure according to the number of network nodes in the synchronous frame and the neighbor information, and executing the step (5);
(3f) randomly waiting for s superframe periods, returning to step (2), whichIn
(4) The nodes establish a network by taking a local clock as a reference clock:
(4a) judging whether the node receives the synchronous frame or not in s superframe periods which are randomly waited, if so, returning to the step (3), otherwise, executing the step (4b), wherein
(4b) Starting a superframe timer, starting a synchronous time slot, and sending a synchronous frame in a synchronous sub-time slot of the synchronous time slot;
(4c) judging whether the network access request sub-time slot of the synchronous time slot receives a network access request frame, if so, executing the step (4d), otherwise, executing the step (4 f);
(4d) sending a network access response frame in the network access response sub-time slot of the synchronous time slot;
(4e) automatically generating a superframe structure according to the source node address of the network access request frame, finishing the synchronous time slot and executing the step (5);
(4f) adding 1 to the number of network establishment failures;
(4g) judging whether the network building failure times are larger than or equal to the maximum node number in the network, if so, returning to the step (2), otherwise, executing the step (4 a);
(5) the node receives or sends data:
(5a) starting a service time slot, judging whether the address of the node belongs to the node group of the service time slot, if so, executing the step (5b), otherwise, executing the step (5 g);
(5b) judging whether the link propagation delay with another node except the node in the node group is greater than the sum of the physical layer transmission delay and the antenna transceiving conversion time, if so, executing the step (5c), otherwise, executing the step (5 e);
(5c) adopting a sending mechanism, scheduling a data frame of which the destination node is another node in the node group from the data frame queue, and sending the data frame in the sending sub-time slot of the service time slot;
(5d) receiving a data frame of another node except the node in the node group in the receiving sub-time slot of the service time slot, and executing the step (5 h);
(5e) judging whether the node is the main sending node of the service time slot or not according to the parity of the multiframe number and the parity of the time slot number, if so, executing the step (5f), otherwise, executing the step (5 g);
(5f) dispatching the first frame data at the head of the queue from the data frame queue, sending the first frame data in the sending sub-time slot of the service time slot, and executing the step (5 h);
(5g) receiving a data frame on a channel at a service time slot;
(5h) when the current service time slot is finished, judging whether the next time slot is a service time slot, if so, executing the step (5a), otherwise, executing the step (6);
(6) starting a synchronous time slot, judging whether the current synchronous time slot is the synchronous time slot of the node, if so, executing the step (7), otherwise, executing the step (8);
(7) the node broadcasts the information of the network:
(7a) the node constructs a synchronous frame according to the information of the network;
(7b) transmitting a synchronization frame in a synchronization sub-slot of a synchronization slot;
(7c) judging whether the network access request sub-time slot of the synchronous time slot receives a network access request frame, if so, executing the step (7d), otherwise, the node waits until the synchronous time slot is finished, and returning to the step (5);
(7d) sending a network access response frame in the network access response sub-time slot of the synchronous time slot;
(7e) automatically generating a new superframe structure according to the source node address of the network access request frame, ending the synchronous time slot and returning to the step (5);
(8) the node updates the information of the network:
(8a) the node receives the synchronous frames of other nodes in the synchronous sub-time slot of the synchronous time slot;
(8b) subtracting the original superframe starting time from the first bit time of the received synchronous frame to obtain a new link propagation delay with a synchronous frame source node;
(8c) automatically generating a new superframe structure according to the number of network nodes and neighbor information in the synchronous frame;
(8d) judging whether the network access response sub-time slot of the current synchronous time slot receives the network access response frame, if so, executing the step (8e), otherwise, the node waits until the current synchronous time slot is finished, and returning to the step (5);
(8e) and (5) automatically generating a new superframe structure according to the destination node address in the network access response frame, ending the synchronous time slot and returning to the step (5).
2. The method of claim 1, wherein: the synchronization frame in step (2) refers to a control frame used by a node to complete coarse synchronization of network access synchronization and update link propagation delay with other nodes in the network, and includes a first training sequence, a source node address, a network node number, neighbor information and a check sequence CRC.
3. The method of claim 1, wherein: the network access request frame in step (3b) refers to a fine synchronization control frame used by the node to initiate a network access request and complete network access synchronization, and includes a second training sequence, a destination node address, a source node address, a type field, and a check sequence CRC.
4. The method of claim 1, wherein: the network access response frame in step (3b) refers to a fine synchronization control frame used by the node to respond to the network access request and complete the network access synchronization, and includes a second training sequence, a destination node address, a source node address, a type field, and a check sequence CRC.
5. The method of claim 1, wherein: automatically generating a superframe structure in the step (3e), and performing the following steps:
(3e1) a node divides a superframe into x multiframes, wherein x is the maximum node number in the network;
(3e2) dividing a multiframe into a synchronous time slot BSn and (x-1) order plus service time slots, wherein n is a multiframe number;
(3e3) the synchronous time slot BSn is distributed to the node with the node address n, and the service time slot is distributed according to the following rule: sequentially allocating a pair of nodes corresponding to each link in the network, wherein in the pair of nodes, the node with the smaller node address is used as the main node of the service time slot, and the node with the larger node address is used as the secondary node of the service time slot; and then allocating service time slots for each link according to the sequence of allocating the service time slots to all links of the node with the smaller node address and allocating the service time slots to all links of the node with the larger node address, and if all links have idle service time slots after allocation, allocating the service time slots once again according to the rule until all the time slots are allocated.
6. The method of claim 1, wherein: the transmission mechanism in step (5c) means that any two nodes in the network transmit one frame of data to each other at the same time and receive the data of each other at the same time, and since the link propagation delay is greater than the sum of the physical layer transmission delay and the antenna transceiving conversion time, the two nodes do not generate collision between the transmitted data and the received data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710021841.4A CN106658735B (en) | 2017-01-12 | 2017-01-12 | Long propagation time delay wireless link time slot allocation method based on TDMA |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710021841.4A CN106658735B (en) | 2017-01-12 | 2017-01-12 | Long propagation time delay wireless link time slot allocation method based on TDMA |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106658735A CN106658735A (en) | 2017-05-10 |
| CN106658735B true CN106658735B (en) | 2020-02-07 |
Family
ID=58843838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710021841.4A Active CN106658735B (en) | 2017-01-12 | 2017-01-12 | Long propagation time delay wireless link time slot allocation method based on TDMA |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106658735B (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107889254B (en) * | 2017-11-08 | 2020-12-08 | 上海酷芯微电子有限公司 | Communication method, communication device and medium for wireless ad hoc network |
| CN107979872B (en) * | 2017-11-10 | 2021-06-01 | 西安电子科技大学 | Multi-frequency time division multiple access system and method based on directional antenna |
| CN108055115B (en) * | 2018-01-08 | 2020-08-04 | 西安电子科技大学 | Time slot group scheduling method in distributed TDMA protocol |
| CN109152079B (en) * | 2018-07-05 | 2021-09-07 | 东南大学 | Time slot scheduling and channel allocation method for TSCH (three-channel switched capacitor) network |
| CN109560888B (en) * | 2018-12-20 | 2019-11-12 | 湖南智领通信科技有限公司 | Node Events information broadcast method based on direction strobe utility |
| CN109862618B (en) * | 2019-03-07 | 2023-09-19 | 王成 | Wireless communication method based on TDMA and CSMA/CA |
| CN109729591B (en) * | 2019-03-25 | 2022-04-05 | 重庆邮电大学 | Time division multiple access time slot allocation method based on genetic algorithm |
| CN110290121B (en) * | 2019-06-13 | 2021-10-08 | 曲阜师范大学 | Method for realizing low-delay high-throughput asynchronous ALT-MAC protocol |
| CN110493893B (en) * | 2019-09-02 | 2022-10-18 | 上海无线电设备研究所 | Self-adaptive dynamic networking method |
| CN110856194B (en) * | 2019-11-13 | 2022-08-02 | 珠海中慧微电子有限公司 | Dual-mode fusion networking method and communication method |
| CN111294907B (en) * | 2020-03-13 | 2022-06-24 | 青岛交互物联科技有限公司 | Low-power-consumption high-interference-resistance wireless networking method |
| CN111866946B (en) * | 2020-06-30 | 2023-10-10 | 北京瀚诺半导体科技有限公司 | Bandwidth allocation method and system |
| CN112929970B (en) * | 2021-01-20 | 2022-08-12 | 西安电子科技大学 | Self-organizing network time slot distribution method based on priority |
| CN112929960B (en) * | 2021-02-04 | 2022-07-12 | 重庆邮电大学 | Method for supporting IPv6 and improving wireless sensor network certainty |
| CN115297523B (en) * | 2022-07-22 | 2023-05-19 | 中国水产科学研究院渔业工程研究所 | Channel access method for slipway-shore communication during operation of marine fleet |
| CN116015351B (en) * | 2022-11-08 | 2024-04-02 | 西安电子科技大学 | Anti-interference multiple access method in self-organizing network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651969A (en) * | 2009-09-14 | 2010-02-17 | 西安交通大学 | Implement method of power control cognition MAC protocol based on time division multiple access (TDMA) |
| CN102802266A (en) * | 2012-09-11 | 2012-11-28 | 电子科技大学 | Implementation method of high dynamic self-organization network high efficiency TDMA (time division multiple address) protocol |
| CN105263143A (en) * | 2015-10-30 | 2016-01-20 | 西安电子科技大学 | Self-adaptive time slot allocation method according to node density and loads in self-organizing network |
-
2017
- 2017-01-12 CN CN201710021841.4A patent/CN106658735B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651969A (en) * | 2009-09-14 | 2010-02-17 | 西安交通大学 | Implement method of power control cognition MAC protocol based on time division multiple access (TDMA) |
| CN102802266A (en) * | 2012-09-11 | 2012-11-28 | 电子科技大学 | Implementation method of high dynamic self-organization network high efficiency TDMA (time division multiple address) protocol |
| CN105263143A (en) * | 2015-10-30 | 2016-01-20 | 西安电子科技大学 | Self-adaptive time slot allocation method according to node density and loads in self-organizing network |
Non-Patent Citations (2)
| Title |
|---|
| A Novel Resource Allocation Scheme Based on Multi-satellite Terminals in MF-TDMA Satellite Systems;Dongdong Qiu等;《IEEE》;20131231;第1483-1488页 * |
| TDMA 时隙分配对业务时延性能的影响分析;秦勇等;《电子学报》;20091031;第2277-2283页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106658735A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106658735B (en) | Long propagation time delay wireless link time slot allocation method based on TDMA | |
| CN108235437B (en) | Wireless mobile self-organizing network channel time slot scheduling and distributing method | |
| US7447180B2 (en) | Wireless media access method | |
| US20210219287A1 (en) | Fast wireless local area network communication method and apparatus using multiple transfer rate partitioning and cooperative transmission | |
| KR102658049B1 (en) | Method and node device for allocating resources in wireless sensor networks | |
| CN108430111B (en) | Mixed type time slot reservation method in distributed TDMA protocol | |
| CN101977385B (en) | DSAM (Dynamic Slot-time Allocation Method) of scale-extensible single-jump ad hoc network supporting QoS (Quality of Service) | |
| CN109561513B (en) | Distributed conflict-free ad hoc network multiple access protocol | |
| US8644213B2 (en) | Mobile data communication method and system using improved medium access control protocol | |
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| CN101651969B (en) | Implement method of power control cognition MAC protocol based on time division multiple access (TDMA) | |
| CN102300257A (en) | Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network | |
| CN111836399B (en) | Channel access protocol design method and time slot allocation method for broadband carrier communication network | |
| EP0720310B1 (en) | Random access system for mobile communication | |
| CN105744641B (en) | A kind of orientation time-division link scheduling method suitable for wireless mesh network | |
| CN101291262A (en) | Voice communication method based on mobile sensor network | |
| CN105050117A (en) | Ad-hoc network communication method based on business type competition and coordination time division multiple access (TDMA) | |
| CN104853385A (en) | Dynamic mechanism for efficient information transmission in WIFI system based on OFDMA technology | |
| WO2015103834A1 (en) | Method, device and system for realizing vlc dynamic access | |
| WO2014036964A1 (en) | Method and apparatus for processing multi-timeslot or multi-subframe resources | |
| CN100452745C (en) | Multi-address access method with the confliction decomposition | |
| Singh et al. | A cross-layer MAC protocol for contention reduction and pipelined flow optimization in wireless sensor networks | |
| CN106936557B (en) | Wireless channel resource allocation method | |
| CN100521581C (en) | Multi-address access method for service quality guarantee | |
| CN104837211A (en) | Multi-channel multiple access method based on MIMO transmission mechanism |
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 |