An improved DV-Hop localisation algorithm
by Qin-Shan Zhao; Yu-Lan Hu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 1, 2016

Abstract: DV-Hop localisation algorithm is a kind of the localisation algorithms without ranging and simple process. However, when the distribution of sensor nodes is uneven or irregular, the algorithm's precision is lower. Aiming at the shortcomings of the DV-Hop localisation algorithm, this paper proposes an improved DV-Hop localisation algorithm. This algorithm calculates the hop size by the average of the maximum and minimum hop size that the traditional algorithm computed. In addition, we use BFO algorithm to solve node coordinates, in order to improve the algorithm convergence and avoid the algorithm falling into local optimum. The simulation experiment shows that the proposed algorithm can reduce the positioning error of the algorithm under the network environment of the node sparse and irregular distribution. At the same time, this algorithm can improve the convergence of the algorithm.

Online publication date: Tue, 08-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email