A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT

Ahcene Bounceur; Madani Bezoui; Reinhardt Euler; Farid Lalem

doi:10.1109/ICSENS.2017.8234162

A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT

Ahcene Bounceur, Madani Bezoui, Reinhardt Euler, Farid Lalem

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

13 Scopus citations

Abstract

Many of the existing Leader Election algorithms don't deal with energy consumption and fault tolerance since they are not mainly dedicated to autonomous systems like wireless sensor and IoT networks. It is possible to use the classical Minimum Finding (MinFind) algorithm, where each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not realistic since it may be subject to an important number of collisions. In this paper, we propose a new algorithm called WBS (Wait-BeforeStarting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program. This time lapse depends on the node's value so that the leader will be the one which will wait the least. In this case, the leader will be the first one which will start by sending a message to all the nodes of the network to inform them that it is the leader. Then, the other nodes will start the execution of their programs. Otherwise, if the leader fails, another node will do the same. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 96% compared with the classical MinFind Algorithm.

Original language	English
Title of host publication	IEEE SENSORS 2017 - Conference Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1-3
Number of pages	3
ISBN (Electronic)	9781509010127
DOIs	https://doi.org/10.1109/ICSENS.2017.8234162
State	Published - 21 Dec 2017
Externally published	Yes
Event	16th IEEE SENSORS Conference, ICSENS 2017 - Glasgow, United Kingdom Duration: 30 Oct 2017 → 1 Nov 2017

Publication series

Name	Proceedings of IEEE Sensors
Volume	2017-December
ISSN (Print)	1930-0395
ISSN (Electronic)	2168-9229

Conference

Conference	16th IEEE SENSORS Conference, ICSENS 2017
Country/Territory	United Kingdom
City	Glasgow
Period	30/10/17 → 1/11/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

ASJC Scopus subject areas

Electrical and Electronic Engineering

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/ICSENS.2017.8234162

Cite this

Bounceur, A., Bezoui, M., Euler, R., & Lalem, F. (2017). A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT. In IEEE SENSORS 2017 - Conference Proceedings (pp. 1-3). (Proceedings of IEEE Sensors; Vol. 2017-December). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICSENS.2017.8234162

@inproceedings{9aa3e61a7084435ebb5853e24f107309,

title = "A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT",

abstract = "Many of the existing Leader Election algorithms don't deal with energy consumption and fault tolerance since they are not mainly dedicated to autonomous systems like wireless sensor and IoT networks. It is possible to use the classical Minimum Finding (MinFind) algorithm, where each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not realistic since it may be subject to an important number of collisions. In this paper, we propose a new algorithm called WBS (Wait-BeforeStarting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program. This time lapse depends on the node's value so that the leader will be the one which will wait the least. In this case, the leader will be the first one which will start by sending a message to all the nodes of the network to inform them that it is the leader. Then, the other nodes will start the execution of their programs. Otherwise, if the leader fails, another node will do the same. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 96% compared with the classical MinFind Algorithm.",

author = "Ahcene Bounceur and Madani Bezoui and Reinhardt Euler and Farid Lalem",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 16th IEEE SENSORS Conference, ICSENS 2017 ; Conference date: 30-10-2017 Through 01-11-2017",

year = "2017",

month = dec,

day = "21",

doi = "10.1109/ICSENS.2017.8234162",

language = "English",

series = "Proceedings of IEEE Sensors",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1--3",

booktitle = "IEEE SENSORS 2017 - Conference Proceedings",

address = "United States",

}

Bounceur, A, Bezoui, M, Euler, R & Lalem, F 2017, A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT. in IEEE SENSORS 2017 - Conference Proceedings. Proceedings of IEEE Sensors, vol. 2017-December, Institute of Electrical and Electronics Engineers Inc., pp. 1-3, 16th IEEE SENSORS Conference, ICSENS 2017, Glasgow, United Kingdom, 30/10/17. https://doi.org/10.1109/ICSENS.2017.8234162

A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT. / Bounceur, Ahcene; Bezoui, Madani; Euler, Reinhardt et al.
IEEE SENSORS 2017 - Conference Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1-3 (Proceedings of IEEE Sensors; Vol. 2017-December).

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

TY - GEN

T1 - A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT

AU - Bounceur, Ahcene

AU - Bezoui, Madani

AU - Euler, Reinhardt

AU - Lalem, Farid

PY - 2017/12/21

Y1 - 2017/12/21

N2 - Many of the existing Leader Election algorithms don't deal with energy consumption and fault tolerance since they are not mainly dedicated to autonomous systems like wireless sensor and IoT networks. It is possible to use the classical Minimum Finding (MinFind) algorithm, where each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not realistic since it may be subject to an important number of collisions. In this paper, we propose a new algorithm called WBS (Wait-BeforeStarting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program. This time lapse depends on the node's value so that the leader will be the one which will wait the least. In this case, the leader will be the first one which will start by sending a message to all the nodes of the network to inform them that it is the leader. Then, the other nodes will start the execution of their programs. Otherwise, if the leader fails, another node will do the same. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 96% compared with the classical MinFind Algorithm.

AB - Many of the existing Leader Election algorithms don't deal with energy consumption and fault tolerance since they are not mainly dedicated to autonomous systems like wireless sensor and IoT networks. It is possible to use the classical Minimum Finding (MinFind) algorithm, where each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not realistic since it may be subject to an important number of collisions. In this paper, we propose a new algorithm called WBS (Wait-BeforeStarting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program. This time lapse depends on the node's value so that the leader will be the one which will wait the least. In this case, the leader will be the first one which will start by sending a message to all the nodes of the network to inform them that it is the leader. Then, the other nodes will start the execution of their programs. Otherwise, if the leader fails, another node will do the same. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 96% compared with the classical MinFind Algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85044335671&partnerID=8YFLogxK

U2 - 10.1109/ICSENS.2017.8234162

DO - 10.1109/ICSENS.2017.8234162

M3 - Conference contribution

AN - SCOPUS:85044335671

T3 - Proceedings of IEEE Sensors

SP - 1

EP - 3

BT - IEEE SENSORS 2017 - Conference Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 16th IEEE SENSORS Conference, ICSENS 2017

Y2 - 30 October 2017 through 1 November 2017

ER -

A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

UN SDGs

Access to Document

Fingerprint

Cite this