CN111479305B - TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna - Google Patents

TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna Download PDF

Info

Publication number
CN111479305B
CN111479305B CN202010301184.0A CN202010301184A CN111479305B CN 111479305 B CN111479305 B CN 111479305B CN 202010301184 A CN202010301184 A CN 202010301184A CN 111479305 B CN111479305 B CN 111479305B
Authority
CN
China
Prior art keywords
node
information
neighbor
nodes
routing
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
Application number
CN202010301184.0A
Other languages
Chinese (zh)
Other versions
CN111479305A (en
Inventor
肖海涛
穆鹏程
刘思宁
张渭乐
田宇
王霞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN202010301184.0A priority Critical patent/CN111479305B/en
Publication of CN111479305A publication Critical patent/CN111479305A/en
Application granted granted Critical
Publication of CN111479305B publication Critical patent/CN111479305B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/023—Limited or focused flooding to selected areas of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A TDMA mobile self-organizing network MAC layer routing method based on an intelligent antenna comprises the step of realizing the routing function in a cross-layer mode, wherein the flooding of all routing related information and the routing calculation are realized in the MAC layer. The MAC layer adopts a TDMA channel access mode: dividing time resources by taking a superframe as a unit time element; carrying out wave beam switching based on an intelligent antenna, carrying out all routing control grouping omnidirectional broadcasting, and carrying out data grouping directional transmission; discovering neighbor nodes through broadcasting of the HELLO packet; the node adopts a handshake mechanism to carry out neighbor screening, and a candidate neighbor information packet contains a pre-screening result of the node; after the symmetrical neighbors are screened, the topology information is flooded, and the nodes aggregate, pack and flood the topology information grasped locally to the whole network in the appointed time slot; and the nodes calculate the topology structure of the whole network according to all the received topology information and link information, and calculate the path with the optimal path comprehensive quality. The invention has small routing overhead and high packet delivery rate.

Description

TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna
Technical Field
The invention belongs to the field of wireless communication, and particularly relates to a TDMA mobile ad hoc network MAC layer routing method based on an intelligent antenna.
Background
The wireless self-organizing network is composed of a group of mobile nodes with wireless communication transceiving devices, is a multi-hop temporary centerless network, has equal positions of each node in the network, can be a terminal or a router, and does not need to rely on inherent network infrastructure. Military wireless communication requires higher confidentiality, monitoring resistance and interference resistance, and certain specific application scenarios also require ultra-long transmission distances. The two terminal nodes which cannot directly communicate need to be subjected to networking forwarding by other nodes.
The routing protocol plays the most critical role in the ad hoc network, and is also a main research hotspot and difficulty. Due to the problems of random movement of nodes in the ad hoc network, time variation of links, limited bandwidth and the like, route interruption or network congestion is easily caused. The relevant characteristics of the mobile ad hoc network make the distance vector routing protocol and the link state routing protocol in the traditional wireless network no longer applicable, and a special ad hoc network routing protocol must be researched.
In addition, at present, most routing algorithms do not consider the design requirements when combined with smart antennas and TDMA access modes, and the routing establishment in the ultra-long transmission distance scene cannot be effectively solved.
Disclosure of Invention
The invention aims to solve the problem that the routing protocol in the prior art does not meet the characteristic requirements of the wireless self-organizing network, and provides a TDMA mobile self-organizing network MAC layer routing method based on an intelligent antenna, which has good expansibility and compatibility under different application scenes, meets the transmission under the ultra-far distance scene, reduces the routing overhead and improves the performance of the whole network.
In order to achieve the purpose, the invention adopts the following technical scheme:
a TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna includes the following steps: the routing function is realized on an MAC layer by adopting a cross-layer design, and the MAC layer adopts a TDMA channel access mode with a reservation mechanism; dividing time domain resources of the whole network by taking a superframe as a unit time element, wherein one superframe is divided into N frames, and each frame is divided into M time slots; wherein, the initial K frame is an access frame to complete network node synchronization and neighbor topology information acquisition; the subsequent N-K frame is a TDMA transmission frame, each node accesses a shared channel in a TDMA mode, and the functions of completing the time slot distribution, the routing control information flooding, the whole network topology establishment and maintenance, the upper layer service data and the broadcast packet transmission are completed;
designing a routing control packet:
the routing control packet comprises a HELLO packet, a candidate neighbor information packet and a topology control packet; the protocol executes the functions of link detection and neighbor discovery through the periodic interaction of HELLO packets between nodes; executing a neighbor node screening function through periodic interaction of the candidate neighbor information packets; executing a topology information flooding function through periodic interaction of topology control packets;
discovering the neighbor nodes: the node periodically sends a HELLO packet to carry out neighbor interception; the node sends a HELLO packet to carry a local node load parameter for representing the node saturation degree during path selection; the node determines local candidate neighbors of the node according to the received HELLO packet, and stores related information into a candidate neighbor information table, wherein the related information comprises neighbor node IDs, neighbor node loads, received signal-to-noise ratios and link quality;
screening neighbor nodes: after one round of HELLO packet broadcasting is finished, the node independently screens neighbors; the node sorts according to the local candidate neighbor information table and the received signal to interference plus noise ratio parameters obtained by the physical layer, wherein the first Q neighbors with higher signal to interference plus noise ratios are pre-screening results; the node sets the candidate neighbor information of the node in a pre-screening result group to be broadcasted in a specified time slot; after receiving the candidate neighbor information packet from other nodes, the node compares the candidate neighbor information packet with a local pre-screening result; a pair of nodes are set to be determined as neighbor nodes of each other only when being subjected to bidirectional pre-screening so as to ensure the bidirectional symmetry of the neighbors;
establishing a flooding and full-network topological structure of topological information: the node carries out aggregation and packaging on local topology information and received topology information from other nodes, and then broadcasts the topology information in a specified time slot; when the non-appointed broadcast time slot of the node receives the topology grouping from other nodes, useful information is analyzed, and a local topology information table is updated; after all nodes are flooded, each node independently establishes a topology structure of the whole network according to a local topology information table;
the design path selection method comprises the following steps: an active link state routing algorithm is adopted, and meanwhile, a QoS guarantee mechanism is provided; the path metric is a single metric parameter of multi-parameter weighted combination; the parameters for weighting and calculating the path quality comprise three parameters of link quality, node load and hop count; the routing algorithm adopts a Dijkstra algorithm, and the reference weight is a comprehensive weight obtained by weighting the three parameters; after the algorithm is executed, the optimal path is cached in a routing table, and data is sent and forwarded hop by hop according to the routing table.
As a preferred scheme, a TDMA service frame in a superframe is divided into P topology maintenance frames and N-K-P service frames according to different functions, each topology maintenance frame is fixedly authorized to a certain node in a network to complete routing control information broadcast in a one-hop communication range of the node, therefore, in each superframe, the communication frame structural design meets the routing control information broadcast of the P nodes, and meanwhile, L superframes are adopted for topology information flooding so as to meet the requirement that the network supports the full-network flooding under the L-hop to the maximum extent.
As a preferred scheme, when designing a routing control packet, beam switching is performed by combining a smart antenna beam forming technology, all routing control packets are broadcast omnidirectionally, and data packets are sent directionally.
Preferably, when discovering the neighbor node, the relevant parameters for measuring the route metric are considered and added to each route control packet for flooding.
As a preferred scheme, when the neighbor nodes are screened, if the neighbor nodes are too many, the neighbor nodes are screened based on a certain parameter; the node adopts a handshake mechanism to carry out neighbor screening, and the candidate neighbor information packet contains the node pre-screening result.
As an optimal scheme, when a topology information flooding and full-network topology structure is established, the topology information flooding is performed after the symmetric neighbors are screened, and the nodes aggregate, pack and flood the locally grasped topology information to the neighbors in the designated time slot.
As a preferred scheme, when designing a path selection method, a node selects a path based on Dijkstra algorithm under path metric according to an acquired full-network topology structure.
Compared with the prior art, the invention has the following beneficial effects: the routing method can flexibly adjust the TDMA frame structure according to the maximum node number and the maximum hop number which can be supported by the network under different application scenes, and has good expansibility and compatibility; the intelligent antenna is designed based on the bottom layer technology of the intelligent antenna, the intelligent antenna is used for completing transmission of the routing function related control packet, the transmission range is greatly improved, transmission under an ultra-far distance scene can be met, control groups are only transmitted in a routing transmission subframe, the control overhead of routing is reduced, and the system efficiency is improved. By adopting the cross-layer design, the information provided by other layers of the ad hoc network protocol layer is fully utilized, and new constraint parameters acquired from a physical layer and a data link layer are added on the basis that the original protocol takes hop count as path measurement, so that the performance of the whole network is effectively improved. By screening the neighbor nodes, only the neighbor nodes are responsible for the relay flooding of the node topology information, the repeated broadcasting of control messages in the same area can be reduced, all the nodes can acquire the topology information of the whole network through the minimum forwarding, the routing cost is low, and the network resources are saved; compared with other routes, the method is more suitable for the mobile ad hoc network with large network scale and higher node density. The topology information flooding adopts grouping and broadcasting after aggregating N pieces of topology information, compared with the original protocol for relaying and forwarding each piece of information, the time slot and channel resources are effectively saved, the data load is used to the maximum extent, and the routing overhead is greatly reduced. The path selection is carried out based on the comprehensive parameters, so that the phenomena of network congestion caused by the fact that the original link state routing algorithm only considers the path with the minimum hop number and high frame error rate caused by poor link quality are effectively improved, and meanwhile, the real-time data transmission and QoS guarantee are achieved.
Drawings
FIG. 1 is a schematic diagram of the overall design of the MAC layer communication frame structure of the wireless ad hoc network of the present invention;
FIG. 2 is a schematic diagram of a routing control packet structure according to the present invention;
fig. 3 is a flow chart of a routing function implementation of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
The invention discloses a TDMA mobile self-organizing network MAC layer routing method based on an intelligent antenna, which comprises the following steps:
(1) the routing scheme performs cross-layer design. The flooding of routing related information and the execution of routing algorithms are implemented at the MAC layer. The MAC layer adopts a TDMA channel access mode with a reservation mechanism. The routing algorithm as a whole employs a proactive link state routing protocol. Each node maintains a routing table to all nodes in the network, all path information existing and available at any time before data transmission. The cross-layer design is to fully utilize the information provided by other layers of the ad hoc network protocol layer, and can improve the performance of the whole network.
The method comprises the following steps of (1) wireless self-organizing network MAC layer communication frame structure design: the overall design scheme of the wireless ad hoc network communication frame structure is shown in fig. 1, the time domain resource division is carried out on the whole network by taking a superframe as a unit time element, one superframe is divided into N frames, each frame is divided into M time slots, and each superframe can be divided into two parts integrally according to different functions.
Firstly, the initial K frames finish network node synchronization and neighbor topology information acquisition in time-sharing sequence; the node synchronization can adopt a unified external synchronization source (such as GPS PPS) mode or a mutual synchronization mode; the neighbor topology information includes relative position information (such as distance, DOA (angle of arrival) obtained by using a spatial spectrum estimation technology, and the like) or absolute position information (such as geographical position coordinates, and the like).
Secondly, the subsequent N-K frames are TDMA transmission frames, each node accesses a shared channel in a TDMA mode, and can be divided into two types of data frames on the whole according to different functions.
The method comprises the steps that firstly, P topology maintenance frames are used for initial establishment and follow-up dynamic maintenance of a network topology structure, each node in the network stores topology information of the whole network, the topology information comprises information whether connection exists among all nodes of the whole network and link quality related information, and the information is useful information which is depended on by a routing algorithm. Therefore, each super frame can support P nodes to perform routing control information broadcasting work in sequence, and each topology maintenance frame can be divided into three subframes according to different functions.
a) The initial A continuous time slots are routing broadcast subframes and are used for broadcasting routing function related control information, including HELLO packets, candidate neighbor information packets and topology control packets, as shown in FIG. 2, the HELLO packets carry information such as node IDs and node loads, the candidate neighbor information packets carry neighbor node information to be confirmed after pre-screening, and the TC packets carry locally-acquired topology information and link information;
b) the rest B continuous time slots are used for normal service data transmission;
and the second, N-K-P service frames are used for normal service data transmission and control command transmission.
(2) Design of routing control packets: the routing control packet includes a HELLO packet, a candidate neighbor information packet, a topology control packet.
-HELLO packet: the method is used for the neighbor discovery process in the initial establishment stage of the network, and adopts the modes of omnidirectional transmission and directional reception for transmission, and the grouping carries information such as node ID, node load, survival time and the like; the node determines a neighboring node which can be reached by one hop through the received HELLO packet;
-candidate neighbor information packet: the method is used for the screening process of the neighbor nodes, and adopts an omnidirectional transmitting and directional receiving mode for transmission, and the grouping carries the information of Q neighbor nodes to be confirmed which are locally pre-screened by the nodes; and the node obtains the determined neighbor node (ensuring symmetric neighbor) by analyzing the received candidate neighbor information packet of the neighbor node and comparing and updating the candidate neighbor information packet with the local pre-screening result.
-topology control packet: the method is used for the topology information flooding process, and the transmission is carried out by adopting an omnidirectional transmitting and directional receiving mode. The function of the topology information declaration is performed by periodic interaction of the topology control packets. The nodes aggregate locally known topology information according to the maximum packet load transmitted by the MAC layer. The packet carries X topology blocks, each topology block carries Y neighbor blocks, and the neighbor blocks contain information of node ID, link quality, node load and the like of the neighbor. And the nodes calculate the topology structure of the whole network through the received topology control packet and the local topology information of the nodes.
(3) Node local caching information: under the routing method of the invention, the nodes locally need to store various information tables.
-candidate neighbor information table: the node stores useful data information according to the received HELLO packet; the information of node ID, link quality, receiving modulation scheme (MCS), receiving signal-to-interference-and-noise ratio, node load and the like of the candidate neighbor is included.
-a neighbor information table: storing the symmetric neighbor information after the neighbor screening process is finished; the information of the neighbor node ID, the receiving modulation mode, the node load, the list item serial number and the like is included.
-topology information table: storing the local topology information of the node and the received topology information from other nodes; the information of destination node ID, node ID of reachable destination node, link quality, node load, sequence number of the table entry, etc. is included.
-a routing table: and storing path information reaching other nodes of the whole network, and inquiring the table to obtain the address of the next hop before data transmission. The information table records information such as destination node ID, next hop node ID to reach the destination node, path quality (path complete cost of the path), hop count, link quality, node load, and sequence number of the entry.
(4) And (3) discovering the neighbor nodes: and the node periodically sends a HELLO packet to carry out neighbor sensing. The HELLO packet sent by the node carries a local node load parameter used for representing the node saturation degree during path selection. The node determines local candidate neighbors of the node according to the received HELLO packet, meanwhile, the MAC layer needs to acquire the receiving drying ratio calculated by the physical layer, and relevant information (including neighbor node IDs, neighbor node loads, receiving signal-to-noise ratios and link quality) is stored in a candidate neighbor information table.
(5) Screening neighbor nodes: after one round of HELLO grouping is finished, the node locally and independently screens the neighbors in a distributed mode. And the node sorts according to the local candidate neighbor information table and the received signal-to-interference ratio parameters acquired by the physical layer, wherein the first Q neighbors with higher signal-to-interference ratios are pre-screening results. The node broadcasts the candidate neighbor information packet of the pre-screening result set of the node in the appointed time slot. And after receiving the candidate neighbor information packets from other nodes, the nodes are compared with the local pre-screening result. A pair of nodes are determined as neighbor nodes of each other only when the nodes are subjected to bidirectional pre-screening, so that bidirectional symmetry of the neighbors is guaranteed.
a) Screening neighbor nodes to be confirmed: the node arranges all candidate neighbor nodes in sequence according to the quality of the screening standard in the TDMA frame protection time slot part and the receiving drying ratio according to the candidate neighbor list, and the screened N neighbor nodes to be confirmed are set in the candidate neighbor list;
b) candidate neighbor information broadcast: in a topology maintenance frame of a designated superframe of each period, all nodes package candidate neighbor information packets at a set top time slot according to a certain sequence and broadcast the candidate neighbor information packets to all one-hop reachable neighbor nodes.
c) The receiving node processes the candidate neighbor information packet: for the node to be confirmed, if the node is also identified as the node to be confirmed in the candidate list of the opposite side, directly placing the neighbor node to be confirmed into the neighbor list; if the node is not identified as to-be-confirmed in the opposite side candidate list, the identification of the node in the candidate neighbor list is cancelled. At this time, the neighbor list of the node is less than Q, and the node is supplemented after the next candidate neighbor information is broadcasted. For a node to be confirmed which is not the node, if the node is also identified as to be confirmed in the opposite side candidate list, the node is placed in the optional neighbor list; if the node is not identified as to be confirmed in the candidate list of the opposite side, the processing is not carried out.
d) Updating in the next period: if Q nodes to be confirmed in the candidate neighbor list at the moment of the node are different from the screening result in the previous period (caused by node movement, addition, quit and the like), broadcasting a new candidate neighbor list group to be confirmed; if the node has Q nodes to be confirmed in the candidate neighbor list consistent with the last screening result, and the number of the nodes in the neighbor list determined in the previous round is less than Q. If other candidate neighbors of the node are still selectable, the selectability of other subsequent nodes is sequentially judged (namely the number of neighbor nodes of the opposite side is less than Q), the selectable node is used for replacing the node which is removed in the previous round, and the node is identified as the neighbor node to be confirmed and broadcasted.
(6) Flooding of topology information and establishment of a full-network topology structure: the nodes aggregate and pack the local topology information and the received topology information from other nodes and broadcast the information in the appointed time slot. The node aggregates X topological blocks each time, and each topological block comprises Y neighbor blocks. When a node receives a TC packet, it first inquires whether the packet has been repeatedly received, and for the TC packet received for the first time, the node records relevant information (source node ID, neighbor nodes of the node, link quality, node load, etc.) in the TC packet in a local topology information table. And the nodes establish the topology structure of the whole network according to the local topology information table.
(7) Designing a path selection method: the routing algorithm is an active link state routing algorithm and has a QoS guarantee mechanism. The core idea of the improved routing algorithm is that an evaluation model for the quality change of a physical layer link and the load condition of the data volume to be sent of a node is added in the routing algorithm. The receiving signal-to-interference-and-noise ratio of the effective signal is obtained through a physical layer to measure the link quality, and the length of a data queue to be sent from an MAC layer is used as a measurement standard of the node saturation. The path metric is a single metric parameter of a multi-parameter weighted combination. The parameters for weighted calculation of the path quality comprise three parameters of link quality, node load and hop count. The routing algorithm adopts Dijkstra algorithm, and the reference weight is a comprehensive weight obtained by weighting. After the algorithm is executed, the optimal path (the path with the minimum path quality) is cached in a routing table. And forwarding the data transmission hop by hop according to the routing table.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the technical solution of the present invention, and it should be understood by those skilled in the art that the technical solution can be modified and replaced by a plurality of simple modifications and replacements without departing from the spirit and principle of the present invention, and the obvious modifications and replacements also belong to the protection scope covered by the claims.

