Deterministic communication in radio networks with large labels

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

Volumn 2461, Issue , 2002, Pages 512-524

  Gąsieniec, Leszek ^a   Pagourtzis, Aris ^b,c   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b ETH ZURICH   (Switzerland)

^c NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; RADIO;

AD HOC RADIO NETWORKS; BROADCASTING ALGORITHM; DETERMINISTIC COMMUNICATIONS; DIRECTED NETWORK; RADIO NETWORKS; RANDOMIZED BROADCASTING; TIME ALGORITHMS; UNDIRECTED NETWORK;

RADIO BROADCASTING;

EID: 84938083217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_46     Document Type: Conference Paper

References (22)

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), pp. 290-298. 513
2. R. Bar-Yehuda, O. Goldreich, and A. Itai, 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), pp. 104-126. 512, 513
3. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993), pp. 875-887. 514
4. D. Brusci, and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing, 10 (1997), pp. 129-135. 513
5. I. Chlamtac and O. Weinstein, The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, IEEE Trans. on Communications, 39(3), pp. 426-433, 1991. 522
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. 513, 515, 516, 520, 522
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. 513
8. B. S. Chlebus, L. Gasieniec, A. Ostlin, and J. M. Robson, Deterministic radio broadcasting, In Proc 27th Int. Colloq. on Automata, Languages and Programming, (ICALP’2000), LNCS 1853, pp. 717-728. 513, 516, 518, 520, 522
9. M. Christersson, L. Gasieniec, and A. Lingas, Gossiping with bounded size messages in ad-hoc radio networks, to appear in Proc 29th Int. Colloq. on Automata, Languages and Programming, (ICALP’2002), Malaga, July 2002. 514
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. 513
11. M. Chrobak, L. Gasieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, In Proc. 41st IEEE Symp. on Found. of Computer Science, (FOCS’2000), pp. 575-581. A full version to appear in Journal of Algorithms. 512, 513, 514, 516
12. 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, Washington, DC, 2001, pp. 709-718. 513, 514, 515
13. A. E. F. Clementi, A. Monti, and R. Silvestri, Round robin is optimal for fault-tolerant broadcasting on wireless networks, In Proc. 9th Ann. European Symposium on Algorithms, (ESA’2001), pp 452-463. 513
14. G. De Marco, and A. Pelc, Faster broadcasting in unknown radio networks, Information Processing Letters, 79(2), pp 53-56, (2001). 513
15. L. Gasieniec & A. Lingas, On adaptive deterministic gossiping in ad-hoc radio networks, In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’2002), January 2002, pp 689-690. 514
16. L. Gasieniec and I. Potapov, Gossiping with unit messages in known radio networks, to appear in Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002. 514
17. P. Indyk, Explicit constructions of selectors and related combinatorial structures with applications, In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, (SODA’2002), January 2002, pp 697-704. 513, 514
18. E. Kushilevitz, and Y. Mansour, An f2(D log(N/D)) lower bound for broadcast in radio networks, SIAM J. on Computing, 27 (1998), pp. 702-712. 513
19. D. Peleg, Deterministic radio broadcast with no topological knowledge, 2000, amanuscript. 512, 514
20. K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discrete Applied Mathematics 61 (1995), pp 61-82. 514
21. K. Ravishankar and S. Singh, Gossiping on a ring with radios, Par. Proc. Let. 6, (1996), pp 115-126. 514
22. S. Tabbane, Handbook ofMobile Radio Networks, Artech House Publishers, 2000. 512