Centralized broadcast in multihop radio networks

Journal of Algorithms

Volumn 46, Issue 1, 2003, Pages 1-20

  Gaber, Iris ^a   Mansour, Yishay ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Broadcast; Radio networks

Indexed keywords

ALGORITHMS; INFORMATION DISSEMINATION; INVESTMENTS; LOCAL AREA NETWORKS; POLYNOMIALS; RADIO BROADCASTING; WIRELESS TELECOMMUNICATION SYSTEMS;

RADIO NETWORKS; WIRELESS LOCAL AREA NETWORKS;

RADIO COMMUNICATION;

EID: 0037222272     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00292-4     Document Type: Article

References (22)

1. N. Alon, A. Bar-Noy, N. Linial, D. Peleg. A lower bound for radio broadcast, J. Comput. System Sci. 43 (2) (1991) 290-298
2. B. Awerbuch, D. Peleg. Sparse partitions, in: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, Vol. 2, St. Louis, MO, 22-24, 1990, pp. 503-513.
3. B. Awerbuch, D. Peleg, Synchronization with polylogarithmic overload, in: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 514-522.
4. B. Awerbuch, D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. Discrete Math. 5 (1992) 151-162.
5. B. Awerbuch, D. Peleg, Online tracking of mobile users, J. ACM 42 (1995) 1021-1058.
6. Y. Afek, M. Ricklin, Sparser: A paradigm for running distributed algorithms, J. Algorithms 14 (1993) 316-328.
7. R. Bar-Yehuda, O. Goldreich, A. Itai, On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization, J. Comput. System Sci. 45 (1) (1992) 104-126.
8. S. Basagni, D. Bruschi, I. Chlamtac, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE/ACM Trans. Network. 7 (6) (1999) 799-807.
9. D. BruschI, M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distrib. Comput. 10 (3) (1997) 129-135.
10. B.S. Chlebus, L. Gasieniec, A. Ostlin, J.M. Robson, Deterministic radio broadcasting, in: Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP', 2000, pp. 717-728.
11. B.S. Chelbus, L. Gasieniec, A.M. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in unknown radio networks, in: Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms, San-Francisco, CA, 2000, pp. 861-870.
12. I. Chlamtac, S. Kutten, An efficient broadcast protocol embedded in multi-hop radio networks, in: COMPCON Conf. Proceedings, Fall, 1984, pp. 220-229.
13. I. Chlamtac, S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Trans. Commun. 33 (12) (1985) 1240-1246.
14. I. Chlamtac, O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. Commun. 39 (9) (1991) 426-433.
15. M. Chrobak, L. Gasieniec, W. Ryter, Fast broadcasting and gossiping in radio networks, in: FOCS, 2000, pp. 575-581.
16. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, 1990.
17. G. De Marco, A. Pelc, Faster broadcasting in unknown radio networks, Inform. Process. Lett. 79 (2) (2001) 53-56.
18. I. Gaber, Y. Mansour, Broadcast in radio networks, in: The 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 577-585.
19. F.K. Hwang, The time complexity of deterministic broadcast radio networks, Discrete Appl. Math. 60 (1-3) (1995) 219-222.
20. E. Kushilevitz, Y. Mansour, An Ω (D log n) lower bound for broadcast in radio networks, SIAM J. Comput. 27 (3) (1998) 702-712.
21. N. Linial, M. Saks, Low diameter graph decomposition, networks, Combinatorica 13 (4) (1993) 441-454.
22. E Pagani, G.P. Rossi, Reliable broadcast in mobile multi hop packet networks, in: Proceedings of the Third Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'97), Hungary, 1997, pp. 34-42.