On randomized broadcasting and gossiping in radio networks

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

Volumn 2387, Issue , 2002, Pages 340-349

  Liu, Ding ^a   Prabhakaran, Manoj ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; RADIO;

LOWER BOUNDS; RADIO NETWORKS; RANDOMIZED ALGORITHMS; RANDOMIZED BROADCASTING; TIME STEP;

RADIO BROADCASTING;

EID: 84949795724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45655-4_37     Document Type: Conference Paper

References (20)

1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast, Journal of Computer and System Sciences 43 (1991), 290–298.
2. Awerbuch, B.: A New Distributed Depth-First-Search Algorithm, Information Processing Letters, 20, (1985), 147–150.
3. Bar-Yehuda, R., Goldreich, O., Itai, A.: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection, Distributed Computing 5 (1991), 67–71.
4. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992), 104–126.
5. Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997), 129–135.
6. Chlebus, B.S.: Randomized communication in radio networks, A chapter in Handbook on Randomized Computing, eds. Pardalos, P.M., Rajasekaran, S., Reif, J., Rolim, J.D.P., Kluwer Academic Publishers, to be published.
7. Chlebus, B.S., Gasieniec, L., Gibbons, A.M., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks, Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (2000), 861–870.
8. Chlebus, B.S., Gasieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting, Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP (2000).
9. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks, Proc. 41st Annual IEEE Conference on Foundations of Computer Science, FOCS (2000), 575–581.
10. Chrobak, M., Gasieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks, Proceedings of 7th Annual International Computing and Combinatorics Conference, COCOON (2001), 483-492.
11. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting in unknown radio networks, Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (2001), 709–718.
12. Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in radio networks, Proc. 7th European Symp. on Algorithms, ESA (1999), 41–52.
13. Gaber, I., Mansour, Y.: Broadcast in radio networks, Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (1995), 577–585.
14. Gallager, R.: A perspective on multiaccess channels, IEEE Transactions on Information Theory, 31 (1985), 124–142.
15. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks, Networks 18(1988), 319-359.
16. Indyk, P.: Explicit constructions of selectors with applications, Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (2002), 697–704.
17. Kushilevitz, E., Mansour, Y.: An Ω(Dlog (N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998), 702–712.
18. Kushilevitz, E., Mansour, Y.: Computation in noisy radio networks, Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (1998), 236–243.
19. Tanenbaum, A.S.: Computer Networks, Prentice-Hall, Englewood Cliffs, NJ, 1981.
20. Yao, A. C-C.: Probabilistic computations: Towards a unified measure of complexity, Proc. 18th Annual IEEE Conference on Foundations of Computer Science, FOCS (1977), 222–227.