Refining hop-count for localisation in wireless sensor networks

Authors:
Xiaojun Zhu;Xiaobing Wu;Guihai Chen
Affiliations:
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu 210093, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu 210093, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu 210093, China
Venue:
International Journal of Sensor Networks
Year:
2012

Citing 15
Cited 1

The Cricket location-support system

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location Systems for Ubiquitous Computing

Computer
Localization from mere connectivity

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Semidefinite programming based algorithms for sensor network localization

ACM Transactions on Sensor Networks (TOSN)
Wireless localization using self-organizing maps

Proceedings of the 6th international conference on Information processing in sensor networks
Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement

Proceedings of the 15th annual international conference on Mobile computing and networking
Achieving range-free localization beyond connectivity

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Hop-count based node-to-anchor distance estimation in wireless sensor networks

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Rendered path: range-free localization in anisotropic sensor networks with holes

IEEE/ACM Transactions on Networking (TON)
Connectivity-based and anchor-free localization in large-scale 2d/3d sensor networks

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Locating sensors in the wild: pursuit of ranging quality

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Spatial Ordering Derivation for One-Dimensional Wireless Sensor Networks

ISPA '11 Proceedings of the 2011 IEEE Ninth International Symposium on Parallel and Distributed Processing with Applications
Component-based localization in sparse wireless networks

IEEE/ACM Transactions on Networking (TON)

Relative localization for wireless sensor networks with linear topology

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.