The space complexity of leader election in anonymous networks

E. I. Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The leader election problem is unsolvable for some anonymous networks. A leader election algorithm for anonymous networks thus elects a leader whenever it is possible; if it is impossible, the algorithm reports this fact. This paper investigates the space complexity of the leader election problem in anonymous networks, where the space complexity is measured by the size (in the number of bits) of memory per processor used by a leader election algorithm. We first observe that Ω(M + log d) bits are necessary and then show that O(n log d) bits are sufficient to construct a leader election algorithm that works on any network, where n, d and M are the number of processors, the maximum number of adjacent processors, and the maximum size (in bits) of a message, respectively. We next show that, for any arbitrarily fixed constant n, O(1) bits are sufficient to construct a leader election algorithm that works in any network of size n.

Original languageEnglish
Pages (from-to)427-440
Number of pages14
JournalInternational Journal of Foundations of Computer Science
Volume21
Issue number3
DOIs
Publication statusPublished - Jun 1 2010

Fingerprint

Data storage equipment

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

The space complexity of leader election in anonymous networks. / Ando, E. I.; Ono, Hirotaka; Sadakane, Kunihiko; Yamashita, Masafumi.

In: International Journal of Foundations of Computer Science, Vol. 21, No. 3, 01.06.2010, p. 427-440.

Research output: Contribution to journalArticle

Ando, E. I. ; Ono, Hirotaka ; Sadakane, Kunihiko ; Yamashita, Masafumi. / The space complexity of leader election in anonymous networks. In: International Journal of Foundations of Computer Science. 2010 ; Vol. 21, No. 3. pp. 427-440.
@article{4d99c5d2c9b24e46bb61af564d9da864,
title = "The space complexity of leader election in anonymous networks",
abstract = "The leader election problem is unsolvable for some anonymous networks. A leader election algorithm for anonymous networks thus elects a leader whenever it is possible; if it is impossible, the algorithm reports this fact. This paper investigates the space complexity of the leader election problem in anonymous networks, where the space complexity is measured by the size (in the number of bits) of memory per processor used by a leader election algorithm. We first observe that Ω(M + log d) bits are necessary and then show that O(n log d) bits are sufficient to construct a leader election algorithm that works on any network, where n, d and M are the number of processors, the maximum number of adjacent processors, and the maximum size (in bits) of a message, respectively. We next show that, for any arbitrarily fixed constant n, O(1) bits are sufficient to construct a leader election algorithm that works in any network of size n.",
author = "Ando, {E. I.} and Hirotaka Ono and Kunihiko Sadakane and Masafumi Yamashita",
year = "2010",
month = "6",
day = "1",
doi = "10.1142/S0129054110007349",
language = "English",
volume = "21",
pages = "427--440",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "3",

}

TY - JOUR

T1 - The space complexity of leader election in anonymous networks

AU - Ando, E. I.

AU - Ono, Hirotaka

AU - Sadakane, Kunihiko

AU - Yamashita, Masafumi

PY - 2010/6/1

Y1 - 2010/6/1

N2 - The leader election problem is unsolvable for some anonymous networks. A leader election algorithm for anonymous networks thus elects a leader whenever it is possible; if it is impossible, the algorithm reports this fact. This paper investigates the space complexity of the leader election problem in anonymous networks, where the space complexity is measured by the size (in the number of bits) of memory per processor used by a leader election algorithm. We first observe that Ω(M + log d) bits are necessary and then show that O(n log d) bits are sufficient to construct a leader election algorithm that works on any network, where n, d and M are the number of processors, the maximum number of adjacent processors, and the maximum size (in bits) of a message, respectively. We next show that, for any arbitrarily fixed constant n, O(1) bits are sufficient to construct a leader election algorithm that works in any network of size n.

AB - The leader election problem is unsolvable for some anonymous networks. A leader election algorithm for anonymous networks thus elects a leader whenever it is possible; if it is impossible, the algorithm reports this fact. This paper investigates the space complexity of the leader election problem in anonymous networks, where the space complexity is measured by the size (in the number of bits) of memory per processor used by a leader election algorithm. We first observe that Ω(M + log d) bits are necessary and then show that O(n log d) bits are sufficient to construct a leader election algorithm that works on any network, where n, d and M are the number of processors, the maximum number of adjacent processors, and the maximum size (in bits) of a message, respectively. We next show that, for any arbitrarily fixed constant n, O(1) bits are sufficient to construct a leader election algorithm that works in any network of size n.

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

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

U2 - 10.1142/S0129054110007349

DO - 10.1142/S0129054110007349

M3 - Article

AN - SCOPUS:77953532223

VL - 21

SP - 427

EP - 440

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 3

ER -