In this work, the differential received signal strength based localization problem is addressed. Based on the measurement model, we present the constrained weighted least squares (CWLS) approach, which is difficult to be solved directly due to its nonconvex nature. However, by performing the semidefinite relaxation (SDR) technique, the CWLS problem can be relaxed into a semidefinite programming problem (SDP), which can be efficiently solved using modern convex optimization algorithms. Moreover, the SDR is proved to be tight, and hence ensures the corresponding SDP find the optimal solution of the original CWLS problem. Numerical simulations are included to corroborate the theoretical results and promising performance.
Yan Shen DU
University of Electronic Science and Technology of China
Ping WEI
University of Electronic Science and Technology of China
Hua Guo ZHANG
University of Electronic Science and Technology of China
Hong Shu LIAO
University of Electronic Science and Technology of China
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yan Shen DU, Ping WEI, Hua Guo ZHANG, Hong Shu LIAO, "A Semidefinite Programming Approach to Source Localization Using Differential Received Signal Strength" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 2, pp. 745-748, February 2015, doi: 10.1587/transfun.E98.A.745.
Abstract: In this work, the differential received signal strength based localization problem is addressed. Based on the measurement model, we present the constrained weighted least squares (CWLS) approach, which is difficult to be solved directly due to its nonconvex nature. However, by performing the semidefinite relaxation (SDR) technique, the CWLS problem can be relaxed into a semidefinite programming problem (SDP), which can be efficiently solved using modern convex optimization algorithms. Moreover, the SDR is proved to be tight, and hence ensures the corresponding SDP find the optimal solution of the original CWLS problem. Numerical simulations are included to corroborate the theoretical results and promising performance.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.745/_p
Copy
@ARTICLE{e98-a_2_745,
author={Yan Shen DU, Ping WEI, Hua Guo ZHANG, Hong Shu LIAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Semidefinite Programming Approach to Source Localization Using Differential Received Signal Strength},
year={2015},
volume={E98-A},
number={2},
pages={745-748},
abstract={In this work, the differential received signal strength based localization problem is addressed. Based on the measurement model, we present the constrained weighted least squares (CWLS) approach, which is difficult to be solved directly due to its nonconvex nature. However, by performing the semidefinite relaxation (SDR) technique, the CWLS problem can be relaxed into a semidefinite programming problem (SDP), which can be efficiently solved using modern convex optimization algorithms. Moreover, the SDR is proved to be tight, and hence ensures the corresponding SDP find the optimal solution of the original CWLS problem. Numerical simulations are included to corroborate the theoretical results and promising performance.},
keywords={},
doi={10.1587/transfun.E98.A.745},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - A Semidefinite Programming Approach to Source Localization Using Differential Received Signal Strength
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 745
EP - 748
AU - Yan Shen DU
AU - Ping WEI
AU - Hua Guo ZHANG
AU - Hong Shu LIAO
PY - 2015
DO - 10.1587/transfun.E98.A.745
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2015
AB - In this work, the differential received signal strength based localization problem is addressed. Based on the measurement model, we present the constrained weighted least squares (CWLS) approach, which is difficult to be solved directly due to its nonconvex nature. However, by performing the semidefinite relaxation (SDR) technique, the CWLS problem can be relaxed into a semidefinite programming problem (SDP), which can be efficiently solved using modern convex optimization algorithms. Moreover, the SDR is proved to be tight, and hence ensures the corresponding SDP find the optimal solution of the original CWLS problem. Numerical simulations are included to corroborate the theoretical results and promising performance.
ER -