A Fractional Programming Method for Target Localization in Asynchronous Networks

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, introduce...

Full description

Bibliographic Details
Main Authors: Gang Wang, Nirwan Ansari, Youming Li
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8478381/
id doaj-8661026e1d37461995297a688ad786b3
record_format Article
spelling doaj-8661026e1d37461995297a688ad786b32021-03-29T20:55:50ZengIEEEIEEE Access2169-35362018-01-016567275673610.1109/ACCESS.2018.28734538478381A Fractional Programming Method for Target Localization in Asynchronous NetworksGang Wang0https://orcid.org/0000-0001-7018-9513Nirwan Ansari1Youming Li2Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, ChinaDepartment of Electrical and Computer Engineering, Advanced Networking Laboratory, New Jersey Institute of Technology, Newark, NJ, USAFaculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, ChinaIn 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.https://ieeexplore.ieee.org/document/8478381/Fractional programming (FP)localizationtime-of-arrival (TOA)time-difference-of-arrival (TDOA)
collection DOAJ
language English
format Article
sources DOAJ
author Gang Wang
Nirwan Ansari
Youming Li
spellingShingle Gang Wang
Nirwan Ansari
Youming Li
A Fractional Programming Method for Target Localization in Asynchronous Networks
IEEE Access
Fractional programming (FP)
localization
time-of-arrival (TOA)
time-difference-of-arrival (TDOA)
author_facet Gang Wang
Nirwan Ansari
Youming Li
author_sort Gang Wang
title A Fractional Programming Method for Target Localization in Asynchronous Networks
title_short A Fractional Programming Method for Target Localization in Asynchronous Networks
title_full A Fractional Programming Method for Target Localization in Asynchronous Networks
title_fullStr A Fractional Programming Method for Target Localization in Asynchronous Networks
title_full_unstemmed A Fractional Programming Method for Target Localization in Asynchronous Networks
title_sort fractional programming method for target localization in asynchronous networks
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description 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.
topic Fractional programming (FP)
localization
time-of-arrival (TOA)
time-difference-of-arrival (TDOA)
url https://ieeexplore.ieee.org/document/8478381/
work_keys_str_mv AT gangwang afractionalprogrammingmethodfortargetlocalizationinasynchronousnetworks
AT nirwanansari afractionalprogrammingmethodfortargetlocalizationinasynchronousnetworks
AT youmingli afractionalprogrammingmethodfortargetlocalizationinasynchronousnetworks
AT gangwang fractionalprogrammingmethodfortargetlocalizationinasynchronousnetworks
AT nirwanansari fractionalprogrammingmethodfortargetlocalizationinasynchronousnetworks
AT youmingli fractionalprogrammingmethodfortargetlocalizationinasynchronousnetworks
_version_ 1724193845874262016