A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks

Authors:
H. Baala;O. Flauzac;J. Gaber;M. Bui;T. El-Ghazawi
Affiliations:
LICP, Université de Cergy pantoise, France;Université de Reims, France;Set, Université de Technologie de Belfort-Montbéliard, France;Université de Paris VIII, France;Department of Electrical and Computer Engineering, The George Washington University, 801 22nd St. N.W., Washington DC
Venue:
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Year:
2003

Citing 14
Cited 14

A fully distributed (minimal) spanning tree algorithm

Information Processing Letters
A modular technique for the design of efficient distributed leader finding algorithms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Token management schemes and random walks yield self-stabilizing mutual exclusion

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
On a random walk problem arising in self-stabilizing token management

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Collisions among random walks on a graph

SIAM Journal on Discrete Mathematics
Randomized algorithms

Randomized algorithms
Meeting times of random walks on graphs

Information Processing Letters
Dependent percolation and colliding random walks

Random Structures & Algorithms
Randomized Initialization Protocols for Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
More on the Power of Random Walks: Uniform Self-Stabilizing Randomized Algorithms (Preliminary Report)

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Mobile Agents for Electing a Leader

ISADS '99 Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems
Randomized Adaptive Routing Based on Mobile Agents

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks

Distributed holonic multi-agent system for resource discovery in grids

Multiagent and Grid Systems
Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks

Journal of Parallel and Distributed Computing
Mobile Agent-Based Approach for Resource Discovery in Peer-to-Peer Networks

Agents and Peer-to-Peer Computing
A Generic Distributed Algorithm for Computing by Random Mobile Agents

Agent Computing and Multi-Agent Systems
Fast distributed random walks

Proceedings of the 28th ACM symposium on Principles of distributed computing
A Query Routing Approach Based on Users' Satisfaction for Resource Discovery in Service-Oriented Networks

World Wide Web
Efficient distributed random walks with applications

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A tight unconditional lower bound on distributed randomwalk computation

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilization in spite of frequent changes of networks: case study of mutual exclusion on dynamic rings

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Random walks in distributed computing: a survey

IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
A probabilistic model for distributed merging of mobile agents

VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Distributed Random Walks

Journal of the ACM (JACM)
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algorithm based on homogeneous agents for constructing a random spanning tree. Our approach makes use of distributed random walks as a network traversal scheme, in order to handle dynamic topology changes in ad hoc wireless networks. Each random walk is represented by a mobile agent annexing a territory over the underlying network. These multiple random walks collapse into a final one that defines the random spanning tree. It will be shown that, compared to deterministically predetermined spanning trees, our algorithm is more resilient to transient failures that occur in ad hoc mobile networks.