Abstract

Wireless sensor network (WSN) possesses very broad application prospect in many fields, where the node location technology is one of the key technologies of WSN. Distance vector hop (DV-Hop) localization algorithm is a widely used algorithm in this technology, and it uses routing exchange protocol to make unknown nodes obtain beacon node information which will be used for coordinate calculation, therefore there exists certain error for the algorithm itself. Aiming at the disadvantage of large error existing in the traditional wireless sensor network location algorithm based on DV-Hop, an improved DV-Hop algorithm based on hop thinning and distance correction is proposed. The minimum hop is corrected by introducing received signal strength indication (RSSI) ranging technology, and the average hop distance is corrected by weighted average value of hop distance error and estimated distance error. Subsequently, the overall improvement on the location performance of the Hop-DV location algorithm is realized, and the location error is reduced. Under the Matlab simulation environment, the simulation experiment on the improved algorithm is carried out. The experimental results show that the improved algorithm reduces the location error and has higher location accuracy.

Highlights

  • Wireless sensor network (WSN) is a self-organizing network composed of a large number of sensor nodes, which presents a high intersection degree between multiple disciplines and can be used in many harsh and unsuitable environments for human work [1]

  • Aiming at the disadvantage of large error existing in the traditional wireless sensor network location algorithm based on Distance vector hop (DV-Hop), this paper proposes an improved DV-Hop algorithm based on hop thinning and distance correction

  • The minimum hop is corrected by introducing received signal strength indication (RSSI) ranging technology, and the average hop distance is corrected by weighted average value of hop distance error and estimated distance error

Read more

Summary

Introduction

Wireless sensor network (WSN) is a self-organizing network composed of a large number of sensor nodes, which presents a high intersection degree between multiple disciplines and can be used in many harsh and unsuitable environments for human work [1]. As a location algorithm without measuring distance, distance vector hop (DV-Hop) algorithm was proposed by Niculescu D et al The algorithm uses routing exchange protocol to make unknown nodes obtain beacon node information which will be used to calculate their own coordinates. Reference [9] proposed that the average of the maximum and minimum hop distance of beacon nodes could be used as the average hop distance of the nodes to be located, which effectively improved the positioning accuracy. [10], an improved algorithm for re-estimation of beacon node position was proposed This algorithm used DV-Hop to re-estimate beacon node position to obtain error, and used the optimal algorithm to find the optimal value of hop distance to improve the positioning accuracy. The overall improvement on the location performance of the HopDV location algorithm is realized, and the location error is reduced

Principle and error analysis of traditional DVHop location algorithm
Determining the distance between unknown nodes and beacon nodes
Determining the coordinates of unknown nodes
The error of hop value
The error of average hop distance
The calculation error of node position
Grading the first hop
Weighting the hop value
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.