Distributed broadcast in radio networks of unknown topology
Top Cited Papers
Open Access
- 13 June 2003
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 302 (1-3), 337-364
- https://doi.org/10.1016/s0304-3975(02)00851-4
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A mobility-transparent deterministic broadcast mechanism for ad hoc networksIEEE/ACM Transactions on Networking, 1999
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio NetworksSIAM Journal on Computing, 1998
- Time-spread multiple-access (TSMA) protocols for multihop mobile radio networksIEEE/ACM Transactions on Networking, 1997
- Lower bounds for the broadcast problem in mobile radio networksDistributed Computing, 1997
- Onr-Cover-free FamiliesJournal of Combinatorial Theory, Series A, 1996
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- Forbidding just one intersectionJournal of Combinatorial Theory, Series A, 1985
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985
- Nonrandom binary superimposed codesIEEE Transactions on Information Theory, 1964