Have a personal or library account? Click to login
An Improved DV-Hop Localization Algorithm Based on Bat Algorithm Cover

An Improved DV-Hop Localization Algorithm Based on Bat Algorithm

By: Xiaoying Yang and  Wanli Zhang  
Open Access
|Apr 2016

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.

DOI: https://doi.org/10.1515/cait-2016-0007 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 89 - 98
Published on: Apr 9, 2016
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2016 Xiaoying Yang, Wanli Zhang, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.