Year-end Sale % OFF 
Abstract
Abstract In the DV-Hop algorithm, the average distance per hop is one of the factors that affect the accuracy of the positioning. In this paper, an improved DV-Hop localization algorithm based on bat algorithm (BAD-Hop) is proposed to solve the error which is brought by the average distance per hop. In BAD-Hop algorithm, bat algorithm which is a kind of intelligent optimization algorithm with good performance is introduced into DV-Hop localization algorithm to calculate average distance per hop of anchor nodes. Firstly, the average distance per hop of anchor node is calculated by using bat algorithm, which makes it closer to the actual value. Then the average distance per hop of the unknown node is weighted by using the average distance per hop of anchor nodes which hop-count is less than or equal to 3 to reduce errors caused by average distance per hop. Simulation results show that the improved algorithm can effectively reduce the positioning error without additional hardware.
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.