Claims (5)

1. A TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna is characterized by comprising the following steps: the routing function is realized on an MAC layer by adopting a cross-layer design, and the MAC layer adopts a TDMA channel access mode with a reservation mechanism; dividing time domain resources of the whole network by taking a superframe as a unit time element, wherein one superframe is divided into N frames, and each frame is divided into M time slots; wherein, the initial K frame is an access frame to complete network node synchronization and neighbor topology information acquisition; the subsequent N-K frame is a TDMA transmission frame, each node accesses a shared channel in a TDMA mode, and the functions of completing the time slot distribution, the routing control information flooding, the whole network topology establishment and maintenance, the upper layer service data and the broadcast packet transmission are completed; the TDMA service frame in a superframe is divided into P topology maintenance frames and N-K-P service frames according to different functions, each topology maintenance frame is fixedly authorized to a certain node in a network to complete routing control information broadcasting in a one-hop communication range of the node, therefore, in each superframe, the communication frame structural design meets the routing control information broadcasting of the P nodes, and meanwhile, L superframes are adopted for topology information flooding so as to meet the requirement that the network supports the full-network flooding under L hops to the maximum extent;
designing a routing control packet:
the routing control packet comprises a HELLO packet, a candidate neighbor information packet and a topology control packet; the protocol executes the functions of link detection and neighbor discovery through the periodic interaction of HELLO packets between nodes; executing a neighbor node screening function through periodic interaction of the candidate neighbor information packets; executing a topology information flooding function through periodic interaction of topology control packets;
when a routing control group is designed, beam switching is carried out by combining an intelligent antenna beam forming technology, all routing control groups are broadcast in an omnidirectional manner, and data groups are sent in a directional manner;
discovering the neighbor nodes: the node periodically sends a HELLO packet to carry out neighbor interception; the node sends a HELLO packet to carry a local node load parameter for representing the node saturation degree during path selection; the node determines local candidate neighbors of the node according to the received HELLO packet, and stores related information into a candidate neighbor information table, wherein the related information comprises neighbor node IDs, neighbor node loads, received signal-to-noise ratios and link quality;
screening neighbor nodes: after one round of HELLO packet broadcasting is finished, the node independently screens neighbors; the node sorts according to the local candidate neighbor information table and the received signal to interference plus noise ratio parameters obtained by the physical layer, wherein the first Q neighbors with higher signal to interference plus noise ratios are pre-screening results; the node sets the candidate neighbor information packet of the pre-screening result of the node in a designated time slot for broadcasting; after receiving the candidate neighbor information packet from other nodes, the node compares the candidate neighbor information packet with a local pre-screening result; a pair of nodes are set to be determined as neighbor nodes of each other only when being subjected to bidirectional pre-screening so as to ensure the bidirectional symmetry of the neighbors;
establishing a flooding and full-network topological structure of topological information: the node carries out aggregation and packaging on local topology information and received topology information from other nodes, and then broadcasts the topology information in a specified time slot; when the non-appointed broadcast time slot of the node receives the topology grouping from other nodes, useful information is analyzed, and a local topology information table is updated; after all nodes are flooded, each node independently establishes a topology structure of the whole network according to a local topology information table;
the design path selection method comprises the following steps: an active link state routing algorithm is adopted, and meanwhile, a QoS guarantee mechanism is provided; the path metric is a single metric parameter of multi-parameter weighted combination; the parameters for weighting and calculating the path quality comprise three parameters of link quality, node load and hop count; the routing algorithm adopts a Dijkstra algorithm, and the reference weight is a comprehensive weight obtained by weighting the three parameters; after the algorithm is executed, the optimal path is cached in a routing table, and data is sent and forwarded hop by hop according to the routing table.
2. The smart antenna-based TDMA mobile ad hoc network MAC layer routing method according to claim 1, wherein: when discovering the neighbor node, the relevant parameters for measuring the route measurement are considered and added into each route control group for flooding.
3. The smart antenna-based TDMA mobile ad hoc network MAC layer routing method according to claim 1, wherein: when the neighbor nodes are screened, if the neighbor nodes are too many, the neighbor nodes are screened based on a certain parameter; the node adopts a handshake mechanism to carry out neighbor screening, and the candidate neighbor information packet contains the node pre-screening result.
4. The smart antenna-based TDMA mobile ad hoc network MAC layer routing method according to claim 1, wherein: when the flooding of the topology information and the whole network topology structure are established, the topology information is flooded after the symmetrical neighbors are screened, and the nodes aggregate, pack and flood the topology information grasped locally to the neighbors in the appointed time slot.
5. The smart antenna-based TDMA mobile ad hoc network MAC layer routing method according to claim 1, wherein: when the path selection method is designed, the nodes select paths based on Dijkstra algorithm under path measurement according to the acquired full-network topological structure.
CN202010301184.0A 2020-04-16 2020-04-16 TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna Active CN111479305B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010301184.0A CN111479305B (en) 2020-04-16 2020-04-16 TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010301184.0A CN111479305B (en) 2020-04-16 2020-04-16 TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna

