A New Algorithm for Finding a Dominating Set in Wireless Sensor and IoT Networks Based on the Wait-Before-Starting Concept

Abstract : Finding a dominating set in a Wireless Sensor Network can be used for the clustering or the routing. There is an abundant literature on methods, centralized or distributed, for detecting these sets. In this work, we propose 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. The proposed method guarantees the generation of a dominating set with low energy consumption.
Type de document :
Communication dans un congrès
IEEE Sensors 2017, Oct 2017, Glasgow, United Kingdom. IEEE Sensors 2017. 〈http://ieee-sensors2017.org〉
Liste complète des métadonnées

http://hal.univ-brest.fr/hal-01574226
Contributeur : Ahcène Bounceur <>
Soumis le : samedi 12 août 2017 - 09:43:37
Dernière modification le : mardi 16 janvier 2018 - 15:54:24

Identifiants

  • HAL Id : hal-01574226, version 1

Citation

Madani Bezoui, Ahcène Bounceur, Reinhardt Euler, Farid Lalem, Laouid Abdelkader. A New Algorithm for Finding a Dominating Set in Wireless Sensor and IoT Networks Based on the Wait-Before-Starting Concept. IEEE Sensors 2017, Oct 2017, Glasgow, United Kingdom. IEEE Sensors 2017. 〈http://ieee-sensors2017.org〉. 〈hal-01574226〉

Partager

Métriques

Consultations de la notice

107