Skip to main content
Springer Nature Link
Log in

Wake-Up Problem in Multi-Hop Radio Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

Years and Authors of Summarized Original Work

  • 2004; Chlebus, Kowalski

  • 2004; Chrobak, Gąsieniec, Kowalski

  • 2005; Chlebus, Gąsieniec, Kowalski, Radzik

  • 2007; Chrobak, Gąsieniec, Kowalski

Problem Definition

A radio network is modeled as a directed, strongly connected graph G with n nodes. The nodes of a network G correspond to transmitting/receiving wireless devices, and directed edges represent their immediately reached neighbors: if a node w is within the transmission range of a node v, then G contains an edge (v, w). We call w an out-neighbor of v and v an in-neighbor of w.

Each node v has a unique label ℓ v from the set [N] = { 1, …, N}, where N = O(n). Initially, each node knows only its label and the values of n and N.

The time is divided into discrete time steps. It is assumed that nodes have unlimited computing power and can perform arbitrary computations within one time step. However, only one transmission or message receipt is allowed in one time step. Each node has its own local...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Chlebus BS, Kowalski DR (2004) A better wake-up in radio networks. In: Chaudhuri S, Kutten S (eds) PODC. ACM, pp 266–274

    Google Scholar 

  2. Chlebus BS, Gasieniec L, Kowalski DR, Radzik T (2005) On the wake-up problem in radio networks. In: Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M (eds) ICALP. Lecture notes in computer science, Lisbon, Portugal, vol 3580. Springer, pp 347–359

    Google Scholar 

  3. Chrobak M, Gasieniec L, Kowalski DR (2004) The wake-up problem in multi-hop radio networks. In: Munro JI (ed) SODA. Portland, Oregon, USA, SIAM, pp 992–1000

    Google Scholar 

  4. Chrobak M, Gasieniec L, Kowalski DR (2007) The wake-up problem in multihop radio networks. SIAM J Comput 36(5):1453–1471

    Article  MathSciNet  MATH  Google Scholar 

  5. De Bonis A, Gasieniec L, Vaccaro U (2005) Optimal two-stage algorithms for group testing problems. SIAM J Comput 34(5):1253–1270

    Article  MathSciNet  MATH  Google Scholar 

  6. Gasieniec L, Pelc A, Peleg D (2001) The wakeup problem in synchronous broadcast systems. SIAM J Discret Math 14(2):207–222

    Article  MathSciNet  MATH  Google Scholar 

  7. Jurdzinski T, Stachowiak G (2005) Probabilistic algorithms for the wake-up problem in single-hop radio networks. Theory Comput Syst 38(3):347–367

    Article  MathSciNet  MATH  Google Scholar 

  8. Kowalski DR (2011) Coordination problems in ad hoc radio networks. In: Nikoletseas S, Rolim JD (eds) Theoretical aspects of distributed computing in sensor networks. Springer

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Wrocław, Poland

    Tomasz Jurdziński

  2. Department of Computer Science, University of Liverpool, L69 3BX, Liverpool, UK

    Dariusz R. Kowalski

Authors
  1. Tomasz Jurdziński
    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

Corresponding author

Correspondence to Tomasz Jurdziński .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Jurdziński, T., Kowalski, D.R. (2016). Wake-Up Problem in Multi-Hop Radio Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_536

Download citation

Publish with us

Policies and ethics