6533b823fe1ef96bd127f5c4

RESEARCH PRODUCT

LCRT: A ToA Based Mobile Terminal Localization Algorithm in NLOS Environment

Frank Y. LiLei JiaoZengyou Xu

subject

Non-line-of-sight propagationTime of arrivalComputational complexity theoryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552Range (statistics)Probability density functionResidualCramér–Rao boundAlgorithmUpper and lower boundsMathematics

description

©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/VETECS.2009.5073644 Non line-of-sight (NLOS) propagation in range measurement is a key problem for mobile terminal localization. This paper proposes a low computational residual test (LCRT) algorithm that can identify the number of line-of-sight (LOS) transmissions and reduce the computational complexity compared with the residual test (RT) algorithm. LCRT is based on the assumption that when all range measurements are from LOS propagations, the normalized residual distribution follows the central chi-square distribution while for NLOS cases it is non-central. An optimized procedure to generate the sets of range measurements is adopted and least square (LS) instead of approximate maximum likelihood (AML) is used during the identification of LOS propagations, resulting in reduced computation complexity. Simulation results show that the LCRT can efficiently identify the set of LOS. The correct decision rate is higher than 92% and the variances of results are approaching to the Cramer-Rao lower bound (CRLB) when there are more than 3 LOS propagations.

yearjournalcountryeditionlanguage
2009-04-01
http://hdl.handle.net/11250/137659