Skip to main content
SpringerLink
Log in

Activating anonymous ad hoc radio networks

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We consider the task of activating an anonymous ad hoc radio network from a single source, by a deterministic algorithm. In the beginning only the source is active and has to activate 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 activated by some (possibly network-dependent) deterministic algorithm. We show that the problem of recognizing whether a given node of an anonymous radio network is accessible, can be solved in polynomial time for the synchronous scenario. A deterministic wake-up algorithm for ad hoc networks is universal if it activates all accessible nodes in all networks. We study the question of the existence of such a universal activating algorithm. For synchronous communication we design a universal activating algorithm, and for asynchronous communication we show that no such algorithm exists.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of 12th Symposium on the Theory of Computing, pp. 82–93 (1980)

  3. Attiya H., Snir M. and Warmuth M. (1988). Computing on an anonymous ring. J. ACM 35: 845–875

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of 18th ACM Symposium on Principles of Distributed Computing (1999)

  6. Bruschi D. and Del Pinto M. (1997). Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10: 129–135

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  9. Chlebus B., Ga̧sieniec L., Gibbons A., Pelc A. and Rytter W. (2002). Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15: 27–38

    Article  Google Scholar 

  10. Chlebus, B., Ga̧sieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP’2000). LNCS, vol. 1853, pp. 717–728

  11. Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proceedings of 23rd Annual Symposium on Principles of Distributed Computing (PODC 2004)

  12. Chlebus, B., Rokicki, M.: Asynchronous broadcast in radio networks. In: Proceedings of 11th International Collaboration on Structural Information and Communication Complexity, (SIROCCO’2004). LNCS, vol. 3104, pp. 57–68

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

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

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

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

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

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Ga̧sieniec L., Pelc A. and Peleg D. (2001). The wakeup problem in synchronous broadcast systems. SIAM J. Discret. Math. 14: 207–222

    Article  MathSciNet  Google Scholar 

  20. Ga̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings of 24th Annual ACM Symposium on Principles Of Distributed Computing (PODC 2005)

  21. Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proceedings of 13th International Symposium on Algorithms and Computation (ISAAC 2002). LNCS, vol. 2518, pp. 535–549

  22. Kowalski D. and Pelc A. (2005). Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333: 355–371

    Article  MATH  MathSciNet  Google Scholar 

  23. Kowalski D. and Pelc A. (2005). Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18: 43–57

    Article  Google Scholar 

  24. Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. (to appear)

  25. Kranakis E., Krizanc D. and van der Berg J. (1994). Computing Boolean functions on anonymous networks. Inf. Comput. 114: 214–236

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Andrzej Pelc

Authors
  1. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Pelc.

Additional information

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

A preliminary version of this paper (with title “Waking up anonymous ad hoc radio networks”) appeared in the Proceedings of the 19th International Symposium on Distributed Computing (DISC 2005), September 2005, Cracow, Poland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pelc, A. Activating anonymous ad hoc radio networks. Distrib. Comput. 19, 361–371 (2007). https://doi.org/10.1007/s00446-007-0021-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-007-0021-5

Keywords

Search

Navigation