LOGO: A new distributed leader election algorithm in WSNs with low energy consumption

Ahcène Bounceur; Madani Bezoui; Umber Noreen; Reinhardt Euler; Farid Lalem; Mohammad Hammoudeh; Sohail Jabbar

doi:10.1007/978-3-319-73712-6_1

LOGO: A new distributed leader election algorithm in WSNs with low energy consumption

Ahcène Bounceur^*, Madani Bezoui, Umber Noreen, Reinhardt Euler, Farid Lalem, Mohammad Hammoudeh, Sohail Jabbar

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

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.

Original language	English
Title of host publication	Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings
Editors	Zuber Patel, Shilpi Gupta
Publisher	Springer Verlag
Pages	1-16
Number of pages	16
ISBN (Print)	9783319737119
DOIs	https://doi.org/10.1007/978-3-319-73712-6_1
State	Published - 2018
Externally published	Yes

Publication series

Name	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume	220 LNICST
ISSN (Print)	1867-8211

Bibliographical note

Publisher Copyright:
© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018.

Keywords

Distributed algorithms
Leader election
Wireless sensor network

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1007/978-3-319-73712-6_1

Cite this

Bounceur, A., Bezoui, M., Noreen, U., Euler, R., Lalem, F., Hammoudeh, M., & Jabbar, S. (2018). LOGO: A new distributed leader election algorithm in WSNs with low energy consumption. In Z. Patel, & S. Gupta (Eds.), Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings (pp. 1-16). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 220 LNICST). Springer Verlag. https://doi.org/10.1007/978-3-319-73712-6_1

Bounceur, Ahcène ; Bezoui, Madani ; Noreen, Umber et al. / LOGO : A new distributed leader election algorithm in WSNs with low energy consumption. Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings. editor / Zuber Patel ; Shilpi Gupta. Springer Verlag, 2018. pp. 1-16 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST).

@inproceedings{f51658e3ceaa476cb46c49ac9130e579,

title = "LOGO: A new distributed leader election algorithm in WSNs with low energy consumption",

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.",

keywords = "Distributed algorithms, Leader election, Wireless sensor network",

author = "Ahc{\`e}ne Bounceur and Madani Bezoui and Umber Noreen and Reinhardt Euler and Farid Lalem and Mohammad Hammoudeh and Sohail Jabbar",

note = "Publisher Copyright: {\textcopyright} ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018.",

year = "2018",

doi = "10.1007/978-3-319-73712-6\_1",

language = "English",

isbn = "9783319737119",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",

publisher = "Springer Verlag",

pages = "1--16",

editor = "Zuber Patel and Shilpi Gupta",

booktitle = "Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings",

address = "Germany",

}

Bounceur, A, Bezoui, M, Noreen, U, Euler, R, Lalem, F, Hammoudeh, M & Jabbar, S 2018, LOGO: A new distributed leader election algorithm in WSNs with low energy consumption. in Z Patel & S Gupta (eds), Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 220 LNICST, Springer Verlag, pp. 1-16. https://doi.org/10.1007/978-3-319-73712-6_1

LOGO: A new distributed leader election algorithm in WSNs with low energy consumption. / Bounceur, Ahcène; Bezoui, Madani; Noreen, Umber et al.
Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings. ed. / Zuber Patel; Shilpi Gupta. Springer Verlag, 2018. p. 1-16 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 220 LNICST).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - LOGO

T2 - A new distributed leader election algorithm in WSNs with low energy consumption

AU - Bounceur, Ahcène

AU - Bezoui, Madani

AU - Noreen, Umber

AU - Euler, Reinhardt

AU - Lalem, Farid

AU - Hammoudeh, Mohammad

AU - Jabbar, Sohail

N1 - Publisher Copyright: © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018.

PY - 2018

Y1 - 2018

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

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

KW - Distributed algorithms

KW - Leader election

KW - Wireless sensor network

UR - https://www.scopus.com/pages/publications/85045211619

U2 - 10.1007/978-3-319-73712-6_1

DO - 10.1007/978-3-319-73712-6_1

M3 - Conference contribution

AN - SCOPUS:85045211619

SN - 9783319737119

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SP - 1

EP - 16

BT - Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings

A2 - Patel, Zuber

A2 - Gupta, Shilpi

PB - Springer Verlag

ER -

Bounceur A, Bezoui M, Noreen U, Euler R, Lalem F, Hammoudeh M et al. LOGO: A new distributed leader election algorithm in WSNs with low energy consumption. In Patel Z, Gupta S, editors, Future Internet Technologies and Trends - 1st International Conference, ICFITT 2017, Proceedings. Springer Verlag. 2018. p. 1-16. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). doi: 10.1007/978-3-319-73712-6_1

LOGO: A new distributed leader election algorithm in WSNs with low energy consumption

Abstract

Publication series

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this