Broadcasting algorithms in radio networks with unknown topology

Journal of Algorithms

Volumn 60, Issue 2, 2006, Pages 115-143

  Czumaj, Artur ^a   Rytter, Wojciech ^a,b  

^a University Heights   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TOPOLOGY;

BROADCASTING ALGORITHMS; CLASSICAL PROBLEM; ECCENTRICITY;

ALGORITHMS;

EID: 33745192089     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.08.001     Document Type: Article

References (15)

1. Alon N., Bar-Noy A., Linial N., and Peleg D. A lower bound for radio broadcast. J. Comput. System Sci. 43 (1991) 290-298
2. Bar-Yehuda R., Goldreich O., and Itai A. On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. System Sci. 45 1 (1992) 104-126
3. Chlamtac I., and Kutten S. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33 12 (1985) 1240-1246
4. Chlebus B.S., Ga̧sieniec L., Gibbons A., Pelc A., and Rytter W. Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15 1 (2002) 27-38
5. Chlebus B.S., Ga̧sieniec L., Östlin A., and Robson J.M. Deterministic radio broadcasting. In: Montanari U., Rolim J.D.P., and Welzl E. (Eds). Proceedings of the 27th Annual International Colloquium on Automata, Languages and Programming (ICALP), Geneva, Switzerland, July 9-15, 2000. Lecture Notes in Comput. Sci. vol. 1853 (2000), Springer-Verlag, Berlin 717-728
6. Chrobak M., Ga̧sieniec L., and Rytter W. Fast broadcasting and gossiping in radio networks. J. Algorithms 43 2 (2002) 177-189
7. Chrobak M., Ga̧sieniec L., and Rytter W. A randomized algorithm for gossiping in radio networks. In: Wang J. (Ed). Proceedings of the 7th Annual International Computing Combinatorics Conference (COCOON), Guilin, China, August 20-23, 2001. Lecture Notes in Comput. Sci. vol. 2108 (2001), Springer-Verlag, Berlin 483-492
8. Clementi A.E.F., Monti A., and Silvestri R. Distributed broadcasting in radio networks of unknown topology. Theoret. Comput. Sci. 302 (2003) 337-364
9. Gaber I., and Mansour Y. Broadcast in radio networks. J. Algorithms 46 1 (2003) 1-20
10. Indyk P. Explicit constructions of selectors and related combinatorial structures, with applications. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). San Francisco, CA, January 6-8, 2002 (2002), SIAM, Philadelphia, PA 697-704
11. Kowalski D., and Pelc A. Faster deterministic broadcasting in ad hoc radio networks. In: Alt H., and Habib M. (Eds). Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Berlin, Germany, February 27-March 1, 2003. Lecture Notes in Comput. Sci. vol. 2607 (2003), Springer-Verlag, Berlin 109-120
12. Kowalski D., and Pelc A. Deterministic broadcasting time in radio networks of unknown topology. Proceedings of the 22nd ACM Symposium on Principles of Distrib. Comput. (PODC). Boston, MA, July 13-16, 2003 (2003), ACM Press, New York, NY 73-82
13. Kushilevitz E., and Mansour Y. An Ω (D log (N / D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27 3 (1998) 702-712
14. Liu D., and Prabhakaran M. On randomized broadcasting and gossiping in radio networks. In: Ibarra O.H., and Zhang L. (Eds). Proceedings of the 8th Annual International Computing Combinatorics Conference (COCOON). Singapore, August 15-17, 2002. Lecture Notes in Comput. Sci. vol. 2387 (2002), Springer-Verlag, Berlin 340-349
15. 1.5) deterministic gossiping algorithm for radio networks. Algorithmica 36 1 (2003) 93-96