Skip to main content
SpringerLink
Log in

Time-Efficient Broadcasting in Radio Networks: A Review

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4882))

Abstract

Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Computer and System Sciences 43, 290–298 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: Single Round Simulation on Radio Networks. J. Algorithms 13, 188–210 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ambuhl, C., Clementi, A., Di Ianni, M., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. In: Proc. 21st Symp. on Theoretical Aspects of Computer Science, pp. 418–427 (2004)

    Google Scholar 

  4. Awerbuch, B.: A new distributed depth-first-search algorithm. Inform. Process. Lett. 20, 147–150 (1985)

    Article  MATH  Google Scholar 

  5. Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light-weight spanners. Technical Report CS92-22, The Weizmann Institute, Rehovot, Israel (1992)

    Google Scholar 

  6. Awerbuch, B., Cidon, I., Kutten, S., Mansour, Y., Peleg, D.: Optimal Broadcast with Partial Knowledge. SIAM J. Computing 28, 511–524 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R.: A tradeoff between information and communication in broadcast protocols. J. ACM 37, 238–256 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Awerbuch, B., Even, S.: Reliable Broadcast Protocols in Unreliable Networks. Networks 16, 381–396 (1986)

    Article  Google Scholar 

  9. Awerbuch, B., Segall, A.: A Reliable Broadcast Protocol. IEEE Trans. Communications 31, 896–901 (1983)

    Article  Google Scholar 

  10. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. Computer and System Sciences 45, 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM J. Computing 22, 875–887 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Basagni, S., Bruschi, D., Chlamtac, I.: A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE/ACM Trans. Networking 7, 799–807 (1999)

    Article  Google Scholar 

  13. Basagni, S., Myers, A.D., Syrotiuk, V.R.: Mobility-independent flooding for real-time multimedia applications in ad hoc networks. In: Proc. IEEE Emerging Technologies Symp. on Wireless Communications & Systems (1999)

    Google Scholar 

  14. Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomized communication in unknown ad hoc networks. In: Proc. 19th Symp. on Parallelism Algorithms and Architectures (2007)

    Google Scholar 

  15. Bertsekas, D., Gallager, R.: Data Networks. Prantice Hall, New Jersey (1987)

    Google Scholar 

  16. Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proc. 24th Symp. on Principles of Distributed Computing, pp. 138–147 (2005)

    Google Scholar 

  17. Bhandari, V., Vaidya, N.H.: Reliable Broadcast in Wireless Networks with Probabilistic Failures. In: Proc. 26th Joint Conf. of IEEE Computer and Communication Societies (INFOCOM), pp. 715–723 (2007)

    Google Scholar 

  18. Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10, 129–135 (1997)

    Article  Google Scholar 

  19. Cǎlinescu, G., Li, X.Y., Frieder, O., Wan, P.J.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proc. 20th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), pp. 1162–1171 (2001)

    Google Scholar 

  20. Chandra, R., Ramasubramanian, V., Birman, K.P.: Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks. In: Proc. 21st Conf. on Distributed Computing Systems, pp. 275–283 (2001)

    Google Scholar 

  21. Chlamtac, I., Faragó, A.: Making transmission schedule immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. Networking 2, 23–29 (1994)

    Article  Google Scholar 

  22. Chlamtac, I., Faragó, A., Zhang, H.: Time-spread multiple access (TSMA) protocols for multihop mobile radio networks. IEEE/ACM Trans. Networking 5, 804–812 (1997)

    Article  Google Scholar 

  23. Chlamtac, I., Kutten, S.: On broadcasting in radio networks – problem analysis and protocol design. IEEE Trans. Communications 33, 1240–1246 (1985)

    Article  MATH  Google Scholar 

  24. Chlamtac, I., Kutten, S.: Tree-based broadcasting in multihop radio networks. IEEE Trans. Computers 36, 1209–1223 (1987)

    Article  Google Scholar 

  25. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Communications 39, 426–433 (1991)

    Article  Google Scholar 

  26. Chlebus, B.S., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, 27–38 (2002)

    Article  Google Scholar 

  27. Chlebus, B.S., Gasieniec, L., Kowalski, D.R., Radzik, T.: On the Wake-Up Problem in Radio Networks. In: Proc. 32nd Int. Colloq. on Automata, Languages and Programming, pp. 347–359 (2005)

    Google Scholar 

  28. Chlebus, B.S., Ga̧sieniec, L., Ostlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 717–728. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  29. Chlebus, B.S., Kowalski, D.R.: A better wake-up in radio networks. In: Proc. 23rd Symp. on Principles of Distributed Computing, pp. 266–274 (2004)

    Google Scholar 

  30. Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 270–280. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  31. Chlebus, B.S., Rokicki, M.: Asynchronous broadcast in radio networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 57–68. Springer, Heidelberg (2004)

    Google Scholar 

  32. Chrobak, M., Ga̧sieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp. 985–993 (2004)

    Google Scholar 

  33. Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symp. on Foundations of Computer Science, pp. 575–581 (2000)

    Google Scholar 

  34. Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: Proc. 17th Symp. on Algorithms and Computation, pp. 339–348 (2006)

    Google Scholar 

  35. Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 23–38 (2002)

    Google Scholar 

  36. Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Proc. 18th Symp. on Theoretical Aspects of Computer Science, pp. 121–131 (2001)

    Google Scholar 

  37. 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, pp. 709–718 (2001)

    Google Scholar 

  38. Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On Computing Ad-hoc Selective Families. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 211–222. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  39. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science 302, 337–364 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  40. Clementi, A.E.F., Monti, A., Silvestri, R.: Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel and Distributed Computing 64, 89–96 (2004)

    Article  MATH  Google Scholar 

  41. Czumaj, A., Ga̧sieniec, L., Pelc, A.: Time and Cost Trade-Offs in Gossiping. SIAM J. Discrete Mathematics 11, 400–413 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  42. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60, 115–143 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  43. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. J. Discrete Algorithms 5, 187–201 (2007)

    Article  MathSciNet  Google Scholar 

  44. Dessmark, A., Pelc, A.: Deterministic radio broadcasting at low cost. Networks 39, 88–97 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  45. De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters 79, 53–56 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  46. Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in linear radio networks. Theoretical Computer Science 287, 449–471 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  47. Elkin, M., Kortsarz, G.: Logarithmic inapproximability of the radio broadcast problem. J. Algorithms 52(1), 8–25 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  48. Elkin, M., Kortsarz, G.: Polylogarithmic inapproximability of the radio broadcast problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX 2004. LNCS, vol. 3122, pp. 105–116. Springer, Heidelberg (2004)

    Google Scholar 

  49. Elkin, M., Kortsarz, G.: Improved schedule for radio broadcast. In: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, pp. 222–231 (2005)

    Google Scholar 

  50. Emek, Y., Ga̧sieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C.: Broadcasting in UDG radio networks with unknown topology. In: Proc. ACM Symp. on Principles of Distributed Computing (2007)

    Google Scholar 

  51. Emek, Y., Kantor, E., Peleg, D.: On the Effect of the Deployment Setting on Broadcasting in Euclidean Radio Networks (unpublished manuscript, 2007)

    Google Scholar 

  52. Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. 19th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), pp. 585–594 (2000)

    Google Scholar 

  53. Farley, A.M.: Minimal Broadcast Networks. Networks 9, 313–332 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  54. Farley, A.M., Hedetniemi, S.T., Mitchell, S., Proskurowski, A.: Minimum Broadcast Graphs. Discrete Math. 25, 189–193 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  55. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: The Complexity of Randomized Broadcast. J. on Random Structures & Algorithms 1, 447–460 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  56. Fernandez, A., Mosteiro, M.A., Thraves, C.: Deterministic Communication in the Weak Sensor Model. In: Proc. 11th Conf. On Principles Of Distributed Systems (2007)

    Google Scholar 

  57. Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Math. 53, 79–133 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  58. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. Algorithms 46, 1–20 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  59. Gargano, L., Pelc, A., Pérennes, S., Vaccaro, U.: Efficient communication in unknown networks. Networks 38, 39–49 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  60. Ga̧sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Mathematics 14, 207–222 (2001)

    Article  MathSciNet  Google Scholar 

  61. Ga̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th ACM Symp. on Principles Of Distributed Computing, pp. 129–137 (2005)

    Google Scholar 

  62. Ga̧sieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Energy and Time Efficient Broadcasting in Known Topology Radio Networks. In: Proc. 21st Symp. on Distributed Computing. LNCS, vol. 4731, pp. 253–267. Springer, Heidelberg (2007)

    Google Scholar 

  63. Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: Proc. 4th ACM Symp. on Mobile ad hoc networking and computing, pp. 222–232 (2003)

    Google Scholar 

  64. Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE/ACM Trans. Networking 14, 479–491 (2006)

    Article  Google Scholar 

  65. Hedetniemi, S., Hedetniemi, S., Liestman, A.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks 18, 319–349 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  66. Humblet, P.A., Soloway, S.R.: Topology Broadcast Algorithms. Computer Networks 16, 179–186 (1989)

    MATH  Google Scholar 

  67. Hwang, F.K.: The time complexity of deterministic broadcast radio networks. Discrete Applied Mathematics 60, 219–222 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  68. Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pp. 697–704 (2002)

    Google Scholar 

  69. Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 535–549. Springer, Heidelberg (2002)

    Google Scholar 

  70. Kesselman, A., Kowalski, D.R.: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In: Proc. 2nd Conf. on Wireless on Demand Network Systems and Service, pp. 119–124 (2005)

    Google Scholar 

  71. Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Proc. 23rd Symp. on Principles of Distributed Computing, pp. 275–282 (2004)

    Google Scholar 

  72. Koo, C.-Y., Bhandari, V., Katz, J., Vaidya, N.H.: Reliable broadcast in radio networks: the bounded collision case. In: Proc. 25th Symp. on Principles of Distributed Computing, pp. 258–264 (2006)

    Google Scholar 

  73. Kothapalli, K., Onus, M., Richa, A., Scheideler, C.: Efficient Broadcasting and Gathering in Wireless Ad Hoc Networks. In: Proc. IEEE Symp. on Parallel Architectures, Algorithms and Networks, pp. 346–351 (2005)

    Google Scholar 

  74. Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Mathematics 18, 332–346 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  75. Kowalski, D.R., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX 2004. LNCS, vol. 3122, pp. 171–182. Springer, Heidelberg (2004)

    Google Scholar 

  76. Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Computing 33, 870–891 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  77. Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18, 43–57 (2005)

    Article  Google Scholar 

  78. Kowalski, D.R., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, 355–371 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  79. Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19, 185–195 (2007)

    Article  Google Scholar 

  80. Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. J. Algorithms 39, 47–67 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  81. Kushilevitz, E., Mansour, Y.: An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM J. Computing 27, 702–712 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  82. Pagani, E., Rossi, G.P.: Reliable broadcast in mobile multihop radio networks. In: Proc. 3rd ACM/IEEE Conf. on Mobile Computing and Networking (MOBICOM), pp. 34–42 (1997)

    Google Scholar 

  83. Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks 28, 143–156 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  84. Pelc, A., Peleg, D.: Broadcasting with locally bounded Byzantine faults. Information Processing Letters 93, 109–115 (2005)

    Article  MathSciNet  Google Scholar 

  85. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)

    Google Scholar 

  86. Ravishankar, K., Singh, S.: Broadcasting on [0,L]. Discrete Applied Mathematics 53, 299–319 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  87. Segall, A.: Distributed Network Protocols. IEEE Trans. Inf. Th. 29, 23–35 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  88. Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proc. 15th Joint Conf. of IEEE Computer and Communication Societies (INFOCOM), pp. 1116–1124 (1996)

    Google Scholar 

  89. Song, W.-Z., Li, X.-Y., Frieder, O., Wang, W.: Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst. 17, 321–334 (2006)

    Article  Google Scholar 

  90. Toh, C.K.: Ad Hoc Mobile Wireless Networks. Prentice Hall, Englewood Cliffs (2002)

    Google Scholar 

  91. Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proc. 3rd ACM Symp. on Mobile Ad Hoc Networking and Computing, pp. 194–205 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel

    David Peleg

Authors
  1. David Peleg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tomasz Janowski Hrushikesha Mohanty

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peleg, D. (2007). Time-Efficient Broadcasting in Radio Networks: A Review. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77115-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77112-8

  • Online ISBN: 978-3-540-77115-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation