CN116582477A - Unmanned aerial vehicle ad hoc network route management method and system - Google Patents
Unmanned aerial vehicle ad hoc network route management method and system Download PDFInfo
- Publication number
- CN116582477A CN116582477A CN202310628162.9A CN202310628162A CN116582477A CN 116582477 A CN116582477 A CN 116582477A CN 202310628162 A CN202310628162 A CN 202310628162A CN 116582477 A CN116582477 A CN 116582477A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- routing table
- nodes
- handshake information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000007726 management method Methods 0.000 title claims abstract description 30
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 34
- 238000000034 method Methods 0.000 claims description 13
- 230000000694 effects Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 11
- 230000005540 biological transmission Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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
-
- 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
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application relates to the technical field of networks, and provides an unmanned aerial vehicle self-organizing network route management method, which is applied to network routing and comprises the following steps: responding to each node in the network to send handshake information according to a specified time interval, and creating a first routing table by each node in the network according to the received handshake information sent by other nodes; responding to the node failure of the first routing table in the network within a specified range, and discarding the failed route in the first routing table by the node in the network; each node in the network manages routes for nodes outside the specified range based on a second routing table created from valid routes existing after discarding failed routes. The application has the technical effect of reducing network channel occupation and delay under the condition of quickly recovering network route management.
Description
Technical Field
The application relates to the field of network technology, in particular to a method and a system for managing an ad hoc network of an unmanned aerial vehicle.
Background
Routing refers to the network-wide process of determining an end-to-end path of a packet as it travels from a source to a destination, with routers implementing network interconnections by forwarding packets.
Currently, in a network node, when a certain relay node fails, the original route fails. It is conventional practice to re-exchange handshake information and reconstruct the routing table. Such a step requires the occupation of channel resources with a certain delay.
Disclosure of Invention
In order to reduce unnecessary channel occupation and realize rapid route repair, the application provides a route management method and a system.
The application provides a self-organizing network route management method of an unmanned aerial vehicle, which adopts the following technical scheme:
in a first aspect, a method for managing an ad hoc network route of an unmanned aerial vehicle is provided, which is applied to network routing, and includes:
responding to each node in the network to send handshake information according to a specified time interval, and creating a first routing table by each node in the network according to the received handshake information sent by other nodes;
responding to the node failure of the first routing table in the network within a specified range, and discarding the failed route in the first routing table by the node in the network;
each node in the network manages routes for nodes in the network outside the specified range based on a second routing table created from valid routes existing after discarding failed routes.
Preferably, the responding to the sending of handshake information by each node in the network according to a specified time interval, each node in the network creates a first routing table according to the received handshake information sent by other nodes, including:
each node records a destination node, the number of hops which have passed and a relay node which have undergone in the handshake information according to the handshake information of other nodes received, and creates a first routing table;
after a specified time interval, the first routing table is updated according to the destination node, the number of hops that have passed, and the relay nodes that have undergone in the new handshake information.
Preferably, in response to a failure of a node in the network, the node in the network discards the failed route in the first routing table, and then includes:
and establishing a second routing table further comprising a sending node according to the destination node, the number of hops which have passed and the relay nodes which have undergone in the first routing table.
Preferably, the first routing table or the second routing table further includes a sequence number of the handshake information sent by the other node and received by each sending and/or destination node; the sequence number starts from zero, and the value of the sequence number is increased once every time the other nodes send handshake information.
Preferably, the method further comprises: and responding to the destination node to receive the sequence number and calculate and obtain the number of hops which have passed, and selecting a route which has the largest sequence number and the smallest number of hops which have passed in the handshake information and is transmitted by the same transmitting node by the destination node to be stored in a first routing table or a second routing table.
In a second aspect, there is also provided an unmanned aerial vehicle ad hoc network route management system, applied to network routing, including:
a first creation module: the method comprises the steps that each node in a network is used for responding to the handshake information sent by each node in the network according to a specified time interval, and each node in the network creates a first routing table according to the handshake information sent by other nodes;
and (3) a failure module: responsive to a node failure of the first routing table within a specified range in a network, the node in the network relinquishes the failed route in the first routing table;
and a management module: for each node in the network, managing routes for nodes in the network outside the specified range based on a second routing table created from valid routes existing after discarding failed routes.
Preferably, the first creating module includes:
a second creation module: recording a destination node, the number of hops which have passed and a relay node which have undergone in the handshake information according to the handshake information of other nodes received by each node, and creating a first routing table;
and an updating module: for updating the first routing table after a specified time interval in accordance with the destination node, the number of hops that have passed and the relay nodes that have undergone in the new handshake information.
Preferably, the method further comprises:
and a third creation module: and the second routing table further comprising a sending node is established according to the destination node, the number of hops which have passed and the relay nodes which have undergone in the first routing table.
Preferably, the first routing table or the second routing table further includes a sequence number of the handshake information sent by the other node and received by each sending and/or destination node; the sequence number starts from zero, and the value of the sequence number is increased once every time the other nodes send handshake information.
Preferably, the method further comprises: and responding to the destination node to receive the sequence number and calculate and obtain the number of hops which have passed, and selecting a route which has the largest sequence number and the smallest number of hops which have passed in the handshake information and is transmitted by the same transmitting node by the destination node to be stored in a first routing table or a second routing table.
In summary, the present application includes at least one of the following beneficial technical effects:
network channel occupancy and delay are reduced with fast recovery of network route management.
Drawings
FIG. 1 is a diagram of a first embodiment of a route management method;
FIG. 2 is a diagram of a first embodiment of creating a first routing table;
FIG. 3 is a first exemplary diagram of a first routing table;
FIG. 4 is a diagram of a second embodiment of a route management method;
FIG. 5 is a first example diagram of a second routing table;
FIG. 6 is a second exemplary diagram of a first routing table;
FIG. 7 is a second exemplary diagram of a second routing table;
FIG. 8 is a diagram of a third embodiment of a route management method;
FIG. 9 is a diagram of a route management system;
FIG. 10 is a first creation module configuration diagram;
fig. 11 is a diagram of another route management system.
Reference numerals illustrate: 1. a route management system; 11. a first creation module; 12. a failure module; 13. a third creation module; 14. a management module; 111. a second creation module; 112. and updating the module.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to fig. 1 to 11 and the embodiments. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
In a first aspect, as shown in fig. 1, there is provided a method for managing an ad hoc network of an unmanned aerial vehicle, applied to network routing, including:
s1: responding to each node in the network to send handshake information according to a specified time interval, and creating a first routing table by each node in the network according to the received handshake information sent by other nodes; in a network, a routing table is required to send and receive information in time. The network connects all nodes together, and the weight of each node is equal, so that the same information can be received and transmitted. Affecting nodes to send and receive information, only the advantages and disadvantages of channels among nodes and the capability of the nodes to process information. Each node may send handshake information to each of the other nodes in the network, which establish a first routing table based on the received handshake information. The routing table is a table for managing information such as a path for transmitting information between nodes. The paths of the information transmitted and received by each node may be different, so the routing table to be established is constructed based on the relay node and the hop count of the information transmitted and received by the node.
S2: responding to the node failure of the first routing table in the network within a specified range, and discarding the failed route in the first routing table by the node in the network; in the real world, since the network is made up of many nodes; obviously, some nodes may fail, may not stay online at all times, and may be able to send and receive information. If nodes fail to send and receive information, then the effective nodes around the failed nodes cannot send information to the failed nodes. In the transmission path in the network, the path containing the failed node needs to be removed. For example, if A, B, C, D exists, the paths of A-B-C-D are the paths originally conveying information in the network of the four nodes; now the C node fails, then the path for transmitting the information may be: a-B-D, a-D, etc. That is, in the network of A, B, C, D, the node C is discarded, and a new routing table is formed to determine the path through which the information a is transmitted to the node D.
S4: each node in the network manages routes for nodes in the network outside the specified range based on a second routing table created from valid routes existing after discarding failed routes. Based on the above example, it can be seen that the second routing table does not contain a C node. By analogy, it can be found that nodes that are invalid only need to be excluded from the second routing table; therefore, the formed effective node network generates information receiving and transmitting paths, and the information receiving and transmitting paths belong to a second routing table.
Preferably, as shown in fig. 2, the responding to sending handshake information by each node in the network according to a specified time interval, each node in the network creates a first routing table according to the received handshake information sent by other nodes, including:
s11: each node records a destination node, the number of hops which have passed and a relay node which have undergone in the handshake information according to the handshake information of other nodes received, and creates a first routing table; the first routing table has the basic attribute of a two-dimensional table, namely, is composed of rows and columns. In this embodiment, as shown in fig. 3, the first routing table includes a destination node, the number of hops that have passed, and relay nodes that have undergone; the destination node may be marked and the number of hops each message has passed to reach the destination node, as well as the number of relay nodes that have been experienced during the time period, may be recorded.
S12: after a specified time interval, the first routing table is updated according to the destination node, the number of hops that have passed, and the relay nodes that have undergone in the new handshake information. Because, in the network, new network nodes may appear at any time, and a certain network node may appear at any time to fail; the path of the network node transmitting the information changes; therefore, it is necessary to update the first routing table at certain time intervals, so that the network transmission information is more efficient and no network congestion occurs.
Preferably, as shown in fig. 4, in response to a node failure of the first routing table in the network within a specified range, the node in the network discards the failed route in the first routing table, and then includes:
s3: and establishing a second routing table further comprising a sending node according to the destination node, the number of hops which have passed and the relay nodes which have undergone in the first routing table. As shown in fig. 5, the second routing table is also a two-dimensional table, comprising rows and columns. The second routing table has not only the destination node but also the transmitting node, compared to the first routing table.
Preferably, as shown in fig. 6 and fig. 7, in the first routing table or the second routing table, the sequence number of the handshake information sent by the other node is further included in each sending and/or destination node; the sequence number starts from zero, and the value of the sequence number is increased once every time the other nodes send handshake information. The sequence number records the number of times the same handshake information is sent by the sending node each time. Because there are many nodes in the network, N identical handshake messages are formed to reach the destination node through M paths; how to select the N handshake information, a sequence number needs to be introduced. Each sending node sends handshake information once, and the sequence number value is increased by an integer in the handshake information; this facilitates the destination node or relay node to recognize the distinction of the same handshake information.
Preferably, as shown in fig. 8, further comprising:
s5: and responding to the destination node to receive the sequence number and calculate and obtain the number of hops which have passed, and selecting a route which has the largest sequence number and the smallest number of hops which have passed in the handshake information and is transmitted by the same transmitting node by the destination node to be stored in a first routing table or a second routing table. Obviously, among the plurality of handshake information received by the destination node, the sequence number is the largest, that is, the most recently transmitted by the transmitting node. Since each node may fail in the network or a new node may be added to the network, the path that the latest handshake information that can reach the destination node contains is the most reliable. Therefore, the piece of handshake information with the largest sequence number contained in the handshake information should be selected as the choice of the latest handshake information; also, due to the numerous nodes in the network, multiple paths may be generated, where the number of hops traversed by each path is also different. Obviously, for optimization of network transmission, the path with the smallest number of hops needs to be selected in order to achieve the fastest time efficiency. In summary, it can be seen that the path with the largest sequence number and the smallest hop count is the most needed for the network to send information.
In a second aspect, as shown in fig. 9, there is further provided an unmanned aerial vehicle ad hoc network route management system 1, for use in network routing, including:
the first creation module 11: the method comprises the steps that each node in a network is used for responding to the handshake information sent by each node in the network according to a specified time interval, and each node in the network creates a first routing table according to the handshake information sent by other nodes;
failure module 12: responsive to a node failure of the first routing table within a specified range in a network, the node in the network relinquishes the failed route in the first routing table;
management module 14: for each node in the network, managing routes for nodes in the network outside the specified range based on a second routing table created from valid routes existing after discarding failed routes.
Preferably, as shown in fig. 10, the first creating module 11 includes:
the second creation module 111: recording a destination node, the number of hops which have passed and a relay node which have undergone in the handshake information according to the handshake information of other nodes received by each node, and creating a first routing table;
update module 112: for updating the first routing table after a specified time interval in accordance with the destination node, the number of hops that have passed and the relay nodes that have undergone in the new handshake information.
Preferably, as shown in fig. 11, further comprising:
the third creation module 13: and the second routing table further comprising a sending node is established according to the destination node, the number of hops which have passed and the relay nodes which have undergone in the first routing table.
Preferably, the first routing table or the second routing table further includes a sequence number of the handshake information sent by the other node and received by each sending and/or destination node; the sequence number starts from zero, and the value of the sequence number is increased once every time the other nodes send handshake information.
Preferably, the method further comprises: and responding to the destination node to receive the sequence number and calculate and obtain the number of hops which have passed, and selecting a route which has the largest sequence number and the smallest number of hops which have passed in the handshake information and is transmitted by the same transmitting node by the destination node to be stored in a first routing table or a second routing table.
In summary, the present application includes at least one of the following beneficial technical effects:
network channel occupancy and delay are reduced with fast recovery of network route management.
The foregoing description of the preferred embodiments of the application is not intended to limit the scope of the application in any way, including the abstract and drawings, in which case any feature disclosed in this specification (including abstract and drawings) may be replaced by alternative features serving the same, equivalent purpose, unless expressly stated otherwise. That is, each feature is one example only of a generic series of equivalent or similar features, unless expressly stated otherwise.
Claims (10)
1. An unmanned aerial vehicle ad hoc network route management method applied to network routing is characterized by comprising the following steps:
responding to each node in the network to send handshake information according to a specified time interval, and creating a first routing table by each node in the network according to the received handshake information sent by other nodes;
responding to the node failure of the first routing table in the network within a specified range, and discarding the failed route in the first routing table by the node in the network;
each node in the network manages routes for nodes in the network outside the specified range based on a second routing table created from valid routes existing after discarding failed routes.
2. The unmanned aerial vehicle ad hoc network routing management method of claim 1, wherein said responding to each node in the network transmitting handshake information at specified time intervals, each node in the network creating a first routing table based on the received handshake information transmitted by other nodes, comprises:
each node records a destination node, the number of hops which have passed and a relay node which have undergone in the handshake information according to the handshake information of other nodes received, and creates a first routing table;
after a specified time interval, the first routing table is updated according to the destination node, the number of hops that have passed, and the relay nodes that have undergone in the new handshake information.
3. The unmanned aerial vehicle ad hoc network route management method of claim 2, wherein in response to a node failure of the first routing table within a specified range in the network, the node in the network relinquishes the failed route in the first routing table, thereafter comprising:
and establishing a second routing table further comprising a sending node according to the destination node, the number of hops which have passed and the relay nodes which have undergone in the first routing table.
4. A method of unmanned aerial vehicle ad hoc network route management according to claim 2 or 3, further comprising, in the first routing table or the second routing table, a sequence number for each of the sending and/or destination nodes to receive handshake information sent by the other nodes; the sequence number starts from zero, and the value of the sequence number is increased once every time the other nodes send handshake information.
5. The unmanned aerial vehicle ad hoc network routing management method of claim 4, further comprising: and responding to the destination node to receive the sequence number and calculate and obtain the number of hops which have passed, and selecting a route which has the largest sequence number and the smallest number of hops which have passed in the handshake information and is transmitted by the same transmitting node by the destination node to be stored in a first routing table or a second routing table.
6. An unmanned aerial vehicle ad hoc network route management system, applied to network routing, comprising:
a first creation module: the method comprises the steps that each node in a network is used for responding to the handshake information sent by each node in the network according to a specified time interval, and each node in the network creates a first routing table according to the handshake information sent by other nodes;
and (3) a failure module: responsive to a node failure of the first routing table within a specified range in a network, the node in the network relinquishes the failed route in the first routing table;
and a management module: for each node in the network, managing routes for nodes in the network outside the specified range based on a second routing table created from valid routes existing after discarding failed routes.
7. The unmanned aerial vehicle ad hoc network routing management system of claim 6, wherein said first creation module comprises:
a second creation module: recording a destination node, the number of hops which have passed and a relay node which have undergone in the handshake information according to the handshake information of other nodes received by each node, and creating a first routing table;
and an updating module: for updating the first routing table after a specified time interval in accordance with the destination node, the number of hops that have passed and the relay nodes that have undergone in the new handshake information.
8. The unmanned aerial vehicle ad hoc network routing management system of claim 7, further comprising:
and a third creation module: and the second routing table further comprising a sending node is established according to the destination node, the number of hops which have passed and the relay nodes which have undergone in the first routing table.
9. The unmanned aerial vehicle ad hoc network routing management system of claim 7 or 8, further comprising, in the first routing table or the second routing table, a sequence number for each of the sending and/or destination nodes to receive handshake information sent by the other nodes; the sequence number starts from zero, and the value of the sequence number is increased once every time the other nodes send handshake information.
10. The unmanned aerial vehicle ad hoc network routing management system of claim 9, further comprising: and responding to the destination node to receive the sequence number and calculate and obtain the number of hops which have passed, and selecting a route which has the largest sequence number and the smallest number of hops which have passed in the handshake information and is transmitted by the same transmitting node by the destination node to be stored in a first routing table or a second routing table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310628162.9A CN116582477A (en) | 2023-05-30 | 2023-05-30 | Unmanned aerial vehicle ad hoc network route management method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310628162.9A CN116582477A (en) | 2023-05-30 | 2023-05-30 | Unmanned aerial vehicle ad hoc network route management method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116582477A true CN116582477A (en) | 2023-08-11 |
Family
ID=87535701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310628162.9A Pending CN116582477A (en) | 2023-05-30 | 2023-05-30 | Unmanned aerial vehicle ad hoc network route management method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116582477A (en) |
-
2023
- 2023-05-30 CN CN202310628162.9A patent/CN116582477A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7035227B2 (en) | On-demand loop-free multipath routing (ROAM) | |
| US6990075B2 (en) | Scalable unidirectional routing with zone routing protocol extensions for mobile AD-HOC networks | |
| US6961319B2 (en) | Methods and arrangements for distribution tree development | |
| US7382731B1 (en) | Method and apparatus for updating probabilistic network routing information | |
| EP0455959B1 (en) | Method and system for routing packets in a packet communication network | |
| US7738402B2 (en) | Ad hoc communication system and method for routing speech packets therein | |
| US8331262B2 (en) | Apparatus and method for setup of optimum route using tree-topology | |
| US7450521B2 (en) | Cost-based routing using backoff scheme | |
| US20100284383A1 (en) | Internet-orientated ad-hoc network | |
| US20090161578A1 (en) | Data routing method and device thereof | |
| US20020061001A1 (en) | Dynamic source tracing (DST) routing protocol for wireless networks | |
| US20030218988A1 (en) | Network for transferring active packet and method for employing same | |
| EP2984873B1 (en) | Smf-type communication method for a manet network, network node and mobile network which implement this communication method | |
| CN110691379A (en) | Active routing communication method suitable for wireless ad hoc network | |
| CN101938418A (en) | Relaying method of power line communication network | |
| CN104883304B (en) | For part entangled quantum to the method for routing of bridge communications network | |
| US20070076629A1 (en) | Parallel constraint based path computation using path vector | |
| US20120163233A1 (en) | Method for transmitting routing information and routing apparatus in wireless network | |
| CN110831104A (en) | Routing method for linear topology wireless ad hoc network | |
| CN113727415B (en) | Method for improving AODV routing protocol by dynamically perceived unmanned aerial vehicle ad hoc network | |
| US20020009088A1 (en) | Systems and methods for negotiating virtual circuit paths in packet switched networks | |
| CN116582477A (en) | Unmanned aerial vehicle ad hoc network route management method and system | |
| US10420012B2 (en) | Adaptive unicast timeout for a wireless network having optimized routing | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| Abbas et al. | Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery |
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 |