Random walk for self-stabilizing group communication in ad hoc networks
Authors:
- S. DolevSDS. Dolev
- J.L. WelchJWJ.L. Welch
- 30 May 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 5 (7) , 893-905
Abstract
We introduce a self-stabilizing group communication system for ad hoc networks. The system design is based on a mobile agent, collecting and distributing information, during a random walk. Three possible settings for modeling the location of the mobile nodes (processors) in the ad hoc network are presented: slow location change, complete random change, and neighbors with probability. The group membership algorithm is based on a mobile agent collecting and distributing information. The new techniques support group membership and multicast, and also support resource allocation.Keywords
This publication has 26 references indexed in Scilit:
- Communication adaptive self-stabilizing group membership serviceIEEE Transactions on Parallel and Distributed Systems, 2003
- Group communication specificationsACM Computing Surveys, 2001
- Self-Stabilizing Agent TraversalLecture Notes in Computer Science, 2001
- An Efficient Communication Strategy for Ad-hoc Mobile Networks2001
- Specifying and using a partitionable group communication serviceACM Transactions on Computer Systems, 2001
- A fast randomized LOGSPACE algorithm for graph connectivityTheoretical Computer Science, 1996
- A tight lower bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- Efficient fault-tolerant algorithms for distributed resource allocationACM Transactions on Programming Languages and Systems, 1995
- Collisions Among Random Walks on a GraphSIAM Journal on Discrete Mathematics, 1993
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974