Electing a leader in multi-hop radio networks

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc

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

Abstract

We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.

Original languageEnglish (US)
Title of host publicationPrinciples of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings
Pages106-120
Number of pages15
DOIs
StatePublished - Dec 1 2012
Externally publishedYes
Event16th International Conference on Principles of Distributed Systems, OPODIS 2012 - Rome, Italy
Duration: Dec 18 2012Dec 20 2012

Publication series

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

Conference

Conference16th International Conference on Principles of Distributed Systems, OPODIS 2012
CountryItaly
CityRome
Period12/18/1212/20/12

Fingerprint

Radio Networks
Multi-hop
Deterministic Algorithm
Randomized Algorithms
Electric power transmission networks
Gossiping
Collision Detection
Wireless networks
Simple Graph
Undirected Graph
Network Topology
Topology
Wireless Networks
Vertex of a graph

Keywords

  • distributed algorithm
  • gossiping
  • leader election
  • lower bound
  • radio network
  • randomization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., Kowalski, D. R., & Pelc, A. (2012). Electing a leader in multi-hop radio networks. In Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings (pp. 106-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7702 LNCS). https://doi.org/10.1007/978-3-642-35476-2_8

Electing a leader in multi-hop radio networks. / Chlebus, Bogdan S.; Kowalski, Dariusz R.; Pelc, Andrzej.

Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings. 2012. p. 106-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7702 LNCS).

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

Chlebus, BS, Kowalski, DR & Pelc, A 2012, Electing a leader in multi-hop radio networks. in Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7702 LNCS, pp. 106-120, 16th International Conference on Principles of Distributed Systems, OPODIS 2012, Rome, Italy, 12/18/12. https://doi.org/10.1007/978-3-642-35476-2_8
Chlebus BS, Kowalski DR, Pelc A. Electing a leader in multi-hop radio networks. In Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings. 2012. p. 106-120. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-35476-2_8
Chlebus, Bogdan S. ; Kowalski, Dariusz R. ; Pelc, Andrzej. / Electing a leader in multi-hop radio networks. Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings. 2012. pp. 106-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{df55c12146c14ef5bd34c896509d3464,
title = "Electing a leader in multi-hop radio networks",
abstract = "We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.",
keywords = "distributed algorithm, gossiping, leader election, lower bound, radio network, randomization",
author = "Chlebus, {Bogdan S.} and Kowalski, {Dariusz R.} and Andrzej Pelc",
year = "2012",
month = "12",
day = "1",
doi = "10.1007/978-3-642-35476-2_8",
language = "English (US)",
isbn = "9783642354755",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "106--120",
booktitle = "Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings",

}

TY - GEN

T1 - Electing a leader in multi-hop radio networks

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.

AB - We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.

KW - distributed algorithm

KW - gossiping

KW - leader election

KW - lower bound

KW - radio network

KW - randomization

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

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

U2 - 10.1007/978-3-642-35476-2_8

DO - 10.1007/978-3-642-35476-2_8

M3 - Conference contribution

AN - SCOPUS:84871660038

SN - 9783642354755

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

SP - 106

EP - 120

BT - Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings

ER -