Node Ranking in Wireless Sensor Networks with Linear Topology

Abstract : In wireless sensor networks with linear topology, knowing the physical order in which nodes are deployed is useful not only for the target application, but also to some network services, like routing or data aggregation. Considering the limited resources of sensor nodes, the design of autonomous protocols to find this order is a challenging topic. In this paper, we propose a distributed and iterative centroid-based algorithm to address this problem. At each iteration, the algorithm selects two virtual anchors and finds the order of a subset of nodes, placed between these two anchors. The proposed algorithm requires local node connectivity knowledge and the identifier of the first sensor node of the network, which is the only manually configured parameter. This solution, scalable and lightweight from the deployment and maintenance point of view, is shown to be robust to connectivity degradation, correctly ordering more than 95% of the nodes, even under very low connectivity conditions
Type de document :
Communication dans un congrès
Wireless Days 2017, Mar 2017, Porto, Portugal. WD 2017 - 9th IFIP Wireless Days
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01466468
Contributeur : Rodrigue Domga Komguem <>
Soumis le : lundi 13 février 2017 - 15:53:34
Dernière modification le : vendredi 15 septembre 2017 - 01:06:40
Document(s) archivé(s) le : dimanche 14 mai 2017 - 14:56:32

Fichier

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

Identifiants

  • HAL Id : hal-01466468, version 1

Collections

Citation

Rodrigue Domga Komguem, Razvan Stanica, Maurice Tchuente, Fabrice Valois. Node Ranking in Wireless Sensor Networks with Linear Topology. Wireless Days 2017, Mar 2017, Porto, Portugal. WD 2017 - 9th IFIP Wireless Days. 〈hal-01466468〉

Partager

Métriques

Consultations de la notice

168

Téléchargements de fichiers

73