SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Route Maintenance in a Wireless Mobile Ad Hoc Network
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Shortcut Detection and Route Repair in Ad Hoc Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Routing with adaptive path and limited flooding for mobile ad hoc networks
Computers and Electrical Engineering
Model and analysis of path compression for mobile Ad Hoc networks
Computers and Electrical Engineering
Hi-index | 0.00 |
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may make the connection route sub-optimal in terms of hop length, thereby resulting in unnecessarily high end-to-end delays, energy consumption and channel contention. In AODV, for example, a connection route is recomputed only if one of its constituent links suffers catastrophic failure, at which point global route discovery attempts repair, and after which the topological structure of the connection again returns to near-optimality. In this paper, we propose an extension to AODV that performs periodic subconnection shrinking of the topological substructure within each connection. We show that this not only reduces the average end-to-end connection length, but also increases the mean time between catastrophic link failures of the connection's constituent links, thereby reducing the number of repair-related global route discoveries experienced. The control traffic needed to operate our scheme can be amortized against the reduction in repair-related global route discovery traffic. Through ns2 simulations, we show that our dynamic subconnection shrinking scheme manifests connections that, on average, have (i) shorter hop length, (ii) higher packet delivery fraction; moreover, this extension operates using less control traffic than standard AODV. We demonstrate that these conclusions continue to hold scalably over a wide range of operating regimes.