Abstract
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.