A Concave-Convex Procedure for TDOA Based Positioning

Author

Gholami, Mohammad Reza ; Gezici, Sinan ; Strom, Erik G.

Author_Institution

Dept. of Signals & Syst., Chalmers Univ. of Technol., Gothenburg, Sweden

Volume

17

Issue

4

fYear

2013

fDate

Apr-13

Firstpage

765

Lastpage

768

Abstract

This letter investigates the time-difference-of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the ℓ₁ norm, minimization of the residual errors and formulate the positioning problem as a difference of convex functions (DC) programming. We then employ a concave-convex procedure to solve the corresponding DC programming. Simulation results illustrate the improved performance of the proposed approach compared to existing methods.

Keywords

concave programming; convex programming; direction-of-arrival estimation; radionavigation; time-of-arrival estimation; wireless sensor networks; DC programming; TDOA based positioning; concave-convex procedure; convex function programming; least-mean absolute; residual error minimization; time-difference-of-arrival based positioning problem; wireless sensor networks; Complexity theory; Convex functions; Maximum likelihood estimation; Minimization; Noise; Optimization; Programming; DC programming; Wireless sensor network; concave-convex procedure; time-difference-of-arrival;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2013.020513.122732

Filename

6459502