RaWMS -: random walk based lightweight membership service for wireless ad hoc network

Authors:
Ziv Bar-Yossef;Roy Friedman;Gabriel Kliot
Affiliations:
Technion - Israel Institute of Technology, Haifa, Israel;Technion - Israel Institute of Technology, Haifa, Israel;Technion - Israel Institute of Technology, Haifa, Israel
Venue:
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Year:
2006

Citing 17
Cited 12

Randomized algorithms

Randomized algorithms
A fast randomized LOGSPACE algorithm for graph connectivity

ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Random walk for self-stabilizing group communication in ad hoc networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Approximating Aggregate Queries about Web Pages via Random Walks

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication

NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
Araneola: A Scalable Reliable Multicast System for Dynamic Environments

NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Fastest Mixing Markov Chain on a Graph

SIAM Review
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks

WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
The peer sampling service: experimental evaluation of unstructured gossip-based implementations

Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Correctness of a gossip based membership protocol

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Gossiping in distributed systems

ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols

ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Gossiping on MANETs: the beauty and the beast

ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Many random walks are faster than one

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Brahms: byzantine resilient random membership sampling

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Random walk with long jumps for wireless ad hoc networks

Ad Hoc Networks
Brahms: Byzantine resilient random membership sampling

Computer Networks: The International Journal of Computer and Telecommunications Networking
Correctness of gossip-based membership under message loss

Proceedings of the 28th ACM symposium on Principles of distributed computing
Using Heterogeneity to Enhance Random Walk-based Queries

Journal of Signal Processing Systems
Lukewarm potato forwarding: a biased random walk routing protocol for wireless sensor networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Radio cover time in hyper-graphs

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Radio cover time in hyper-graphs

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 member-ship construction. The design of RaWMS is based on a novel re-verse 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.