Skip to Main content Skip to Navigation

Eventual Leader Elections in Dynamic Networks

Abstract : Leader election is important for many fault-tolerant services in asynchronous distributed systems. By coordinating actions of a set of processes, it allows solving agreement problems like the consensus, a fundamental problem of distributed computing. Several consensus algorithms, such as Paxos, rely on an eventual leader election service, also known as the Omega failure detector. Omega returns the identity of a process in the system, ensuring that eventually the identity of the same correct process is always returned. Many leadership algorithms were proposed in the literature to implement Omega. Among those that consider dynamic systems, most of them do not choose the leader according to a topological criterion. However, the position of the leader in the network directly impacts the performance of algorithms using the leader election service, since the leader must often interact with other processes, for example, to collect information from a majority of processes in consensus algorithms. This thesis studies the eventual leader election problem in dynamic evolving networks and performance related issues. Two eventual leader election algorithms are proposed for Mobile Ad Hoc Networks. They maintain and exploit the knowledge of the network topology to eventually elect one leader per connected component with the best closeness centrality. Evaluations were conducted on simulators with different mobility models and performance results show that these algorithms present better performance than other algorithms of the literature, including fewer messages, shortest paths to the leader, and better stability.
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Monday, May 16, 2022 - 12:12:41 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:07 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03624018, version 2


Arnaud Favier. Eventual Leader Elections in Dynamic Networks. Distributed, Parallel, and Cluster Computing [cs.DC]. Sorbonne Université, 2022. English. ⟨NNT : 2022SORUS059⟩. ⟨tel-03624018v2⟩



Record views


Files downloads