2011/04/20 by Tao Wang, Wang, Tao
Computer Science · Engineering · #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Indoor and Outdoor Localization Technologies #Information Theory (cs.IT) #Optimization and Control (math.OC) #Robotics and Sensor-Based Localization #Systems and Control (eess.SY) #Target Tracking and Data Fusion in Sensor Networks #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1104.4056
openalex publication_date 2011/04/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper derives a general expression for the Cramér-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 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.