Gossiping with unit messages in known radio networks

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 193-205

  Gasieniec, Leszek ^a   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORESTRY; O RINGS; RADIO TRANSMISSION; TREES (MATHEMATICS);

AD HOC RADIO NETWORKS; COMMUNICATION PRIMITIVES; GENERAL GRAPH; RADIO NETWORKS; TIME COMPLEXITY; TIME STEP;

COMPLEX NETWORKS;

EID: 84891098644     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_17     Document Type: Article

References (19)

1. N. Alón, A. Bar-Noy, N. Liniał and D. Peleg, A Lower Bound for Radio Broadcast, Journal of Computer and System Sciences 43, (1991), pp. 290-298.
2. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993), pp. 875-887.
3. J.C. Bermond, L. Gargano, A.A. Rescigno, and U. Vacarro, Fast Gossiping by Short Messages, In Proc 22th Int. Colloq. on Automata, Languages and Programming, (ICALP'1995), LNCS 944, pp. 135-146.
4. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1988.
5. I. Chlamtac and O. Weinstein, The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, In Proc. INFOCOM, 1987.
6. B.S. Chlebus, L. Gasieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, (SODA'2000), pp. 861-870.
7. B.S. Chlebus, L. Gasieniec, A. Lingas, and A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, In Proc 5th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, (DIALM'2001), pp. 44-51.
8. M. Christersson, L. Gasieniec, and A. Lingas, Gossiping with bounded size messages in ad hoc radio networks, In Proc 29th Int. Colloq. on Automata, Languages and Programming, (ICALP'2002), to appear.
9. M. Chrobak, L. Gasieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, In Proc. 41st IEEE Symp. on Found, of Comp. Sci., (FOCS'2000), pp. 575-581.
10. M. Chrobak, L. Gasieniec, and W. Rytter, A randomized algorithm for gossiping in radio networks, In Proc. 7th Annual Int. Computing and Combinatorics Conference, (COCOON'2001), pp. 483-492.
11. 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, (SODA'2001), pp. 709-718.
12. M. Flamini and S. Perennes, Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols, Tech Report, INRIA, January 1999.
13. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, 1988.
14. I. Gaber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, (SODA'1995), pp. 577-585.
15. L. Gasieniec and A. Lingas, On adaptive deterministic gossiping in ad hoc radio networks, In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA'2002), pp. 689-690.
16. P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, In Proc. 13tii ACM-SIAM Symp. on Disc. Alg., (SODA'2002), pp. 697-704.
17. K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discrete Applied Mathematics 61 (1995), pp 61-82.
18. K. Ravishankar and S. Singh, Gossiping on a ring with radios, Par. Proc. Let. 6, (1996), pp 115-126.
19. S. Tabbane, Handbook of Mobile Radio Networks, Artech House Publishers, 2000.