Distributed broadcast in unknown radio networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 208-217

  De Marco, Gianluca ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; GRAPH THEORY; RADIO BROADCASTING;

RADIO NETWORKS; TIME COMPLEXITIES; UPPER BOUNDS;

BROADCASTING;

EID: 58449083083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. N. Alon, A. Bar-Noy, N. Linial, ami D. Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43(2):290-298, 1991.
2. N. Alon and J. Spencer. The Probabilistic Method-John Wiley, 1992.
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. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 98-108, Vancouver, BC, Canada, 1987.
4. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Proceedings of the 11th AC'M-SIAM Symposium on Discrete Algorithms (SODA), pages 861-870, San Francisco, CA, USA, 2000.
5. B. S. Chlebus, L. Gasieniec, A. Ostlin, and J. M. Robson. Deterministic radio broadcasting. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, 2000.
6. M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 575-581, Redondo Beach, CA, USA, 2000.
7. A. E. F. Clementi, A. Monti, and R. Silvestri. Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science, 302(1-3):337-364, 2003.
8. A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS), pages 492-501, Cambridge, MA, USA, 2003.
9. G. De Marco and A. Pelc. Faster broadcasting in unknown radio networks. Information Processing Letters, 79(2):53-56, 2001.
10. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 697-704, San Francisco, CA, USA, 2002.
11. D. R. Kowalski and A. Pelc. Deterministic broadcasting time in radio networks of unknown topology. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 63-72, Vancouver, BC, Canada, 2002.
12. D. R. Kowalski and A. Pelc. Faster deterministic broadcasting in ad hoc radio networks. SIAM Journal on Discrete Mathematics, 18(2):332-346, 2004.
13. D. R. Kowalski and A. Pelc. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing, 19(3):185-195, 2007.
14. E. Kushilevitz and Y. Mansour. An Ω(D log(N/D)) lower bound for broadcast in radio networks. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing (PODC), pages 65-74, Ithaca, NY, USA, 1993.
15. A. Pelc. Broadcasting in radio networks. In I. Stoymenovic, editor, Handbook of Wireless Networks and Mobile Computing, pages 95-119. John Wiley, 2000.
16. D. Peleg. Deterministic radio broadcast with no topological knowledge. Manuscript, 2000.