On the wake-up problem in radio networks

Research output: Contribution to journalConference article

38 Scopus citations


Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving simultaneously to a node interfere with one another and none of them can be read reliably. We present improved solutions to the problem of waking up such a network. This requires activating all nodes in a scenario when some nodes start to be active spontaneously, while every sleeping node needs to be awaken by receiving successfully a message from a neighbor. Our contributions concern the existence and efficient construction of universal radio synchronizers, which are combinatorial structures introduced in [6] as building blocks of efficient wake-up algorithms. First we show by counting that there are (n, g)-universal synchronizers for g(k) = scriptOsign(k log k log n). Next we show an explicit construction of (n, g)-universal-synchronizers for g(k) = scriptOsign(k2 polylog n). By way of applications, we obtain an existential wake-up algorithm which works in time scriptOsign(n log2 n) and an explicitly instantiated algorithm that works in time scriptOsign(n Δ polylog n), where n is the number of nodes and Δ is the maximum in-degree in the network. Algorithms for leader-election and synchronization can be developed on top of wake-up ones, as shown in [7], such that they work in time slower by a factor of scriptOsign(log n) than the underlying wake-up ones.

Original languageEnglish (US)
Pages (from-to)347-359
Number of pages13
JournalLecture Notes in Computer Science
StatePublished - Oct 19 2005
Externally publishedYes
Event32nd International Colloquium on Automata, Languages and Programming, ICALP 2005 - Lisbon, Portugal
Duration: Jul 11 2005Jul 15 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the wake-up problem in radio networks'. Together they form a unique fingerprint.

  • Cite this