A concave-convex procedure for TDOA based positioning

Files

A concave-convex procedure for TDOA based positioning.pdf (135.49 KB)

Date

2013

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
2
views
11
downloads

Citation Stats

  • Share

Series

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 ℓ1 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. © 1997-2012 IEEE.

Source Title

IEEE Communications Letters

Publisher

IEEE

Course

Other identifiers

Book Title

Keywords

DC programming, Wireless sensor network, Concave-convex procedure, D-C programming, Residual error, Electrical engineering, Mathematical models, Wireless sensor networks

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/21069

Published Version (Please cite this version)

http://dx.doi.org/10.1109/LCOMM.2013.020513.122732

Collections

Scholarly Publications - Electrical and Electronics Engineering

Language

English

Type

Article