An improved DV-Hop algorithm based on distance optimisation for WSNs
by Fei Tang; Sanfeng Chen; Guangming Lin
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 17, No. 2, 2019

Abstract: To improve the localisation accuracy for unknown nodes within a one-hop distance of an anchor node, this paper analysis the main reason that results in localisation error of DDV-Hop localisation algorithm, which is the estimation of the number of hops between nodes. The localisation algorithm based on distance optimisation is proposed. Jaccard coefficient is conducive to reduce the estimation error on the number of hops to an unknown node at a one-hop distance, and the difference error coefficient of the DDV-Hop algorithm is used to reduce the error accumulated when calculating the average hop distance to correct the average hop distance between nodes. A credibility factor is introduced to select the anchor node for localisation, which can calculate the locations of nodes. The node with the highest localisation accuracy is used as a new anchor node. Simulation results show that under the same conditions, the improved algorithm has a higher localisation accuracy than both the DDV-Hop algorithm and DV-Hop algorithm. The algorithm proposed in this paper is of great significance to the localisation performance of wireless sensor networks.

Online publication date: Wed, 07-Aug-2019

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 subs@inderscience.com