A simple iterative algorithm for range-based localization

Author

Shi, Qingjiang ; He, Chen

Author_Institution

Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai

fYear

2009

fDate

19-24 April 2009

Firstpage

2105

Lastpage

2108

Abstract

The range-based localization problem often arises in TOA or RSSI based position estimation schemes. It is well-known that such a localization problem can be formulated as a nonlinear least-squares (NLS) estimation problem. In this paper, we formulate the problem as a constrained optimization problem, which is equivalent to the general NLS problem. By using a greedy optimization strategy, we derive a simple iterative algorithm with closed-form expressions for the NLS localization, which can be implemented in a distributed way. Simulation results show that the localization performance of the proposed localization algorithm is very close to the Cramer-Rao lower bound.

Keywords

estimation theory; greedy algorithms; iterative methods; least mean squares methods; optimisation; radio networks; time-of-arrival estimation; Cramer-Rao lower bound; closed-form expressions; constrained optimization problem; greedy optimization strategy; iterative algorithm; nonlinear least-squares estimation problem; range-based localization problem; received signal strength; time-of-arrival estimation; wireless communication networks; Constraint optimization; Cost function; Helium; Iterative algorithms; Nonlinear equations; Parameter estimation; Position measurement; Time difference of arrival; Wireless communication; Wireless networks; Iterative algorithm; Nonlinear least-squares estimation; Range-based localization;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on

Conference_Location

Taipei

ISSN

1520-6149

Print_ISBN

978-1-4244-2353-8

Electronic_ISBN

1520-6149

Type

conf

DOI

10.1109/ICASSP.2009.4960031

Filename

4960031