CN117676834A - Time slot multiplexing ad hoc network method based on hop count - Google Patents
Time slot multiplexing ad hoc network method based on hop count Download PDFInfo
- Publication number
- CN117676834A CN117676834A CN202311587298.6A CN202311587298A CN117676834A CN 117676834 A CN117676834 A CN 117676834A CN 202311587298 A CN202311587298 A CN 202311587298A CN 117676834 A CN117676834 A CN 117676834A
- Authority
- CN
- China
- Prior art keywords
- time slot
- node
- nodes
- group
- micro
- 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 24
- 230000007246 mechanism Effects 0.000 claims abstract description 12
- ODCKICSDIPVTRM-UHFFFAOYSA-N [4-[2-hydroxy-3-(propan-2-ylazaniumyl)propoxy]naphthalen-1-yl] sulfate Chemical compound C1=CC=C2C(OCC(O)CNC(C)C)=CC=C(OS(O)(=O)=O)C2=C1 ODCKICSDIPVTRM-UHFFFAOYSA-N 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 claims description 4
- 230000011664 signaling Effects 0.000 claims description 4
- 230000006855 networking Effects 0.000 description 15
- 238000004891 communication Methods 0.000 description 8
- 238000013461 design Methods 0.000 description 7
- 235000008694 Humulus lupulus Nutrition 0.000 description 6
- 241000854291 Dianthus carthusianorum Species 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000006467 substitution reaction Methods 0.000 description 4
- 230000004075 alteration Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a time slot multiplexing ad hoc network method based on hop count, which comprises the following steps: dividing the nodes of the whole network into cells with different geographic coverage according to positions and distances, wherein the area of each cell is 4-hop maximum coverage area, and different time slots are allocated to different cells to realize time slot multiplexing among the cells of the whole network; dividing a time axis into 4 superslots, and allocating different superslots to each cell based on a multiplexing principle; dividing nodes in each cell into intra-group nodes and inter-group nodes; in time slot allocation, the nodes in the group only participate in the time slot allocation of the cell, and the nodes between the groups allocate the time slots of the corresponding cells when communicating with the nodes of which cell according to service requirements; when the node in the cell forwards, different time slot allocation mechanisms are used according to different hop counts. The invention realizes multiplexing of time slot resources, and obviously improves the throughput and network capacity of the whole network by reasonably setting a grouping principle and an intra-group time slot multiplexing method.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a hop-count-based time slot multiplexing ad hoc network method.
Background
With the wide popularization of mobile devices and the continuous development of wireless communication technologies, ad Hoc networks (Ad Hoc networks) are widely applied to the fields of military, emergency, fire protection and the like as a novel network mode. In the ad hoc network, different nodes can directly communicate through relays among the nodes, a fixed router and a switch are not needed, a flexible networking mechanism is provided, but a networking protocol is relatively complex, the networking efficiency is low, especially when a large number of nodes are networked, the networking efficiency is possibly reduced sharply, the networking communication of normal service is seriously influenced, and how to improve the networking transmission efficiency becomes a key technology of the ad hoc network protocol design.
The ad hoc network generally adopts a time division mode to realize the sharing of channels by a plurality of users, and each user is allocated with different working time slots to realize the conflict-free networking communication by dividing the time into different time slots. The real-time slot allocation method mainly includes random contention mode, such as Aloha protocol, CSMA protocol, etc., and fixed or dynamic allocation slot mode, such as TDMA, DTDMA protocol, etc. Although various time slot allocation algorithms are developed according to different networking demands, due to lack of a centralized scheduling mechanism in the ad hoc network, the complexity of scheduling and allocation of time slots in the whole network is increased sharply when the number of nodes is large, so that the networking signaling overhead is increased greatly, the networking efficiency is reduced, and even networking communication is not possible. At present, a clustering method is generally adopted to solve the problem of large-scale node ad hoc network, the nodes are divided into different clusters, the clusters are communicated through cluster head nodes, and the nodes in the clusters can be directly communicated with each other. Although the clustering method can reduce the problem of network performance degradation after the node scale is increased to a certain extent, cluster head nodes often become the bottleneck of communication. In addition, the cluster head node may fail, and the self-organizing election mechanism of the cluster head node is often complex, so that the robustness of the network is poor.
Disclosure of Invention
Aiming at the problems faced by the large-scale node ad hoc network protocol, the invention designs a hop-based time slot multiplexing ad hoc network protocol design method, nodes are divided into different groups which are adjacent geographically according to the coverage range of hop numbers, different time slots are allocated for the different groups based on the idea of a honeycomb to realize time slot multiplexing, and meanwhile, the time slot multiplexing is carried out in one group based on the hop numbers, so that the time slot use efficiency is obviously improved.
In order to achieve the above object, the present invention discloses a hop count-based time slot multiplexing ad hoc network method, which comprises the following steps:
in order to improve the time slot efficiency, grouping the nodes of the whole network according to the positions and the distances, dividing different groups into cells with geographically different coverage, wherein the area of each cell is a maximum coverage area of 4 hops, and distributing different time slots for different groups so as to realize time slot multiplexing among cells of the whole network; dividing a time axis into 4 superslots, and allocating different superslots to each cell based on a multiplexing principle, wherein the superslot allocation principle is that superslots allocated by adjacent cells are inconsistent, so that multiplexing of time slot resources is realized on the premise of avoiding mutual interference of the adjacent cells;
dividing the nodes in each cell into intra-group nodes and inter-group nodes, wherein the intra-group nodes only have connection relations with other nodes in the cells, and the inter-group nodes establish connection relations with the intra-group nodes of a plurality of cells; in time slot allocation, the nodes in the group only participate in the time slot allocation of the cell, and the nodes between the groups allocate the time slots of the corresponding cells when communicating with the nodes of which cell according to service requirements;
when the nodes in the group forward, different time slot allocation mechanisms are used according to different hop counts, so that the multiplexing of time slots in the group is further realized.
Further, the super time slot is divided into a plurality of time frames in each packet, and each time frame is divided into a fixed time slot and a dynamic time slot; wherein, all nodes in the group are allocated a fixed time slot for transmitting signaling and time delay sensitive information, and dynamic time slots are dynamically allocated to different nodes for use according to the need by a time slot allocation mechanism.
Further, each dynamic time slot is further divided into 6 micro time slots, and a micro time slot multiplexing scheme is determined according to different relay hops, so that the time slot use efficiency is further improved.
Further, the routing address of the ad hoc network protocol includes a cell flag and an intra-cell node flag, and each node maintains two routing tables: a cell routing table and a node routing table; when the source node has data transmission, firstly, the source node applies for dynamic time slots through fixed time slots, and determines the whole network routing information through sending RTS/CTS frames.
Further, when the intra-group node forwards, using different time slot allocation mechanisms according to different hop counts to further realize intra-group time slot multiplexing, including: if the source node and the destination node are in a cell, each node in the routing table determines a receiving and transmitting micro time slot of the node according to the relay in the second level, and carries out data receiving and transmitting in the corresponding micro time slot according to the following mode:
the time slot allocation in the case of directly connected transceiver nodes is as follows: the source node can send data, and the destination node is in a receiving state;
the time slot allocation is as follows under the condition that 1 relay node passes between the receiving and transmitting nodes: when the micro time slot 1, the micro time slot 3 or the micro time slot 5 is adopted, the source node transmits data, the relay node is in a receiving state at the moment, and the target node is in an idle state; when the micro time slot 2, the micro time slot 4 or the micro time slot 6 is adopted, the relay node transmits data, the destination node is in a receiving state, and the transmitting node is in an idle state;
the time slot allocation is as follows under the condition that 2 relay nodes pass between the receiving and transmitting nodes: when the micro time slot 1 or the micro time slot 4 is used, the source node sends data, the relay node 1 is in a receiving state, and the relay node 2 and the destination node are in an idle state; when the micro time slot 2 and the micro time slot 5 are used, the relay node 1 sends data, the relay node 2 is in a receiving state, and the source node and the destination node are in an idle state; when the micro time slot 3 or the micro time slot 6 is adopted, the relay node 2 sends data, the destination node is in a receiving state, and the source node and the relay node 1 are in an idle state;
the time slot allocation under the condition that 3 relay nodes pass between the receiving and transmitting nodes is as follows: when the micro time slot 1 and the micro time slot 4 are used, one or both of the source node and the relay node 3 send data, the destination node and the relay node 1 are in a receiving state, and the relay node 2 is in an idle state; when the micro time slot 2 and the micro time slot 5 are used, the relay node 1 sends data, the relay node 2 is in a receiving state, and the source node, the destination node and the relay node 3 are in an idle state; when the micro time slot 3 and the micro time slot 6 are used, the relay node 2 sends data, the relay node 3 is in a receiving state, and the source node, the destination node and the relay node 1 are in an idle state.
Further, if the source node and the destination node cross the packet, the inter-group node of the two inter-group relays is completed, and the transceiving time slot of the inter-group node is confirmed according to the following principle: when receiving, the inter-group node takes part in the allocation of the micro time slots of the group as the virtual destination node of the group, and when transmitting, the inter-group node takes part in the allocation of the micro time slots of the group as the virtual source node of the next group.
Compared with the prior art, the invention has the following beneficial effects:
the ad hoc network protocol designed by the invention fully utilizes the characteristic that the loss of radio waves increases sharply along with the increase of distance, realizes the multiplexing of time slot resources on a geographic space, and remarkably improves the throughput and network capacity of the whole network by reasonably setting a grouping principle and an intra-group time slot multiplexing method.
The protocol provided by the invention is particularly suitable for wireless ad hoc network application occasions with a plurality of networking nodes and limited power consumption of a single node, and can realize stable and reliable networking communication of a large number of nodes.
Drawings
FIG. 1 is a schematic diagram of a grouping scheme by distance hops;
fig. 2 is a superslot multiplexing scheme;
FIG. 3 is a time frame design;
fig. 4 is a diagram of a micro-slot multiplexing scheme designed for different hops;
fig. 5 is a schematic diagram of cross-cell relay node superslot allocation.
Detailed Description
The invention is further described below with reference to the accompanying drawings, without limiting the invention in any way, and any alterations or substitutions based on the teachings of the invention are intended to fall within the scope of the invention.
Firstly, in order to improve the time slot efficiency, grouping the nodes of the whole network according to the positions and the distances, dividing different groups into cells with geographically different coverage areas, wherein the area of each cell is a maximum coverage area of 4 hops, and distributing different time slots for different groups so as to realize the time slot multiplexing among cells of the whole network; the time axis is divided into 4 superslots, different superslots are allocated to each cell based on a multiplexing principle, and the superslot allocation principle is that superslots allocated by adjacent cells are inconsistent, so that multiplexing of time slot resources is realized on the premise of avoiding mutual interference of the adjacent cells.
All nodes are divided into different groups by geographic area (cells), with each cell area being a 4-hop maximum coverage area, as shown in fig. 1. In fig. 1, the original points represent a node, and assuming that the nodes are uniformly distributed, and the maximum distance of each hop is four nodes forming a square diagonal distance, two nodes with the farthest distance in the packet coverage area can establish a communication link through at most 4 hops, and the area where the packet node is located is a cell. Therefore, the networking protocol of the invention is applicable to large-scale node networking, the node density is high enough, and the relay node meeting the required route can be found.
Based on the method, the whole coverage area is divided into different cells, and at most 3 relay nodes are needed between the nodes with the farthest intervals in each cell, and the connection can be established through 4-hop forwarding. Taking hexagonal cellular coverage as an example, the time axis is divided into 4 superslots, and the following superslot allocation method is designed:
(1) Supposing that a superslot 1 is initially allocated to a cell 1, 6 adjacent cells are sequentially allocated with a superslot 2, a superslot 3, a superslot 4, a superslot 2, a superslot 3 and a superslot 4;
(2) The assigned superslot cells determine the superslots of the adjacent cells according to the same method, thereby realizing the superslot assignment of all cells.
The result of the superslot allocation determined based on the allocation principle described above is shown in fig. 2. Since the same superslot cell is allocated, its closest distance interval is the distance between the opposite sides of the hexagon, and assuming that the diagonal distance of the hexagon is a 4-hop coverage distance, the distance between the opposite sides is much greater than the 3-hop coverage distance. Considering the attenuation characteristic of wireless propagation along with distance, the cells allocated with the same superslot can be considered to have no mutual interference, so that the superslot multiplexing among the cells is realized, namely, cells with farther geographic intervals can use the same superslot without causing mutual interference.
On the basis, the nodes in each cell are divided into intra-group nodes and inter-group nodes, the intra-group nodes only have connection relations with other nodes in the cells, and the inter-group nodes can establish connection relations with the intra-group nodes of a plurality of cells. In time slot allocation, the nodes in the group only participate in the time slot allocation of the cell, and the nodes between the groups allocate the time slots of the corresponding cells when communicating with the nodes of which cell according to service requirements. Within each cell, the superslot is divided into a plurality of time frames, each of which is divided into a fixed time slot and a dynamic time slot, as shown in fig. 3. All nodes in the group are allocated with a fixed time slot for transmitting signaling and time delay sensitive information, and the dynamic time slot is dynamically allocated to different nodes for use according to the need by a time slot allocation mechanism, namely, the rest time slots are flexibly allocated to other nodes according to the scheduling need. Each dynamic time slot is further divided into 6 micro time slots, and the micro time slot multiplexing scheme is determined according to the difference of the relay hops, so that the time slot use efficiency is further improved, as shown in fig. 4. In the figure, according to the difference of relay hops between a source node (a sending node) and a destination node (a receiving node), the invention designs a micro time slot allocation scheme. When the intra-group node forwards, different time slot allocation mechanisms are used according to different hop counts, so that the intra-group time slot multiplexing is further realized, and the method comprises the following steps: if the source node and the destination node are in a cell, each node in the routing table determines a receiving and transmitting micro time slot of the node according to the relay in the second level, and carries out data receiving and transmitting in the corresponding micro time slot according to the following mode:
the time slot allocation in the case of directly connected transceiver nodes is as follows: the source node can send data, and the destination node is in a receiving state;
the time slot allocation is as follows under the condition that 1 relay node passes between the receiving and transmitting nodes: when the micro time slot 1, the micro time slot 3 or the micro time slot 5 is adopted, the source node transmits data, the relay node is in a receiving state at the moment, and the target node is in an idle state; when the micro time slot 2, the micro time slot 4 or the micro time slot 6 is adopted, the relay node transmits data, the destination node is in a receiving state, and the transmitting node is in an idle state;
the time slot allocation is as follows under the condition that 2 relay nodes pass between the receiving and transmitting nodes: when the micro time slot 1 or the micro time slot 4 is used, the source node sends data, the relay node 1 is in a receiving state, and the relay node 2 and the destination node are in an idle state; when the micro time slot 2 and the micro time slot 5 are used, the relay node 1 sends data, the relay node 2 is in a receiving state, and the source node and the destination node are in an idle state; when the micro time slot 3 or the micro time slot 6 is adopted, the relay node 2 sends data, the destination node is in a receiving state, and the source node and the relay node 1 are in an idle state;
the time slot allocation under the condition that 3 relay nodes pass between the receiving and transmitting nodes is as follows: when the micro time slot 1 and the micro time slot 4 are used, one or both of the source node and the relay node 3 send data, the destination node and the relay node 1 are in a receiving state, and the relay node 2 is in an idle state; when the micro time slot 2 and the micro time slot 5 are used, the relay node 1 sends data, the relay node 2 is in a receiving state, and the source node, the destination node and the relay node 3 are in an idle state; when the micro time slot 3 and the micro time slot 6 are used, the relay node 2 sends data, the relay node 3 is in a receiving state, and the source node, the destination node and the relay node 1 are in an idle state.
Taking 4-hop micro-time slot allocation as an example, in the allocation scheme, the micro-time slot 4 notes that the relay 3 transmits and receives the destination and the source relay 1 receives, which means that in the current micro-time slot 4, the source node and the 3-hop relay node can transmit data, the 1-hop relay node and the destination node are in a receiving state, and other nodes are in an idle state. Based on the micro time slot allocation scheme, in the 4-hop relay forwarding process, the source node and the 3-hop relay node which are separated by 3 hops can realize time slot multiplexing, and the distance is far enough so that mutual interference is not caused, thereby improving the use efficiency of the micro time slots.
The routing address of the hop-based time slot multiplexing ad hoc network protocol comprises a cell mark and an intra-cell node mark, and each node maintains two routing tables: cell routing table and node routing table. When the source node has data transmission, firstly, the source node applies for dynamic time slots through fixed time slots, and determines the whole network routing information through sending RTS/CTS frames.
If the source node and the destination node are in a cell, each node in the routing table determines a micro time slot for receiving and transmitting the data according to the corresponding micro time slot in fig. 4 according to the relay in the second stage.
If the source node and the destination node are in different cells, the receiving and transmitting time slots of the inter-group nodes for completing the relay between the two cells are confirmed according to the following principle: the inter-group node participates in the time slot allocation of the group as the destination node of the group, and the source node of the next group participates in the time slot allocation of the group. Taking the relay forwarding situation shown in fig. 5 as an example, when the source node sends the relay node to receive, corresponding time slot resources are allocated in the cell where the source node is located, namely in the overtime slot 1; when the relay node sends the destination node to receive, corresponding time slot resources are allocated in the cell where the destination node is located, namely in the overtime slot 3.
The word "preferred" is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as "preferred" is not necessarily to be construed as advantageous over other aspects or designs. Rather, use of the word "preferred" is intended to present concepts in a concrete fashion. The term "or" as used in this application is intended to mean an inclusive "or" rather than an exclusive "or". That is, unless specified otherwise or clear from the context, "X uses a or B" is intended to naturally include any of the permutations. That is, if X uses A; x is B; or X uses both A and B, then "X uses A or B" is satisfied in any of the foregoing examples.
Moreover, although the disclosure has been shown and described with respect to one or more implementations, equivalent alterations and modifications will occur to others skilled in the art based upon a reading and understanding of this specification and the annexed drawings. The present disclosure includes all such modifications and alterations and is limited only by the scope of the following claims. In particular regard to the various functions performed by the above described components (e.g., elements, etc.), the terms used to describe such components are intended to correspond, unless otherwise indicated, to any component which performs the specified function of the described component (e.g., that is functionally equivalent), even though not structurally equivalent to the disclosed structure which performs the function in the herein illustrated exemplary implementations of the disclosure. Furthermore, while a particular feature of the disclosure may have been disclosed with respect to only one of several implementations, such feature may be combined with one or other features of the other implementations as may be desired and advantageous for a given or particular application. Moreover, to the extent that the terms "includes," has, "" contains, "or variants thereof are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term" comprising.
The functional units in the embodiment of the invention can be integrated in one processing module, or each unit can exist alone physically, or a plurality of or more than one unit can be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product. The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like. The above-mentioned devices or systems may perform the storage methods in the corresponding method embodiments.
In summary, the foregoing embodiment is an implementation of the present invention, but the implementation of the present invention is not limited to the embodiment, and any other changes, modifications, substitutions, combinations, and simplifications made by the spirit and principles of the present invention should be equivalent to the substitution manner, and all the changes, modifications, substitutions, combinations, and simplifications are included in the protection scope of the present invention.
Claims (6)
1. A hop count based time slot reusable ad hoc network method, comprising the steps of:
grouping the nodes of the whole network according to the positions and the distances, dividing different groups into cells with geographically different coverage, wherein the area of each cell is a maximum coverage area of 4 hops, and distributing different time slots for different groups so as to realize time slot multiplexing among cells of the whole network; dividing a time axis into 4 superslots, and allocating different superslots to each cell based on a multiplexing principle, wherein the superslot allocation principle is that superslots allocated by adjacent cells are inconsistent;
dividing the nodes in each cell into intra-group nodes and inter-group nodes, wherein the intra-group nodes only have connection relations with other nodes in the cells, and the inter-group nodes establish connection relations with the intra-group nodes of a plurality of cells; in time slot allocation, the nodes in the group only participate in the time slot allocation of the cell, and the nodes between the groups allocate the time slots of the corresponding cells when communicating with the nodes of which cell according to service requirements;
when the nodes in the group forward, different time slot allocation mechanisms are used according to different hop counts, so that the multiplexing of time slots in the group is further realized.
2. The hop-based slot multiplexing ad hoc network method according to claim 1, wherein the super slot is divided into a plurality of time frames within each packet, each time frame being divided into a fixed slot and a dynamic slot; wherein, all nodes in the group are allocated a fixed time slot for transmitting signaling and time delay sensitive information, and dynamic time slots are dynamically allocated to different nodes for use according to the need by a time slot allocation mechanism.
3. The hop-based time slot multiplexing ad hoc network method according to claim 2, wherein each dynamic time slot is further divided into 6 micro time slots, and the micro time slot multiplexing scheme is determined according to the difference of the relay hop numbers, so that the time slot use efficiency is further improved.
4. The hop-based time slot multiplexing ad hoc network method according to claim 3, wherein the route address of the hop-based time slot multiplexing ad hoc network protocol comprises a cell flag and an intra-cell node flag, each node maintains two route tables, the two route tables being a cell route table and a node route table, respectively; when the source node has data transmission, firstly, the source node applies for dynamic time slots through fixed time slots, and determines the whole network routing information through sending RTS/CTS frames.
5. The hop-based time slot multiplexing ad hoc network method according to claim 4, wherein said using different time slot allocation mechanisms according to different hop numbers when forwarding by the nodes in the group further realizes the time slot multiplexing in the group, comprising: if the source node and the destination node are in a cell, each node in the routing table determines a receiving and transmitting micro time slot of the node according to the relay in the second level, and carries out data receiving and transmitting in the corresponding micro time slot according to the following mode:
the time slot allocation in the case of directly connected transceiver nodes is as follows: the source node can send data, and the destination node is in a receiving state;
the time slot allocation is as follows under the condition that 1 relay node passes between the receiving and transmitting nodes: when the micro time slot 1, the micro time slot 3 or the micro time slot 5 is adopted, the source node transmits data, the relay node is in a receiving state at the moment, and the target node is in an idle state; when the micro time slot 2, the micro time slot 4 or the micro time slot 6 is adopted, the relay node transmits data, the destination node is in a receiving state, and the transmitting node is in an idle state;
the time slot allocation is as follows under the condition that 2 relay nodes pass between the receiving and transmitting nodes: when the micro time slot 1 or the micro time slot 4 is used, the source node sends data, the relay node 1 is in a receiving state, and the relay node 2 and the destination node are in an idle state; when the micro time slot 2 and the micro time slot 5 are used, the relay node 1 sends data, the relay node 2 is in a receiving state, and the source node and the destination node are in an idle state; when the micro time slot 3 or the micro time slot 6 is adopted, the relay node 2 sends data, the destination node is in a receiving state, and the source node and the relay node 1 are in an idle state;
the time slot allocation under the condition that 3 relay nodes pass between the receiving and transmitting nodes is as follows: when the micro time slot 1 and the micro time slot 4 are used, one or both of the source node and the relay node 3 send data, the destination node and the relay node 1 are in a receiving state, and the relay node 2 is in an idle state; when the micro time slot 2 and the micro time slot 5 are used, the relay node 1 sends data, the relay node 2 is in a receiving state, and the source node, the destination node and the relay node 3 are in an idle state; when the micro time slot 3 and the micro time slot 6 are used, the relay node 2 sends data, the relay node 3 is in a receiving state, and the source node, the destination node and the relay node 1 are in an idle state.
6. The hop-based time slot multiplexing ad hoc network method according to claim 5, wherein if the source node and the destination node are in different cells, the inter-group node of the two inter-group relays is completed, and its transceiving time slot is confirmed according to the following principle: the inter-group node participates in the allocation of the micro time slots of the group as the destination node of the group, and the source node of the next group participates in the allocation of the micro time slots of the group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311587298.6A CN117676834A (en) | 2023-11-27 | 2023-11-27 | Time slot multiplexing ad hoc network method based on hop count |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311587298.6A CN117676834A (en) | 2023-11-27 | 2023-11-27 | Time slot multiplexing ad hoc network method based on hop count |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117676834A true CN117676834A (en) | 2024-03-08 |
Family
ID=90065380
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311587298.6A Pending CN117676834A (en) | 2023-11-27 | 2023-11-27 | Time slot multiplexing ad hoc network method based on hop count |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117676834A (en) |
-
2023
- 2023-11-27 CN CN202311587298.6A patent/CN117676834A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107018551B (en) | Time slot reservation method of TDMA frame structure based on directional multi-beam antenna | |
| US7502360B2 (en) | Method and apparatus for dynamic neighbor discovery within wireless networks using time division multiple access (TDMA) | |
| CN109348537A (en) | Multi-beam self-organizing network channel access control method | |
| Das et al. | WLC30-4: static channel assignment in multi-radio multi-channel 802.11 wireless mesh networks: issues, metrics and algorithms | |
| CN106131923B (en) | Networking method of multi-hop network in hybrid access mode and wireless communication equipment | |
| CN106559103B (en) | A kind of extensive hopped-frequency pulses system based on Beidou time service | |
| CN105636148A (en) | Wireless multi-hop network data transmission method | |
| CN111818652A (en) | Channel resource allocation method of multi-transceiver multi-channel wireless Ad Hoc network | |
| Gu et al. | C-ICAMA, a centralized intelligent channel assigned multiple access for multi-layer ad-hoc wireless networks with UAVs | |
| CN104185280A (en) | Method of determining scheduling priority of link in distributive wireless network and device | |
| CN105744641A (en) | Directional time-division link scheduling method applicable to wireless mesh network | |
| CN110138757A (en) | Space division multiple access SDMA-SPMA multiple access system | |
| CN100559738C (en) | The multi-address access method according to requirement that the band conflict is decomposed | |
| CN111356198B (en) | Clustering cross-layer communication processing method and system based on geographic position and Q learning | |
| US8976728B2 (en) | Distributed medium access control (DMAC) for mobile ad hoc networks | |
| CN107770875B (en) | Method for mixing MAC protocol of aviation ad hoc network | |
| CN117676834A (en) | Time slot multiplexing ad hoc network method based on hop count | |
| Wu et al. | Dynamic channel allocation strategy for quality of service enhancement in wireless ad hoc networks | |
| KR20100050379A (en) | Wireless network system using a cyclic frame | |
| Kondylis et al. | Multicasting sustained CBR and VBR traffic in wireless ad-hoc networks | |
| CN116137744B (en) | Dynamic time frame structure and allocation method for antenna ad hoc network system | |
| Ma et al. | Review of multi-channel MAC protocols for vehicular ad hoc networks | |
| Matani et al. | A survey on MAC protocols for data collection in wireless sensor networks | |
| Sugavanam | Reformed timeslot allocation for data intensive clustered industrial wireless sensor networks using virtual grid structure with UWB | |
| 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 |