A better wake-up in radio networks
- 25 July 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 266-274
- https://doi.org/10.1145/1011767.1011806
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Fast broadcasting and gossiping in radio networksJournal of Algorithms, 2002
- Deterministic broadcasting in ad hoc radio networksDistributed Computing, 2002
- Loss-less condensers, unbalanced expanders, and extractorsPublished by Association for Computing Machinery (ACM) ,2001
- The Wakeup Problem in Synchronous Broadcast SystemsSIAM Journal on Discrete Mathematics, 2001
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio NetworksSIAM Journal on Computing, 1998
- Lower bounds for the broadcast problem in mobile radio networksDistributed Computing, 1997
- The Wakeup ProblemSIAM Journal on Computing, 1996
- Multiple Communication in Multihop Radio NetworksSIAM Journal on Computing, 1993
- A lower bound for radio broadcastJournal of Computer and System Sciences, 1991
- Complexity of network synchronizationJournal of the ACM, 1985