Topology Aware Leader Election Algorithm for MANET - Archive ouverte HAL Access content directly
Conference Papers Year :

Topology Aware Leader Election Algorithm for MANET

(1) , (1) , (1) , (2) , (1) , (1)
1
2

Abstract

This article presents an eventual leader election algorithm for mobile dynamic networks. Each node builds knowledge of the communication graph of connected nodes, by broadcasting changes in their neighborhood. This knowledge provides the current topology of the network, used to compute the closeness centrality as the choice of the leader. Experiments were realized on PeerSim simulator, comparing our algorithm with static and dynamic flooding algorithms, on different network topologies and mobility patterns. Our algorithm improves leader stability up to 24%, sends half less messages and aims to an 8% shorter leader path.
Fichier principal
Vignette du fichier
TA-Compas.pdf (402.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03471423 , version 1 (08-12-2021)

Identifiers

  • HAL Id : hal-03471423 , version 1

Cite

Arnaud Favier, Nicolas Guittonneau, Jonathan Lejeune, Anne Fladenmuller, Luciana Arantes, et al.. Topology Aware Leader Election Algorithm for MANET. COMPAS 2020 - Conférence francophone d'informatique en Parallélisme, Architecture et Système, Jun 2020, Lyon, France. ⟨hal-03471423⟩
47 View
34 Download

Share

Gmail Facebook Twitter LinkedIn More