Proceedings ArticleDOI
A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT
Ahcène Bounceur,Madani Bezoui,Reinhardt Euler,Farid Lalem +3 more
- pp 1-3
Reads0
Chats0
TLDR
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, is proposed.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.read more
Citations
More filters
Journal ArticleDOI
A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure
Nabil Kadjouh,Ahcène Bounceur,Ahcène Bounceur,Madani Bezoui,Mohamed Essaid Khanouche,Reinhardt Euler,Reinhardt Euler,Mohammad Hammoudeh,Loïc Lagadec,Sohail Jabbar,Fadi Al-Turjman +10 more
TL;DR: A new algorithm called DoTRo is presented, which is low energy consuming with reduction rates that can exceed 85% with respect to the classical minium finding algorithm and is efficient and fault-tolerant since it works even in the presence of node failures and communication disconnectivity.
Proceedings ArticleDOI
A revised BROGO algorithm for leader election in wireless sensor and IoT networks
TL;DR: This paper proposes a revised version of the BROGO algorithm in which the non-faulty node with the smallest identifier is considered as a root, using the Wait-Before-Starting (WBS) concept, which guarantees a maximum of reliability and quality of service.
Posted Content
Leader Election in the Internet of Things: Challenges and Opportunities.
TL;DR: The most significant work performed in this direction in Ad hoc networks is surveyed, the challenges highlighted and possible extensions proposed are highlighted.
Proceedings ArticleDOI
A new algorithm for finding a dominating set in wireless sensor and IoT networks based on the wait-before-starting concept
TL;DR: This work proposes a new distributed algorithm for the search of the nodes forming a dominating set in a wireless sensor network, which uses a new concept called Wait-Before-Starting that allows to each dominating node to declare itself according to the number of its neighbors.
References
More filters
Journal ArticleDOI
Elections in a Distributed Computing System
TL;DR: This paper discusses elections and reorganizations of active nodes in a distributed computing system after a failure, and two types of reasonable failure environments are studied.
Book
Design and Analysis of Distributed Algorithms
TL;DR: The aim of this monograph is to provide a history of distributed computing in the context of elections, as well as some of the techniques used to design and implement these networks.
Proceedings ArticleDOI
CupCarbon: a multi-agent and discrete event wireless sensor network design and simulation tool
TL;DR: The first version of a Wireless Sensor Network simulator, called CupCarbon, is presented, which can help trainers to explain the basic concepts and how sensor networks work and it can help scientists to test their wireless topologies, protocols, etc.
Journal ArticleDOI
Design and analysis of dynamic leader election protocols in broadcast networks
TL;DR: In this paper, a leader election protocol in a dynamic context is presented. But the protocol is not considered in this paper, it is assumed that a leader is present in the initial design process and the assumption of an initial leader is dropped.
Proceedings ArticleDOI
A leader election algorithm in a distributed computing system
TL;DR: A leader election algorithm based on the performance and the operation rate of nodes and links and the pre-election algorithm that elects a provisional leader while the leader is executing is introduced.