A leader election algorithm within candidates on ad hoc mobile networks

Abstract

Leader election is an extensively studied problem in Ad hoc networks. In our study, an extended idea of leader election algorithms for energy saving on arbitrary changing topological environment is derived. Our focus is to reduce the number of leader election processes, to make it more energy efficient. The proposed algorithm shows that each node maintains a list of candidates to minimize the total number of leader elections. Simulation results show that the leader election algorithm using candidates has less leader elections process and generates less message than those of the existing leader election algorithms. © Springer-Verlag Berlin Heidelberg 2007.