Publications (2)

Publication Number Publication Date
CN111479305A CN111479305A (en) 2020-07-31
CN111479305B true CN111479305B (en) 2022-05-20

Family

ID=71753713

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010301184.0A Active CN111479305B (en) 2020-04-16 2020-04-16 TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna

Country Status (1)

Country Link
CN (1) CN111479305B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113473481B (en) * 2021-06-11 2022-10-21 西安空间无线电技术研究所 Efficient communication networking access system for resource-limited scene
CN113747539B (en) * 2021-08-27 2024-05-24 西安交通大学 TDMA mobile self-organizing network topology control method based on intelligent antenna
CN115348634B (en) * 2022-06-22 2023-11-17 江苏怀业信息技术股份有限公司 Route protocol optimization method for ad hoc network

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102149161A (en) * 2011-01-24 2011-08-10 重庆大学 Hierarchical and regular mesh network routing method
CN102984781B (en) * 2012-12-13 2015-01-07 北京邮电大学 Neighbor node judgment method for wireless ad hoc network route
CN103763750B (en) * 2014-01-08 2017-02-08 西安电子科技大学 Method for fast achieving packet forwarding in wireless ad hoc network of TDMA protocol
CN107018551B (en) * 2017-03-07 2021-08-17 上海交通大学 Time slot reservation method of TDMA frame structure based on directional multi-beam antenna
CN110417663B (en) * 2018-04-27 2022-01-21 中泓慧联技术有限公司 Multi-factor hybrid route updating method based on proactive routing protocol

