Fast broadcasting and gossiping in radio networks
- 8 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 575-581
- https://doi.org/10.1109/sfcs.2000.892325
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Centralized broadcast in multihop radio networksJournal of Algorithms, 2003
- Fault-Tolerant Broadcasting in Radio NetworksJournal of Algorithms, 2001
- The Impact of Knowledge on Broadcasting Time in Radio NetworksPublished by Springer Nature ,1999
- 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
- Combinatorial Group Testing and Its ApplicationsSeries on Applied Mathematics, 1993
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channelsIEEE Transactions on Information Theory, 1985