Localization algorithms for asynchronous time difference of arrival positioning systems

Abstract An asynchronous time difference of arrival (ATDOA) positioning system requires no time synchronization among all the anchor and target nodes, which makes it highly practical and can be easily deployed. This paper first presents an ATDOA localization model, and then primarily focuses on two...

Full description

Bibliographic Details
Main Authors: Shuai He, Xiaodai Dong, Wu-Sheng Lu
Format: Article
Language:English
Published: SpringerOpen 2017-04-01
Series:EURASIP Journal on Wireless Communications and Networking
Subjects:
Online Access:http://link.springer.com/article/10.1186/s13638-017-0851-1
id doaj-0cfb223a366a491e91b8f0400c28cae4
record_format Article
spelling doaj-0cfb223a366a491e91b8f0400c28cae42020-11-24T23:29:37ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992017-04-012017111410.1186/s13638-017-0851-1Localization algorithms for asynchronous time difference of arrival positioning systemsShuai He0Xiaodai Dong1Wu-Sheng Lu2Department of Electrical and Computer Engineering, University of VictoriaDepartment of Electrical and Computer Engineering, University of VictoriaDepartment of Electrical and Computer Engineering, University of VictoriaAbstract An asynchronous time difference of arrival (ATDOA) positioning system requires no time synchronization among all the anchor and target nodes, which makes it highly practical and can be easily deployed. This paper first presents an ATDOA localization model, and then primarily focuses on two new localization algorithms for the system. The first algorithm is a two-step positioning algorithm that combines semidefinite programming (SDP) with a Taylor series method to achieve global convergence as well as superior estimation accuracy, and the second algorithm is a constrained least-squares method that has the advantage of low complexity and fast convergence while maintaining good performance. In addition, a novel receiver re-selection method is presented to significantly improve estimation accuracy. In this paper, we also derive the Cramer-Rao lower bound (CRLB) of the ATDOA positioning system using a distance-dependent noise variance model, which describes a realistic indoor propagation channel.http://link.springer.com/article/10.1186/s13638-017-0851-1LocalizationAsynchronous positioning systemsTime difference of arrival (TDOA)Semidefinite programming (SDP)Taylor seriesConstrained least-squares
collection DOAJ
language English
format Article
sources DOAJ
author Shuai He
Xiaodai Dong
Wu-Sheng Lu
spellingShingle Shuai He
Xiaodai Dong
Wu-Sheng Lu
Localization algorithms for asynchronous time difference of arrival positioning systems
EURASIP Journal on Wireless Communications and Networking
Localization
Asynchronous positioning systems
Time difference of arrival (TDOA)
Semidefinite programming (SDP)
Taylor series
Constrained least-squares
author_facet Shuai He
Xiaodai Dong
Wu-Sheng Lu
author_sort Shuai He
title Localization algorithms for asynchronous time difference of arrival positioning systems
title_short Localization algorithms for asynchronous time difference of arrival positioning systems
title_full Localization algorithms for asynchronous time difference of arrival positioning systems
title_fullStr Localization algorithms for asynchronous time difference of arrival positioning systems
title_full_unstemmed Localization algorithms for asynchronous time difference of arrival positioning systems
title_sort localization algorithms for asynchronous time difference of arrival positioning systems
publisher SpringerOpen
series EURASIP Journal on Wireless Communications and Networking
issn 1687-1499
publishDate 2017-04-01
description Abstract An asynchronous time difference of arrival (ATDOA) positioning system requires no time synchronization among all the anchor and target nodes, which makes it highly practical and can be easily deployed. This paper first presents an ATDOA localization model, and then primarily focuses on two new localization algorithms for the system. The first algorithm is a two-step positioning algorithm that combines semidefinite programming (SDP) with a Taylor series method to achieve global convergence as well as superior estimation accuracy, and the second algorithm is a constrained least-squares method that has the advantage of low complexity and fast convergence while maintaining good performance. In addition, a novel receiver re-selection method is presented to significantly improve estimation accuracy. In this paper, we also derive the Cramer-Rao lower bound (CRLB) of the ATDOA positioning system using a distance-dependent noise variance model, which describes a realistic indoor propagation channel.
topic Localization
Asynchronous positioning systems
Time difference of arrival (TDOA)
Semidefinite programming (SDP)
Taylor series
Constrained least-squares
url http://link.springer.com/article/10.1186/s13638-017-0851-1
work_keys_str_mv AT shuaihe localizationalgorithmsforasynchronoustimedifferenceofarrivalpositioningsystems
AT xiaodaidong localizationalgorithmsforasynchronoustimedifferenceofarrivalpositioningsystems
AT wushenglu localizationalgorithmsforasynchronoustimedifferenceofarrivalpositioningsystems
_version_ 1725544580297785344