Performance analysis of Leader Election Algorithms in Mobile Ad hoc Networks
نویسندگان
چکیده
Leader election is an extensively studied problem in Ad hoc networks. In our study, we have implemented an extended idea of an existing leader election algorithm for energy saving to arbitrary topological changes. In this method, our focus is to reduce the number of leader election processes; to make it more energy efficient. Unlike the previous solutions, the algorithm proposes that each node maintains a list of candidates to minimize the total number of leader elections. Simulation results show that this leader election algorithm using candidates has much fewer leader elections and generates lower messages than the existing leader election algorithm.
منابع مشابه
Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks
Mobile Ad Hoc networks (MANET), distinct from traditional distributed systems, are dynamic and selforganizing 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 co...
متن کاملDesign and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. Existing solutions to leader election do not handle frequent topology changes and dynamic nature of mobile networks. In this paper, we present a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for u...
متن کاملAn Election Algorithm to Ensure the High Availability of Leader in Large Mobile Ad Hoc Networks∗
A fundamental problem of distributed systems, leader election, is presented in the context of mobile ad hoc networks (MANETs). In many distributed systems, the presence of a leader is necessary in order to monitor underlying computations, guarantee quality functioning, take checkpoints, generate the lost token, detect quiescence conditions, etc. Hence, several leader election algorithms have be...
متن کاملTWO ALGORITHMS FOR LEADER ELECTION AND NETWORK SIZE ESTIMATION IN MOBILE AD HOC NETWORKS A Thesis by NICHOLAS
Two Algorithms for Leader Election and Network Size Estimation in Mobile Ad Hoc Networks. (December 2004) Nicholas Gerard Neumann, B.S., Texas A&M University Chair of Advisory Committee: Dr. Jennifer Welch We develop two algorithms for important problems in mobile ad hoc networks (MANETs). A MANET is a collection of mobile processors (“nodes”) which communicate via message passing over wireless...
متن کاملA Modified Leader Election Algorithm for MANET
Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...
متن کامل