Broadcasting in udg radio networks with unknown topology

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 195-204

  Emek, Yuval ^a   Gasieniec, Leszek ^b   Kantor, Erez ^a   Pelc, Andrzej ^c   Peleg, David ^a   Su, Chang ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Ad hoc networks; Broadcasting; Radio networks; Unit disk graphs

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; MATHEMATICAL MODELS; MESSAGE PASSING; TOPOLOGY;

PARAMETER VALUES; RADIO NETWORKS; UNIT DISK GRAPHS (UDG);

RADIO BROADCASTING;

EID: 36849021555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281130     Document Type: Conference Paper

References (32)

1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. of Computer and System Sciences 43, (1991), 290-298.
2. Avin, C., Ercal, G.: On the Cover Time of Random Geometric Graphs. In Proc. ICALP 2005, 677-689.
3. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. of Computer and System Sciences 45, (1992), 104-126.
4. Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10, (1997), 129-135.
5. Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. on Communications 33, (1985), 1240-1246.
6. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. on Communications 39, (1991), 426-433.
7. Chlebus, B., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, (2002), 27-38.
8. Chlebus, B., Ga̧sieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. In Proc. ICALP 2000, 717-728.
9. Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In Proc. PODC 2004, 266-274.
10. Chrobak, M., Ga̧sieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In Proc. SODA 2004, 985-993.
11. Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In Proc. FOCS 2000, 575-581.
12. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In Proc. SODA 2001, 709-718.
13. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In Proc. FOCS 2003, 492-501.
14. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. J. of Discrete Algorithms 5 (2007), 187-201.
15. Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in linear radio networks. Theoretical Computer Science 287, (2002), 449-471.
16. Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In Proc. SODA 2005, 222-231.
17. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. of Algorithms 46, (2003), 1-20.
18. Ga̧sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. on Discrete Mathematics 14, (2001), 207-222.
19. Ga̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In Proc. PODC 2005, 129-137.
20. Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In Proc. ISAAC 2002, 535-549.
21. Kesselman, A., Kowalski, D.,: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In Proc. WONS 2005, 119-124.
22. Kowalski, D., Pele, A.: Time of deterministic broadcasting in radio networks with local knowledge, SIAM J. on Computing 33, (2004), 870-891.
23. Kowalski, D., Pele, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, (2005), 355-371.
24. Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18, (2005), 43-57.
25. Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing, to appear.
26. Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks, J. of Algorithms 39, (2001), 47-67.
27. Kushilevitz, E., Mansour, Y.: An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM J. on Computing 27, (1998), 702-712.
28. Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In Proc. PODC 2005, 148-157.
29. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In Proc. SPAA 2005, 39-48.
30. Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding random geometric graph properties, In Proc. SODA 2005, 989-998.
31. Ravishankar, K., Singh, S.: Broadcasting on [0,L]. Discrete Applied Mathematics 53, (1994), 299-319.
32. Sen, A., Huson, M. L.: A New Model for Scheduling Packet Radio Networks, In Proc. IEEE INFOCOM 96, 1116-1124.