TY - GEN
T1 - Time and communication complexity of leader election in anonymous networks
AU - Kowalski, Dariusz R.
AU - Mosteiro, Miguel A.
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/7
Y1 - 2021/7
N2 - We study the problem of randomized Leader Election in synchronous distributed networks with indistinguishable nodes. We consider algorithms that work on networks of arbitrary topology in two settings, depending on whether the size of the network, i.e., the number of nodes $n$, is known or not. In the former setting, we present a new Leader Election protocol that improves over previous work by lowering message complexity and making it close to a lower bound by a factor in $\widetilde{O}(\sqrt{t_{mix}\sqrt{\Phi}})$, where $\Phi$ is the conductance and $t_{mix}$ is the mixing time of the network graph. We then show that lacking the network size no Leader Election algorithm can guarantee that the election is final with constant probability, even with unbounded communication. Hence, we further classify the problem as Leader Election (the classic one, requiring knowledge of $n$ - as is our first protocol) or Revocable Leader Election, and present a new polynomial time and message complexity Revocable Leader Election algorithm in the setting without knowledge of network size. We analyze time and message complexity of our protocols in the CONGEST model of communication.
AB - We study the problem of randomized Leader Election in synchronous distributed networks with indistinguishable nodes. We consider algorithms that work on networks of arbitrary topology in two settings, depending on whether the size of the network, i.e., the number of nodes $n$, is known or not. In the former setting, we present a new Leader Election protocol that improves over previous work by lowering message complexity and making it close to a lower bound by a factor in $\widetilde{O}(\sqrt{t_{mix}\sqrt{\Phi}})$, where $\Phi$ is the conductance and $t_{mix}$ is the mixing time of the network graph. We then show that lacking the network size no Leader Election algorithm can guarantee that the election is final with constant probability, even with unbounded communication. Hence, we further classify the problem as Leader Election (the classic one, requiring knowledge of $n$ - as is our first protocol) or Revocable Leader Election, and present a new polynomial time and message complexity Revocable Leader Election algorithm in the setting without knowledge of network size. We analyze time and message complexity of our protocols in the CONGEST model of communication.
KW - Ad-hoc Networks
KW - Anonymous Networks
KW - Distributed Algorithms
KW - Leader Election
UR - http://www.scopus.com/inward/record.url?scp=85109564755&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85109564755&partnerID=8YFLogxK
U2 - 10.1109/ICDCS51616.2021.00050
DO - 10.1109/ICDCS51616.2021.00050
M3 - Conference contribution
AN - SCOPUS:85109564755
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 449
EP - 460
BT - Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021
Y2 - 7 July 2021 through 10 July 2021
ER -