An energy efficient 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. In this paper, we propose a solution based on the omega failures detector. The algorithm is highly adaptive with ad hoc networks in the sense that it can tolerate intermittent failures, such as link failures, sudden crash or recovery of mobile nodes, network partitions, and merging of connected network components associated with ad hoc networks. In addition, the algorithm reduces the number of exchanged messages to make it energy efficient. The paper also presents proofs of correctness to exhibit the fairness of this algorithm.