A distributed routing algorithm for mobile wireless networks
Wireless Networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
An Efficient Communication Strategy for Ad-hoc Mobile Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Ad Hoc Networking
A mobility sensitive approach for efficient routing in ad hoc mobile networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
A Distributed O(|E|) Algorithm for Optimal Link-Reversal
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Algorithms for ad hoc and sensor networks
Computer Communications
Modeling and analysis of a stable direction-based routing protocol in vehicle mobile ad hoc networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Configurable links for runtime adaptive on-chip communication
Proceedings of the Conference on Design, Automation and Test in Europe
Brief announcement: full reversal routing as a linear dynamical system
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Full reversal routing as a linear dynamical system
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Energy-Efficient data dissemination in sensor networks using distributed dynamic tree management
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Adaptive sink mobility management scheme for wireless sensor networks
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
Implementation of a cluster based routing protocol for mobile networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Efficient checking of link-reversal-based concurrent systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when the network topology changes frequently. In link reversal, a node reverses its incident links whenever it loses routes to the destination. Link reversal algorithms have been studied experimentally and have been used in practical routing algorithms, including [8].This paper presents the first formal performance analysis of link reversal algorithms. We study these algorithms in terms of work (number of node reversals) and the time needed until the network stabilizes to a state in which all the routes are reestablished. We focus on the full reversal algorithm and the partial reversal algorithm, both due to Gafni and Berstekas [5]; the first algorithm is simpler, while the latter has been found to be more efficient for typical cases. Our results are as follows:(1) The full reversal algorithm requires O(n2) work and time, where n is the number of nodes which have lost the routes to the destination.(2) The partial reversal algorithm requires O(n • a* + n2) work and time, where a* is a non-negative integer which depends on the state of the network. This bound is tight in the worst case, for any a*.(3) There are networks such that for every deterministic link reversal algorithm, there are initial states which require requires ω(n2) work and time to stabilize. Therefore, surprisingly, the full reversal algorithm is asymptotically optimal in the worst case, while the partial reversal algorithm is not, since a* can grow arbitrarily large.