A Distributed O(|E|) Algorithm for Optimal Link-Reversal

Authors:
Sukhamay Kundu
Affiliations:
Computer Sc. Dept, Louisiana State University, Baton Rouge, USA LA 70803
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 6
Cited 0

A distributed routing algorithm for mobile wireless networks

Wireless Networks
Topology control and routing in ad hoc networks: a survey

ACM SIGACT News
Analysis of link reversal routing algorithms for mobile ad hoc networks

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
A Performance Comparison of the Temporally-Ordered Routing Algorithm and Ideal Link-State Routing

ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Ad Hoc Networking

Ad Hoc Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We first characterize the minimal link-sets L whose directions must be reversed for reestablishing one or more directed paths from each node x to a fixed destination node d in a network when a link fails. Then, we give a distributed O (|E |) algorithm for determining such a link-set L , where |E | = $\sharp$(links in the network). This improves the previous lower bound O (n 2 ), where n = $\sharp$(nodes in the network). The minimality of the reversed link-set L has other important consequences.