Sciweavers

Share
TOCS
2008

RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks

8 years 9 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership service is useful, e.g., in data dissemination algorithms, lookup and discovery services, peer sampling services, and complete membership construction. The design of RaWMS is based on a novel reverse random walk (RW) sampling technique. The paper includes a formal analysis of both the reverse RW sampling technique and RaWMS and verifies it through a detailed simulation study. In addition, RaWMS is compared with a number of other known methods such as flooding and gossip-based techniques. Categories and Subject Descriptors: C.2.1 [Comp.-Communication Networks]: Network Architecture and Design--Wireless communication; C.2.4 [Comp.-Communication Networks]: Distributed Systems--Distributed applications General Terms: Algorithms, Design.
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TOCS
Authors Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
Comments (0)
books