Probabilistic algorithms for the wake-up problem in single-hop radio networks
From MaRDI portal
Publication:1780847
DOI10.1007/s00224-005-1144-3zbMath1105.68115MaRDI 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
Related Items
Unnamed Item, Approximate Neighbor Counting in Radio Networks, Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election, Distributed minimum dominating set approximations in restricted families of graphs, Unbounded contention resolution in multiple-access channels, 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, Scalable wake-up of multi-channel single-hop radio networks, Consensus and collision detectors in radio networks, Contention resolution in a non-synchronized multiple access channel