Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks

Ahcène Bounceur 1, 2 Madani Bezoui 3 Loïc Lagadec 4 Reinhardt Euler 5 Abdelkader Laouid 6 Mohammad Hammoudeh 7
2 Lab-STICC_UBO_CACS_MOCS
IBNM - Institut Brestois du Numérique et des Mathématiques, Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
4 Lab-STICC_ENSTAB_ CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
5 Lab-STICC_UBO_CID_DECIDE
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : 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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.univ-brest.fr/hal-01829251
Contributeur : Ahcène Bounceur <>
Soumis le : samedi 14 mars 2020 - 19:18:31
Dernière modification le : mercredi 24 juin 2020 - 16:19:56
Archivage à long terme le : : lundi 15 juin 2020 - 12:56:47

Fichier

dotro_bounceur.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01829251, version 1

Citation

Ahcène Bounceur, Madani Bezoui, Loïc Lagadec, Reinhardt Euler, Abdelkader Laouid, et al.. DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks. 4th International Conference on Mobile, Secure and Programmable Networking (MSPN 2018), Jun 2018, Paris, France. pp.42-53. ⟨hal-01829251⟩

Partager

Métriques

Consultations de la notice

290

Téléchargements de fichiers

81