Monitoring churn in wireless networks

DOI10.1016/j.tcs.2011.08.012zbMath1247.68017OpenAlexW2180072861MaRDI QIDQ714767

Stephan Holzer, Jasmin Smula, Roger Wattenhofer, Yvonne Anne Pignolet

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.012

zbMATH Keywords

monitoringwireless networkssensor networksgroup membershipno collision detection

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Energy efficient alert in single-hop networks of extremely weak devices
• Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
• Quasi-optimal energy-efficient leader election algorithms in radio networks
• Distributed broadcast in radio networks of unknown topology.
• Probabilistic algorithms for the wake-up problem in single-hop radio networks
• Performing work in broadcast networks
• Maximum throughput of multiple access channels in adversarial environments
• Secure communication over radio channels
• DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
• Deterministic broadcasting in ad hoc radio networks
• Meeting the deadline
• Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
• Mathematical Foundations of Computer Science 2003
• Probability and Computing
• Algorithms - ESA 2003
• Algorithms and Computation
• SOFSEM 2006: Theory and Practice of Computer Science
• Theory and Applications of Models of Computation