Faster communication in known topology radio networks

Distributed Computing

Volumn 19, Issue 4, 2007, Pages 289-300

  Ga̧sieniec, Leszek ^a   Peleg, David ^b   Xin, Qin ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

Broadcasting; Gossiping; Radio networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; GRAPH THEORY; RADIO COMMUNICATION; TOPOLOGY;

GOSSIPING; POLYLOGARITHMIC INAPPROXIMABILITY; RADIO NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 33847275061     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-006-0011-z     Document Type: Conference Paper

References (16)

1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290-298 (1991)
2. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcasting in radio networks: an exponential gap between determinism and randomization. In: Proceedings of the 5th Symposium on Principles of Distributed Computing, pp. 98-107 (1986)
3. Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33, 1240-1246 (1985)
4. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426-433 (1991)
5. Christersson, M., Gasieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, pp. 377-389 (2002)
6. Diks, K., Kranakis, E., Pelc, A.: The impact of knowledge on broadcasting time in radio networks. In: Proceedings of the 7th European Symposium on Algorithms, pp. 41-52 (1999)
7. Elkin, M., Kortsarz, G.: Polylogarithmic inapproximability of the radio broadcast problem. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS, vol. 3122, pp. 105-116 (2004)
8. Elkin, M., Kortsarz, G.: Logarithmic inapproximability of the radio broadcast problem. J. Algorithms 52(1), 8-25 (2004)
9. Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 222-231 (2005)
10. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. Algorithms 46(1), 1-20 (2003)
11. Gasieniec, L., Potapov, I., Xin, Q.: Efficient gossiping in known radio networks. In: Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity. LNCS, vol. 3104, pp. 173-184 (2004)
12. Kowalski, D., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS, vol. 3122, pp. 171-182 (2004)
13. Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known radio networks. In: Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, LNCS (to appear)
14. Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proceedings of the 15th Joint Conference of IEEE Computer and Communication Societies, pp. 1116-1124 (1996)
15. Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Am. 63, 1117-1142 (1952)
16. Viennot, X.G.: A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317-329 (2002)