Average-time complexity of gossiping in radio networks

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

Volumn 4056 LNCS, Issue , 2006, Pages 253-267

  Chlebus, Bogdan S ^a   Kowalski, Dariusz R ^b   Rokicki, Mariusz A ^a  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION DISSEMINATION; INFORMATION THEORY; NETWORK PROTOCOLS; PACKET NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

GOSSIPING PROTOCOL; MANY-TO-ALL (M2A) COMMUNICATION; RADIO NETWORKS; SYNCHRONOUS COMMUNICATION;

RADIO BROADCASTING;

EID: 33746382287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780823_20     Document Type: Conference Paper

References (15)

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. 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. I. Chlamtac, and S. Kutten, On broadcasting in radio networks - problem analysis and protocol design, IEEE Transactions on Communication, 33 (1985) 1240 -1246.
5. B.S. Chlebus, L. Ga̧sieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in ad hoc radio networks, Distributed Computing, 15 (2002) 27 - 38.
6. B.S. Chlebus, L. Ga̧sieniec, A. Lingas, and A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, in Proc., 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), 2001, pp. 44 - 51.
7. M. Christersson, L. Ga̧sieniec, and A. Lingas, Gossiping with bounded size messages in ad-hoc radio networks, in Proc., 29th International Colloquium on Automata, Languages and Programming (ICALP), 2002, pp. 377 - 389.
8. M. Chrobak, L. Ga̧sieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, Journal of Algorithms, 43 (2002) 177 - 189.
9. A.E.F. Clementi, A. Monti, and R. Silvestri, Distributed broadcasting in radio networks of unknown topology, Theoretical Computer Science, 302 (2003) 337 - 364.
10. A. Czumaj, and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in Proc., 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 492 - 501.
11. A. De Bonis, L. Ga̧sieniec, U. Vaccaro, Generalized framework for selectors with applications in optimal group testing, in Proc., 50th International Colloquium on Automata, Languages and Programming (ICALP), 2003, pp. 81 - 96.
12. R. Elsässer, and L. Ga̧sieniec, Radio communication in random graphs, in Proc., 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2005, pp. 309 - 315.
13. L. Ga̧sieniec, E. Kranakis, A. Pelc, and Q.Xin, Deterministic M2M multicast in radio networks, in Proc., 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004, pp. 670 - 682.
14. L. Gaşieniec, T. Radzik, and Q. Xin, Faster deterministic gossiping in directed ad-hoc radio networks, in Proc., 9th Scandinavian Workshop on Algorithm Theory (SWAT), 2004, pp. 397 - 407.
15. D.R. Kowalski, and A. Pelc, Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, in Proc., 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2003, pp. 195 - 210.