Skip to main content
SpringerLink
Log in

Fast Radio Broadcasting with Advice

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5058))

Abstract

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.

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. Journal of Computer and System Sciences 43, 290–298 (1991)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Brito, C., Gafni, E., Vaya, S.: An information theoretic lower bound for broadcasting in radio networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 534–546. Springer, Heidelberg (2004)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Chlebus, B., Ga̧sieniec, L., Östlin, 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 

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

    Google Scholar 

  10. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 709–718 (2001)

    Google Scholar 

  11. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 492–501 (2003)

    Google Scholar 

  12. De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA 2008) (2008)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 

  15. Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms(SODA 2005) (2005)

    Google Scholar 

  16. Emek, Y., Gasieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C.: Broadcasting time in UDG radio networks with unknown topology. In: Proc. 26th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 195–204 (2007)

    Google Scholar 

  17. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication problems. In: Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 179–187 (2006)

    Google Scholar 

  18. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 24–37. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Fraigniaud, P., Ilcinkas, D., Gavoille, C., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 231–242. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 154–160 (2007)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  25. Kowalski, D., 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 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  30. Soguet, D., Nisse, N.: Graph searching with advice. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 51–65. Springer, Heidelberg (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LaBRI, Université Bordeaux I, France

    David Ilcinkas

  2. Department of Computer Science, The University of Liverpool, United Kingdom

    Dariusz R. Kowalski

  3. Département d’informatique, Université du Québec en Outaouais, Canada

    Andrzej Pelc

Authors
  1. David Ilcinkas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dariusz R. Kowalski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alexander A. Shvartsman Pascal Felber

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ilcinkas, D., Kowalski, D.R., Pelc, A. (2008). Fast Radio Broadcasting with Advice. In: Shvartsman, A.A., Felber, P. (eds) Structural Information and Communication Complexity. SIROCCO 2008. Lecture Notes in Computer Science, vol 5058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69355-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69355-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69326-0

  • Online ISBN: 978-3-540-69355-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation