Faster deterministic gossiping in directed ad hoc radio networks

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

Volumn 3111, Issue , 2004, Pages 397-407

  Ga̧sieniec, Leszek ^a   Radzik, Tomasz ^b   Xin, Qin ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AD HOC RADIO NETWORKS; DETERMINISTIC ALGORITHMS; UPPER BOUND;

ALGORITHMS;

EID: 35048874747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_34     Document Type: Article

References (17)

1. Ga̧sieniec, L., Pagourtzis, A., Potapov, I.: Deterministic communication in radio networks with large labels. In: Proc. 10th European Symposium on Algorithms (ESA'02). Volume 2461 of Lecture Notes in Computer Science, Springer Verlag (2002) 512-524
2. Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43 (2002) 177-189
3. Ga̧sieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters 83 (2002) 89-94
4. 1.5) deterministic gossiping algorithm for radio networks. Algorithmica 36 (2003) 93-96
5. Chlebus, B., Ga̧sieniec, L., Ostlin, A., Robson, M.: Deterministic radio broadcasting. In: Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP'00). Volume 1853 of Lecture Notes in Computer Science, Springer Verlag (2000) 717-728
6. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), ACM/SIAM (2001) 709-718
7. Chlebus, B., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), ACM/SIAM (2000) 861-870
8. Marco, G.D., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters 79 (2001) 53-56
9. Brusci, D., Pinto, M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10 (1997) 129-135
10. Christersson, M., Ga̧sieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Proc. 29th International Colloquium on Automata, Languages and Programming (ICALP'02). Volume 2380 of Lecture Notes in Computer Science, Springer Verlag (2002) 377-389
11. Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Proc. 8th Annual International Conference on Computing and Combinatorics (COCOON'02). Volume 2387 of Lecture Notes in Computer Science, Springer Verlag (2002) 340-349
12. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symposium on Foundations of Computer Science (FOCS'03), IEEE Computer Society (2003) 492-501
13. Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'95), ACM/SIAM (1995) 577-585
14. Diks, K., Kranakis, E., Pelc, A.: The impact of knowledge on broadcasting time in radio networks. In: Proc. 7th European Symposium on Algorithms (ESA'99). Volume 1643 of Lecture Notes in Computer Science, Springer Verlag (1999) 41-52
15. Ga̧sieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS'02). Volume 223 of IFIP Conference Proceedings, Kluwer (2002) 193-205
16. Bonis, A.D., Ga̧sieniec, L., Vaccaro, U.: Generalized framework for selectors with applications in optimal group testing. In: Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP'03). Volume 2719 of Lecture Notes in Computer Science, Springer Verlag (2003) 81-96
17. T. Hagerup and J. Katajainen (Eds.): SWAT 2004, LNCS 3111, pp. 408-419, 2004.