Monitoring churn in wireless networks

Authors:
Stephan Holzer;Yvonne Anne Pignolet;Jasmin Smula;Roger Wattenhofer
Affiliations:
Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland;IBM Research, Zurich Research Laboratory, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland
Venue:
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Year:
2010

Citing 11
Cited 1

Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network

PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Energy-Efficient Communication in Multi-Channel Single-Hop Sensor Networks

ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

Distributed Computing
Quasi-optimal energy-efficient leader election algorithms in radio networks

Information and Computation
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Energy Efficient Alert in Single-Hop Networks of Extremely Weak Devices

Algorithmic Aspects of Wireless Sensor Networks
Meeting the deadline: on the complexity of fault-tolerant continuous gossip

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Merging and merge-sort in a single hop radio network

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Adversary immune size approximation of single-hop radio networks

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Basic computations in wireless networks

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Time-optimal information exchange on multiple channels

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. In this paper we propose a distributed algorithm for single-hop networks that detects churn and is resilient to a worst-case adversary. The nodes of the network are notified about changes quickly, in asymptotically optimal time up to an additive logarithmic overhead. We establish a trade-off between saving energy and minimizing the delay until notification for single- and multi-channel networks.