A better wake-up in radio networks

DOI10.1145/1011767.1011806zbMath1321.68019OpenAlexW1984375161MaRDI QIDQ5501506

Bogdan S. Chlebus, Dariusz R. Kowalski

Publication date: 3 August 2015

Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1011767.1011806

zbMATH Keywords

synchronizationexpanderleader electionmulti-hop radio networkad-hoc networkradio synchronizerwake-up problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (20)

Performing work in broadcast networks ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Faster deterministic wakeup in multiple access channels ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Deterministic Communication in Radio Networks ⋮ Activating anonymous ad hoc radio networks ⋮ Modeling radio networks ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Energy efficient alert in single-hop networks of extremely weak devices ⋮ Unnamed Item ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Efficient and competitive broadcast in multi-channel radio networks

This page was built for publication: A better wake-up in radio networks