Broadcasting algorithms in radio networks with unknown topology

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 492-501

  Czumaj, A ^a   Rytter, W ^a,b  

^a University Heights   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Broadcast technology; Computer science; Electronic mail; Informatics; Intelligent networks; Network topology; Radio broadcasting; Radio network; Radio networks; Upper bound

Indexed keywords

COMPLEX NETWORKS; COMPUTER SCIENCE; ELECTRONIC MAIL; INTELLIGENT NETWORKS; RADIO; TOPOLOGY;

BROADCAST TECHNOLOGY; INFORMATICS; NETWORK TOPOLOGY; RADIO NETWORKS; UPPER BOUND;

RADIO BROADCASTING;

EID: 74549168274     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238222     Document Type: Conference Paper

References (21)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43: 290-298, 1991.
2. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. Single round simulation on radio networks. Journal of Algorithms, 13: 188-210, 1992.
3. R. Bar-Yehuda, O. Goldreich, and A. Itai. Efficient emulation of single-hop radio network with collision on multi-hop radio network with no collision detection. Distributed Computing, 5: 67-71, 1991.
4. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45(1): 104-126, 1992.
5. I. Chlamtac and S. Kutten. On broadcasting in radio networks - problem analysis and protocol design. IEEE Transaction on Communications, 33(12): 1240-1246, 1985.
6. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Transaction on Communications, 39(3): 426-433, 1991.
7. B. S. Chlebus. Randomized communication in radio networks. In Handobook of Randomized Algorithms. 2001, vol. I, pages 401-456.
8. B. S. Chlebus, L. Ga¸sieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 861-870, 2000.
9. B. S. Chlebus, L. Ga¸sieniec, A. Östlin, and J. M. Robson. Deterministic Radio Broadcasting. In Proc. 27th ICALP, pages 717-728, 2000.
10. M. Chrobak, L. Ga¸sieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 575-581, 2000.
11. M. Chrobak, L. Ga¸sieniec, and W. Rytter. A randomized algorithm for gossiping in radio networks. In Proc. 7th COCOON, pages 483-492, 2001.
12. A. E. F. Clementi, A. Monti, and R. Silvestri. Distributed broadcasting in radio networks of unknown topology. Theoretical Computer Science, 302: 337-364, 2003.
13. I. Gaber and Y. Mansour. Broadcast in radio networks. Journal of Algorithms, 46(1): 1-20, 2003.
14. R. G. Gallager. A perspective on multiaccess channels. IEEE Transactions on Information Theory, 31(2): 124-142, 1985.
15. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 697-704, 2002.
16. D. Kowalski and A. Pelc. Deterministic broadcasting time in radio networks of unknown topology. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, pages 63-72, 2002.
17. D. Kowalski and A. Pelc. Faster deterministic broadcasting in ad hoc radio networks. In Proc. 20th STACS, pages 109-120, 2003.
18. D. Kowalski and A. Pelc. Deterministic broadcasting time in radio networks of unknown topology. To appear in Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003.
19. E. Kushilevitz and Y. Mansour. An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing, 27(3): 702-712, 1998.
20. D. Liu and M. Prabhakaran. On randomized broadcasting and gossiping in radio networks. In Proc. 8th COCOON, pages 340-349, 2002.
21. 1.5) determinstic gossiping algorithm for radio networks. Algorithmica, 36(1):93-96, 2003.