Probabilistic algorithms for the wake-up problem in single-hop radio networks

DOI10.1007/s00224-005-1144-3zbMath1105.68115OpenAlexW1990661532MaRDI QIDQ1780847

Grzegorz Stachowiak, Tomasz Jurdziński

Publication date: 14 June 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1144-3

zbMATH Keywords

logarithmic waking algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20)

Related Items (11)

Consensus and collision detectors in radio networks ⋮ Distributed minimum dominating set approximations in restricted families of graphs ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Unbounded contention resolution in multiple-access channels ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Initializing sensor networks of non-uniform density in the weak sensor model ⋮ Monitoring churn in wireless networks ⋮ Energy efficient alert in single-hop networks of extremely weak devices ⋮ Unnamed Item ⋮ Approximate Neighbor Counting in Radio Networks

This page was built for publication: Probabilistic algorithms for the wake-up problem in single-hop radio networks