DocumentCode :
3578415
Title :
Semidefinite programming approaches for source localization problems
Author :
Yanshen Du ; Ping Wei ; Huaguo Zhang
Author_Institution :
Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear :
2014
Firstpage :
339
Lastpage :
342
Abstract :
This paper addresses the problems of locating a source from the received signal time of arrival (TOA) or time difference of arrival (TDOA) collected using a group of collaborative wireless sensors. Based on the TOA and TDOA measurement models, we present, respectively, two constrained weighted least squares (CWLS) estimators, which are difficult to be solved directly due to their nonconvex nature. However, by performing the semidefinite relaxation technique, each of the CWLS problems can be relaxed into a semidefinite programming problem (SDP), which can be efficiently solved using modern convex optimization algorithms. Moreover, these relaxations are proved to be tight, and hence guarantee the good performance. Simulation results corroborate the theoretical results and good performance of the proposed methods.
Keywords :
convex programming; least squares approximations; relaxation theory; time-of-arrival estimation; wireless sensor networks; CWLS problems; TDOA; TOA; collaborative wireless sensors; constrained weighted least square estimators; convex optimization algorithms; semidefinite programming approaches; semidefinite programming problem; semidefinite relaxation technique; source localization problems; time difference of arrival; wireless sensor networks; Maximum likelihood estimation; Noise; Noise measurement; Position measurement; Programming; Sensors; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Problem-Solving (ICCP), 2014 IEEE International Conference on
Print_ISBN :
978-1-4799-4246-6
Type :
conf
DOI :
10.1109/ICCPS.2014.7062288
Filename :
7062288
Link To Document :
بازگشت