A better wake-up in radio networks
From MaRDI portal
Publication:5501506
DOI10.1145/1011767.1011806zbMath1321.68019MaRDI 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
synchronization; expander; leader election; multi-hop radio network; ad-hoc network; radio synchronizer; wake-up problem
68W05: Nonnumerical algorithms
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
Related Items
Deterministic Communication in Radio Networks, Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses, Unnamed Item, Coordination Problems in Ad Hoc Radio Networks, Improved lower bound for deterministic broadcasting in radio networks, Modeling radio networks, Energy efficient alert in single-hop networks of extremely weak devices, Faster deterministic wakeup in multiple access channels, Scalable wake-up of multi-channel single-hop radio networks, Acknowledged broadcasting in ad hoc radio networks, Activating anonymous ad hoc radio networks, Singletons for simpletons revisiting windowed backoff with Chernoff bounds, Efficient and competitive broadcast in multi-channel radio networks, Windowed backoff algorithms for WiFi: theory and performance under batched arrivals, Global synchronization and consensus using beeps in a fault-prone multiple access channel, Performing work in broadcast networks, Broadcasting in UDG radio networks with unknown topology, Contention resolution in a non-synchronized multiple access channel, Deterministic non-adaptive contention resolution on a shared channel, Time-Efficient Broadcast in Radio Networks
