Oblivious gossiping in ad-hoc radio networks

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2001, Pages 44-51

  Chlebus, Bogdan S ^a   Ga̧sieniec, Leszek ^b   Lingas, Andrzej ^c   Pagourtzis, Aris T ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBABILITY; RADIO COMMUNICATION;

RADIO NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0035789909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/381448.381454     Document Type: Conference Paper

References (25)

1. 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.
2. 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. Computer and System Sciences 45 (1992) 104-126.
3. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM J. on Computing 22 (1993) 875-887.
4. D. Brusci, and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997) 129-135.
5. I. Chlamtac, and S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Trans. on Communications 33 (1985) 1240-1246.
6. I. Chlamtac, and O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, in Proc. 6th Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), 1987, pp. 1116-1124.
7. B.S. Chlebus, Randomized communication in radio networks, a chapter in "Handbook on Randomized Computing," P.M. Pardalos, S. Rajasekaran, J.H. Reif, and J.D.P. Rolim, (Eds.), Kluwer Academic Publishers, to appear.
8. B.S. Chlebus, L. Ga̧sieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861-870.
9. B.S. Chlebus, L. Ga̧sieniec, A. Östlin, and J.M. Robson, Deterministic radio broadcasting, in Proc. 27th Int. Colloquium on Automata, Languages and Programming, Geneva, Switzerland, 2000, Springer LNCS 1853, pp. 717-728.
10. M. Chrobak, L. Ga̧sieniec, and W. Rytter, A randomized algorithm for gossiping in radio networks, 2000, a manuscript.
11. M. Chrobak, L. Ga̧sieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, in Proc. 41st IEEE Symp. on Foundations of Computer Science, Redondo Beach, California, 2000, pp. 575-581.
12. A.E.F. Clementi, A. Monti, and R. Silvestri, Distributed multi-broadcast in unknown radio networks, in Proc., 20th ACM Symp. on Principles of Distributed Computing, 2001, Newport, Rhode Island, to appear.
13. A.E.F. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting in unknown radio networks, in Proc., 12th ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, 2001, pp. 709-718.
14. A.E.F. Clementi, A. Monti, and R. Silvestri, Round robin is optimal for fault-tolerant broadcasting on wireless networks, in Proc., 9th Ann. European Symposium on Algorithms, BRICS, University of Aarhus, Denmark, 2001, to appear.
15. K. Diks, E. Kranakis, D. Krizanc, and A. Pelc, The impact of knowledge on broadcasting time in radio networks, in Proc. 7th European Symposium on Algorithms, Prague, Czech Republic, 1999, Springer LNCS 1643, pp. 41-52.
16. I. Gaber, and Y. Mansour, Broadcast in radio networks, in Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 577-585.
17. D.J. Kleitman, and D.J. Kwiatkowski, A lower bound on the length of a sequence containing all permutations as subsequences, J. Combinatorial Theory (A) 21 (1976) 129-136.
18. 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.
19. E. Kushilevitz, and Y. Mansour, An O(D log(N/D)) lower bound for broadcast in radio networks, SIAM J. on Computing 27 (1998) 702-712.
20. E. Kushilevitz, and Y. Mansour, Computation in noisy radio networks, in Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 236-243.
21. A. Pelc, Broadcasting in radio networks, a chapter in [25].
22. K. Ravishankar, and S. Singh, Asymptotically optimal gossiping in radio networks, Discr. Appl. Math. 61 (1995) 61-82.
23. C. Savage, Short strings containing all k-element permutations, Discrete Mathematics 42 (1982) 281-285.
24. A. Sen, and M.L. Huson, A new model for scheduling packet radio networks, in Proc. 15th Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), 1996, pp. 1116-1124.
25. I. Stojmenovic, (Ed.), "Handbook of Wireless Networks and Mobile Computing," John Wiley, to appear.