Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks

Authors:
Shlomi Dolev;Elad Schiller;Jennifer Welch
Affiliations:
-;-;-
Venue:
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Year:
2002

Citing 0
Cited 23

Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks

IEEE Transactions on Mobile Computing
Distributed Token Circulation in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Autonomous virtual mobile nodes

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
GeoQuorums: implementing atomic memory in mobile ad hoc networks

Distributed Computing - Special issue: DISC 03
The power of choice in random walks: an empirical study

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks

Journal of Parallel and Distributed Computing
On the cover time and mixing time of random geometric graphs

Theoretical Computer Science
The power of choice in random walks: An empirical study

Computer Networks: The International Journal of Computer and Telecommunications Networking
Random walk based routing protocol for wireless sensor networks

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Many random walks are faster than one

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
The hitting and cover times of random walks on finite graphs using local degree information

Theoretical Computer Science
Using Heterogeneity to Enhance Random Walk-based Queries

Journal of Signal Processing Systems
Quiescence of self-stabilizing gossiping among mobile agents in graphs

Theoretical Computer Science
Self-stabilizing group communication in directed networks

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
On the self-stabilization of mobile robots in graphs

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
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
Stabilizing consensus in mobile networks

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
On the cover time of random geometric graphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Topological adaptability for the distributed token circulation paradigm in faulty environment

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Random walks and Green's function on digraphs: a framework for estimating wireless transmission costs

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce a self-stabilizing group communication system for ad-hoc networks. The system design is based on random walks of mobile agents. Three possible settings for modeling the location of the 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 collecting and distributing information by a mobile agent. The new techniques support group membership and multicast, and also support resource allocation.