1406 IEEE COMMUNICATIONS LETTERS, VOL. 22, NO. 7, JULY 2018
ADMM-Based TDOA Estimation
Yanping Zhu, Bowen Deng, Aimin Jiang , Xiaofeng Liu, Yibin Tang, and Xiao Yao
Abstract—Accurate estimation of time difference of arrival
(TDOA) between sensors is a fundamental problem in various
applications of sensor networks. In this letter, a novel algorithm
is proposed to estimate TDOAs based on low-rank essence of a
TDOA matrix, whose entry (i, j) denotes TDOA value between
sensors i and j with respect to a common reference source.
To enhance the robustness of the proposed algorithm, we further
introduce the Gram matrix of the TDOA matrix, resulting in a
semidefinite programming estimation problem. An efficient alter-
nating direction method of multipliers is developed to improve the
scalability of the proposed algorithm. Simulation results validate
the performance of the proposed algorithm.
Index Terms— Alternating direction method of multipliers
(ADMM), Gram matrix, semidefinite programming (SDP), time-
difference of arrival (TDOA).
I. INTRODUCTION
T
IME difference of arrival (TDOA) measurements are
widely used in various applications of sensor networks,
e.g., source localization [1] and tracking [2]. In practice, they
can be obtained by generalized cross-correlation (GCC) [3],
but adversely affected by many factors, e.g., noise, out-
liers, and missing data. When only considering additive
Gaussian noise, TDOA estimation can be well addressed
by Gauss-Markov method [4] or standard least-squares
estimator [5]. Outliers generated by multipath and interference
have been studied from various perspectives. To identify and
remove outliers, the
p
-norm is employed in [6]. Multiple
quality metrics are also used in [7] along with the Zero-Sum
Condition (ZSC) to select reliable TDOA measurements.
Another outlier removal algorithm [8] is based on geometrical
constraints and statistical tests. Geometrical constraints are
based on minimal ZSCs, while the statistical model character-
izing the distance of TDOAs from the corresponding feasible
set is derived for multiple statistical tests to identify potential
outliers.
Missing data of TDOA measurements are induced by
communication failure or severe non-line-of-sight (NLOS)
propagation. A recent study presented in [9] exploits algebraic
properties of a TDOA matrix to handle missing data along
Manuscript received April 2, 2018; accepted April 27, 2018. Date of
publication May 7, 2018; date of current version July 10, 2018. This
work was supported in part by the National Nature Science Foundation
of China under grants 61471157, 61401148, 61501169, 61501170, and
61772090, the Fundamental Research Funds for the Central Universities
under grant 26120182018B23014, the Key Development Program of Jiangsu
Province of China under grants BE2017071 and BE2017647, and the Projects
of International Cooperation and Exchanges of Changzhou of China under
grants CZ20170018. The associate editor coordinating the review of this
letter and approving it for publication was L. Mucchi. (Corresponding author:
Aimin Jiang.)
Y. Zhu is with the School of Information Science and Engineering,
Changzhou University, Changzhou 213164, China (e-mail: zhuyanping@
cczu.edu.cn).
B. Deng, A. Jiang, X. Liu, Y. Tang, and X. Yao are with the College
of Internet of Things Engineering, Hohai University, Changzhou Campus,
Changzhou 213022, China (e-mail: jiangam@hhuc.edu.cn).
Digital Object Identifier 10.1109/LCOMM.2018.2833546
with additive noise and outliers. For a network with n sensors,
a TDOA matrix is a skew-symmetric matrix, whose element
(i, j) represents the TDOA value between sensors i and j
with respect to a common reference source. Although this
matrix is fully determined by n(n − 1)/2 pairwise measure-
ments, further examination shows that these measurements are
redundant [10], [11] and data redundancy can be exploited
to improve the denoising performance and the accuracy of
TDOA matrix completion [9]–[11]. A noiseless TDOA matrix
has rank 2 and a singular value decomposition (SVD) with
n − 1 degrees of freedom. Using these properties, one can
readily obtain closed-form solutions to the TDOA matrix
completion problem [9]. In [11], source localization is divided
to two distinct steps: denoising TDOAs and recovering source
positions. Based on statistical assumption of additive noise
in noisy TDOAs, denoising TDOAs is achieved by the
Maximum-Likelihood estimator derived by minimal ZSCs.
Note that a specific TDOA matrix corresponds to infinite
number of sensor geometries, whose essential properties can
be described by geometrical constraints. Interested readers
can refer to [8]–[11] for the connection between these two
formulations.
In this letter, we focus on the TDOA estimation, given
noisy and incomplete measurements. In the proposed algo-
rithm, we exploit the low rank essence of the Gram matrix
of the TDOA matrix to enhance estimation accuracy. The
resulting model does not rely on any extra prior information
(e.g., the exact number of outliers, statistical assumptions of
noise and outliers, sensors’ positions). Section II describes
the estimation problem of TDOA matrix and an semidefinite
programming (SDP) problem is further formulated. Then,
an alternating direction method of multipliers (ADMM) is
developed in Section III. Numerical experiments are given in
Section IV. Finally, Section V summarizes the conclusions.
II. P
ROPOSED ESTIMATION MODEL
Suppose that one source and n sensors are located at s
0
∈
R
d
and s
i
∈ R
d
, i =1,...,n, respectively. The TDOA value
for a pair of sensors is defined as a
ij
= d
i
− d
j
where d
i
=
s
i
− s
0
2
. Collecting all the TDOA values, we can construct
the TDOA matrix A =[a
ij
] ∈ R
n×n
. In practice, TDOAs
are contaminated by errors of range measurements and NLOS
propagation, yielding noisy measurements {˜a
ij
}. Moreover,
some of TDOA values cannot be reliably attained, leading to
a noisy and incomplete TDOA matrix
˜
A.
It can be demonstrated [9] that, using noiseless measure-
ments, a TDOA matrix can be written as
A = φ(x)=x · 1
T
− 1 · x
T
(1)
where x ∈ R
n
and 1 denotes a vector of ones. TDOAs
in (1) surely satisfy the ZSCs (e.g.,
m
i=1
a
k
i
k
i+1
= a
k
1
k
m
)
for any m, which are the fundamental of geometrical-
constraints-based algorithms. Eq. (1) demonstrates an exact
1558-2558 © 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.