Wireless ad hoc network reactive route method based on probability
A wireless self-organizing and reactive technology, applied in the field of establishing a path between a source and Shinjuku, can solve the problems of waste and seriousness, and achieve the effect of reducing communication overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment Construction
[0015] Routing scheme of the present invention is as follows:
[0016] Routing includes two stages: route discovery and route maintenance:
[0017] The route discovery process (Route Discovery) is as follows:
[0018] When the source s has data to transmit to the sink t, but there is no path information to reach t, the source s generates a routing request message (RREQ, Route Request). RREQ includes the following information: source ID, sink ID, RREQ sequence number, and the value of forwarding probability p* of intermediate nodes. Then, source s broadcasts the RREQ packet to neighbors and starts a timer.
[0019] When a non-receiver node (that is, an intermediate node) receives a non-repeated RREQ, the node forwards the RREQ with probability p*. If it decides to forward, the node will record the node that sent the RREQ packet to itself as the previous hop node, and save an entry (record source ID, previous hop ID, RREQ sequence number) for this routin...
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