Title
Self-Stabilizing Local Routing in Ad Hoc Networks
Abstract
We present a self-stabilizing optimal (in terms of the distance) local routing algorithm () for a wireless mobile ad hoc network. The distance may represent various metrics, including the real distance and the number of hops. The optimal routing for any node is computed for t closest nodes (called t-set) where t is an application-dependent parameter and is decided in advance. The locality is defined with respect to the t-set, not with respect to the direct neighbours. Our protocol is a particular case of distance vector routing protocol, where the number of entries in the routing table is limited to t. A self-stabilizing system has the ability to automatically recover to normal behaviour in case of transient faults without a centralized control. Each node can start in some arbitrary state and with no knowledge of the network architecture, but still eventually computes a correct routing table for the nodes in its t-set. If we assume that the t-set represents the set of destinations for which the shortest path needs to be computed, becomes an optimal on-demand routing protocol. It can be extended to a global routing protocol by using features specific to other protocols (e.g. hierarchical routing, cluster routing, interval routing, etc.).
Year
DOI
Venue
2007
10.1093/comjnl/bxl059
Comput. J.
Keywords
Field
DocType
distributed algorithm,ad hoc network,network architecture,routing protocol,shortest path,mobile ad hoc network,mobile network,hierarchical routing
Link-state routing protocol,Dynamic Source Routing,Computer science,Path vector protocol,Static routing,Enhanced Interior Gateway Routing Protocol,Destination-Sequenced Distance Vector routing,Computer network,Wireless Routing Protocol,Theoretical computer science,Zone Routing Protocol,Distributed computing
Journal
Volume
Issue
ISSN
50
2
0010-4620
Citations 
PageRank 
References 
1
0.36
9
Authors
3
Name
Order
Citations
PageRank
Doina Bein110321.64
Ajoy Kumar Datta231740.76
Vincent Villain354445.77