Distributed Computing

, Volume 21, Issue 5, pp 331–351 | Cite as

Broadcasting in UDG radio networks with unknown topology

  • Yuval Emek
  • Leszek Ga̧sieniec
  • Erez Kantor
  • Andrzej Pelc
  • David Peleg
  • Chang Su


The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting models are considered. In the conditional wake up model, the stations other than the source are initially idle and cannot transmit until they hear a message for the first time. In the spontaneous wake up model, all stations are awake (and may transmit messages) from the beginning. It turns out that broadcasting time depends on two parameters of the UDG network, namely, its diameter D and its granularity g, which is the inverse of the minimum distance between any two stations. We present a deterministic broadcasting algorithm which works in time O (Dg) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than \({\Omega (D \sqrt{g})}\) . For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O (D + g2) and the second in time O (D log g). While neither of these algorithms alone is optimal for all parameter values, we prove that the algorithm obtained by interleaving their steps, and thus working in time \({ O \left( \min\left\{ D + g^2, D \log{g}\right\}\right) }\), turns out to be optimal by establishing a matching lower bound.


Radio networks Unit disk graphs Ad hoc networks Broadcasting 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon N., Bar-Noy A., Linial N., Peleg D.: A lower bound for radio broadcast. J. Comp. Syst. Sci. 43, 290–298 (1991)MATHCrossRefMathSciNetGoogle Scholar
  2. 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)Google Scholar
  3. 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. Comp. Syst. Sci. 45, 104–126 (1992)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bruschi D., Del Pinto M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Comput. 10, 129–135 (1997)CrossRefGoogle Scholar
  5. 5.
    Chlamtac I., Kutten S.: On broadcasting in radio networks—problem analysis and protocol design. IEEE Trans. Commun. 33, 1240–1246 (1985)MATHCrossRefGoogle Scholar
  6. 6.
    Chlamtac I., Weinstein O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426–433 (1991)CrossRefGoogle Scholar
  7. 7.
    Chlebus B., Ga̧sieniec L., Gibbons A., Pelc A., Rytter W.: Deterministic broadcasting in unknown radio networks. Distributed Comput. 15, 27–38 (2002)CrossRefGoogle Scholar
  8. 8.
    Chlebus, B., Ga̧sieniec, 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)Google Scholar
  9. 9.
    Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proc. 23rd Symp. on Principles of Distributed Computing (PODC 2004) (2004)Google Scholar
  10. 10.
    Chrobak, M., Ga̧sieniec, 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)Google Scholar
  11. 11.
    Chrobak, M., Ga̧sieniec, 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)Google Scholar
  12. 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)Google Scholar
  13. 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)Google Scholar
  14. 14.
    De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA 2008) (2008)Google Scholar
  15. 15.
    Dessmark A., Pelc A.: Broadcasting in geometric radio networks. J. Discrete Algorithms 5, 187–201 (2007)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Diks K., Kranakis E., Krizanc D., Pelc A.: The impact of knowledge on broadcasting time in linear radio networks. Theor. Comp. Sci. 287, 449–471 (2002)MATHCrossRefMathSciNetGoogle Scholar
  17. 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)Google Scholar
  18. 18.
    Emek, Y., Kantor, E., Peleg, D.: On the effect of the deployment setting on broadcasting in Euclidean radio networks (submitted)Google Scholar
  19. 19.
    Fusco, E., Pelc, A.: Broadcasting in UDG radio networks with missing and inaccurate information (submitted)Google Scholar
  20. 20.
    Gaber I., Mansour Y.: Centralized broadcast in multihop radio networks. J. Algorithms 46, 1–20 (2003)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Ga̧sieniec L., Pelc A., Peleg D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math. 14, 207–222 (2001)CrossRefMathSciNetGoogle Scholar
  22. 22.
    Ga̧sieniec, 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)Google Scholar
  23. 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)Google Scholar
  24. 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)Google Scholar
  25. 25.
    Kowalski D., Pelc A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Comput. 33, 870–891 (2004)MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Kowalski D., Pelc A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comp. Sci. 333, 355–371 (2005)MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Kowalski D., Pelc A.: Broadcasting in undirected ad hoc radio networks. Distributed Comput. 18, 43–57 (2005)CrossRefGoogle Scholar
  28. 28.
    Kowalski D., Pelc A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Comput. 19, 185–195 (2007)CrossRefGoogle Scholar
  29. 29.
    Kranakis E., Krizanc D., Pelc A.: Fault-tolerant broadcasting in radio networks. J. Algorithms 39, 47–67 (2001)MATHCrossRefMathSciNetGoogle Scholar
  30. 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)Google Scholar
  31. 31.
    Kushilevitz E., Mansour Y.: An Ω(D log (N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 702–712 (1998)MATHCrossRefMathSciNetGoogle Scholar
  32. 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)Google Scholar
  33. 33.
    Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proc. 17th ACM Symp. on Parallel Algorithms (SPAA 2005), pp. 39–48 (2005)Google Scholar
  34. 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)Google Scholar
  35. 35.
    Ravishankar K., Singh S.: Broadcasting on [0,L]. Discrete Appl. Math. 53, 299–319 (1994)MATHCrossRefMathSciNetGoogle Scholar
  36. 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)Google Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Yuval Emek
    • 1
  • Leszek Ga̧sieniec
    • 2
  • Erez Kantor
    • 3
  • Andrzej Pelc
    • 4
  • David Peleg
    • 3
  • Chang Su
    • 2
  1. 1.School of Electrical EngineeringTel Aviv UniversityTel AvivIsrael
  2. 2.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  3. 3.Department of Computer Science and Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael
  4. 4.Département d’informatiqueUniversité du Québec en OutaouaisGatineauCanada

Personalised recommendations