Tradeoff between estimation performance and sensor usage in distributed localisation problems
Authors: Liu, Juan1; Huang, Qingfeng2
Source: International Journal of Ad Hoc and Ubiquitous Computing, Volume 1, Number 4, 26 July 2006 , pp. 230-238(9)
Publisher: Inderscience Publishers
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.Keywords: COMPUTING JOURNALS; Computing Science, Applications and Software
Document Type: Research article
DOI: 10.1504/IJAHUC.2006.010504
Affiliations: 1: Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304, USA. 2: Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304, USA

Click here for Page Help