A revised BROGO algorithm for leader election in wireless sensor and IoT networks

Ahcene Bounceur; Madani Bezoui; Reinhardt Euler; Farid Lalem; Massinissa Lounis

doi:10.1109/ICSENS.2017.8234400

A revised BROGO algorithm for leader election in wireless sensor and IoT networks

Ahcene Bounceur
, Madani Bezoui
, Reinhardt Euler
, Farid Lalem
, Massinissa Lounis

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

10 Scopus citations

Abstract

The BROGO algorithm has been recently presented for Leader Election in Wireless Sensor and IoT Networks, where after finding a spanning tree of a network, each leaf will route a message through its branch to the root in order to determine the leader in that branch. The root will then elect the global leader among the received branch leaders. The main drawback of this algorithm is a possible failure of the root node before the beginning of the election process. In this paper, we propose a revised version of the BROGO algorithm in which the non-faulty node with the smallest identifier is considered as a root. This can be done using the Wait-Before-Starting (WBS) concept, which guarantees a maximum of reliability and quality of service. The obtained results show that this process has no impact on the initial energy consumption generated by the BROGO 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.8234400
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

Access to Document

10.1109/ICSENS.2017.8234400

Cite this

@inproceedings{50f930d63d8a43e188c643b117bb368d,

title = "A revised BROGO algorithm for leader election in wireless sensor and IoT networks",

abstract = "The BROGO algorithm has been recently presented for Leader Election in Wireless Sensor and IoT Networks, where after finding a spanning tree of a network, each leaf will route a message through its branch to the root in order to determine the leader in that branch. The root will then elect the global leader among the received branch leaders. The main drawback of this algorithm is a possible failure of the root node before the beginning of the election process. In this paper, we propose a revised version of the BROGO algorithm in which the non-faulty node with the smallest identifier is considered as a root. This can be done using the Wait-Before-Starting (WBS) concept, which guarantees a maximum of reliability and quality of service. The obtained results show that this process has no impact on the initial energy consumption generated by the BROGO algorithm.",

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

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

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 & Lounis, M 2017, A revised BROGO algorithm for leader election in wireless sensor and IoT networks. 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.8234400

A revised BROGO algorithm for leader election in wireless sensor and IoT networks. / 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 revised BROGO algorithm for leader election in wireless sensor and IoT networks

AU - Bounceur, Ahcene

AU - Bezoui, Madani

AU - Euler, Reinhardt

AU - Lalem, Farid

AU - Lounis, Massinissa

PY - 2017/12/21

Y1 - 2017/12/21

N2 - The BROGO algorithm has been recently presented for Leader Election in Wireless Sensor and IoT Networks, where after finding a spanning tree of a network, each leaf will route a message through its branch to the root in order to determine the leader in that branch. The root will then elect the global leader among the received branch leaders. The main drawback of this algorithm is a possible failure of the root node before the beginning of the election process. In this paper, we propose a revised version of the BROGO algorithm in which the non-faulty node with the smallest identifier is considered as a root. This can be done using the Wait-Before-Starting (WBS) concept, which guarantees a maximum of reliability and quality of service. The obtained results show that this process has no impact on the initial energy consumption generated by the BROGO algorithm.

AB - The BROGO algorithm has been recently presented for Leader Election in Wireless Sensor and IoT Networks, where after finding a spanning tree of a network, each leaf will route a message through its branch to the root in order to determine the leader in that branch. The root will then elect the global leader among the received branch leaders. The main drawback of this algorithm is a possible failure of the root node before the beginning of the election process. In this paper, we propose a revised version of the BROGO algorithm in which the non-faulty node with the smallest identifier is considered as a root. This can be done using the Wait-Before-Starting (WBS) concept, which guarantees a maximum of reliability and quality of service. The obtained results show that this process has no impact on the initial energy consumption generated by the BROGO algorithm.

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

U2 - 10.1109/ICSENS.2017.8234400

DO - 10.1109/ICSENS.2017.8234400

M3 - Conference contribution

AN - SCOPUS:85044295289

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 revised BROGO algorithm for leader election in wireless sensor and IoT networks

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this