A randomized algorithm for gossiping in radio networks

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

Volumn 2108, Issue , 2001, Pages 483-492

  Chrobak, Marek ^a   Gąsieniec, Leszek ^b   Rytter, Wojciech ^b,c  

^a University of California Riverside   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

POLY-LOGARITHMIC FACTORS; RADIO NETWORKS; RANDOMIZED ALGORITHMS; RUNNING TIME;

COMBINATORIAL MATHEMATICS;

EID: 84944049102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_54     Document Type: Conference Paper

References (26)

1. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences 43 (1991) 290–298.
2. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, Single round simulation of radio networks, Journal of Algorithms 13 (1992) 188–210.
3. R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992) 104–126.
4. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993) 875–887.
5. D. Bruschi and M. del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997) pp. 129-135
6. B.S. Chlebus, L. Gasieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861–870.
7. M. Chlebus, L. Gasieniec, A. Ostlin and J.M. Robson, Deterministic broadcasting in radio networks, Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP’2000.
8. I. Chlamtac and S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Transactions on Communications 33 (1985) 1240–1246.
9. M. Chrobak, L. Gasieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, 41st Annual IEEE Conference on Foundations of Computer Science, FOCS’00, 2000, pp. 575–581.
10. K. Diks, E. Kranakis, D. Krizanc, A. Pelc, The impact of knowledge on broadcasting time in radio networks, In Proc. 7th European Symp. on Algorithms (1999) 41-52
11. G. De Marco and A. Pelc, Faster broadcasting in unknown radio networks, unpublished manuscript, 1999.
12. A. Ephremides and B. Hajek, Information theory and communication networks: an unconsummated union, IEEE Trans. on Inf. Theory, IT-44 (1998) 2416-2434.
13. R. Gallager, A perspective on multiaccess communications, IEEE Trans. on Inf. Theory, IT-31 (1985) 124-142.
14. I. Gaber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACMSIAM Symp. on Discrete Algorithms, 1995, pp. 577–585.
15. S.T. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communicatio nnetworks, Networks 18 (1988) 319–349.
16. J. Komlos and A.G. Greenberg, An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans. on Inf. Theory, IT-31 (1985) 302-306.
17. E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, in Proc. 6th European Symposium on Algorithms, Venice, Italy, 1998, Springer LNCS 1461, pp. 283–294.
18. E. Kushilevitz and Y. Mansour, An Ω(Dlg(N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998) 702–712.
19. E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 236–243.
20. J.L. Massey and P. Mathys, The collision channel without feedback, IEEE Trans. on Inf. Theory, IT-31 (1985) 192-204.
21. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
22. K. Pahlavan and A. Levesque, Wireless Information Networks, Wiley-Interscience, New York, 1995.
23. D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript, 2000.
24. K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discr. Appl. Math. 61 (1995) 61–82.
25. K. Ravishankar and S. Singh, Gossiping on a ring with radios, Parallel Processing Letters 6 (1996), p. 115-126.
26. A. Sen and M. L. Huson, A new model for scheduling packet radio networks, in Proc. 15th Ann. Joint Conference of the IEEE Computer and Communication Societies, 1996, pp. 1116–1124.