Scalable wake-up of multi-channel single-hop radio networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider waking up a single-hop radio network with multiple channels. There are n stations connected to b channels without collision detection. Some k stations may become active spontaneously at arbitrary times, where k is unknown, and the goal is for all the stations to hear a successful transmission as soon as possible after the first spontaneous activation. We present a deterministic algorithm for the general problem that wakes up the network in O(k log1/b k log n) time. We prove a lower bound that any deterministic algorithm requires Ω(Formula Presented) time. We give a deterministic algorithm for the special case when b > dlog log n, for some constant d > 1, which wakes up the network in O(Formula Presented) time. This algorithm misses time optimality by at most a factor of log n log b. We give a randomized algorithm that wakes up the network within O(Formula Presented) rounds with the probability of at least 1 - ɛ, for any unknown 0 < ɛ < 1. We also consider a model of jamming, in which each channel in any round may be jammed to prevent a successful transmission, which happens with some known parameter probability p, independently across all channels and rounds. For this model, we give a deterministic algorithm that wakes up the network in O(log-1(1/p)k log n log1/b k) time with the probability of at least 1 - 1/poly(n).

Original languageEnglish (US)
Title of host publicationPrinciples of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings
EditorsMarcos K. Aguilera, Leonardo Querzoni, Marc Shapiro
PublisherSpringer Verlag
Pages186-201
Number of pages16
ISBN (Electronic)9783319144719
StatePublished - Jan 1 2014
Externally publishedYes
Event18th International Conference on Principles of Distributed Systems, OPODIS 2014 - Cortina d’Ampezzo, Italy
Duration: Dec 16 2014Dec 19 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8878
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Principles of Distributed Systems, OPODIS 2014
CountryItaly
CityCortina d’Ampezzo
Period12/16/1412/19/14

Fingerprint

Radio Networks
Wake
Deterministic Algorithm
Unknown
Collision Detection
Jamming
Randomized Algorithms
Activation
Optimality
Chemical activation
Lower bound
Arbitrary
Model

Keywords

  • Distributed algorithms
  • Multi-channel
  • Multiple access channel
  • Radio network
  • Randomized algorithms
  • Wakeup

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., Marco, G. D., & Kowalski, D. R. (2014). Scalable wake-up of multi-channel single-hop radio networks. In M. K. Aguilera, L. Querzoni, & M. Shapiro (Eds.), Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings (pp. 186-201). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8878). Springer Verlag.

Scalable wake-up of multi-channel single-hop radio networks. / Chlebus, Bogdan S.; Marco, Gianluca De; Kowalski, Dariusz R.

Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings. ed. / Marcos K. Aguilera; Leonardo Querzoni; Marc Shapiro. Springer Verlag, 2014. p. 186-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8878).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS, Marco, GD & Kowalski, DR 2014, Scalable wake-up of multi-channel single-hop radio networks. in MK Aguilera, L Querzoni & M Shapiro (eds), Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8878, Springer Verlag, pp. 186-201, 18th International Conference on Principles of Distributed Systems, OPODIS 2014, Cortina d’Ampezzo, Italy, 12/16/14.
Chlebus BS, Marco GD, Kowalski DR. Scalable wake-up of multi-channel single-hop radio networks. In Aguilera MK, Querzoni L, Shapiro M, editors, Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings. Springer Verlag. 2014. p. 186-201. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chlebus, Bogdan S. ; Marco, Gianluca De ; Kowalski, Dariusz R. / Scalable wake-up of multi-channel single-hop radio networks. Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings. editor / Marcos K. Aguilera ; Leonardo Querzoni ; Marc Shapiro. Springer Verlag, 2014. pp. 186-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{57682b271f934497aeb7e893df8b5e40,
title = "Scalable wake-up of multi-channel single-hop radio networks",
abstract = "We consider waking up a single-hop radio network with multiple channels. There are n stations connected to b channels without collision detection. Some k stations may become active spontaneously at arbitrary times, where k is unknown, and the goal is for all the stations to hear a successful transmission as soon as possible after the first spontaneous activation. We present a deterministic algorithm for the general problem that wakes up the network in O(k log1/b k log n) time. We prove a lower bound that any deterministic algorithm requires Ω(Formula Presented) time. We give a deterministic algorithm for the special case when b > dlog log n, for some constant d > 1, which wakes up the network in O(Formula Presented) time. This algorithm misses time optimality by at most a factor of log n log b. We give a randomized algorithm that wakes up the network within O(Formula Presented) rounds with the probability of at least 1 - ɛ, for any unknown 0 < ɛ < 1. We also consider a model of jamming, in which each channel in any round may be jammed to prevent a successful transmission, which happens with some known parameter probability p, independently across all channels and rounds. For this model, we give a deterministic algorithm that wakes up the network in O(log-1(1/p)k log n log1/b k) time with the probability of at least 1 - 1/poly(n).",
keywords = "Distributed algorithms, Multi-channel, Multiple access channel, Radio network, Randomized algorithms, Wakeup",
author = "Chlebus, {Bogdan S.} and Marco, {Gianluca De} and Kowalski, {Dariusz R.}",
year = "2014",
month = "1",
day = "1",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "186--201",
editor = "Aguilera, {Marcos K.} and Leonardo Querzoni and Marc Shapiro",
booktitle = "Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings",

}

