On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
Authors:
- Reuven Bar-YehudaRBReuven Bar-Yehuda
- Oded GoldreichOGOded Goldreich
- Alon ItaiAIAlon Itai
- 1 August 1992
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 45 (1) , 104-126
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- The wave expansion approach to broadcasting in multihop radio networksIEEE Transactions on Communications, 1991
- Multiple communication in multi-hop radio networks1989
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access ChannelSIAM Journal on Computing, 1986
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsJournal of the ACM, 1985
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985
- Born again group testing: Multiaccess communicationsIEEE Transactions on Information Theory, 1985
- Generalized TDMA: The Multi-Accessing Tree ProtocolIEEE Transactions on Communications, 1979
- An Adaptive Technique for Local DistributionIEEE Transactions on Communications, 1978
- Routing in Packet-Switching Broadcast Radio NetworksIEEE Transactions on Communications, 1976