Centrality-Based Eventual Leader Election in Dynamic Networks - Archive ouverte HAL Access content directly
Conference Papers Year :

Centrality-Based Eventual Leader Election in Dynamic Networks

(1) , (1) , (1) , (1)
1
Arnaud Favier
Luciana Arantes
Jonathan Lejeune
Pierre Sens

Abstract

This paper presents CEL, a new distributed eventual leader election algorithm for dynamic networks, which exploits topological information to improve the choice of a central leader and reduce message exchanges. The algorithm has a crosslayer neighbors detection, with a neighbor-aware mechanism, to improve the sharing of topological knowledge and elect a central leader faster. It uses a self-pruning mechanism based on topological knowledge, combined with probabilistic gossip, to improve the performance of broadcast propagation. Evaluations were conducted on the OMNeT++ environment, simulating realistic MANET with interference, collision, and messages loss. Using different parameters values, we have compared CEL to Gómez-Calzado et al. algorithm [1], on the Random Walk and the Truncated Lévy Walk mobility models. The results show better performances than [1], including fewer messages sent, shortest paths to the leader, and a more stable algorithm.
Fichier principal
Vignette du fichier
Centrality-Based Eventual Leader Election in Dynamic Networks.pdf (327.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03452072 , version 1 (26-11-2021)

Identifiers

  • HAL Id : hal-03452072 , version 1

Cite

Arnaud Favier, Luciana Arantes, Jonathan Lejeune, Pierre Sens. Centrality-Based Eventual Leader Election in Dynamic Networks. NCA 2021 - 20th IEEE International Symposium on Network Computing and Applications, Nov 2021, Cambridge, Boston, United States. pp.1-8. ⟨hal-03452072⟩
105 View
95 Download

Share

Gmail Facebook Twitter LinkedIn More