A New Leader Election Algorithm based on the WBS Algorithm Dedicated to Smart-cities

Abstract

One of the interesting techniques for leader election is used in the WBS (Wait Before Starting) algorithm, in which each node in the network will wait for a time corresponding to its value before starting to send the first message to neighbours. This means that the node with the smallest value becomes the leader and it also starts first. This approach is impracticable in the case of real values (case of GPS-coordinates). Also, if the values are very large, the waiting time becomes too long. In this paper, we propose a fast, fault-tolerant and low energy leader election algorithm dedicated to smart-cities, which is based on the technique of waiting before starting, with minimum complexity and in which every node sends one and only one message. Here, the leader is the node with the smallest x-coordinate and the total of sent and received messages is used to represent the global consumption in the network. We give a detailed description of the algorithm, prove its accuracy, discuss its complexity in terms of exchanged messages and evaluate its performance using the CupCarbon simulator. We show that our algorithm is well balanced in terms of energy consumption, it is efficient and adapts well to the increase of the nodes number in the network.