The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Routing in Wireless Ad Hoc and Sensor Networks
Abstract
Routing is the process of finding a path from a source node to a destination node. Since each node has a limited transmission range, the message is normally forwarded by other nodes in an ad hoc or sensor network. Therefore routes normally consist of several hops. Proposed routing schemes can be divided into topological and position based, depending on the availability of geographic location for nodes. Topological routing may be proactive or reactive. Position based routing consists of greedy approaches applied when a neighbor closer to the destination (than the node currently holding the packet) exists, and recovery schemes otherwise. In order to preserve bandwidth and power which are critical resources in ad hoc and sensor networks, localized approaches are proposed, where each node acts based solely on the location of itself, its neighbors, and the destination. There are various measures of optimality which lead to various schemes which optimize hop count, power, network lifetime, delay, or other metrics. A uniform solution based on ratio of cost and progress is described here
Related Content
Nithin Kalorth, Vidya Deshpande.
© 2024.
7 pages.
|
Nitesh Behare, Vinayak Chandrakant Shitole, Shubhada Nitesh Behare, Shrikant Ganpatrao Waghulkar, Tabrej Mulla, Suraj Ashok Sonawane.
© 2024.
24 pages.
|
T.S. Sujith.
© 2024.
13 pages.
|
C. Suganya, M. Vijayakumar.
© 2024.
11 pages.
|
B. Harry, Vijayakumar Muthusamy.
© 2024.
19 pages.
|
Munise Hayrun Sağlam, Ibrahim Kirçova.
© 2024.
19 pages.
|
Elif Karakoç Keskin.
© 2024.
19 pages.
|
|
|