Routing method for greedy geographical routing protocol tangent switching hole processing
A geographical routing and hollowing technology, applied in the field of communication, can solve the problem of reducing the number of routing hops, achieve the effect of reducing control overhead and improving the success rate of transmission
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0061] The routing method of the greedy geographical routing protocol for tangent switching hole processing is shown in Figure 5. A network topology map with 500 nodes is randomly generated, and the communication radius is 50. The GG algorithm is used to planarize the network topology map so that there is no gap between nodes. crossed sides. Let the source node ID be 209, and the destination node ID be 472 (coordinates x4=709, y4=617), in this scenario, the specific implementation steps of node 209 running routing protocol with reference to Figure 4, described as follows:
[0062] 1) Construct a Hello packet and broadcast it, and the target node will periodically broadcast its location information to the entire network. All nodes in the wireless sensor network use their own node identification numbers and location information to construct Hello packets, and periodically broadcast Hello packets to their one-hop neighbors. The nodes that receive the Hello packets store the packe...
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