Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks
This paper presents a tag localization algorithm based on the time-difference-of-arrival (TDOA) of mobile tag signal for asynchronous wireless sensor network (WSN) with N anchors (nodes with known locations) and a large number of mobile tags. To obtain time synchronization, all anchors broadcast sig...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2015-05-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2015/598747 |
id |
doaj-45c9742f4f884c55b1a46016a3d6df9a |
---|---|
record_format |
Article |
spelling |
doaj-45c9742f4f884c55b1a46016a3d6df9a2020-11-25T03:45:17ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772015-05-011110.1155/2015/598747598747Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor NetworksHui XiongZhiyuan ChenWei AnBeiya YangThis paper presents a tag localization algorithm based on the time-difference-of-arrival (TDOA) of mobile tag signal for asynchronous wireless sensor network (WSN) with N anchors (nodes with known locations) and a large number of mobile tags. To obtain time synchronization, all anchors broadcast signals periodically; relative clock offsets and skews of anchor pairs are estimated by the least-square (LS) method using the times-of-arrival (TOAs) of broadcast signals at anchors. When a tag transmits signal, the TOA of tag signal at each anchor is stamped and errors in original TDOAs of tag signal due to relative clock offsets and skews of anchor pairs are eliminated. Based on Gaussian noise model, maximum likelihood estimation (MLE) for the tag position is obtained. Performance issues are addressed by evaluating the Cramér-Rao lower bound of synchronization and localization algorithms. Since the tag can be located via a single transmission, least power consumption of tag is required, and large number of tags can be served in WSN. The proposed algorithm is simple and effective, with performance close to that of synchronous TDOA algorithm.https://doi.org/10.1155/2015/598747 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hui Xiong Zhiyuan Chen Wei An Beiya Yang |
spellingShingle |
Hui Xiong Zhiyuan Chen Wei An Beiya Yang Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks International Journal of Distributed Sensor Networks |
author_facet |
Hui Xiong Zhiyuan Chen Wei An Beiya Yang |
author_sort |
Hui Xiong |
title |
Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks |
title_short |
Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks |
title_full |
Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks |
title_fullStr |
Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks |
title_full_unstemmed |
Robust TDOA Localization Algorithm for Asynchronous Wireless Sensor Networks |
title_sort |
robust tdoa localization algorithm for asynchronous wireless sensor networks |
publisher |
SAGE Publishing |
series |
International Journal of Distributed Sensor Networks |
issn |
1550-1477 |
publishDate |
2015-05-01 |
description |
This paper presents a tag localization algorithm based on the time-difference-of-arrival (TDOA) of mobile tag signal for asynchronous wireless sensor network (WSN) with N anchors (nodes with known locations) and a large number of mobile tags. To obtain time synchronization, all anchors broadcast signals periodically; relative clock offsets and skews of anchor pairs are estimated by the least-square (LS) method using the times-of-arrival (TOAs) of broadcast signals at anchors. When a tag transmits signal, the TOA of tag signal at each anchor is stamped and errors in original TDOAs of tag signal due to relative clock offsets and skews of anchor pairs are eliminated. Based on Gaussian noise model, maximum likelihood estimation (MLE) for the tag position is obtained. Performance issues are addressed by evaluating the Cramér-Rao lower bound of synchronization and localization algorithms. Since the tag can be located via a single transmission, least power consumption of tag is required, and large number of tags can be served in WSN. The proposed algorithm is simple and effective, with performance close to that of synchronous TDOA algorithm. |
url |
https://doi.org/10.1155/2015/598747 |
work_keys_str_mv |
AT huixiong robusttdoalocalizationalgorithmforasynchronouswirelesssensornetworks AT zhiyuanchen robusttdoalocalizationalgorithmforasynchronouswirelesssensornetworks AT weian robusttdoalocalizationalgorithmforasynchronouswirelesssensornetworks AT beiyayang robusttdoalocalizationalgorithmforasynchronouswirelesssensornetworks |
_version_ |
1724510442307452928 |