Abstract
In this paper, we proposed an improved DV-Hop localization using runner-root algorithm to overcome the existing disadvantage of traditional DV-Hop. In proposed algorithm, we have introduced a correction factor in order to modify the hop size of the anchor nodes. The proposed algorithm lessens the communication between unknown and anchor nodes by calculating hop size of all anchors at unknown nodes. To show the applicability of proposed algorithm in anisotropic network, radio irregularity model is also considered. Simulations have been carried out on MATLAB, and comparison is made for our proposed algorithm with traditional DV-Hop, genetic algorithm-based DV-Hop and particle swarm optimization-based DV-Hop. Simulation results confirm that our proposed localization algorithm minimizes the localization error, localization error variance and computational time in comparison with existing localization techniques.
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.
