Proposal and comparative analysis of a voting-based election algorithm for managing service replication in MANETs

Guerrero-Contreras, Gabriel; Balderas-Díaz, Sara; Garrido, José Luis García; Rodríguez-Fórtiz, María José; O’Hare, Gregory M. P.

doi:10.1007/s10489-023-04506-7

Cited by 1 publication

(2 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several leader election algorithms 32 have been explored for MANETs, each with its strengths and limitations. For instance, some algorithms 34 focus on minimizing communication overhead during leader election, while others prioritize energy efficiency.…”

Section: Leader Election Algorithmsmentioning

confidence: 99%

“…The proposed CBGWO algorithm is compared with other existing methods such as PCA-FELM, 23 CTAA-MPSO, 27 FLS-RE, 29 LEACH, 33 DCAIDS, 25 WOA-GA, 34 and VOELA 32 in order to evaluate the performance in balancing energy consumption, prolonging network lifespan, and enhancing intrusion detection. The evaluation outcomes are explained below.…”

Section: Comparative Analysismentioning

confidence: 99%

See 1 more Smart Citation

Crossover Boosted Grey Wolf Optimizer‐based framework for leader election and resource allocation in Intrusion Detection Systems for MANETs

Selvaraj,

Nanjappan,

Nagalingam

et al. 2024

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Mobile Ad hoc Networks (MANETs) is a self‐organizing networks without having a fixed infrastructure for making them susceptible to security threats. Intrusion Detection Systems (IDS) promotes security in MANETs by identifying malicious activities. Leader election is a fundamental aspect of IDS deployment, impacting resource allocation and system efficiency. This article presents a novel approach, the Crossover Boosted Grey Wolf Optimizer (CBGWO), for leader election and resource allocation in MANET‐based IDS. The proposed CBGWO algorithm integrates the Grey Wolf Optimizer (GWO) with innovative crossover operators that have an ability to enhance the capabilities of exploration and exploitation in the optimization process. The leader election problem is solved through applying multi‐objective optimization by considering energy consumption, reputation, and communication overhead. Objective functions are defined to maximize energy efficiency while maintaining a balanced distribution of leadership roles. Extensive simulations are conducted, varying network densities and the percentage of selfish nodes. Results demonstrate the effectiveness of the CBGWO‐based model in balancing energy consumption, prolonging network lifespan, and enhancing intrusion detection by comparing different state‐of‐the‐art models such as PCA‐FELM, CTAA‐MPSO, FLS‐RE, LEACH, DCAIDS, WOA‐GA, and VOELA. The proposed model achieved an energy consumption of 4.31 J, network lifetime of 560.482 ms, and average intrusion detection latency of 0.12 s, respectively. The proposed model outperforms than existing random and connectivity‐based leader election methods that is evaluated by taking main consideration of energy efficiency and network survivability. This research contributes to the field by introducing a robust algorithm for leader election in MANET‐based IDS, addressing challenges posed by network dynamics and resource constraints. The CBGWO‐based approach showcases its potential to achieve effective leader election and efficient resource allocation, thereby enhancing the security and sustainability of MANETs.

show abstract

Section: Leader Election Algorithmsmentioning

confidence: 99%