On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn Part F130235, Issue , 1987, Pages 98-108

  Bar Yehuda, Reuven ^a   Goldreich, Oded ^a   Itai, Alon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS; INTERNET PROTOCOLS; RADIO BROADCASTING; RANDOM PROCESSES;

BROADCAST PROTOCOLS; LOWER BOUNDS; MULTI-HOP RADIO NETWORKS; RADIO NETWORKS; RANDOMIZED PROTOCOLS; TIME COMPLEXITY; TIME SLOTS;

COMPLEX NETWORKS;

EID: 85032225026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41840.41849     Document Type: Conference Paper

References (19)

1. Abramson, N., "The Aloha system - Another approach for computer communications", in Proc. Fall Joint Computer Conf. AFIPS Conf., Vol. 37, (1970).
2. Bendy J. and Yao A.C., "An almost optimal algorithm for unbounded search", Inf. Proc. Letters, Vol. 5 (1976), 82-87.
3. Capetanakis, J., "Generalized TDMA: The multi-accessing tree protocol", IEEE Trans. Commun., Vol. COM-27, 1479-1484, (1979).
4. Chlamtac, I. and Kutten, S., "On Broadcasting in Radio Networks-Problem Analysis and Protocol Design", IEEE Transactions on Communications, December (1985), Vol COM-33, No. 12.
5. Chlamtac, I. and Weinstein O. "The wave expansion approach to broadcasting in multihop radio networks", INFOCOM (April 1987).
6. Digital-Intel-Xerox, "The Ethernet data link layer and physical layer specification 1.0" (Sept. 1980).
7. Erdos, P., and J, Spencer, Probabilistic Methods in Combinatorics, Academic Press, (1974).
8. Even, S., Goldreich, O., Moran S. and Tong, P., "On the NP Completeness of Certain Network Testing Problems", Networks, Vol. 14, (1984), 1-24.
9. Gallager, R., "A perspective on multiaccess channels", IEEE Trans, on Inf. Theory, Vol. IT-31 (1985), 124-142.
10. Gitman, L, Van Slyke, R.M. and Frank, H., "Routing in Packet-Switching Broadcast Radio Networks", IEEE Transactions on Communications, (August 1976), 926-930.
11. Hayes, J.F., "An adaptive technique for local distribution", IEEE Trans, on Commun., Vol. COM-26, (1978), 1178-1186.
12. Hofri, M., "A Feedback-less Distributed Broadcast Algorithm for Multihop Radio Networks with Time-varying Structure", 2nd ACM Intr. MCPR Workshop, Rome (May 1987). Also available as TR-451, Computer Science Dept., Technion, Haifa, Israel (March 1987).
13. Itai, A. and Rodeh, M., "Probabilistic Methods for Breaking Symmetry in Distributive Networks", Foundation of Computer Science (FOCS) 81, Nashvillc, Tenn. (Nov. 1981).
14. Komlós, J. and Greenberg A.G., "An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels", IEEE Trans, on Inf. Theory, Vol. IT-31 (1985), 302-306.
15. M.O. Rabin, "Probabilistic algorithms", Proc. Symp. on New Directions and Recent Results in Algorithms and Complexity, J.F. Traub ed., Academic Press, (1976).
16. Tsybakov, B.S. and Mikhailov, V.A., "Free synchronous packet access in a broadcast channel with feedback", Prob. Inform. Th., Vol. 14, 259-280, (1979).
17. Valiant, L.G., and V.V. Vazirani, "NP is as Easy as Detecting Unique Solutions", Proc. 17th STOC, 458-463, (1985).
18. Weinstein O., "The wave expansion approach to broadcasting in multihop radio networks", M. Sc. Thesis, Computer Science Dept., Technion, Haifa, Israel, in preparation, (1987).
19. Willard D.E., "Log-logarithmic selection protocols for resolving semaphore conflicts on multiple access channels", to appear in SIAM J. on Comput. (1986).