Fast broadcasting and gossiping in radio networks
- 1 May 2002
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 43 (2) , 177-189
- https://doi.org/10.1016/s0196-6774(02)00004-4
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Faster broadcasting in unknown radio networksInformation Processing Letters, 2001
- Information theory and communication networks: an unconsummated unionIEEE Transactions on Information Theory, 1998
- 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
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- Single round simulation on radio networksJournal of Algorithms, 1992
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985
- The collision channel without feedbackIEEE Transactions on Information Theory, 1985
- Born again group testing: Multiaccess communicationsIEEE Transactions on Information Theory, 1985
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channelsIEEE Transactions on Information Theory, 1985