The space complexity of leader election in anonymous networks

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

Research output: Contribution to journalArticlepeer-review

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

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Fingerprint Dive into the research topics of 'The space complexity of leader election in anonymous networks'. Together they form a unique fingerprint.

Cite this