Skip to Main content Skip to Navigation
Conference papers

A Revised BROGO Algorithm for Leader Election in Wireless Sensor and IoT Networks

Ahcène Bounceur 1 Madani Bezoui 2 Reinhardt Euler 3 Farid Lalem Massinissa Lounis 4
1 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
3 Lab-STICC_UBO_CID_DECIDE
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
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.
Complete list of metadatas

https://hal.univ-brest.fr/hal-01574227
Contributor : Ahcène Bounceur <>
Submitted on : Saturday, August 12, 2017 - 9:48:41 AM
Last modification on : Wednesday, June 24, 2020 - 4:19:36 PM

Identifiers

  • HAL Id : hal-01574227, version 1

Citation

Ahcène Bounceur, Madani Bezoui, Reinhardt Euler, Farid Lalem, Massinissa Lounis. A Revised BROGO Algorithm for Leader Election in Wireless Sensor and IoT Networks. IEEE Sensors 2017, Oct 2017, Glasgow, United Kingdom. ⟨hal-01574227⟩

Share

Metrics

Record views

294