Cramer-Rao Bound for Localization with A Priori Knowledge on Biased Range Measurements

This paper derives a general expression for the Cramer-Rao bound (CRB) of wireless localization algorithms using range measurements subject to bias corruption. Specifically, the a priori knowledge about which range measurements are biased, and the probability density functions (pdf) of the biases ar...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on aerospace and electronic systems Vol. 48; no. 1; pp. 468 - 476
Main Author Wang, Tao
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper derives a general expression for the Cramer-Rao bound (CRB) of wireless localization algorithms using range measurements subject to bias corruption. Specifically, the a priori knowledge about which range measurements are biased, and the probability density functions (pdf) of the biases are assumed to be available. For each range measurement, the error due to estimating the time-of-arrival (TOA) of the detected signal is modeled as a Gaussian distributed random variable with zero mean and known variance. In general, the derived CRB expression can be evaluated numerically. An approximate CRB expression is also derived when the bias pdf is very informative. Using these CRB expressions, we study the impact of the bias distribution on the mean square error (MSE) bound corresponding to the CRB. The analysis is corroborated by numerical experiments.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2012.6129648