%0 Book Section
%T DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks
%+ Lab-STICC_UBS_CACS_MOCS
%+ Université M'Hamed Bougara Boumerdes (UMBB)
%+ Lab-STICC_ENSTAB_ CACS_MOCS
%+ Lab-STICC_UBO_CID_DECIDE
%+ Université d'El-Oued
%+ School of Computing, Mathematics and Digital Technology [Manchester] (Manchester Metropolitan University)
%A Bounceur, Ahcène
%A Bezoui, Madani
%A Lagadec, Loïc
%A Euler, Reinhardt
%A Laouid, Abdelkader
%A Hammoudeh, Mohammad
%@ 978-3-030-03100-8
%B Mobile, Secure, and Programmable Networking. MSPN 2018
%E Renault É.
%E Boumerdassi S.
%E Bouzefrane S. (eds)
%I Springer, Cham
%S Lecture Notes in Computer Science
%V 11005
%P 42-53
%8 2019-01-13
%D 2019
%R 10.1007/978-3-030-03101-5_5
%K Wireless Sensor Network
%K IoT
%K Leader election
%K Distributed algorithms
%K Dominating Tree Routing
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Book sections
%X A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to generate keys for encryption/decryption, to find a node with minimum energy or situated in an extreme part of the network. In our work, we need as a leader the node situated on the extreme left of the network to start the process of finding its boundary nodes. These nodes will be used to monitor any sensitive, dangerous or non-accessible site. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.
%G English
%2 https://hal.univ-brest.fr/hal-02501870/document
%2 https://hal.univ-brest.fr/hal-02501870/file/dotro_bounceur.pdf
%L hal-02501870
%U https://hal.univ-brest.fr/hal-02501870
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ ENSTA-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENSTA-BRETAGNE-STIC
%~ LAB-STICC_UBO
%~ UBS
%~ LAB-STICC_UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ IBNM
%~ INSTITUTS-TELECOM
%~ SILECS
%~ FIT
%~ TEST3-HALCNRS