Round Robin is optimal for fault-tolerant broadcasting on wireless networks

Journal of Parallel and Distributed Computing

Volumn 64, Issue 1, 2004, Pages 89-96

  Clementi, Andrea E F ^a   Monti, Angelo ^b   Silvestri, Riccardo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Broadcast; Fault tolerant protocols; Wireless networks

Indexed keywords

EID: 1642420431     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.09.002     Document Type: Article

References (20)

1. N. Alon, A. Bar-Noy, N. Linial, D. Peleg, A lower bound for radio broadcast, J. Comput. System Sci. 43 (1991) 290-298 (An extended abstract appeared also in ACM - STOC 1989).
2. R. Bar-Yehuda, O. Goldreich, 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 (preliminary version in 6th ACM PODC, 1987).
3. I. Chlamtac, S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Trans. Comm. 33 (1985) 1240-1246.
4. B.S. Chlebus, L. Ga̧sieniec, A.M. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in unknown radio networks, Proceedings of the 11th ACM-SIAM SODA, San Francisco, CA, 2000, pp. 861-870.
5. B.S. Chlebus, L. Ga̧sieniec. A. Ostlin, J.M. Robson, Deterministic radio broadcasting, Proceedings of the 27th ICALP, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 717-728.
6. M. Chrobak, L. Ga̧sieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, Proceedings of the 41st IEEE FOCS. Redordo Beach, CA, 2000.
7. A.E.F. Clementi, P. Crescenzi, A. Monti, P. Penna, R. Silvestri, On computing ad-hoc selective families, Proceedings of the 5th RANDOM'01, Lecture Notes in Computer Science, Vol. 2129, Springer, Berlin, 2001, pp. 211-222.
8. A.E.F. Ciementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting in unknown radio networks, Proceedings of the 12th ACM-SIAM SODA, Washington, D.C., 2001, pp. 709-718.
9. A.E.F. Clementi, A. Monti, R. Silvestri, Distributed multi-broadcast in unknown radio networks, 20th ACM PODC, 2001, pp. 123-133.
10. R. Gallager, A perspective on multiaccess channels, IEEE Trans. Inform. Theory 31 (1985) 124-142.
11. I. Gaber, Y. Mansour, Broadcast in radio networks, Proceedings of the 6th ACM-SIAM SODA, San Francisco. CA, 1995, pp. 577-585.
12. P. Indyk. Deterministic superimposed coding with application to pattern matching, Proceedings of the IEEE 38th FOCS, Miami Beach, FL, 1997, pp. 127-136.
13. E. Kranakis, D. Krizanc. A. Pelc, Fault-tolerant broadcasting in radio networks, Proceedings of the 6th ESA, Lecture Notes in Computer Science, Vol. 1461, Springer, Berlin, 1998, pp. 283-294.
14. E. Kushilevitz, Y. Mansour, Computation in noisy radio networks, Proceedings of the Ninth ACM-SIAM SODA. San Francisco, CA, 1998, pp. 236-243.
15. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
16. E. Pagani, G. Rossi. Reliable broadcast in mobile multihop packet networks, Proceedings of the Third ACM-IEEE MOBICOM, Budapest, Hungary, 1997, pp. 34-42.
17. A. Pelc, Broadcasting in radio networks, Handbook of Wireless Networks and Mobile Computing, Wiley, New York, 2002, pp. 509-528.
18. L.G. Roberts, Aloha packet system with and without slots and capture, ASS Notes, Vol. 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute, 1972.
19. T.S. Rappaport, Wireless Communications: Principles and Practice, Prentice-Hall, Englewood Cliffs, NJ, 1996.
20. J.E. Wieselthier, G.D. Ngyuyen, A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, Proceedings of the 19th IEEE INFOCOM, Tel Aviv, Israel, 2000, pp. 456-478.