Near-optimal radio use for wireless network synchronization
DOI10.1016/j.tcs.2011.09.026zbMath1247.68014OpenAlexW2964107750MaRDI QIDQ714765
Rafail Ostrovsky, Eddie Kohler, Milan Bradonjić
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.09.026
algorithmswireless sensor networkenergy efficiencybirthday paradoxclock synchronizationprobabilistic protocols
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The firing squad synchronization problem for graphs
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- The firing squad synchronization problem for a class of polyautomata networks
- Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks.
- The diameter of random regular graphs
- Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
- Deterministic and Energy-Optimal Wireless Synchronization
- Centralized broadcast in multihop radio networks
- Clock Synchronization in Distributed Real-Time Systems
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Deterministic broadcasting in ad hoc radio networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Broadcast in radio networks tolerating byzantine adversarial behavior
- Principles of Distributed Systems
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Near-optimal radio use for wireless network synchronization
