Refining hop-count for localisation in wireless sensor networks
by Xiaojun Zhu; Xiaobing Wu; Guihai Chen
International Journal of Sensor Networks (IJSNET), Vol. 12, No. 4, 2012

Abstract: Distance estimation is a crucial component in localisation for wireless sensor networks. Among the estimation methods, hop-count is widely used in situations where only connectivity information is available. However, hop-count is integer-valued, implying crude distance estimation. In this paper, we refine hop-count to achieve better distance estimation. This is done by estimating neighbour distance and then approximating non-neighbour distance by the length of the shortest path. To estimate neighbour distance, we propose three estimators and show that they have negligible bias. We also show that the variance of the estimators is related to node density. The final refined hop-counts are further studied by simulations. Results verify the improvement on distance estimation and show that existing localisation methods can benefit from the improvement in various scenarios.

Online publication date: Sun, 20-Jan-2013

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 Sensor Networks (IJSNET):
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