Fault-Tolerant Broadcasting in Radio Networks

Journal of Algorithms

Volumn 39, Issue 1, 2001, Pages 47-67

  Kranakis, Evangelos ^a   Krizanc, Danny ^a   Pelc, Andrzej ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Broadcasting; Fault tolerance; Radio network

Indexed keywords

EID: 0009152529     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1147     Document Type: Article

References (20)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, A lower bound for radio broadcast, J. Comput. System Sci. 43 (1991), 290-298.
2. 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, J. Comput. System Sci. 45 (1992), 104-126.
3. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multihop radio networks, SIAM J. Comput. 22 (1993), 875-887.
4. M. Barborak, M. Malek, and A. Dahbura, The consensus problem in fault-tolerant computing, ACM Comput. Surveys 25 (1993), 171-220.
5. D. Bruschi and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distrib. Comput. 10 (1997), 129-135.
6. I. Chlamtac and S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Trans. Commun. 33 (1985), 1240-1246.
7. I. Chlamtac and S. Kutten, Tree based broadcasting in multihop radio networks, IEEE Trans. Comput. 36 (1987), 1209-1223.
8. B. S. Chlebus, L. Ga̧sieniec, A. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in "Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms, SODA'2000," pp. 861-870.
9. B. S. Chlebus, L. Ga̧sieniec, A. Östlin, and J. M. Robson, Deterministic radio broadcasting, in "Proc. 27th Int. Coll. on Automata, Languages and Programming, (ICALP'2000), July 2000, Geneva, Switzerland," Lecture Notes in Computer Science, Vol. 1853, pp. 717-728, Springer-Verlag, Berlin/New York.
10. K. Diks, E. Kranakis, D. Krizanc, and A. Pelc, The impact of knowledge on broadcasting time in radio networks, in "Proc. 7th Annual European Symposium on Algorithms, ESA'99, Prague, Czech Republic, July 1999," Lecture Notes in Computer Science, Vol. 1643, pp. 41-52, Springer-Verlag, Berlin/New York.
11. I. Gaber and Y. Mansour, Broadcast in radio networks, in "Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA'95," pp. 577-585.
12. R. Gallager, A perspective on multiaccess channels, IEEE Trans. Inform. Theory 31 (1985), 124-142.
13. E. Kushilevitz and Y. Mansour, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SIAM J. Comput. 27 (1998), 702-712.
14. E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in "Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA'98," pp. 236-243.
15. E. Pagani and G. P. Rossi, Reliable broadcast in mobile multihop packet networks, in "Proc. 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM'97)," pp. 34-42, 1997.
16. K. Pahlavan and A. Levesque, "Wireless Information Networks," Wiley-Interscience, New York, 1995.
17. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143-156.
18. K. Ravishankar and S. Singh, Broadcasting on [0, L], Disc. Appl. Math. 53 (1994), 299-319.
19. K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Disc. Appl. Math. 61 (1995), 61-82.
20. A. Sen and M. L. Huson, A new model for scheduling packet radio networks, in "Proc. 15th Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE INFOCOM'96)," pp. 1116-1124, 1996.