Research Article
LOGO: A New Distributed Leader Election Algorithm in WSNs with Low Energy Consumption
@INPROCEEDINGS{10.1007/978-3-319-73712-6_1, author={Ahc\'{e}ne Bounceur and Madani Bezoui and Umber Noreen and Reinhardt Euler and Farid Lalem and Mohammad Hammoudeh and Sohail Jabbar}, title={LOGO: A New Distributed Leader Election Algorithm in WSNs with Low Energy Consumption}, proceedings={Future Internet Technologies and Trends. First International Conference, ICFITT 2017, Surat, India, August 31 - September 2, 2017, Proceedings}, proceedings_a={ICFITT}, year={2018}, month={2}, keywords={Wireless sensor network Leader election Distributed algorithms}, doi={10.1007/978-3-319-73712-6_1} }- Ahcène Bounceur
Madani Bezoui
Umber Noreen
Reinhardt Euler
Farid Lalem
Mohammad Hammoudeh
Sohail Jabbar
Year: 2018
LOGO: A New Distributed Leader Election Algorithm in WSNs with Low Energy Consumption
ICFITT
Springer
DOI: 10.1007/978-3-319-73712-6_1
Abstract
The Leader Election Algorithm is used to select a specific node in distributed systems. In the case of Wireless Sensor Networks, this node can be the one having the maximum energy, the one situated on the extreme left in a given area or the one having the maximum identifier. A node situated on the extreme left, for instance, can be used to find the boundary nodes of a network embedded in the plane. The classical algorithm allowing to find such a node is called the Minimum Finding Algorithm. In this algorithm, each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not reliable since it may be subject to an important number of collisions and lost messages. In this paper, we propose a new algorithm called LOGO (Local Optima to Global Optimum) where some local leaders will send a message to a given node, which will designate the global leader. This process is more reliable since broadcast messages are sent only twice by each node, and the other communications are based on a direct sending. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 95% compared with the classical Minimum Finding Algorithm.