Also Published As

Publication number Publication date
CN111479305A (en) 2020-07-31

Similar Documents

Publication Publication Date Title
Pu Jamming-resilient multipath routing protocol for flying ad hoc networks
CN111479305B (en) TDMA mobile self-organizing network MAC layer routing method based on intelligent antenna
Johnson et al. Simple pragmatic approach to mesh routing using BATMAN
Chiu et al. J-CAR: An efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile ad hoc networks
WO2005060170A1 (en) Fast/opportunistic distributed resource reallocation for established connections in a multihop network
Ghannay et al. Multi-radio multi-channel routing metrics in IEEE 802.11 s based wireless mesh networks
Liu et al. Topology control for multi-channel multi-radio wireless mesh networks using directional antennas
Mogaibel et al. Review of routing protocols and it's metrics for wireless mesh networks
Dong et al. A maximally radio-disjoint geographic multipath routing protocol for MANET
Raju et al. ZRP versus aodv and dsr: A comprehensive study on zrp performance on manets
Zhou et al. A novel routing protocol for ad hoc sensor networks using multiple disjoint paths
CN113747539B (en) TDMA mobile self-organizing network topology control method based on intelligent antenna
Wang et al. Journey from mobile ad hoc networks to wireless mesh networks
Ullah et al. Network adaptive interference aware routing metric for hybrid wireless mesh networks
Nandiraju et al. Adaptive state-based multi-radio multi-channel multi-path routing in wireless mesh networks
Chakraborty et al. MAC layer channel access and forwarding in a directional multi-interface mesh network
Bakalis et al. Power consumption analysis in mobile Ad Hoc networks
Karia et al. Review of routing metrics for wireless mesh networks
KR102089964B1 (en) Apparatus and method for routing of wireless ad-hoc network
Mohapatra Performance analysis of multirate MM-OLSR protocol in wireless adhoc networks
Chakraborty et al. Selective greedy routing: exploring the path diversity in backbone mesh networks
Cavalcanti et al. A new routing mechanism for integrating cellular networks, wlan hot spots and manets
Sheikh et al. A cross-layer hybrid strategy for congestion avoidance and link quality routing in wireless multi-hop networks
US20240244448A1 (en) Signal Strength Mapping for Steering a Client
Li et al. Design and Implementation of Routing Algorithms for Mobile Ad Hoc Network Applying TDMA Strategy Based on Smart Antenna

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