Monitoring churn in wireless networks

Authors:
Stephan Holzer;Yvonne Anne Pignolet;Jasmin Smula;Roger Wattenhofer
Affiliations:
Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland;ABB Corporate Research, Dättwil, Switzerland;Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland;Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland
Venue:
Theoretical Computer Science
Year:
2012

Citing 18
Cited 0

Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection

IEEE Transactions on Parallel and Distributed Systems
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Energy-Efficient Communication in Multi-Channel Single-Hop Sensor Networks

ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks

Theory of Computing Systems
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

Distributed Computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Quasi-optimal energy-efficient leader election algorithms in radio networks

Information and Computation
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Secure communication over radio channels

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
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
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

Wireless networks often experience a significant amount of churn, i.e. the arrival and departure of nodes, and often it is necessary to keep all nodes informed about all other nodes in the network. In this paper, we propose a distributed algorithm for single-hop networks that detects churn, meaning that the nodes observe other nodes joining or leaving the network and inform all other nodes in the network about their observations. Our algorithm works correctly even if the nodes which join or leave and the respective points in time are chosen by an adversary in a worst-case fashion. The delay until notification is small, such that all nodes of the network are informed about changes quickly, in asymptotically optimal time. We establish a trade-off between saving energy and minimizing the delay until notification for single- and multi-channel networks.