A Randomized Algorithm for Gossiping in Radio Networks

Networks

Volumn 43, Issue 2, 2004, Pages 119-124

  Chrobak, Marek ^a   Ga̧sieniec, Leszek ^b   Rytter, Wojciech ^b,c  

^a University of California ^*  (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

Gossiping; Radio networks; Randomized algorithms

Indexed keywords

GOSSIPING; NETWORK TOPOLOGY; RADIO NETWORKS; RANDOMIZED ALGORITHM;

ALGORITHMS; INFORMATION DISSEMINATION; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RADIO BROADCASTING; RADIO COMMUNICATION; TRANSCEIVERS;

RADIO SYSTEMS;

EID: 2042515611     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10109     Document Type: Article

References (27)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, A lower bound for radio broadcast, J Comput Syst Sci 43 (1991), 290-298.
2. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, Single round simulation of radio networks, J Alg 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, J Comput Syst Sci 45 (1992), 104-126.
4. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM J Comput 22 (1993), 875-887.
5. D. Bruschi and M. del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distrib Comput 10 (1997), 129-135.
6. I. Chlamtac and S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Trans Commun 33 (1985), 1240-1246.
7. B.S. Chlebus, L. Ga̧sieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, Proc 11th Ann ACM-SIAM Symp on Discrete Algorithms, San Francisco, CA, 2000, pp. 861-870.
8. M. Chlebus, L. Ga̧sieniec, A. Östlin, and J.M. Robson, Deterministic broadcasting in radio networks, Proc 27th Int Colloq on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1853, Springer, 2000, pp. 717-728.
9. M. Christersson, L. Ga̧sieniec, and A. Lingas, Gossiping with bounded size messages in unknown ad hoc radio networks, manuscript, 2002.
10. M. Chrobak, L. Ga̧sieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, 41st Ann IEEE Conf on Foundations of Computer Science, FOCS'00, 2000, pp. 575-581.
11. G. De Marco and A. Pelc, Faster broadcasting in unknown radio networks, published manuscript, 1999.
12. K. Diks, E. Kranakis, D. Krizanc, and A. Pelc, The impact of knowledge on broadcasting time in radio networks, Proc 7th European Symp on Algorithms, 1999, pp. 41-52.
13. A. Ephremides and B. Hajek, Information and communication networks: An unconsummated union, IEEE Trans Info Theory IT-44 (1998), 2416-2434.
14. I. Gaber and Y. Mansour, Broadcast in radio networks, Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms, 1995, pp. 577-585.
15. R. Gallager, A perspective on multiaccess communications, IEEE Trans Info Theory IT-31 (1985), 124-142.
16. S.T. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319-349.
17. J. Komlos and A.G. Greenberg, An asymptotically non-adaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans Info Theory IT-31 (1985), 302-306.
18. E. Kranakis, D. Krizanc, and A. Pelc, Fault-tolerant broadcasting in radio networks, Proc 6th European Symp on Algorithms, Venice, Italy, 1998, Lecture Notes in Computer Science 1461, Springer, pp. 283-294.
19. E. Kushilevitz and Y. Mansour, An Ω(D lg(N/D)) lower bound for broadcast in radio networks, SIAM J Comput 27 (1998), 702-712.
20. E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, Proc 9th Ann ACM-SIAM Symp on Discrete Algorithms, 1998, pp. 236-243.
21. J.L. Massey and P. Mathys, The collision channel without feedback, IEEE Trans Info Theory IT-31 (1985), 192-204.
22. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
23. K. Pahlavan and A. Levesque, Wireless Information Networks, Wiley-Interscience, New York, 1995.
24. D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript, 2000.
25. K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discr Appl Math 61 (1995), 61-82.
26. K. Ravishankar and S. Singh, Gossiping on a ring with radios, Parallel Process Lett 6 (1996), 115-126.
27. A. Sen and M.L. Huson, A new model for scheduling packet radio networks, Proc 15th Ann Joint Conf of the IEEE Computer and Communication Societies, 1996, pp. 1116-1124.