CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Concave-Convex Procedure for TDOA Based Positioning

Mohammad Reza Gholami (Institutionen för signaler och system, Kommunikationssystem) ; Sinan Gezici ; Erik G. Ström (Institutionen för signaler och system, Kommunikationssystem)
IEEE Communications Letters (1089-7798). Vol. To appear (2013),
[Artikel, refereegranskad vetenskaplig]

This letter investigates the time-difference- of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the l1 norm, minimization of the residual errors and formulate the positioning problem as a difference of convex function (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.

Nyckelord: Wireless sensor network, time-difference- of-arrival (TDOA), DC programming, concave-convex pro- cedure, difference of convex programming.

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-01-08. Senast ändrad 2013-06-20.
CPL Pubid: 169494


Läs direkt!

Lokal fulltext (fritt tillgänglig)