𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preemptive routing in ad hoc networks

✍ Scribed by Tom Goff; Nael Abu-Ghazaleh; Dhananjay Phatak; Ridvan Kahvecioglu


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
458 KB
Volume
63
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis


Routing in ad hoc networks is a challenging problem because nodes are mobile and links are continuously being created and broken. Existing on-demand ad hoc routing algorithms initiate route discovery only after a path breaks, incurring a significant cost in detecting the disconnection and establishing a new route. In this work, we investigate adding proactive route selection and maintenance to on-demand ad hoc routing algorithms. More specifically, when a path is likely to be broken, a warning is sent to the source indicating the likelihood of a disconnection. The source can then initiate path discovery early, potentially avoiding the disconnection altogether. A path is considered likely to break when the received packet power becomes close to the minimum detectable power (other approaches are possible). Care must be taken to avoid initiating false route warnings due to fluctuations in received power caused by fading, multipath effects and similar random transient phenomena. Experiments demonstrate that adding proactive route selection and maintenance to DSR and AODV (on-demand ad hoc routing protocols) significantly reduces the number of broken paths, with a small increase in protocol overhead. Packet latency and jitter go down in most cases. Because preemptive routing reduces the number of broken paths, it also has a secondary effect on TCP performance-unnecessary congestion handling measures are avoided. This is observed for TCP traffic under different traffic patterns (telnet, ftp and http). Additionally, we outline some problems in TCP performance in ad hoc environments.


πŸ“œ SIMILAR VOLUMES


Mobility prediction and routing in ad ho
✍ William Su; Sung-Ju Lee; Mario Gerla πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 392 KB πŸ‘ 1 views

## Abstract By exploiting non‐random behaviors for the mobility patterns that mobile users exhibit, we can predict the future state of network topology and perform route reconstruction proactively in a timely manner. Moreover, by using the predicted information on the network topology, we can elimi