Broadcasting in UDG radio networks with unknown topology

Distributed Computing

Volumn 21, Issue 5, 2009, Pages 331-351

  Emek, Yuval ^a   Ga̧sieniec, Leszek ^b   Kantor, Erez ^c   Pelc, Andrzej ^d   Peleg, David ^c   Su, Chang ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

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

Author keywords

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

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; CONTROL THEORY; DECODING; DISKS (STRUCTURAL COMPONENTS); ELECTRIC NETWORK TOPOLOGY; RADIO; RADIO BROADCASTING; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS; TOPOLOGY; WAKES; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

BROADCASTING MODELS; DETERMINISTIC ALGORITHMS; DETERMINISTIC BROADCASTING; EUCLIDEAN PLANES; LOWER BOUNDS; MINIMUM DISTANCES; NETWORK STATIONS; NETWORK TOPOLOGIES; PARAMETER VALUES; RADIO NETWORKS; TIME STEPS; TWO PARAMETERS; UNIT DISK GRAPHS; WIRELESS COMMUNICATIONS;

BROADCASTING;

EID: 60449107686     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0075-z     Document Type: Conference Paper

References (36)

1. N. Alon A. Bar-Noy N. Linial D. Peleg 1991 A lower bound for radio broadcast J. Comp. Syst. Sci. 43 290 298
2. Avin, C., Ercal, G.: On the cover time of random geometric graphs. In: Proc. 32th Int. Colloq. on Automata, Languages and Programming (ICALP 2005). LNCS, vol. 3580, pp. 677-689 (2005)
3. R. Bar-Yehuda O. Goldreich A. Itai 1992 On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization J. Comp. Syst. Sci. 45 104 126
4. D. Bruschi M. Del Pinto 1997 Lower bounds for the broadcast problem in mobile radio networks Distributed Comput. 10 129 135
5. I. Chlamtac S. Kutten 1985 On broadcasting in radio networks-problem analysis and protocol design IEEE Trans. Commun. 33 1240 1246
6. I. Chlamtac O. Weinstein 1991 The wave expansion approach to broadcasting in multihop radio networks IEEE Trans. Commun. 39 426 433
7. B. Chlebus L. Gasieniec A. Gibbons A. Pelc W. Rytter 2002 Deterministic broadcasting in unknown radio networks Distributed Comput. 15 27 38
8. Chlebus, B., Gasieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Proc. 27th Int. Colloq. on Automata, Languages and Programming (ICALP 2000). LNCS, vol. 1853, pp. 717-728 (2000)
9. Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proc. 23rd Symp. on Principles of Distributed Computing (PODC 2004) (2004)
10. Chrobak, M., Gasieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA 2004), pp. 985-993 (2004)
11. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symp. on Foundations of Computer Science (FOCS 2000), pp. 575-581 (2000)
12. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 709-718 (2001)
13. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symp. on Foundations of Computer Science (FOCS 2003), pp. 492-501 (2003)
14. De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA 2008) (2008)
15. A. Dessmark A. Pelc 2007 Broadcasting in geometric radio networks J. Discrete Algorithms 5 187 201
16. K. Diks E. Kranakis D. Krizanc A. Pelc 2002 The impact of knowledge on broadcasting time in linear radio networks Theor. Comp. Sci. 287 449 471
17. Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA 2005), pp. 222-231 (2005)
18. Emek, Y., Kantor, E., Peleg, D.: On the effect of the deployment setting on broadcasting in Euclidean radio networks (submitted)
19. Fusco, E., Pelc, A.: Broadcasting in UDG radio networks with missing and inaccurate information (submitted)
20. I. Gaber Y. Mansour 2003 Centralized broadcast in multihop radio networks J. Algorithms 46 1 20
21. L. Gasieniec A. Pelc D. Peleg 2001 The wakeup problem in synchronous broadcast systems SIAM J. Discrete Math. 14 207 222
22. Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th ACM Symp. on Principles Of Distributed Computing (PODC 2005), pp. 129-137 (2005)
23. Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proc. 13th Int. Symp. on Algorithms and Computation (ISAAC 2002). LNCS, vol. 2518, pp. 535-549 (2002)
24. Kesselman, A., Kowalski, D.: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In: Proc. 2nd Int. Conf. on Wireless on Demand Network Systems and Service (WONS 2005), pp. 119-124 (2005)
25. D. Kowalski A. Pelc 2004 Time of deterministic broadcasting in radio networks with local knowledge SIAM J. Comput. 33 870 891
26. D. Kowalski A. Pelc 2005 Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism Theor. Comp. Sci. 333 355 371
27. D. Kowalski A. Pelc 2005 Broadcasting in undirected ad hoc radio networks Distributed Comput. 18 43 57
28. D. Kowalski A. Pelc 2007 Optimal deterministic broadcasting in known topology radio networks Distributed Comput. 19 185 195
29. E. Kranakis D. Krizanc A. Pelc 2001 Fault-tolerant broadcasting in radio networks J. Algorithms 39 47 67
30. Kuhn, F., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proc. DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 69-78 (2003)
31. E. Kushilevitz Y. Mansour 1998 An Ω(D log (N/D)) lower bound for broadcast in radio networks SIAM J. Comput. 27 702 712
32. Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: Proc. 24th ACM Symp. on Principles of Distributed Computing (PODC 2005), pp. 148-157 (2005)
33. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proc. 17th ACM Symp. on Parallel Algorithms (SPAA 2005), pp. 39-48 (2005)
34. Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding random geometric graph properties. In: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA 2005), pp. 989-998 (2005)
35. K. Ravishankar S. Singh 1994 Broadcasting on [0,L] Discrete Appl. Math. 53 299 319
36. Sen, A., Huson, M. L.: A New Model for Scheduling Packet Radio Networks. In: Proc. 15th Joint Conf. of the IEEE Computer and Communication Societies (IEEE INFOCOM 1996), pp. 1116-1124 (1996)