The wake-up problem in multihop radio networks

Marek Chrobak, Leszek Ga̧sieniec, Dariusz R. Kowalski

Research output: Contribution to journalArticle

Abstract

We study the problem of waking up a collection of n processors connected by a multihop ad hoc ratio network with unknown topology, no access to a global clock, and no collision detection mechanism available. Each node in the network either wakes up spontaneously or gets activated by receiving a wake-up signal from another node. All active nodes transmit the wake-up signals according to a given protocol W. The running time of W is the number of steps counted from the first spontaneous wake-up until all nodes become activated. We provide two protocols for this problem. The first one is a deterministic protocol with running time O(n 5/3 logn). Our protocol is based on a novel concept of a shift-tolerant selector to which we refer as a (radio) synchronizer. The second protocol is randomized, and its expected running time is O(D log 2 n), where D is the diameter of the network. Subsequently we show how to employ our wake-up protocols to solve two other communication primitives: leader election and clock synchronization.

Original languageEnglish (US)
Pages (from-to)1453-1471
Number of pages19
JournalSIAM Journal on Computing
Volume36
Issue number5
DOIs
StatePublished - Dec 1 2006
Externally publishedYes

Fingerprint

Radio Networks
Multi-hop
Wake
Clocks
Vertex of a graph
Leader Election
Clock Synchronization
Collision Detection
Selector
Synchronization
Topology
Communication
Unknown

Keywords

  • Broadcasting
  • Gossiping
  • Probabilistic method
  • Radio network
  • Wake-up

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Chrobak, M., Ga̧sieniec, L., & Kowalski, D. R. (2006). The wake-up problem in multihop radio networks. SIAM Journal on Computing, 36(5), 1453-1471. https://doi.org/10.1137/S0097539704442726

The wake-up problem in multihop radio networks. / Chrobak, Marek; Ga̧sieniec, Leszek; Kowalski, Dariusz R.

In: SIAM Journal on Computing, Vol. 36, No. 5, 01.12.2006, p. 1453-1471.

Research output: Contribution to journalArticle

Chrobak, M, Ga̧sieniec, L & Kowalski, DR 2006, 'The wake-up problem in multihop radio networks', SIAM Journal on Computing, vol. 36, no. 5, pp. 1453-1471. https://doi.org/10.1137/S0097539704442726
Chrobak, Marek ; Ga̧sieniec, Leszek ; Kowalski, Dariusz R. / The wake-up problem in multihop radio networks. In: SIAM Journal on Computing. 2006 ; Vol. 36, No. 5. pp. 1453-1471.
@article{19e9946afe1c42eaacd8d554f55fe499,
title = "The wake-up problem in multihop radio networks",
abstract = "We study the problem of waking up a collection of n processors connected by a multihop ad hoc ratio network with unknown topology, no access to a global clock, and no collision detection mechanism available. Each node in the network either wakes up spontaneously or gets activated by receiving a wake-up signal from another node. All active nodes transmit the wake-up signals according to a given protocol W. The running time of W is the number of steps counted from the first spontaneous wake-up until all nodes become activated. We provide two protocols for this problem. The first one is a deterministic protocol with running time O(n 5/3 logn). Our protocol is based on a novel concept of a shift-tolerant selector to which we refer as a (radio) synchronizer. The second protocol is randomized, and its expected running time is O(D log 2 n), where D is the diameter of the network. Subsequently we show how to employ our wake-up protocols to solve two other communication primitives: leader election and clock synchronization.",
keywords = "Broadcasting, Gossiping, Probabilistic method, Radio network, Wake-up",
author = "Marek Chrobak and Leszek Ga̧sieniec and Kowalski, {Dariusz R.}",
year = "2006",
month = "12",
day = "1",
doi = "10.1137/S0097539704442726",
language = "English (US)",
volume = "36",
pages = "1453--1471",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "5",

}

TY - JOUR

T1 - The wake-up problem in multihop radio networks

AU - Chrobak, Marek

AU - Ga̧sieniec, Leszek

AU - Kowalski, Dariusz R.

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We study the problem of waking up a collection of n processors connected by a multihop ad hoc ratio network with unknown topology, no access to a global clock, and no collision detection mechanism available. Each node in the network either wakes up spontaneously or gets activated by receiving a wake-up signal from another node. All active nodes transmit the wake-up signals according to a given protocol W. The running time of W is the number of steps counted from the first spontaneous wake-up until all nodes become activated. We provide two protocols for this problem. The first one is a deterministic protocol with running time O(n 5/3 logn). Our protocol is based on a novel concept of a shift-tolerant selector to which we refer as a (radio) synchronizer. The second protocol is randomized, and its expected running time is O(D log 2 n), where D is the diameter of the network. Subsequently we show how to employ our wake-up protocols to solve two other communication primitives: leader election and clock synchronization.

AB - We study the problem of waking up a collection of n processors connected by a multihop ad hoc ratio network with unknown topology, no access to a global clock, and no collision detection mechanism available. Each node in the network either wakes up spontaneously or gets activated by receiving a wake-up signal from another node. All active nodes transmit the wake-up signals according to a given protocol W. The running time of W is the number of steps counted from the first spontaneous wake-up until all nodes become activated. We provide two protocols for this problem. The first one is a deterministic protocol with running time O(n 5/3 logn). Our protocol is based on a novel concept of a shift-tolerant selector to which we refer as a (radio) synchronizer. The second protocol is randomized, and its expected running time is O(D log 2 n), where D is the diameter of the network. Subsequently we show how to employ our wake-up protocols to solve two other communication primitives: leader election and clock synchronization.

KW - Broadcasting

KW - Gossiping

KW - Probabilistic method

KW - Radio network

KW - Wake-up

UR - http://www.scopus.com/inward/record.url?scp=35448963514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35448963514&partnerID=8YFLogxK

U2 - 10.1137/S0097539704442726

DO - 10.1137/S0097539704442726

M3 - Article

AN - SCOPUS:35448963514

VL - 36

SP - 1453

EP - 1471

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 5

ER -