Improvement of DV-Hop Localization Algorithm in Multi-hop Wireless Sensor Networks
- Others:
- Research Laboratory of Automatic, Signal Processing and Image (LARATSI) ; École Nationale d'Ingénieurs de Monastir (ENIM) ; Université de Monastir - University of Monastir (UM)-Université de Monastir - University of Monastir (UM)
- Laboratoire d'Electronique, Antennes et Télécommunications (LEAT) ; Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)
- IEEE
Description
Localization in wireless sensor networks is used to track and analyze information sensed by nodes. Localization techniques typically estimate node position based on a set of sensor nodes, denoted as anchors, that are aware of theirgeographic positions. Many localization algorithms are proposed in the literature, mainly using the Distance Vector Hop algorithms (DV-Hop) and its many improvements. In this paper, we propose an optimized method to compute the average distance of hops between sensor nodes, namely the HopSize. This approach is an improvement of the DV-Hop algorithm as it allows estimating with accuracy the position of nodes in the network. We focus on range-free localization algorithms in homogeneous multihop wireless sensor networks. Simulation results show that our approach significantly reduces the average error of nodes estimated positions compared with the original DV-Hop as well as an improved localization algorithm from the literature.
Abstract
International audience
Additional details
- URL
- https://hal.archives-ouvertes.fr/hal-02115365
- URN
- urn:oai:HAL:hal-02115365v1
- Origin repository
- UNICA