[Paper Review] Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks

Mohammad H. Al Shayeji, Abdulrahman R. Alazmi -+2 more|arXiv (Cornell University)|Oct 5, 2012

Mobile Ad Hoc Networks22 references3 citations

TL;DR

This paper analyzes four leader election algorithms in Mobile Ad Hoc Networks (MANETs), proposing enhancements that reduce election overhead by enabling recovered nodes to query the current leader and using candidate lists during elections. It introduces MANET-specific criteria like battery life and signal strength, demonstrating improved efficiency and fault tolerance in dynamic, decentralized environments.

ABSTRACT

Mobile Ad Hoc networks (MANET), distinct from traditional distributed systems, are dynamic and self-organizing networks. MANET requires a leader to coordinate and organize tasks. The challenge is to have the right election algorithm that chooses the right leader based on various factors in MANET. In this paper, we analyze four leader election algorithms used in mobile Ad Hoc Networks. Factors considered in our analysis are time complexity, message complexity, assumptions considered, fault tolerance and timing model. Our proposed enhancements include recovered nodes inquiring about the current leader and the use of candidates during election to reduce the overhead of starting a new election session. In addition, better election criteria specific to MANET, such as battery life and signal strength, are proposed. Our evaluation and discussion shows that the proposed enhancements are effective. The analysis can be used as a reference for system designers in choosing the right election algorithm for MANET.

Motivation & Objective

• To evaluate existing leader election algorithms in Mobile Ad Hoc Networks (MANETs) based on key system metrics such as time and message complexity.
• To identify limitations in current algorithms related to dynamic topology, node mobility, and fault tolerance in MANETs.
• To propose enhancements that reduce election overhead by allowing recovered nodes to rejoin without restarting elections.
• To introduce MANET-specific election criteria such as battery level and signal strength for selecting more suitable leaders.
• To provide a reference framework for system designers to select or adapt leader election algorithms based on network constraints and requirements.

Proposed method

• Analyzes four existing leader election algorithms in MANETs using criteria including time complexity, message complexity, fault tolerance, timing model, and assumptions.
• Proposes a mechanism where recovered nodes (after failure or disconnection) can inquire about the current leader before initiating a new election.
• Introduces the use of candidate lists during elections to avoid redundant election sessions and reduce message overhead.
• Incorporates MANET-specific metrics—battery life and signal strength—into the leader selection process to improve network stability and longevity.
• Evaluates the proposed enhancements through qualitative analysis and discussion, comparing performance across key metrics.
• Uses a comparative framework to assess algorithm behavior under dynamic network conditions, emphasizing resilience and efficiency.

Experimental results

Research questions

• RQ1 How do existing leader election algorithms in MANETs perform under dynamic and unreliable network conditions in terms of time and message complexity?
• RQ2 What are the key limitations of current leader election mechanisms in handling node mobility, failures, and recovery in MANETs?
• RQ3 How can the overhead of restarting elections after node recovery be minimized in MANETs?
• RQ4 To what extent can incorporating MANET-specific metrics like battery level and signal strength improve leader election outcomes?
• RQ5 What design principles can guide the selection or enhancement of leader election algorithms for MANETs based on system requirements?

Key findings

• The proposed mechanism for recovered nodes to query the current leader significantly reduces redundant election sessions and message overhead.
• The use of candidate lists during elections decreases the likelihood of repeated election initiation, improving scalability and efficiency.
• Incorporating metrics such as battery life and signal strength into leader selection leads to more stable and energy-efficient network operation.
• The enhanced algorithms demonstrate improved fault tolerance and adaptability in dynamic MANET environments compared to baseline approaches.
• The analysis provides a comprehensive reference for system designers to evaluate and select leader election algorithms based on specific network constraints.
• The evaluation confirms that the proposed enhancements are effective in reducing operational overhead while maintaining robustness in mobile, decentralized networks.