Abstract
The Distance Vector-Hop (DV-Hop) algorithm is a well-known technique for wireless sensor networks node location due to its robustness, simplicity and cost effectiveness. Therefore scientists are still searching for its improvement. Aiming at optimizing the localization accuracy in traditional DV-Hop algorithm, we propose a novel improved recursive DV-Hop localization algorithm in this paper. Our research focuses on range-free localization algorithm in homogeneous multi-hop wireless sensor networks. The proposed algorithm is based on a recursive position calculation of unknown nodes. It also focuses on second and third step of DV-Hop algorithm. We aim to use an optimized formulation to calculate the average hop-size of anchor nodes aiming to minimize the localization error in the estimated distance between anchor and unknown node, thus achieving better localization accuracy. Simulation results prove the performance of our proposed algorithm comparing with DV-Hop algorithm and DV-Hop based algorithms in different deployment scenarios.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
