A hybrid routing protocol design optimization method of a high-altitude high-speed mobile node ad hoc network
A routing protocol, high-speed mobile technology, applied in wireless communication, electrical components, etc., can solve the problems that nodes cannot obtain the required routes in time, cannot obtain the required routes, and the network topology changes rapidly, so as to achieve timely route acquisition and reduce The amount of computation and the effect of reducing end-to-end delay
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0036] Embodiment 1: The hybrid routing protocol combines the advantages of the active routing protocol and the on-demand routing protocol. Its basic idea is: if the destination node is in the local routing table, then directly look up the table to obtain the best route; if the destination node is not in the local In the routing table, use the best route acquisition algorithm based on the A* algorithm to obtain the best route.
Embodiment 2
[0037] Embodiment 2: In the method described in Embodiment 1, the attributes included in the local routing table are the destination node, the route to the destination node, and the path weight. The path weight refers to the weight of the first node among the nodes listed in the route from the source node to the destination node. The method for obtaining the local routing table is as follows: each node exchanges information with nodes in its logical neighbor node set. Then use the Dijkstra algorithm to construct the local shortest path tree, obtain the best route of each node and each node in the local node set, and obtain the local routing table.
Embodiment 3
[0038] Embodiment 3: as the method described in embodiment 1, the execution steps of the best route acquisition algorithm based on A* algorithm are:
[0039] (1) First define two lists called open list and close list, and add the source node to the open list.
[0040] (2) Traverse the nodes in the open list, calculate their cost function for each node, find the point with the smallest cost function, and this node is the currently processed node. Then add him to the close list.
[0041] (3) The neighbor nodes of the current node to be processed are divided into three situations: if it is unreachable due to failure or other reasons or it is in the close list, ignore it directly; if it is not in the open list, put it Add to the open list, and set the current node to be processed as its parent node, and then calculate its cost function; if it is already in the open list, determine whether the route from the current node to be processed to reach it is better, if better , change i...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com