Random walk for self-stabilizing group communication in ad hoc networks

Shlomi Dolev; Elad Schiller; Jennifer L. Welch

doi:10.1109/TMC.2006.104

Random walk for self-stabilizing group communication in ad hoc networks

Shlomi Dolev, Elad Schiller, Jennifer L. Welch

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

77 Scopus citations

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.

Original language	English
Article number	1637437
Pages (from-to)	893-905
Number of pages	13
Journal	IEEE Transactions on Mobile Computing
Volume	5
Issue number	7
DOIs	https://doi.org/10.1109/TMC.2006.104
State	Published - 1 Jul 2006

Keywords

Ad hoc networks
Group communication
Random walk
Self-stabilization

ASJC Scopus subject areas

Software
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/TMC.2006.104

Cite this

@article{2052ff76c14c41889778cc24be83028d,

title = "Random walk for self-stabilizing group communication in ad hoc networks",

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 = "Ad hoc networks, Group communication, Random walk, Self-stabilization",

author = "Shlomi Dolev and Elad Schiller and Welch, {Jennifer L.}",

note = "Funding Information: The authors would like to thank Uriel Feige for helpful discussions, Lyn Pierce for improving the presentation, and Nir Alfasi for performing the simulations. This work was partially supported by US National Science Foundation Award CCR-0098305, Texas Advanced Research Program Award 00512-0091-2001, and Rita Altura Trust Chair. An extended abstract of this work was presented at the 21st IEEE Symposium on Reliable Distributed Systems, Japan, 2002.",

year = "2006",

month = jul,

day = "1",

doi = "10.1109/TMC.2006.104",

language = "English",

volume = "5",

pages = "893--905",

journal = "IEEE Transactions on Mobile Computing",

issn = "1536-1233",

publisher = "Institute of Electrical and Electronics Engineers",

number = "7",

}

TY - JOUR

T1 - Random walk for self-stabilizing group communication in ad hoc networks

AU - Dolev, Shlomi

AU - Schiller, Elad

AU - Welch, Jennifer L.

N1 - Funding Information: The authors would like to thank Uriel Feige for helpful discussions, Lyn Pierce for improving the presentation, and Nir Alfasi for performing the simulations. This work was partially supported by US National Science Foundation Award CCR-0098305, Texas Advanced Research Program Award 00512-0091-2001, and Rita Altura Trust Chair. An extended abstract of this work was presented at the 21st IEEE Symposium on Reliable Distributed Systems, Japan, 2002.

PY - 2006/7/1

Y1 - 2006/7/1

N2 - 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.

AB - 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.

KW - Ad hoc networks

KW - Group communication

KW - Random walk

KW - Self-stabilization

UR - http://www.scopus.com/inward/record.url?scp=33746628606&partnerID=8YFLogxK

U2 - 10.1109/TMC.2006.104

DO - 10.1109/TMC.2006.104

M3 - Article

AN - SCOPUS:33746628606

SN - 1536-1233

VL - 5

SP - 893

EP - 905

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

IS - 7

M1 - 1637437

ER -

Random walk for self-stabilizing group communication in ad hoc networks

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this