An improved algorithm for radio broadcast

ACM Transactions on Algorithms

Volumn 3, Issue 1, 2007, Pages

  Elkin, Michael ^a   Kortsarz, Guy ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Radio broadcast

Indexed keywords

RADIO BROADCAST SCHEDULING; RADIO NETWORKS; UPPER BOUND;

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; SCHEDULING; SET THEORY;

RADIO BROADCASTING;

EID: 33847305524     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1186810.1186818     Document Type: Conference Paper

References (18)

1. ALON, N., BAR-NOY, A., LINIAL, N., AND PELEG, D. 1991. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290-298.
2. AWERBUCH, B., BERGER, B., COWEN, L., AND PELEG, D. 1992. Fast network decomposition. In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing. 161-173.
3. BAR-YEHUDA, R., GOLDREICH, O., AND ITAI, A. 1991. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distrib. Comput. 2, 5, 67-72.
4. BAR-YEHUDA, R., GOLDREICH, O., AND ITAI, A. 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 1, 45, 104-126.
5. CHLAMTAC, I., AND KUTTEN, S. 1985. A spatial-reuse TDMA/FDMA for mobile multihop radio networks. In Proceedings of the IEEE INFOCOM Conference. 389-394.
6. CHLAMTAC, I., AND WEINSTEIN. 1987. The wave expansion approach to broadcasting in multihop radio networks. In Proceedings of the IEEE INFOCOM Conference. 874-881.
7. CHLEBUS, B., GASIENIEC, L., GIBBONS, A., PELC, A., AND RYTTER, W. 2002. Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 1, 15, 27-38.
8. CHROBAK, M., GASIENIEC, L., AND RYTTER, W. 2000. Fast broadcasting and gossiping in radio networks. In Proceedings of the 41st Symposium on Foundations of Computer Science. 575-581.
9. CLEMENTI, A. F., MONTI, A., AND SILVESTRI, R. 2003. Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 3, 302, 337-364.
10. CZUMAJ, A., AND RYTTER, W. 2003. Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the 44th Symposium on Foundations of Computer Science. 492-501.
11. ELKIN, M., AND KORTSARZ, G. 2004. Polylogarithmic additive inapproximability of the radio broadcast problem. SIAM J. Discrete Mod. 19, 4, 881-899.
12. GABER, I., AND MANSOUR, Y. 1995. Broadcast in radio networks. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms. 577-585.
13. INDYK, P. 2002. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the 15th Symposium on Discrete Algorithms. 697-704.
14. KOWALSKI, D., AND PELC, A. 2002. Deterministic broadcasting time in radio networks of unknown topology. In Proceedings of the 43th Symposium on Foundations of Computer Science. 63-72.
15. KOWALSKI, D., AND PELC, A. 2003. Broadcasting in undirected ad hoc radio networks. In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing. 73-82.
16. KOWALSKI, D., AND PELC, A. 2004. Centralized deterministic broadcasting in undirected multi-hop radio network. In Approximation, Randomization, and Combinatorial Optimization. Springer-Verlag. 171-182.
17. KUSHILEVITZ, E., AND MANSOUR, Y. 1998. An ω(d log(n/d)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 3, 702-712.
18. LINIAL, N., AND SAKS, M. 1991. Decomposing graphs into regions of small diameter. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms. 320-330.