TY - JOUR
T1 - A Fractional Programming Method for Target Localization in Asynchronous Networks
AU - Wang, Gang
AU - Ansari, Nirwan
AU - Li, Youming
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China under Grant 61571249, in part by the Zhejiang Provincial Natural Science Foundation under Grant LY18F010011, and in part by the K. C. Wong Magna Fund in Ningbo University.
PY - 2018
Y1 - 2018
N2 - In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.
AB - In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.
KW - Fractional programming (FP)
KW - localization
KW - time-difference-of-arrival (TDOA)
KW - time-of-arrival (TOA)
UR - http://www.scopus.com/inward/record.url?scp=85054370220&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054370220&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2018.2873453
DO - 10.1109/ACCESS.2018.2873453
M3 - Article
AN - SCOPUS:85054370220
SN - 2169-3536
VL - 6
SP - 56727
EP - 56736
JO - IEEE Access
JF - IEEE Access
M1 - 8478381
ER -