TY - JOUR
T1 - TOA-based distributed localisation with unknown internal delays and clock frequency offsets in wireless sensor networks
AU - Yu, K.
AU - Guo, Y. J.
AU - Hedley, M.
PY - 2009
Y1 - 2009
N2 - Locating sensor nodes in an ad hoc wireless sensor network (WSN) is a challenging task. In general, the network nodes are not synchronised and the internal delays within the nodes are unknown. Here, time-of-arrival (TOA)-based localisation is investigated when practical parameters such as clock time offset, clock frequency offset and system internal delay are all involved. The TOA measurements are made between each pair of nodes that are within radio range. First, an efficient frequency offset (FO) estimation algorithm is derived. Then, a two-stage localisation scheme is proposed. In the first stage, localisation starts from the nodes with the largest numbers of neighbouring anchors and priority is always given to nodes with more neighbouring anchors and/or localised nodes. In the second stage, the locations of all neighbouring nodes are exploited to improve location accuracy. Two iterative algorithms are developed: the Taylor series-based least squares (TS-LS) method and the sequential quadratic programming (SQP) optimisation method. During the localisation process, a number of measures are taken to ensure the reliability of each location estimate to avoid abnormal errors and reduce error propagation. The Cramer-Rao lower bound is also derived to benchmark the location accuracy.
AB - Locating sensor nodes in an ad hoc wireless sensor network (WSN) is a challenging task. In general, the network nodes are not synchronised and the internal delays within the nodes are unknown. Here, time-of-arrival (TOA)-based localisation is investigated when practical parameters such as clock time offset, clock frequency offset and system internal delay are all involved. The TOA measurements are made between each pair of nodes that are within radio range. First, an efficient frequency offset (FO) estimation algorithm is derived. Then, a two-stage localisation scheme is proposed. In the first stage, localisation starts from the nodes with the largest numbers of neighbouring anchors and priority is always given to nodes with more neighbouring anchors and/or localised nodes. In the second stage, the locations of all neighbouring nodes are exploited to improve location accuracy. Two iterative algorithms are developed: the Taylor series-based least squares (TS-LS) method and the sequential quadratic programming (SQP) optimisation method. During the localisation process, a number of measures are taken to ensure the reliability of each location estimate to avoid abnormal errors and reduce error propagation. The Cramer-Rao lower bound is also derived to benchmark the location accuracy.
UR - http://www.scopus.com/inward/record.url?scp=60449119578&partnerID=8YFLogxK
U2 - 10.1049/iet-spr:20080029
DO - 10.1049/iet-spr:20080029
M3 - Article
AN - SCOPUS:60449119578
SN - 1751-9675
VL - 3
SP - 106
EP - 118
JO - IET Signal Processing
JF - IET Signal Processing
IS - 2
ER -