A concave-convex procedure for TDOA based positioning

Simple item page
buir.contributor.authorGezici, Sinan
dc.citation.epage768en_US
dc.citation.issueNumber4en_US
dc.citation.spage765en_US
dc.citation.volumeNumber17en_US
dc.contributor.authorGholami, M. R.en_US
dc.contributor.authorGezici, Sinanen_US
dc.contributor.authorStrom, E. G.en_US
dc.date.accessioned2016-02-08T09:40:33Z
dc.date.available2016-02-08T09:40:33Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractThis 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.en_US
dc.identifier.doi10.1109/LCOMM.2013.020513.122732en_US
dc.identifier.issn1089-7798
dc.identifier.urihttp://hdl.handle.net/11693/21069
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/LCOMM.2013.020513.122732en_US
dc.source.titleIEEE Communications Lettersen_US
dc.subjectDC programmingen_US
dc.subjectWireless sensor networken_US
dc.subjectConcave-convex procedureen_US
dc.subjectD-C programmingen_US
dc.subjectResidual erroren_US
dc.subjectElectrical engineeringen_US
dc.subjectMathematical modelsen_US
dc.subjectWireless sensor networksen_US
dc.titleA concave-convex procedure for TDOA based positioningen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A concave-convex procedure for TDOA based positioning.pdf
Size:
135.49 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Electrical and Electronics Engineering