Node Ranking in Wireless Sensor Networks with Linear Topology

Rodrigue Domga Komguem (1, 2) , Razvan Stanica (2, 3) , Maurice Tchuente (1) , Fabrice Valois (2, 3)

1 LIRIMA - Laboratoire International de Recherche en Informatique et Mathématiques Appliquées
2 AGORA - ALGorithmes et Optimisation pour Réseaux Autonomes
3 CITI - CITI Centre of Innovation in Telecommunications and Integration of services

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

Mots clés: Self-Configuration; Nodes ranking; Linear Wireless Sensor Networks; Centroid-Based Localization

Domaines: Réseaux et télécommunications [cs.NI]

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