Skip to main content
SpringerLink
Log in

Waking Up Anonymous Ad Hoc Radio Networks

  • Conference paper
Book cover Distributed Computing (DISC 2005)

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

Included in the following conference series:

  • 613 Accesses

Abstract

We consider the task of waking up an anonymous ad hoc radio network from a single source, by a deterministic algorithm. In the beginning only the source is awake and has to wake up other nodes by disseminating messages throughout the network. Nodes of the network do not know its topology and they do not have distinct labels. In such networks some nodes are impossible to reach. A node in a network is accessible if it can be woken up by some (possibly network-dependent) deterministic algorithm. A deterministic wakeup algorithm for ad hoc networks is universal if it wakes up all accessible nodes in all networks. We study the question of the existence of such a universal wakeup algorithm. For synchronous communication we design a universal wakeup algorithm, and for asynchronous communication we show that no such algorithm exists.

Research partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.

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. Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM 35, 845–875 (1988)

    Article  MATH  MathSciNet  Google Scholar 

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

  4. Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing, PODC 1999 (1999)

    Google Scholar 

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

    Article  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., Gąsieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15, 27–38 (2002)

    Article  Google Scholar 

  8. Chlebus, B.S., Gą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. Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proc. 23rd Annual Symp. on Principles of Distributed Computing (PODC 2004) (2004)

    Google Scholar 

  10. Chlebus, B., 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)

    Chapter  Google Scholar 

  11. Chrobak, M., Gą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 

  12. Chrobak, M., Gąsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symposium on Foundations of Computer Science (FOCS 2000), pp. 575–581 (2000)

    Google Scholar 

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

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

  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. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms 46(1), 1–20 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Jurdziński, 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)

    Chapter  Google Scholar 

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

  20. Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 73–82 (2003)

    Google Scholar 

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

    Chapter  Google Scholar 

  22. Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean Functions on Anonymous Networks. Information and Computation 114, 214–236 (1994)

    Article  MATH  MathSciNet  Google Scholar 

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

Download references

Author information

Authors and Affiliations

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

    Andrzej Pelc

Authors
  1. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pelc, A. (2005). Waking Up Anonymous Ad Hoc Radio Networks. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_20

Download citation

  • DOI: https://doi.org/10.1007/11561927_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation