Tradeoff between estimation performance and sensor usage in distributed localisation problems Online publication date: Wed, 26-Jul-2006
by Juan Liu, Qingfeng Huang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 1, No. 4, 2006
Abstract: In distributed sensor networks, the tradeoff between application performance and resource consumption is a fundamental issue. In this paper, we analyse the tradeoff in the context of localisation problems. In particular, the localisation performance is characterised using the Cramer-Rao lower bound which reflects the performance limit in the family of unbiased estimators. For a variety of distance-sensitive sensing models, the bound comes in closed-form. In view of the tradeoff, we design a circular incremental inclusion scheme for efficient sensor tasking and propose to use the theoretical Cramer-Rao lower bound as a guiding heuristic. Our results reveal that there is a performance limit for collaborative sensing, and the expansion of sensing group size incurs fast diminishing returns on performance. The study results in new insights and provides general guidelines for sensor tasking in practical applications.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook