Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.tcs.2011.08.012 | Algorithmic Aspects of Wireless Sensor Networks |
Keywords | Field | DocType |
single-hop network,wireless network,multi-channel network,Monitoring churn,worst-case fashion,asymptotically optimal time,significant amount,respective point,detects churn | Leader election,Wireless network,Collision detection,Computer science,Computer network,Distributed algorithm,Adversary,Logarithm,Asymptotically optimal algorithm,Distributed computing | Journal |
Volume | ISSN | ISBN |
453, | 0304-3975 | 3-642-16987-2 |
Citations | PageRank | References |
3 | 0.41 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephan Holzer | 1 | 225 | 11.29 |
| Yvonne Anne Pignolet | 2 | 118 | 21.26 |
| Jasmin Smula | 3 | 35 | 3.33 |
| Roger Wattenhofer | 4 | 1377 | 67.13 |