Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments

A novel time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments is proposed. First, an optimization problem of target localization in the known distribution of line-of-sight and non-line-of-sight is established, and mixed semi-definite and second-order cone...

Full description

Bibliographic Details
Main Authors: Peixin Wang, Youming Li, Shengming Chang, Xiaoping Jin, Xiaoli Wang
Format: Article
Language:English
Published: SAGE Publishing 2020-03-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147720913808
id doaj-613eef32fd4941bcbd17fa0f2c1e0804
record_format Article
spelling doaj-613eef32fd4941bcbd17fa0f2c1e08042020-11-25T03:26:37ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772020-03-011610.1177/1550147720913808Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environmentsPeixin Wang0Youming Li1Shengming Chang2Xiaoping Jin3Xiaoli Wang4Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, ChinaFaculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, ChinaNingbo University of Technology, Ningbo, ChinaCollege of Information Engineering, China Jiliang University, Hangzhou, ChinaFaculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, ChinaA novel time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments is proposed. First, an optimization problem of target localization in the known distribution of line-of-sight and non-line-of-sight is established, and mixed semi-definite and second-order cone programming techniques are used to transform the original problem into a convex optimization problem which can be solved efficiently. Second, a worst-case robust least squares criterion is used to form an optimization problem of target localization in unknown distribution of line-of-sight and non-line-of-sight, where all links are treated as non-line-of-sight links. This problem is also solved using the similar techniques used in the known distribution of line-of-sight and non-line-of-sight case. Finally, computer simulation results show that the proposed algorithms have better performance in both the known distribution and the unknown distribution of line-of-sight and non-line-of-sight environments.https://doi.org/10.1177/1550147720913808
collection DOAJ
language English
format Article
sources DOAJ
author Peixin Wang
Youming Li
Shengming Chang
Xiaoping Jin
Xiaoli Wang
spellingShingle Peixin Wang
Youming Li
Shengming Chang
Xiaoping Jin
Xiaoli Wang
Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
International Journal of Distributed Sensor Networks
author_facet Peixin Wang
Youming Li
Shengming Chang
Xiaoping Jin
Xiaoli Wang
author_sort Peixin Wang
title Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
title_short Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
title_full Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
title_fullStr Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
title_full_unstemmed Time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
title_sort time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments
publisher SAGE Publishing
series International Journal of Distributed Sensor Networks
issn 1550-1477
publishDate 2020-03-01
description A novel time-of-arrival–based localization algorithm in mixed line-of-sight/non-line-of-sight environments is proposed. First, an optimization problem of target localization in the known distribution of line-of-sight and non-line-of-sight is established, and mixed semi-definite and second-order cone programming techniques are used to transform the original problem into a convex optimization problem which can be solved efficiently. Second, a worst-case robust least squares criterion is used to form an optimization problem of target localization in unknown distribution of line-of-sight and non-line-of-sight, where all links are treated as non-line-of-sight links. This problem is also solved using the similar techniques used in the known distribution of line-of-sight and non-line-of-sight case. Finally, computer simulation results show that the proposed algorithms have better performance in both the known distribution and the unknown distribution of line-of-sight and non-line-of-sight environments.
url https://doi.org/10.1177/1550147720913808
work_keys_str_mv AT peixinwang timeofarrivalbasedlocalizationalgorithminmixedlineofsightnonlineofsightenvironments
AT youmingli timeofarrivalbasedlocalizationalgorithminmixedlineofsightnonlineofsightenvironments
AT shengmingchang timeofarrivalbasedlocalizationalgorithminmixedlineofsightnonlineofsightenvironments
AT xiaopingjin timeofarrivalbasedlocalizationalgorithminmixedlineofsightnonlineofsightenvironments
AT xiaoliwang timeofarrivalbasedlocalizationalgorithminmixedlineofsightnonlineofsightenvironments
_version_ 1724591795922272256