Optimal gossiping with unit size messages in known topology radio networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4235 LNCS, Issue , 2006, Pages 125-134

  Manne, Fredrik ^a   Xin, Qin ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Centralized radio networks; Gossiping; Randomized schedule

Indexed keywords

COMMUNICATION PRIMITIVES; HIGH PROBABILITY; LOWER BOUNDS; RADIO NETWORKS; REALISTIC MODEL; SPANNING TREE; TIME STEP; TIME UNITS;

GALLIUM; RADIO; TOPOLOGY;

RADIO BROADCASTING;

EID: 77049117317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11922377_11     Document Type: Conference Paper

References (27)

1. B. Awerbuch and D. Peleg. Sparse partitions. Proc. 31st Symp. on Foundations of Computer Science, 1990, pp. 503-513.
2. N. Alon, A. Bar-Noy, N. Linial and D. Peleg. A lower bound for radio broadcast. J. Computer and System Sciences 43, (1991), 290 - 298.
3. R. Bar-Yehuda, O. Goldreich and A. Itai. On the time complexity of broadcasting in radio networks: an exponential gap between determinism and randomization. Proc. 5th Symp. on Principles of Distributed Computing, 1986, 98 - 107.
4. M. Chrobak, L. Ga̧sieniec and W. Rytter, Fast broadcasting and gossiping in radio networks. J. of Algorithms 43(2), (2002), pp. 177-189.
5. I. Chlamtac and S. Kutten. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. on Communications 33, (1985), pp. 1240-1246.
6. T.H. Cormen, C.E. Leiserson and R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.
7. F. Cicalese F. Manne and Q. Xin. Faster centralized communication in radio networks. Manuscript, 2006.
8. A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. Proc. 44th Symp. on Foundations of Computer Science, 2003, pp. 492-501.
9. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. Proc. Proc. INFOCOM, 1987.
10. K. Diks, E. Kranakis and A. Pelc. The impact of knowledge on broadcasting time in radio networks. Proc. 7th European Symp. on Algorithms, 1999, pp. 41-52.
11. M. Elkin and G. Kortsarz. Polylogarithmic inapproximability of the radio broadcast problem. Proc. APPROX, 2004, LNCS 3122.
12. M. Elkin and G. Kortsarz. Improved broadcast schedule for radio networks. Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, 2005.
13. I. Gaber and Y. Mansour. Broadcast in radio networks. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 577-585.
14. M. Christersson, L. Ga̧sieniec and A. Lingas. Gossiping with bounded size messages in ad-hoc radio networks. Proc. 29th Int. Colloq. on Automata, Languages and Programming, 2002, pp. 377-389.
15. L. Ga̧sieniec and A. Lingas. On adaptive deterministic gossiping in ad hoc radio networks, Information Processing Letters 2(83), 2002, pp. 89-94.
16. L. Ga̧sieniec, E. Kranakis, A. Pelc and Q. Xin. Deterministic M2M multicast in radio networks. Proc. 31st Int. Colloq. on Automata, Languages and Programming, 2004, LNCS 3142, pp. 670-682.
17. L. Ga̧sieniec and I. Potapov, Gossiping with unit messages in known radio networks. Proc. 2nd IFIP Int. Conference on Theoretical Computer Science, 2002, pp. 193-205.
18. L. Ga̧sieniec, I. Potapov and Q. Xin. Efficient gossiping in known radio networks. Proc. 11th Int. Colloq. on Structural Information and Communication Complexity, 2004, LNCS 3104, pp. 173-184.
19. L. Ga̧sieniec, D. Peleg and Q. Xin. Faster communication in known topology radio networks. Proc. 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'2005, pp. 129-137.
20. L. Ga̧sieniec, T. Radzik and Q. Xin. Faster deterministic gossiping in ad-hoc radio networks. Proc. 9th Scandinavian Workshop on Algorithm Theory, 2004, LNCS 3111, pp. 397-407.
21. D. Kowalski and A. Pelc. Centralized deterministic broadcasting in undirected multi-hop radio networks. Proc. APPROX, 2004, LNCS 3122, pp. 171-182.
22. D. Liu and M. Prabhakaran. On randomized broadcasting and gossiping in radio networks. Proc. 8th Int. Conf. on Computing and Combinatorics, 2002, pp. 340-349.
23. A. Sen and M.L. Huson. A new model for scheduling packet radio networks. Proc. 15th Joint Conf. of IEEE Computer and Communication Societies, 1996, pp. 1116-1124.
24. P.J. Slater, E.J.Cockayne and S.T. Hedetniemi. Information dissemination in trees. SIAM J. on Computing 10, (1981), pp. 892-701.
25. A.N. Strahler. Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, (1952), pp. 117-1142.
26. X.G. Viennot. A Strahler bijection between Dyck paths and planar trees. Discrete Mathematics 246, (2002), pp. 317-329.
27. 1.5) deterministic gossiping algorithm for radio networks. Algorithmica, 36(1), (2003), pp. 93-96.