TY - GEN

T1 - Scalable wake-up of multi-channel single-hop radio networks

AU - Chlebus, Bogdan S.

AU - Marco, Gianluca De

AU - Kowalski, Dariusz R.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We consider waking up a single-hop radio network with multiple channels. There are n stations connected to b channels without collision detection. Some k stations may become active spontaneously at arbitrary times, where k is unknown, and the goal is for all the stations to hear a successful transmission as soon as possible after the first spontaneous activation. We present a deterministic algorithm for the general problem that wakes up the network in O(k log1/b k log n) time. We prove a lower bound that any deterministic algorithm requires Ω(Formula Presented) time. We give a deterministic algorithm for the special case when b > dlog log n, for some constant d > 1, which wakes up the network in O(Formula Presented) time. This algorithm misses time optimality by at most a factor of log n log b. We give a randomized algorithm that wakes up the network within O(Formula Presented) rounds with the probability of at least 1 - ɛ, for any unknown 0 < ɛ < 1. We also consider a model of jamming, in which each channel in any round may be jammed to prevent a successful transmission, which happens with some known parameter probability p, independently across all channels and rounds. For this model, we give a deterministic algorithm that wakes up the network in O(log-1(1/p)k log n log1/b k) time with the probability of at least 1 - 1/poly(n).

AB - We consider waking up a single-hop radio network with multiple channels. There are n stations connected to b channels without collision detection. Some k stations may become active spontaneously at arbitrary times, where k is unknown, and the goal is for all the stations to hear a successful transmission as soon as possible after the first spontaneous activation. We present a deterministic algorithm for the general problem that wakes up the network in O(k log1/b k log n) time. We prove a lower bound that any deterministic algorithm requires Ω(Formula Presented) time. We give a deterministic algorithm for the special case when b > dlog log n, for some constant d > 1, which wakes up the network in O(Formula Presented) time. This algorithm misses time optimality by at most a factor of log n log b. We give a randomized algorithm that wakes up the network within O(Formula Presented) rounds with the probability of at least 1 - ɛ, for any unknown 0 < ɛ < 1. We also consider a model of jamming, in which each channel in any round may be jammed to prevent a successful transmission, which happens with some known parameter probability p, independently across all channels and rounds. For this model, we give a deterministic algorithm that wakes up the network in O(log-1(1/p)k log n log1/b k) time with the probability of at least 1 - 1/poly(n).

KW - Distributed algorithms

KW - Multi-channel

KW - Multiple access channel

KW - Radio network

KW - Randomized algorithms

KW - Wakeup

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

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

M3 - Conference contribution

AN - SCOPUS:84917706655

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 186

EP - 201

BT - Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings

A2 - Aguilera, Marcos K.

A2 - Querzoni, Leonardo

A2 - Shapiro, Marc

PB - Springer Verlag

ER -