Faster deterministic broadcasting in ad hoc radio networks

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 332-346

  Kowalski, Dariusz R ^a,b   Pelc, Andrzej ^c  

^a UNIVERSITY OF WARSAW   (Poland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

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

Author keywords

Broadcasting; Distributed algorithms; Radio networks

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; TELECOMMUNICATION NETWORKS; TOPOLOGY; TRANSMITTERS;

BROADCASTING ALGORITHMS; DISTRIBUTED ALGORITHMS; NODES; RADIO NETWORKS;

RADIO STATIONS;

EID: 18744369059     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548010342464X     Document Type: Article

References (19)

1. N. ALON, A. BAR-NOY, N. LINIAL, AND D. PELEG, A lower bound for radio broadcast, J. Comput. System Sci., 43 (1991), pp. 290-298.
2. R. BAR-YEHUDA, O. GOLDREICH, AND A. ITAI, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, J. Comput. System Sci., 45 (1992), pp. 104-126.
3. S. BASAGNI, D. BRUSCHI, AND I. CHLAMTAC, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE/ACM Trans. Networking, 7 (1999), pp. 799-807.
4. S. BASAGNI, A. D. MYERS, AND V.R. SYROTIUK, Mobility-independent flooding for real-time multimedia applications in ad hoc networks, in Proceedings of the IEEE Emerging Technologies Symposium on Wireless Communications & Systems, Richardson, TX, 1999.
5. D. BRUSCHI AND M. DEL PINTO, Lower bounds for the broadcast problem in mobile radio networks, Distrib. Comput., 10 (1997), pp. 129-135.
6. I. CHLAMTAC AND A. FARAGÓ, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE/ACM Trans. Networking, 2 (1994), pp. 23-29.
7. I. CHLAMTAC, A. FARAGÓ, AND H. ZHANG, Time-spread multiple access (TSMA) protocols for multihop mobile radio networks, IEEE/ACM Trans. Networking, 5 (1997), pp. 804-812.
8. I. CHLAMTAC AND O. WEINSTEIN, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. Communications, 39 (1991), pp. 426-433.
9. B.S. CHLEBUS, L. GASIENIEC, A. GIBBONS, A. PELC, AND W. RYTTER, Deterministic broadcasting in unknown radio networks, Distrib. Comput., 15 (2002), pp. 27-38.
10. B.S. CHLEBUS, L. GA̧SIENIEC, A. ÖSTLIN, AND J.M. ROBSON, Deterministic radio broadcasting, in Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), Geneva, Switzerland, 2000, Lecture Notes in Comput. Sci. 1853, U. Montanari, J.D.P. Rolim, and E. Welzl, eds., Springer-Verlag, Berlin, 2000, pp. 717-728.
11. M. CHROBAK, L. GA̧SIENIEC, AND D. KOWALSKI, The wake-up problem in multi-hop radio networks, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2004, pp. 985-993.
12. M. CHROBAK, L. GA̧SIENIEC, AND W. RYTTER, Fast broadcasting and gossiping in radio networks, in Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS'2000), Redondo Beach, CA, pp. 575-581.
13. A.E.F. CLEMENTI, A. MONTI, AND R. SILVESTRI, Selective families, superimposed codes, and broadcasting on unknown radio networks, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, pp. 709-718.
14. A. CZUMAJ AND W. RYTTER, Broadcasting algorithms in radio networks with unknown topology, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'2003), Cambridge, MA, pp. 492-501.
15. G. DE MARCO AND A. PELC, Faster broadcasting in unknown radio networks, Inform. Process. Lett., 79 (2001), pp. 53-56.
16. I. GABER AND Y. MANSOUR, Centralized broadcast in multihop radio networks, J. Algorithms, 46 (2003), pp. 1-20.
17. D. KOWALSKI AND A. PELC, Deterministic broadcasting time in radio networks of unknown topology, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'2002), Vancouver, BC, Canada, pp. 63-72.
18. D. KOWALSKI AND A. PELC, Broadcasting in undirected ad hoc radio networks, in Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC'2003), Boston, MA, pp. 73-82.
19. E. KUSHILEVITZ AND Y. MANSOUR, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SIAM J. Comput., 27 (1998), pp. 702-712.