 Research
 Open Access
 Published:
Referencefree timebased localization for an asynchronous target
EURASIP Journal on Advances in Signal Processing volume 2012, Article number: 19 (2012)
Abstract
Lowcomplexity leastsquares (LS) estimators based on timeofarrival (TOA) or timedifferenceofarrival (TDOA) measurements have been developed to locate a target node with the help of anchors (nodes with known positions). They require to select a reference anchor in order to cancel nuisance parameters or relax stringent synchronization requirements. Thus, their localization performance relies heavily on the reference selection. In this article, we propose several referencefree localization estimators based on TOA measurements for a scenario, where anchor nodes are synchronized, and the clock of the target node runs freely. The referencefree LS estimators that are different from the referencebased ones do not suffer from a poor reference selection. Furthermore, we generalize existing referencebased localization estimators using TOA or TDOA measurements, which are scattered over different research areas, and we shed new light on their relations. We justify that the optimal weighting matrix can compensate the influence of the reference selection for referencebased weighted LS (WLS) estimators using TOA measurements, and make all those estimators identical. However, the optimal weighting matrix cannot decouple the reference dependency for referencebased WLS estimators using a nonredundant set of TDOA measurements, but can make the estimators using the same set identical as well. Moreover, the CramérRao bounds are derived as benchmarks. Simulation results corroborate our analysis.
1. Introduction
Localization is a challenging research topic under investigation for many decades. It finds applications in the global positioning system (GPS) [1], radar systems [2], underwater systems [3], acoustic systems [4, 5], cellular networks [6], wireless local area networks (WLANs) [7], wireless sensor networks (WSNs) [8, 9], etc. It is embraced everywhere at any scale. New applications of localization are continuously emerging, which motivates further exploration and attracts many researchers from different research areas, such as geophysics, signal processing, aerospace engineering, and computer science. In general, the localization problem can be solved by two steps [7–9]: firstly measure the metrics bearing location information, the socalled ranging or bearing, and secondly estimate the positions based on those metrics, the socalled location information fusion. There are mainly four metrics: timeofarrival (TOA) or timeofflight (TOF) [10], timedifferenceofarrival (TDOA) [4, 11], angleofarrival (AOA) [12], and received signal strength (RSS) [13]. The ranging methods using RSS can be implemented by energy detectors, but they can only achieve a coarse resolution. Antenna arrays are required for AOAbased methods, which encumbers their popularity. On the other hand, the high accuracy and potentially low cost implementation make TOA or TDOA based on ultrawideband impulse radios (UWBIRs) a promising ranging method [8].
Closedform localization solutions based on TOAs or TDOAs are used to locate a target node with the help of anchors (nodes with known positions). They are appreciated for realtime localization applications, initiating iterative localization algorithms, and facilitating Kalman tracking [14]. They have much lower complexity compared to the optimal maximum likelihood estimator (MLE), and also do not require prior knowledge of noise statistics. However, a common feature of existing closedform localization solutions is reference dependency. The reference here indicates the time associated with the reference anchor. For instance, in order to measure TDOAs, a reference anchor has to be chosen first [7]. The reference anchor is also needed to cancel nuisance parameters in closedform solutions based on TOAs or TDOAs [15]. Thus, the localization performance depends heavily on the reference selection. There are some efforts to improve the reference selection [16–18], but they mainly rely on heuristics. Furthermore, when TOAs are measured using the oneway ranging protocol for calculating the distance between the target and the anchor, stringent synchronization is required between these two nodes in the conventional methods [7, 10]. However, it is difficult to maintain synchronization due to the clock inaccuracy and other error sources. Therefore, various closedform localization methods resort to using TDOA measurements to relax this synchronization constraint between the target and the anchor. These methods only require synchronization among the anchors, e.g., the source localization methods based on TDOAs using a passive sensor array [4, 19–22].^{a}
In this article, we also relax the above synchronization requirement, and consider a scenario, where anchor nodes are synchronized, and the clock of the target node runs freely. However, instead of using TDOAs, we model the asynchronous effect as a common bias, and propose referencefree leastsquares (LS), weighted LS (WLS), and constrained WLS (CWLS) localization estimators based on TOA measurements. Furthermore, we generalize existing referencebased localization solutions using TOA or TDOA measurements, which are scattered over different research areas, and provide new insights into their relations, which have been overlooked. We clarify that the reference dependency for referencebased WLS estimators using TOA measurements can be decoupled by the optimal weighting matrix, which also makes all those estimators identical. However, the influence of the reference selection for referencebased WLS estimators using a nonredundant set of TDOA measurements cannot be compensated by the optimal weighting matrix. But the optimal weighting matrix can make the estimators using the same set equivalent as well. Moreover, the CramérRao bounds (CRBs) are derived as benchmarks for comparison.
The rest of this article is organized as follows. In Section 2, different kinds of referencefree TOAbased estimators are proposed, as well as existing referencebased estimators using TOA measurements. Their relations are thoroughly investigated. In Section 3, we generalize existing referencebased localization algorithms using TDOA measurements, and shed light on their relations as well. Simulation results and performance bounds are shown in Section 4. Conclusions are drawn at the end of the article.
Notation: We use upper (lower) bold face letters to denote matrices (column vectors). [X]_{m,n}, [X]_{m,:} and [X]_{:},_{ n }denote the element on the m th row and n th column, the m th row, and the n th column of the matrix X, respectively. [x]_{ n }indicates the n th element of x. 0_{ m }(1_{ m }) is an allzero (allone) column vector of length m. I_{ m }indicates an identity matrix of size m × m. Moreover, (·)^{T},  · , and ⊙ designate transposition, ℓ_{2} norm, and elementwise product, respectively. All other notation should be selfexplanatory.
2. Localization based on TOA measurements
Considering M anchor nodes and one target node, we would like to estimate the position of the target node. All the nodes are distributed in an ldimensional space, e.g., l = 2 (a plane (2D)) or l = 3 (a space (3D)). The coordinates of the anchor nodes are known and defined as X_{ a }= [x_{1}, x_{2}, ..., x_{ M }], where the vector x_{ i }= [x_{1,i}, x_{2},_{ i }, . . ., x_{l,i}]^{T}of length l indicates the known coordinates of the i th anchor node. We employ a vector x of length l to denote the unknown coordinates of the target node. Our method can also be extended for multiple target nodes. We remark that in a large scale WSN, it is common to localize target nodes in a sequential way [23]. The target nodes that have enough anchors are localized first. Then, the located target nodes can be viewed as new anchors that can facilitate the localization of other target nodes. Therefore, the multipleanchorsonetarget scenario here is of practical interest. We can even consider a case with a moving anchor, in which a ranging signal is periodically transmitted by the target node, and all the positions where the moving anchor receives the ranging signal are viewed as the fixed positions of some virtual anchors. We assume that all the anchors are synchronized, and their clock skews are equal to 1, whereas the clock of the target node runs freely. Furthermore, we assume that the target node transmits a ranging signal, and all the anchors act as receivers. We remark that other systems may share the same data model such as a passive sensor array for source localization or a GPS system, where a GPS receiver locates itself by exploring the received ranging signals from several satellites [1]. All the satellites are synchronized to an atomic clock, but the GPS receiver has a clock offset relative to the satellite clock. Note that this is a stricter synchronization requirement than ours, as we allow the clock of the target node to run freely. Every satellite sends a ranging signal and a corresponding transmission time. The GPS receiver measures the TOAs, and calculates the timeofflight (TOF) plus an unknown offset. In this section, TOA measurements are used, and TDOA measurements are employed in the next section.
2.1. System model
In this section, all localization algorithms are based on TOA measurements. When the target node transmits a ranging signal, all the anchors receive it and record a timestamp upon the arrival of the ranging signal independently. We define a vector u of length M to collect all the distances corresponding to the timestamps, which is given by u = [u_{1}, u_{2}, . . ., u_{ M }]^{T}. We employ b to denote the distance corresponding to the true target node transmission instant, which is unknown. We remark that if we consider a GPS system, then u collects the distances corresponding to the biased TOFs calculated by the GPS receiver, and b indicates the distance bias corresponding to the unknown clock offset of the GPS receiver relative to the satellite. Consequently, the TOA measurements can be modeled as
where d = [d_{1}, d_{2}, ..., d_{M}]^{T}, with d_{ i }= x_{ i } x the true distance between the i th anchor node and the target node, and n = [n_{1}, n_{2}, ..., n_{ M }]^{T}with n_{ i }the distance error term corresponding to the TOA measurement error at the i th anchor, which can be modeled as a random variable with zero mean and variance ${\sigma}_{i}^{2}$, and which is independent of the other terms (E[n_{ i }n_{ j }] = 0, i ≠ j). We remark that instead of using TDOAs to directly get rid of the distance bias, we use TOAs and take the bias into account in the system model.
2.2. Localization based on squared TOA measurements
2.2.1. Proposed localization algorithms
Note that (1) is a nonlinear equation with respect to (w.r.t.) x. To solve it, a MLE can be derived, which is optimal in the sense that for a large number of data it is unbiased and approaches the CRB. However, the MLE has a high computational complexity, and also requires the unknown noise statistics. Therefore, lowcomplexity solutions are of great interest for localization. From ${\u2225{\mathbf{x}}_{i}\mathbf{x}\u2225}^{2}={\u2225{\mathbf{x}}_{i}\u2225}^{2}2{\mathbf{x}}_{i}^{T}\mathbf{x}+{\u2225\mathbf{x}\u2225}^{2}$, we derive that $\mathbf{d}\odot \mathbf{d}={\psi}_{a}2{\mathbf{X}}_{a}^{T}\mathbf{x}+{\u2225\mathbf{x}\u2225}^{2}{\mathbf{1}}_{M}$, where ${\psi}_{a}={\left[{\u2225{\mathbf{x}}_{1}\u2225}^{2},{\u2225{\mathbf{x}}_{2}\u2225}^{2},\dots ,{\u2225{\mathbf{x}}_{M}\u2225}^{2}\right]}^{T}$. Elementwise multiplication at both sides of (1) is carried out, which leads to
Moving knowns to one side and unknowns to the other side, we achieve
where m = (2d ⊙ n + n ⊙ n). The stochastic properties of m are as follows
where we ignore the higher order noise terms to obtain (5) and assume that the noise mean E[[m]_{ i }] ≈ 0 under the condition of sufficiently small measurement errors. Note that the noise covariance matrix Σ depends on the unknown d.
Defining ϕ= ψ_{ a }u ⊙ u, y = [x^{T}, b, b^{2}  x^{2}]^{T}, and $\mathbf{A}=\left[2{\mathbf{X}}_{a}^{T},2\mathbf{u},{\mathbf{1}}_{M}\right]$, we can finally rewrite (3) as
Ignoring the parameter relations in y, an unconstrained LS and WLS estimate of y can be computed respectively given by
and
where W is a weighting matrix of size M × M. Note that M ≥ l + 2 is required in (7) and (8), which indicates that we need at least four anchors to estimate the target position on a plane. The optimal W is W* = Σ^{1}, which depends on the unknown d as we mentioned before. Thus, we can update it iteratively, and the resulting iterative WLS can be summarized as follows:

(1)
Initialize W using the estimate of d based on the LS estimate of x;

(2)
Estimate ŷ using (8);

(3)
Update $\mathbf{W}={\widehat{\mathbf{\Sigma}}}^{1}$ where $\widehat{\mathbf{\Sigma}}$ is computed using ŷ ;

(4)
Repeat Steps (2) and (3) until a stopping criterion is satisfied.
The typical stopping criteria are discussed in [24]. We stop the iterations when $\u2225{\widehat{\mathbf{y}}}^{\left(k+1\right)}{\widehat{\mathbf{y}}}^{\left(k\right)}\u2225\le \epsilon $, where ŷ^{(k)}is the estimate of the k th iteration and ϵ is a given threshold [25]. An estimate of x is finally given by
To accurately estimate y, we can further explore the relations among the parameters in y. A CWLS estimator is obtained as
subject to
where $\rho ={\left[{\mathbf{0}}_{l+1}^{T},1\right]}^{T}$ and
Solving the CWLS problem is equivalent to minimizing the Lagrangian [4, 10]
where λ is a Lagrangian multiplier. A minimum point for (13) is given by
where λ is determined by plugging (14) into the following equation
We could find all the seven roots of (15) as in [4, 10], or employ a bisection algorithm as in [26] to look for λ instead of finding all the roots. If we obtain seven roots as in [4, 10], we discard the complex roots, and plug the real roots into (14). Finally, we choose the estimate ŷ , which fulfills (10). The details of solving (15) are mentioned in Appendix 1. Note that the proposed CWLS estimator (14) is different from the estimators in [4, 10]. The CLS estimator in [4] is based on TDOA measurements, and the CWLS estimator in [10] is based on TOA measurements for a synchronous target (b = 0). Furthermore, we remark that the WLS estimator proposed in [27] based on the same data model as (1), is labeled as an extension of Bancroft's algorithm [28], which is actually similar to the sphericalintersection (SX) method proposed in [29] for TDOA measurements. It first solves a quadratic equation in b^{2} x^{2}, and then estimates x and b via a WLS estimator. However, it fails to provide a solution for the quadratic equation under certain circumstances, and performs unsatisfactorily when the target node is far away from the anchors [29].
Many research works have focused on LS solutions ignoring the constraint (11) in order to obtain lowcomplexity closedform estimates [7]. As squared range (SR) measurements are employed, we call them unconstrained SRbased LS (USRLS) approaches, to be consistent with [26]. Because only x is of interest, b and b^{2}  x^{2} are nuisance parameters. Different methods have been proposed to get rid of them instead of estimating them. A common characteristic of all these methods is that they have to choose a reference anchor first, and thus we label them referencebased USRLS (REFBUSRLS) approaches. As a result, the performance of these REFBUSRLS methods depends on the reference selection [7]. However, note that the unconstrained LS estimate of y in (7) does not depend on the reference selection. Thus, we call (7) the referencefree USRLS (REFFUSRLS) estimate, (8) the REFFUSRWLS, and (14) the REFFSRCWLS estimate.
Moreover, we propose the subspace minimization (SM) method [22] to achieve a REFFUSRLS estimate of x alone, which is identical to $\widehat{\mathbf{x}}$ in (7), but shows more insight into the links among different estimators. Treating b and b^{2}  x^{2} as nuisance parameters, we try to get rid of them by orthogonal projections instead of random reference selection. We first use an orthogonal projection $\mathbf{P}={\mathbf{I}}_{M}\frac{1}{M}{\mathbf{1}}_{M}{\mathbf{1}}_{M}^{T}$ of size M × M onto the orthogonal complement of 1_{ M }to eliminate (b^{2}  x^{2}) 1_{ M }. Sequentially, we employ a second orthogonal projection P_{ u }of size M × M onto the orthogonal complement of Pu to cancel 2b Pu, which is given by
Thus, premultiplying (3) with P_{ u }P, we obtain
which is linear w.r.t. x. The price paid for applying these two projections is the loss of information. The rank of P_{ u }P is M  2, which means that M ≥ l + 2 still has to be fulfilled as before to obtain an unconstrained LS or WLS estimate of x based on (17). In a different way, P_{ u }P can be achieved directly by calculating an orthogonal projection onto the orthogonal complement of [1_{ M },u]. Let us define the nullspace $\mathcal{N}\left({\mathbf{U}}^{T}\right)=\text{span}\left({\mathbf{1}}_{M},\mathbf{u}\right)$, and $\mathcal{R}\left(\mathbf{U}\right)\oplus \mathcal{N}\left({\mathbf{U}}^{T}\right)={\mathbb{R}}^{M}$, where $\mathcal{R}\left(\mathbf{U}\right)$ is the column space of U, ⊕ denotes the direct sum of two linearly independent subspaces and ℝ^{M}is the Mdimensional vector space. Therefore, P_{ u }P is the projection onto $\mathcal{R}\left(\mathbf{U}\right)$. Note that the rank of ${\mathbf{P}}_{u}{\mathbf{PX}}_{a}^{T}$ has to be equal to l, which indicates that the anchors should not be colinear for both 2D and 3D or coplanar for 3D. A special case occurs when u = k 1_{ M }, where k is any positive real number. In this case, P can cancel out both (b^{2}  x^{2})1_{ M }and 2b u, and one projection is enough, leading to the condition M ≥ l + 1. The drawback though is that we can then only estimate x and b^{2}  x^{2} 2bk due to the dependence between u and 1_{ M }according to (3). The SM method indicates all the insights mentioned above, which cannot be easily observed by the unconstrained estimators.
Based on (17), the LS and WLS estimate of x is respectively given by,
and
where Q is an aggregate weighting matrix of size M × M. The optimal Q is given by
where the pseudoinverse (†) is employed, because the argument is rank deficient. Note that P_{ u }P is the projection onto $\mathcal{R}\left(\mathbf{U}\right)$, and is applied to both sides of Σ. Thus, (P_{ u }PΣPP_{ u })^{†} is still in $\mathcal{R}\left(\mathbf{U}\right)$, and would not change with applying the projection again. As a result, we can simplify (20) as (21). Consequently, Q* is the pseudoinverse of the matrix obtained by projecting the columns and rows of Σ onto $\mathcal{R}\left(\mathbf{U}\right)$, which is of rank M  2. We remark that $\widehat{\mathbf{x}}$ in (18) (or (19)) is identical to the one in (7) (or (8)) according to [22]. The SM method and the unconstrained LS (or WLS) method lead to the same result. Therefore, $\widehat{\mathbf{x}}$ in (18) and (7) (or in (19) and (8)) are all REFFUSRLS (or REFFUSRWLS) estimates.
2.2.2. Revisiting existing localization algorithms
As we mentioned before, all the REFBUSRLS methods suffer from a poor reference selection. There are some efforts to improve the reference selection [16–18]. In [16], the operation employed to cancel x^{2}1_{ M }is equivalent to the orthogonal projection P. All anchors are chosen as a reference once in [17] in order to obtain M(M  1)/2 equations in total. A reference anchor is chosen based on the criterion of the shortest anchortarget distance measurement in [18]. However, referencefree methods are better than these heuristic referencebased methods in the sense that they cancel nuisance parameters in a systematic way. To clarify the relations between the REFBUSR and the REFFUSR approaches, we generalize the reference selection of all the referencebased methods as a linear transformation, which is used to cancel nuisance parameters, similarly as an orthogonal projection. To eliminate (b^{2}  x^{2})1_{ M }, the i th anchor is chosen as a reference to make differences. As a result, the corresponding linear transformation T_{ i }of size (M  1) × M can be obtained by inserting the column vector 1_{M1}after the (i1)th column of I_{M1}, which fulfills T_{ i }1_{ M }= 0_{M1}, i ∈ {1,..., M}. For example, if the first anchor is chosen as a reference, then T_{1} = [1_{M1}, I_{M1}]. Furthermore, we can write T_{ i }d = T_{i 1}d  d_{ i }1_{m 1}, where T_{i 1}is achieved by replacing the i th column of T_{ i }with the column vector 0_{M 1}. Applying T_{ i }to both sides of (3), we arrive at
Sequentially, we investigate the second linear transformation M_{ j }of size (M  2) × (M  1), which fulfills M_{ j }T_{ i }u = 0_{M2}, j ∈ {1,..., M} and j ≠ i. As a result, the nullspace $\mathcal{N}\left({\mathbf{M}}_{j}{\mathbf{T}}_{i}\right)=\text{span}\left({\mathbf{1}}_{M},\mathbf{u}\right)=\mathcal{N}\left({\mathbf{U}}^{T}\right)$, and $\mathcal{R}\left({\mathbf{T}}_{i}^{T}{\mathbf{M}}_{j}^{T}\right)=\mathcal{R}\left(\mathbf{U}\right)$. Note that b = 0 in [7, 16–18, 22, 26], which means that there is no need to apply M_{ j }in these works. But the double differencing method in [15] is equivalent to employing M_{ j }, and thus the results of [15] can be used to design M_{ j }. Let us first define a matrix ${\stackrel{\u0304}{\mathbf{T}}}_{j1}$ of size (M  2) × (M  1) similarly as T_{i 1}using the column vector 0_{M 2}instead of 0_{M 1}. When the j th anchor is chosen as a reference and j < i, M_{ j }can be obtained by inserting the column vector (1/(u_{ j } u_{ i }))1_{M2}after the (j  1)th column of the matrix $\text{diag}\left({\stackrel{\u0304}{\mathbf{T}}}_{j1}\left({\mathbf{1}}_{M1}\oslash \left({\mathbf{T}}_{i}\mathbf{u}\right)\right)\right)$, where ∅ is elementwise division. If j > i, then M_{ j }can be obtained by inserting the column vector (1/(u_{ j } u_{ i }))1_{M2}after the (j  2)th column of the matrix $\text{diag}\left({\stackrel{\u0304}{\mathbf{T}}}_{\left(j1\right)1}\left({\mathbf{1}}_{M1}\oslash \left({\mathbf{T}}_{i}\mathbf{u}\right)\right)\right)$. For example, if the first anchor is chosen to cancel out (b^{2}  x^{2}) 1_{ M }(T_{1} is used), and the second anchor is chosen to eliminate T_{1}u, then M_{2} is given by
Premultiplying M_{ j }T_{ i }to both sides of (3), we achieve
Consequently, the general form of the REFBUSRLS and the REFBUSRWLS estimates are derived in the same way as (18) and (19) by replacing PP_{ u }P and Q with ${\mathbf{T}}_{i}^{T}{\mathbf{M}}_{j}^{T}{\mathbf{M}}_{j}{\mathbf{T}}_{i}$ and Q_{ i,j }, respectively. We do not repeat these equations for the sake of brevity. Note that Q_{i,j}is an aggregate weighting matrix of size M × M. The optimal Q_{i,j}is given by
where ${\left({\mathbf{M}}_{j}{\mathbf{T}}_{i}\right)}^{\u2020}{\mathbf{M}}_{j}{\mathbf{T}}_{i}={\mathbf{T}}_{i}^{T}{\mathbf{M}}_{j}^{T}{\left({\mathbf{T}}_{i}^{T}{\mathbf{M}}_{j}^{T}\right)}^{\u2020}={\mathbf{T}}_{i}^{T}{\mathbf{M}}_{j}^{T}{\left({\mathbf{M}}_{j}{\mathbf{T}}_{i}{\mathbf{T}}_{i}^{T}{\mathbf{M}}_{j}^{T}\right)}^{1}{\mathbf{M}}_{j}{\mathbf{T}}_{i}$, which is also the projection onto $\mathcal{R}\left(\mathbf{U}\right)$, and thus is equivalent to P_{ u }P. The equality between (25) and (26) can be verified using a property of the pseudoinverse.^{b} Hence, ${\mathbf{Q}}_{i,j}^{*}$ is of rank M  2, and ${\mathbf{Q}}_{i,j}^{*}={\mathbf{Q}}^{*},i,j\in \left\{1,\dots ,M\right\}$ with i ≠ j. As a result, the REFBUSRWLS estimate and the REFFUSRWLS estimate are identical if the optimal weighting matrix is used. Hence, the optimal weighting matrix can compensate the impact of random reference selection. However, since Σ depends on the unknown d, the optimal weighting matrix can only be approximated iteratively. Also note that the REFBUSRLS estimate suffers from the adhoc reference selection, while the REFFUSRLS estimate is independent of the reference selection.
2.3. Localization based on squared differences of TOA measurements
2.3.1. Proposed localization algorithms
Let us recall (1) here, i.e.,
In general, b is regarded as a nuisance parameter. Instead of first carrying out elementwise multiplication at both sides of (27), we can also try to get rid of b before elementwise multiplication. By choosing a reference anchor, and then subtracting the TOAs of other anchors from the TOA of the reference anchor [7], M  1 TDOAs are obtained and b is canceled out. Note that these TDOAs are achieved differently from the TDOAs obtained directly by crosscorrelating the received signals from different anchors. The obvious drawback of this conventional scheme is again the reference dependency. On the other hand, since b is a common term in (1), we can again apply P to eliminate b 1_{ M }instead of randomly choosing a reference anchor. Then we arrive at
Note that $\mathbf{Pu}=\mathbf{u}\u016b{\mathbf{1}}_{M}$, where ū is the average TOA. Thus, Pu represents the differences between the anchor TOAs and the average TOA. Moreover, $\mathbf{Pd}=\mathbf{d}\stackrel{\u0304}{d}{\mathbf{1}}_{M}$, where $\stackrel{\u0304}{d}=\frac{1}{M}{\sum}_{i=1}^{M}{d}_{i}$ is the unknown average of the distances between the target node and the anchors, and $\mathbf{Pn}=\mathbf{n}\stackrel{\u0304}{n}{\mathbf{1}}_{M}$, where $\stackrel{\u0304}{n}=\frac{1}{M}{\sum}_{i=1}^{M}{n}_{i}$. Thus, (28) can be rewritten as
By making elementwise multiplication of (29) and rearranging all the terms, we achieve
where ψ_{ a }= [x_{1}^{2}, x_{2}^{2},..., x_{ M }^{2}]^{T}and m = (2d ⊙ n + n ⊙ n) as before. Using the SM method to obtain an unconstrained LS estimate of x alone, we employ again two projections P and P_{ u }, and arrive at
the right hand side of which is exactly the same as the one in (17), and thus we can state P_{ u }P(ψ_{ a } (Pu) ⊙ (Pu)) = P_{ u }P ϕ. Note that although (30) is different from (3), we find that (31) and (17) become equivalent after premultiplying P_{ u }P. Furthermore, (Pu) ⊙ (Pu) can be labeled as a SR difference (SRD) term. As a result, the unconstrained LS and WLS estimate of x based on (31), which are named the referencefree USRDLS (REFFUSRDLS) estimate and the REFFUSRDWLS estimate, are exactly the same as the REFFUSRLS estimate (18) and the REFFUSRWLS estimate (19), respectively. We do not repeat them here in the interest of brevity. Moreover, the constrained LS and WLS based on (30), namely the REFFSRDCLS estimate and the REFFSRDCWLS estimate, are identical to the REFFSRCLS and the REFFSRCWLS estimate (14) as well.
2.3.2. Revisiting existing localization algorithms
Existing methods choose a reference anchor to obtain range differences, and further investigate lowcomplexity closedform LS or WLS solutions. Thus, we call them referencebased USRDLS (REFBUSRDLS) and REFBUSRDWLS approaches. To expose interesting links among the different referencebased or referencefree SRbased or SRDbased approaches, we generalize the conventional REFBUSRDLS and REFBUSRDWLS approaches [7] in the same way as in Section 2.2.2. The reference selection can be generalized by a linear transformation similarly as in Section 2.2.2. In order to eliminate b 1_{ M }in (27), the i th anchor is chosen as a reference, thus T_{ i }defined in Section 2.2.2 is employed, which fulfills T_{ i }1_{ M }= 0_{M1}. Applying T_{ i }instead of P to (27), following the same operations to obtain (30), and noting that (T_{i 1}(d + n)) ⊙ (T_{i 1}(d + n)) = T_{i 1}((d + n) ⊙ (d + n)), we arrive at
which is different from (30), and has only one nuisance parameter d_{ i }at the right hand side. Ignoring the relation between x and d_{ i }, we still have two ways to deal with d_{ i }. The first one is to estimate x and d_{ i }together [22], which means we only use a reference once for calculating the TDOAs. The second one is again to apply M_{ j }, which fulfills M_{ j }T_{ i }u = 0_{M 2}. It employs two different references, one for calculating the TDOAs, and the other for eliminating the nuisance parameter. In order to distinguish these two, we call them the REFBUSRDLS(1) and the REFBUSRDLS(2) estimate, respectively, where the number between brackets indicates the number of references used in the approach. In the same way as we clarified the equivalence between the REFFUSRDLS and the REFFUSRLS estimate in the previous subsection, we can easily confirm the equivalence between the REFBUSRDLS(2) (or the REFBUSRDWLS(2)) and the REFBUSRLS (or the REFBUSRWLS) estimate of Section 2.2.2. We omit the details for the sake of brevity. Furthermore, we recall that similarly as above we could have dealt with 2b T_{ i }u in (22) in two different ways. But since b = 0 in [7, 16–18, 22, 26], there are no discussions about these two different ways in literature, and we do not distinguish between them in the REFBUSRLS method.
Since there is no counterpart of the REFBUSRDLS(1) estimate in Section 2.2.2 for the SRbased methods, we briefly discuss the REFBUSRDLS(1) estimate to complete the investigation of the links among all the estimators based on TOA measurements. Employing the SM method, we again use an orthogonal projection P_{ i }of size (M  1) × (M  1) onto the orthogonal complement of T_{ i }u to fulfill P_{ i }T_{ i }u = 0_{M 1}, which can be derived in the same way as (16) by replacing I_{ M }and Pu with I_{M1}and T_{ i }u, respectively. As a result, $\mathcal{N}\left({\mathbf{P}}_{i}{\mathbf{T}}_{i}\right)=\text{span}\left({\mathbf{1}}_{M},\mathbf{u}\right)=\mathcal{N}\left({\mathbf{U}}^{T}\right)$ and $\mathcal{R}\left({\mathbf{T}}_{i}^{T}{\mathbf{P}}_{i}\right)=\mathcal{R}\left(\mathbf{U}\right)$. Premultiplying (32) with P_{ i }, we obtain
Note that P_{ i }((T_{ i }u) ⊙ (T_{ i }u)) = P_{ i }T_{ i }(u ⊙ u) (see Appendix 2 for a proof), and thus we can state P_{ i }T_{ i ψ a }P_{i} ((T_{i}u) ⊙ (T_{ i }u)) = P_{ i }T_{ i ϕ }). Consequently, the REFBUSRDLS(1) and the REFBUSRDWLS(1) estimates can also be written as (18) and (19) by replacing PP_{ u }P and Q with ${\mathbf{T}}_{i}^{T}{\mathbf{P}}_{i}{\mathbf{T}}_{i}$ and Q_{ i }, respectively. We do not repeat the equations in the interest of brevity. We remark that Q_{ i }is again an aggregate weighting matrix of size M × M, and the optimal Q_{ i }of rank (M  2) is given by
where V_{ i }is of size M × (M  2), and collects the right singular vectors corresponding to the M  2 nonzero singular values of P_{ i }T_{ i }. We derive (35) in Appendix 3, and prove that ${\mathbf{V}}_{i}{\mathbf{V}}_{i}^{T}$ is the projection onto $\mathcal{R}\left(\mathbf{U}\right)$. As a result, ${\mathbf{Q}}_{i}^{*}={\mathbf{Q}}_{i,j}^{*}={\mathbf{Q}}^{*},i,j\phantom{\rule{2.77695pt}{0ex}}\in \left\{1,\dots ,M\right\}$ and i ≠ j.
Based on the above discussions, we achieve the important conclusion that the REFFUSRDWLS, the REFBUSRDWLS(1), the REFBUSRDWLS(2), the REFFUSRWLS, and the REFBUSRWLS estimate are all identical if the optimal weighting matrix is adopted. The optimal weighting matrix releases the referencebased methods from the influence of a random reference selection. Moreover, the REFFUSRLS and the REFFUSRDLS estimate are identical, and free from a reference selection, whereas the REFBUSRLS and the REFBUSRDLS(2) estimate are equivalent, but still suffer from a poor reference selection.
To further improve the localization accuracy, a constrained WLS estimate based on (32) can be pursued considering the relation between x and d_{ i }similarly as in [26]. We call it the referencebased SRD CWLS (REFBSRDCWLS) estimate. Denoting $\mathbf{z}={\left[{\mathbf{x}}^{T},{d}_{i}\right]}^{T},{\mathbf{B}}_{i}=2{\mathbf{T}}_{i}\left[{\mathbf{X}}_{a}^{T},\mathbf{u}\right]$ and ϱ_{ i }= T_{ i }ψ_{ a } (T_{ i }u) ⊙ (T_{ i }u), it is given by,
subject to
where W_{ i }is a weighting matrix of size (M  1) × (M  1), ${\mathbf{z}}_{i}={\left[{\mathbf{x}}_{i}^{T}\phantom{\rule{1em}{0ex}}0\right]}^{T}$ and
The method to solve this CWLS problem is proposed in [26]. We do not review it for the sake of brevity. Note that there are two constraints for (36) compared to one for (10), thus the method to solve (36) is different from the one to solve (10).
All the estimators based on TOA measurements are summarized in Tables 1, 2, and 3. They are characterized by the number of references, the reference dependency, the minimum number of anchors, and the optimal weighting matrices. We also shed light on their relations and categorize the existing methods from literature. We remark that the authors in [30] claim that the error covariance of the optimal position estimate using TOAs with a distance bias is equivalent to the one using TDOAs regardless of the reference selection, where the error covariance is defined as the product of the position dilution of precision (PDOP) and a composite userequivalent range error (UERE). However, a more appropriate indication of the localization performance is the CramérRao bound (CRB), which is a bound for unbiased estimators. Therefore, the CRB based on (1) for TOAs with a distance bias is derived in Appendix 4. Since the TDOAs in Section 2.3 are calculated by making differences of the TOAs in (1), the CRB based on these TDOAs is the same as the one based on (1).
3. Localization based on TDOA measurements
3.1. System model
Let us now focus on TDOA measurements. In passive sensor array or microphone array localization, TDOA measurements are obtained directly by crosscorrelating a pair of received signals. Thus, no correlation template is needed, and the clockoffset can be canceled out immediately. We reemphasize that these TDOA measurements are different from the TDOAs calculated by subtracting the TOAs. The data model for these TDOA measurements is given by [31]
where r_{i,j}is the TDOA measurement, which is obtained by crosscorrelating the received signal from the j th anchor with the one from the i th anchor. Note that the stochastic properties of the noise terms n_{i,j}are totally different from the ones of the noise terms n_{ i }of (1). We approximate n_{i,j}as zeromean random variables, where cov(n_{i,j}, n_{p,q}) = E[(n_{ i },_{ j }E[n_{ i },_{ j }])(n_{p,q} E[n_{p,q}])] = E[n_{ i },_{ j }n_{p,q}], i, j, p, q, ∈ {1, 2,..., M}, i ≠ j, and p ≠ q. Defining r_{ i }as the collection of the corresponding distances to the M 1 TDOA measurements using the i th anchor as a reference, r_{ i }= [r_{i,1},..., r_{i,i1}, r_{i,i+1},..., r_{i,M}]^{T}, and n_{ i }= [n_{i,1},..., n_{i,i1}, n_{i,i +1},..., n_{i,M}]^{T}as the related noise vector, we write (39) in vector form as
Moving d_{ i }1_{M1}to the other side, making an elementwise multiplication and rearranging, we achieve
where φ_{ i }= T_{ i }ψ_{ a } r_{ i }⊙ r_{ i }and m_{ i }= (2(T_{i 1}d) ⊙ n_{ i }+ n_{ i }⊙ n_{ i }). The stochastic properties of m_{ i }are as follows
where we ignore the higher order noise terms to obtain (43) and assume that the noise mean E[[m]_{ i }] ≈ 0 under the condition of sufficiently small measurement errors. Note that the noise covariance matrix Σ_{ i }of size (M  1) × (M  1) depends on the unknown d as well.
3.2. Localization based on squared TDOA measurements
We do not propose any new algorithms in this section, but summarize existing localization algorithms spread over different research areas and shed light on their relations. All these algorithms are categorized as referencebased SRD approaches. Note that (41) looks similar to (32). Only the available data and the noise characteristics are different, which leads to totally different relations among the estimators as we will show in the following paragraphs. The approach to achieve the REFBUSRDLS(1) estimate, the REFBUSRDLS(2) estimate and the REFBSRDCWLS estimate (36) based on TOA measurements in Section 2.3.2 can be adopted here as well. The orthogonal projection ${\tilde{\mathbf{P}}}_{i}$ of size (M  1) × (M  1) onto the complement of r_{ i }is employed, which is given by (16), where we replace I_{ M }and Pu with I_{M1}and r_{ i }. Let us define the nullspace $\mathcal{N}\left({\tilde{\mathbf{U}}}_{i}^{T}\right)=\text{span}\left({\mathbf{r}}_{i}\right)$, and $\mathcal{R}\left({\tilde{\mathbf{U}}}_{i}\right)\oplus \mathcal{N}\left({\tilde{\mathbf{U}}}_{i}^{T}\right)={\mathbb{R}}^{M1}$. Therefore, ${\tilde{\mathbf{P}}}_{i}$ is the projection onto $\mathcal{R}\left({\tilde{\mathbf{U}}}_{i}\right)$. As a result, the REFBUSRDLS(1) and REFBUSRDWLS(1) estimate based on TDOA measurements is respectively given by,
and
where ${\tilde{\mathbf{Q}}}_{i}$ is an aggregate weighting matrix of size (M  1) × (M  1) as well. Note that (44) (or (45)) differs from (18) (or (19)) since M  1 TDOA measurements are used instead of M TOA measurements. The optimal ${\tilde{\mathbf{Q}}}_{i}$ is given by
where ${\tilde{\mathbf{Q}}}_{i}^{*},i\in \left\{1,\dots ,M\right\}$ is the pseudoinverse of the matrix achieved by projecting the columns and rows of Σ_{ i }onto $\mathcal{R}\left({\tilde{\mathbf{U}}}_{i}\right)$, which is of rank M  2. We remark that the REFBUSRDLS(1) estimate (44) is equivalent to the ones in [22, 32].
Let us also revisit the REFBUSRDLS(2) estimate and the REFBUSRDWLS(2) estimate based on TDOA measurements. A linear transformation ${\tilde{\mathbf{M}}}_{j}$ of size (M  2) × (M  1), which fulfills ${\tilde{\mathbf{M}}}_{j}{\mathbf{r}}_{i}={\mathbf{0}}_{M2}$, can be devised in the same way as M_{ j }by replacing T_{ i }u and 1/(u_{ j }u_{ i }) with r_{ i }and 1/r_{i,j}, respectively. Thus, $\mathcal{R}\left({\tilde{\mathbf{M}}}_{j}^{T}\right)=\mathcal{R}\left({\tilde{\mathbf{U}}}_{i}\right)$. Note that another heuristic method to obtain ${\tilde{\mathbf{M}}}_{j}$ is proposed in [20]. As a result, the general form of the REFBUSRDLS(2) and the REFBUSRDWLS(2) estimates can be derived in the same way as (44) and (45) by replacing ${\tilde{\mathbf{P}}}_{i}$ and ${\tilde{\mathbf{Q}}}_{i}$ with ${\tilde{\mathbf{M}}}_{j}^{T}{\tilde{\mathbf{M}}}_{j}$ and ${\tilde{\mathbf{Q}}}_{i,j}$, respectively. Note that ${\tilde{\mathbf{Q}}}_{i,j}$ is also an aggregate weighting matrix of size (M  1) × (M  1). The optimal ${\tilde{\mathbf{Q}}}_{i,j}^{*}$ is given by
where ${\left({\tilde{\mathbf{M}}}_{j}\right)}^{\u2020}{\tilde{\mathbf{M}}}_{j}={\tilde{\mathbf{M}}}_{j}^{T}{\left({\tilde{\mathbf{M}}}_{j}^{T}\right)}^{\u2020}={\tilde{\mathbf{M}}}_{j}^{T}{\left({\tilde{\mathbf{M}}}_{j}{\tilde{\mathbf{M}}}_{j}^{T}\right)}^{1}{\tilde{\mathbf{M}}}_{j}$ is also the projection onto $\mathcal{R}\left({\tilde{\mathbf{U}}}_{i}\right)$, which means that ${\tilde{\mathbf{Q}}}_{i,j}^{*}={\tilde{\mathbf{Q}}}_{i}^{*},i,j\in \left\{1,\dots ,M\right\}$ and i ≠ j. The REFBUSRDLS(2) estimate and the REFBUSRDWLS(2) estimate based on TDOA measurements are generalizations of the estimators proposed in [20]. However, the noise covariance matrix in [20] is a diagonal matrix, and the noise covariance matrix Σ_{ i }here is a full matrix.
We remark here that with the optimal weighting matrix, the REFBUSRDWLS(1) estimate (45) and the REFBUSRDWLS(2) estimate based on the same set of TDOA measurements are identical. However, the optimal weighting matrix cannot decouple the reference dependency. The performance of all the estimates still depends on the reference selection, since the reference dependency is an inherent property of the available measurement data. To further improve the localization performance, the REFBSRDCWLS estimate based on (41) can be derived in the same way as the estimate (36) by replacing ϱ_{ i }and B_{ i }with φ_{ i }and $2\left[{\mathbf{T}}_{i}{\mathbf{X}}_{a}^{T},{\mathbf{r}}_{i}\right]$, respectively. A solution to this CLS problem is presented in [26].
Note that all the above estimators are based on a socalled nonredundant set of TDOA measurements [31], resulting in reference dependency. Recently, a SM method based on the full set of TDOA measurements has been proposed in [33], labeled "referencefree TDOA source localization". It is referencefree in the sense that every anchor plays the role of reference, as in [17], thus there is no need to specifically choose one. We revisit the proposed method in [33] here to clarify its relation to our framework. Let us define ${\mathbf{D}}_{r}=\left[{\tilde{\mathbf{r}}}_{1},{\tilde{\mathbf{r}}}_{1},\dots ,{\tilde{\mathbf{r}}}_{M}\right]$, where ${\tilde{\mathbf{r}}}_{i}$ can be achieved by inserting a 0 in r_{ i }between r_{i,i1}and r_{i,i+1}. Using our notations, we can rewrite (22) of [33] as
Then, a matrix G of size (M  2) × M, which fulfills GD_{ r }= 0_{M2}, can be obtained by exploring the nullspace of D_{ r }using the singular value decomposition (SVD). Consequently, an LS estimator of x is given by
Note that ${\mathbf{D}}_{r}=\left[\mathbf{d},{\mathbf{1}}_{M}\right]\left[\begin{array}{c}{\mathbf{1}}_{M}^{T}\hfill \\ {\mathbf{d}}^{T}\hfill \end{array}\right]$ without noise, and GD_{ r }= 0_{M 2}. Thus, 1_{ M }is in the nullspace of G. As P is the projection onto the orthogonal complement of 1_{ M }, GP is still of rank M  2 with probability 1. In a different way, we can make use of the full set of TDOA measurements similarly as the second extension of the approach proposed in [32]. We collect (41) in vector form as
As a result, a LS estimator of x and d can be derived based on (52). We do not detail it in the interest of brevity.
Furthermore, as indicated in [31], an optimal nonredundant set can be achieved by the optimum conversion of the full TDOA set in order to approach the same localization performance, and the use of this optimal nonredundant set is recommended to reduce the complexity. Because [31] relies on the assumption that the received signals at the anchors are corrupted by noise with equal variances, the optimal nonredundant set can be estimated by a LS estimator. This is not the case here however, where it should be estimated by a WLS estimator, which requires the knowledge of the stochastic properties of the noise.
We summarize the characteristics of all the estimators based on TDOA measurements in Table 4. With the nonredundant TDOA measurement set of length M  1, the estimator performance suffers from a poor reference selection. Although the performance improves with the full set or the optimal nonredundant set, it first has to measure the full set of TDOAs of length M(M  1)/ 2.
4. Numerical results
4.1. Noise statistics
In order to make a fair comparison between the localization performance of the different estimators using TOA measurements and TDOA measurements, we derive the statistics of n_{ i }and n_{i,j}based on the same received signal models. The received signal is modeled by [33]
where N is the number of samples, κ is a constant parameter, s(n) is the source signal, and e_{ i }(n) and τ_{ i }are respectively the additive noise and the delay at the i th node. We assume that s(n) is a zeromean white sequence with variance ${\sigma}_{s}^{2}$, and e_{ i }(n) is also a zeromean white sequence with variance ${\sigma}_{e}^{2}$, independent from the other noise sequences and s(n).
For the TOAbased approaches, we assume knowledge of the template s(n), and estimate τ_{ i }by crosscorrelating the received signal with the clean template:
Since there is an unknown bias due to asynchronous nodes, the distance u_{ i }corresponding to the timestamp is modeled as ${u}_{i}=c{\widehat{\tau}}_{i}={d}_{i}+b+{n}_{i}$, where c is the signal propagation speed. The statistical properties of n_{ i }can be derived in a similar way as in [31], and are given by
where $\text{SNR}={\sigma}_{s}^{2}/{\sigma}_{e}^{2}$. We remark that in reality, it is very difficult to obtain a clean template, since there are various kinds of error sources, such as multipath fading, antenna mismatch, pulse distortion, etc. Plugging (55) and (56) into (5), the entries of the covariance matrix Σ are given by
On the other hand, the TDOA estimates can be achieved by crosscorrelating two received signals as follows
Thus, the estimate of the distance difference is ${r}_{i,j}=c{\widehat{\tau}}_{i,j}={d}_{j}{d}_{i}+{n}_{i,j}$, where the bias is canceled out naturally. The statistical properties of n_{i,j}can also be derived in a similar way as in [31, 33], and are given by
Note that similarly as in [33] the signal attenuation is taken into account in order to obtain more general noise statistics than in [31], but we correct the derivation errors in [33]. We remark that in reality, the TDOA estimates may face similar problems as the TOA estimates, since the received signals at different anchors may be totally different. Plugging (59) and (60) into (43), the entries of the covariance matrix Σ_{ i }are given by
In the simulations, we generate n_{ i }and n_{i,j}as zeromean Gaussian random variables with covariance matrices specified as above.
4.2. Performance evaluation
As a welladopted lower bound, the CRB is derived for localization estimators based on TOA measurements and TDOA measurements, respectively. Note that the estimators derived in this paper are biased. We remark that although the CRB is a bound for unbiased estimators, it still is interesting to compare it with the proposed biased estimators. Here, we exemplify the CRBs for location estimation on a plane, e.g., we take l = 2. We assume that n_{ i }and n_{i,j}are Gaussian distributed. The Fisher information matrix (FIM) I_{1}(θ) based on model (1) in Section 2 for TOA measurements is derived in Appendix 4, where θ= [x^{T}, b]^{T}, and x = [x_{1}, x_{2}]^{T}. Consequently, we obtain $\text{CRB}\left({x}_{1}\right)={\left[{\mathbf{I}}_{1}^{1}\left(\theta \right)\right]}_{1,1}$. We observe that b is not part of ${\mathbf{I}}_{1}^{1}\left(\theta \right)$. Therefore, no matter how large b is, it has the same influence on the CRB for TOA measurements. The FIM I_{2}(x) and I_{3}(x) based on model (39) in Section 3 are derived in Appendix 5 for the nonredundant set and the full set of TDOA measurements, respectively.
We consider three simulation setups. In Setups 1 and 2, eight anchors are evenly located on the edges of a 100 m × 100 m rectangular. Meanwhile the target node is located at [200 m, 30 m] and [10 m, 20 m] for Setups 1 and 2, respectively. Thus, the target node is far away from the anchors in Setup 1, but close to them in Setup 2. In Setup 3, all anchors and the target node are randomly distributed on a grid with cells of size 1 m × 1 m inside the rectangular. The performance criterion is the root mean squared error (RMSE) of $\widehat{\mathbf{x}}$ versus a reference range $\left(\text{SN}{\text{R}}_{r}=\frac{N{\pi}^{2}{\kappa}^{2}}{3{c}^{2}}\text{SNR}\right)$, which can be expressed as $\sqrt{1/{N}_{exp}{\sum}_{j=1}^{{N}_{exp}}\left\right{\widehat{\mathbf{x}}}^{\left(j\right)}\mathbf{x}{}^{2}}$, where ${\widehat{\mathbf{x}}}^{\left(j\right)}$ is the estimate obtained in the j th trial. Each simulation result is averaged over N_{exp} = 1,000 Monte Carlo trials. The bias b corresponding to the clock offset is randomly generated in the range of [0 m, 100 m] in each Monte Carlo run. We would like to compare all the REFF and REFB estimators, as well as the estimator proposed in [27] (first iteration) using TOA measurements, labeled the LS1 estimator, and the estimator proposed in [33] using the full TDOA set, namely the REFFLS2 estimator.
4.2.1. Estimators using TOA measurements
Figure 1 shows the localization performance of the REFF estimators using TOA measurements under the three considered setups. The ${\mathbf{I}}_{1}^{1}\left(\theta \right)$ (the dotted line with "×" markers) is used as a benchmark. The REFFUSRWLS estimator (8) with the optimal weighting matrix (the solid line with "+" markers) achieves the best performance, while the iterative approach to update the weighting matrix (the solid line with "◊" markers) also helps the REFFUSRWLS estimator to converge to the best performance. The REFFSRCLS estimator (14) (the solid line with "○" markers) benefits from the constraints, and thus outperforms the REFFUSRLS estimator (7) (the solid line with "*" markers). The concrete value of the bias b does not influence the localization performance. The curve of the REFFUSRLS estimator with fixed b (the solid line with "∇" markers) and the one with random b overlap. Furthermore, the LS1 estimator [27] (the solid line with "□" markers) is sensitive to the geometry. It performs better than the REFFUSRLS estimator in Setup 2, but worse in Setup 1. This observation is consistent with the one in [19]. In Setup 3 (random geometry), it fails under some cases due to its inherent instability, and performs unsatisfactorily.
Figure 2 compares the localization performance of the REFF with the one of the REFB estimators using TOA measurements under Setups 1 and 2. Since there are no fixed anchors in Setup 3, we skip it in the comparison. We show both the performance of the best and the worst reference selection, which indicates the performance limits of the REFB estimators. The dashed lines with "+" and "∇" markers denote the performance bounds for the REFBUSRDLS(1) and the REFBUSRDLS(2), respectively. The best reference choice for the REFBUSRDLS(1) estimator is the reference anchor with the shortest distance to the target node. Meanwhile, we do not observe the best reference pair selection for the REFBUSRDLS(2) estimator following any rules. The curves for the REFFUSRLS estimator (7) (the solid line with "*" markers) and the REFFSRCLS estimator (14) (the solid line with "○" markers) lie inside these limits. Their performances are neither too bad nor too good, but they do not suffer from a poor reference selection. As we have already proved that the optimal weighting matrix can compensate the impact of the reference selection, the curves of all the WLS estimators with optimal weights will overlap. Thus, we do not show the performance of the REFFUSRWLS estimator again, which is already illustrated in Figure 1.
4.2.2. Estimators using TDOA measurements
Let us first compare the CRBs employing different measurements in Figure 3. We observe the same tendency for both Setups 1 and 2. All the CRBs overlap above a specific SNR_{r} threshold, which is 55 dB for Setup 1, and 50dB for Setup 2. Below the threshold, the CRB using TOA measurements (the solid line with "×" markers) is lower than the other CRBs. Meanwhile, the CRB using the full TDOA set (the dotted line with "×" markers) is lower than the ones using a nonredundant TDOA set (the dotted lines). The observations are consistent with the ones in [31]. On the other hand, the SNR_{r} ranges of interest corresponding to a RMSE smaller than 10^{0} = 1 m, are SNR_{r} > 60 dB and SNR_{r} > 30 dB for Setup 1 and Setup 2, respectively. Within this range of interest, there are no differences among the CRBs in Setup 1, and only small differences in Setup 2. Therefore, using different measurements would not cause obvious differences in the CRB at high SNR.
Figure 4 shows the localization performance of the REFF estimators using the full TDOA set under three setups. The CRB ${\mathbf{I}}_{3}^{1}\left(\theta \right)$ (the dotted line with × markers) is still used as a benchmark. We observe similar tendencies as in Figure 1. The REFFWLS estimator based on (52) with the optimal weighting matrix (the solid line with "+" markers) achieves the best performance, while the iterative approach to update the weighting matrix (the solid line with "◊" markers) also facilitates the REFFWLS estimator based on (52) to converge to the best performance. Moreover, the performance of the REFFLS2 estimator (51) [33] (the solid line with "□" markers) is slightly worse than the REFFLS estimator based on (52) (the solid line with "*" markers) in Setup 1. In general, their performances are very close. In Setup 3 (random geometry), they almost overlap with each other.
Figure 5 compares the localization performance of the REFF estimator using the full TDOA set with the one of the REFB estimators using the nonredundant TDOA set under Setups 1 and 2. Since there are no fixed anchors in Setup 3, we again skip it in the comparison. We show both the performance of the best and the worst reference selection, which indicates the performance limits of the REFB estimators. The dashed lines with "+" and "∇" markers denote the performance limits for the REFBUSRDLS(1) (44) and the REFBUSRDLS(2) estimator, respectively. The best reference choice for the REFBUSRDLS(1) estimator is again the reference anchor with the shortest distance to the target node, which means we crosscorrelate the received signal at the reference anchor with the ones at other anchors in order to achieve a nonredundant set of TDOA measurements. Meanwhile, we do not observe the best reference pair selection for the REFBUSRDLS(2) estimator following any rules either. The curves for the REFFLS estimator based on (52) (the solid line with "*" markers) and the REFFLS2 estimator (51) [33] (the solid line with "□" markers) lie inside these limits. They are very close to the lower limits in Setup 1, and in the middle of the performance band in Setup 2. The performance band of the REFBUSRDLS(1) estimator is quite narrow in Setup 2. On the other hand, the performance variation is very obvious for the REFBUSRDLS(2) estimator.
Finally, we verify the equivalence of the REFBUSRDWLS estimators with the same optimal weighting matrix in Figure 6. As we have discussed before, the optimal weighting matrix can only release the impact of the second reference selection. The first reference selection decides the obtained data set. Therefore, using the same nonredundant set of TDOAs, the curves of the REFBUSRDWLS(1) (45) (the solid lines with "◊" markers) and the REFBUSRDWLS(2) estimators (the solid lines with "+" markers) overlap. A different performance can be obtained by employing different nonredundant TDOA sets. However, similarly as the CRB, the performance converges after some SNR_{r} threshold. Finally, in Figure 7, we compare the localization performance of the REFF estimators using TOAs and the full TDOA set, respectively. They are very close at high SNR_{r}, but diverge at low SNR_{r}.
5. Conclusions
In this article, we have proposed referencefree localization estimators based on TOA measurements for a scenario, where anchors are synchronized, and the clock of the target node runs freely. The referencefree estimators do not suffer from a poor reference selection, which can seriously degrade the localization performance of referencebased LS estimators. Furthermore, we generalized existing referencebased localization estimators using TOA or TDOA measurements, and expose their relations. Based on analysis and simulations, we have obtained the following important conclusions:

(1)
Applying a projection is always preferred over making differences with a reference to get rid of nuisance parameters.

(2)
The optimal weighting matrix can compensate for the impact of the reference selection for referencebased WLS estimators using TOA measurements, and make all those estimators equivalent. However, the optimal weighting matrix cannot release the reference influence for referencebased WLS estimators using a nonredundant set of TDOA measurements, but can make the estimators using the same set identical as well.

(3)
There are corresponding equivalences between the SRbased and the SRdifferencebased methods, which are all using TOA measurements.

(4)
Beyond some SNR threshold, there are no obvious differences among the CRBs using TOA measurements, the nonredundant set and the full set of TDOA measurements, respectively.

(5)
The performance of the referencefree LS estimators is neither too bad nor too good, but they do not suffer from a poor reference selection.

(6)
The concrete value of the distance bias caused by the inaccurate clock does not affect the localization performance of the LS or WLS estimators.
Appendix 1 Derivation of λ for CLS
Substituting (14) into the constraint (11), we obtain
which has to be solved for λ, leading to the estimate $\widehat{\lambda}$. We exemplify how to solve (62) for localization on a plane, i.e.,/= 2. Since J is of rank 3, there are only three nonzero eigenvalues of (A^{T}WA)^{1}J. Therefore, the square matrix (A^{T}WA)^{1}J of size 4 × 4 can be diagonalized as (A^{T}WA)^{1}J = VΛV^{1}, where V is of size 4 × 3, collecting the singular vectors corresponding to the three nonzero singular values, and Λ is a diagonal matrix with the three nonzero singular values (γ_{ i }, i = 1, 2, 3) on its diagonal. According to the Kailath variant [34] and plugging the eigenvalue decomposition of (A^{T}WA)^{1}J into (A^{T}WA + λ J)^{1}, we obtain
Substituting (63) into the constraint (62), we achieve
where
Now, (64) can be simplified as a sevenorder equation as follows
After obtaining the seven roots of (69), we discard the complex roots, and plug the real roots into (14). Finally, we choose the estimate ŷ , which fulfills (10). Note that (14) is a CLS estimate of y with W = I. Since the optimal W* depends on the unknown d, the CWLS problem can be solved in a similar way by iteratively updating the weights and the estimates, thus we do not repeat it here.
Appendix 2 Proof of P_{ i }((T_{ i }u) ⊙ (T_{ i }u)) = P_{ i }T_{ i }(u ⊙ u)
Recalling that T_{ i }u = T_{i 1}u  u_{ i }1_{m i}, T_{ i }1_{ m }= 0_{M1}, and P_{ i }T_{ i }u = 0_{M 1}, we prove that P_{ i }((T_{ i }u) ⊙ (T_{ i }u)) in (33) is equivalent to P_{ i }T_{ i }(u ⊙ u) as follows
Appendix 3 Derivation of (35)
The SVD of P_{ i }T_{ i }is given by ${\mathbf{P}}_{i}{\mathbf{T}}_{i}={\mathbf{U}}_{i}{\Lambda}_{i}{\mathbf{V}}_{i}^{T}$, where U_{ i }is of size (M  1) × (M  2) and V_{ i }is of size M × (M  2), which collect the left and right singular vectors corresponding to the M  2 nonzero singular values, and Λ_{ i }is a diagonal matrix with the M  2 nonzero singular values on its diagonal. Note that ${\mathbf{U}}_{i}^{T}{\mathbf{U}}_{i}={\mathbf{I}}_{M2},{\mathbf{V}}_{i}^{T}{\mathbf{V}}_{i}={\mathbf{I}}_{M2},{\mathbf{V}}_{i}^{T}{\mathbf{1}}_{M}={\mathbf{0}}_{M2}$ and ${\mathbf{V}}_{i}^{T}\mathbf{u}={\mathbf{0}}_{M2}$. As a result, the nullspace $\mathcal{N}\left({\mathbf{V}}_{i}^{T}\right)=\text{span}\left({\mathbf{1}}_{M},\mathbf{u}\right)$, and $\mathcal{R}\left({\mathbf{V}}_{i}\right)=\mathcal{R}\left(\mathbf{U}\right)$. Using the SVD and the property of the pseudoinverse, we can write ${\left({\mathbf{P}}_{i}{\mathbf{T}}_{i}{\mathrm{\Sigma T}}_{i}^{T}{\mathbf{P}}_{i}\right)}^{\u2020}$ as
Plugging (71) and the SVD of P_{ i }T_{ i }into (34), and making use of the property of the pseudoinverse again, we arrive at
where ${\mathbf{V}}_{i}{\mathbf{V}}_{i}^{T}$ is the projection onto $\mathcal{R}\left(\mathbf{U}\right)$.
Appendix 4 CRB derivation for localization based on TOA measurements
We analyze the CRB for jointly estimating x and b based on (1), and assume n_{ i }is Gaussian distributed. The FIM I_{1}(θ) is employed, where θ = [x^{T}, b]^{T}, with entries defined as:
where
Appendix 5 CRB derivation for localization based on TDOA measurements
We analyze the CRB for estimating x based on (40), and assume n_{i,j}is Gaussian distributed. The FIM I_{2}(x) for the nonredundant set of TDOA measurements is employed, with entries defined as:
Where
Furthermore, let us define $\mathit{\mu}={\left[{\mathit{\mu}}_{1}^{T},{\left[{\mathit{\mu}}_{2}^{T}\right]}_{2:M},\dots ,{\left[{\mathit{\mu}}_{M1}^{T}\right]}_{M1}\right]}^{T}$, where μ_{ i }= [ μ_{i,1},..., μ_{i,i1}, μ_{i,i+1},..., μ_{i,M}]^{T}, and C as the covariance matrix of this full set of TDOA measurements. Then the FIM I_{3}(x) for the full set can also be derived based on (78) by replacing μ_{ i }and C_{ i }with μ and C, respectively. We can obtain [μ]_{ k }= μ_{i,j}, where k = (i 1)Mi^{2}/2i/2 + j, k ∈ {1,2,...,M(M1)/2}, i ∈ {1, 2,..., M1}, j ∈ {2, 3,..., M} and j > i.
Consequently, we achieve
In the same way, [C]_{k,l}= cov(n_{i,j}, n_{p,q}), where l = (p  1)M p^{2}/2  p/2 + q, l ∈ {1,2,..., M(M 1)/2}, p ∈ {1,2,..., M  1}, q ∈ {2, 3,..., M} and q > p.
Endnotes
^{a}The sensor elements of a passive sensor array are equivalent to the anchor nodes here. ^{b}Given the matrix C of size n × r and the matrix D of size r × m both of rank r, then if A = CD, it holds that A^{†} = D^{†}C^{†}[35].
References
 1.
Parkinson, B, Spilker J, Jr. (Eds): Global Positioning System: Theory and Application Volume I. American Institute of Astronautics and Aeronautics, Washington, DC; 1996.
 2.
Torrieri D: Statistical theory of passive location systems. IEEE Trans Aerosp Electron Syst 1984, 20(2):183198.
 3.
Chandrasekhar V, Seah WK, Choo YS, Ee HV: Localization in underwater sensor networks: survey and challenges. In Proc ACM WUWNet. New York, USA; 2006:3340.
 4.
Huang Y, Benesty J, Elko G, Mersereati R: Realtime passive source localization: a practical linearcorrection leastsquares approach. IEEE Trans Acoust Speech Signal Process 2001, 9(8):943956.
 5.
Li D, Hu YH: Least square solutions of energy based acoustic source localization problems. In Proc ICPPW. Montreal, Canada, August; 2004:443446.
 6.
Caffery J Jr, Stuber GL: Subscriber location in CDMA cellular networks. IEEE Trans Veh Technol 1998, 47(2):406416. 10.1109/25.669079
 7.
Sayed A, Tarighat A, Khajehnouri N: Networkbased wireless location: challenges faced in developing techniques for accurate wireless location information. IEEE Signal Process Mag 2005, 22(4):2440.
 8.
Gezici S, Tian Z, Giannakis G, Kobayashi H, Molisch A, Poor H, Sahinoglu Z: Localization via ultrawideband radios: a look at positioning aspects for future sensor networks. IEEE Signal Process Mag 2005, 22(4):7084.
 9.
Patwari N, Ash J, Kyperountas S, AO Hero I, Moses R, Correal N: Locating the nodes: cooperative localization in wireless sensor networks. IEEE Signal Process Mag 2005, 22(4):5469.
 10.
Cheung K, So H, Ma WK, Chan Y: Least squares algorithms for timeofarrivalbased mobile location. IEEE Trans Signal Process 2004, 52(4):11211130. 10.1109/TSP.2004.823465
 11.
Savvides A, Han CC, Strivastava MB: Dynamic finegrained localization in adhoc networks of sensors. In Proc ACM MobiCom. Rome, Italy; 2001:166179.
 12.
Niculescu D, Nath B: Ad hoc positioning system (APS) using AOA. In Proc IEEE INFOCOM. Volume 3. San Francisco, CA, USA; 2003:17341743.
 13.
Bahl P, Padmanabhan V: RADAR: an inbuilding RFbased user location and tracking system. In Proc IEEE INFOCOM. Volume 2. Tel Aviv, Israel; 2000:775784.
 14.
Wang Y, Leus G, Ma X: Tracking a mobile node by asynchronous networks. In Proc IEEE SPAWC. San Francisco, CA, USA; 2011:15.
 15.
Yan J: Algorithms for indoor positioning systems using ultrawideband signals. Delft University of Technology; 2010.
 16.
Li Z, Trappe W, Zhang Y, Nath B: Robust statistical methods for securing wireless localization in sensor networks. In Proc IPSN. Los Angeles, CA, USA, April; 2005:9198.
 17.
Venkatesh S, Buehrer R: A linear programming approach to NLOS error mitigation in sensor networks. In Proc IPSN. Nashville, TN, USA; 2006:301308.
 18.
Guvenc I, Gezici S, Watanabe F, Inamura H: Enhancements to linear least squares localization through reference selection and ML estimation. In Proc IEEE WCNC. Las Vegas, NV, USA; 2008:284289.
 19.
Smith J, Abel J: Closedform leastsquares source location estimation from rangedifference measurements. IEEE Trans Acoust Speech Signal Process 1987, 35(12):16611669. 10.1109/TASSP.1987.1165089
 20.
Friedlander B: A passive localization algorithm and its accurancy analysis. IEEE J Ocean Eng 1987, 12(1):234245.
 21.
Chan Y, Ho K: A simple and efficient estimator for hyperbolic location. IEEE Trans Signal Process 1994, 42(8):19051915. 10.1109/78.301830
 22.
Stoica P, Li J: Lecture notessource localization from rangedifference measurements. IEEE Signal Process Mag 2006, 23(6):6366.
 23.
Ganeriwal S, Kumar R, Srivastava MB: Timingsync protocol for sensor networks. In Proc ACM SenSys. Los Angeles, CA, USA; 2003:138149.
 24.
Chan F, So H: Efficient weighted multidimensional scaling for wireless sensor network localization. IEEE Trans Signal Process 2009, 57(11):45484553.
 25.
Bresler Y, Macovski A: Exact maximum likelihood parameter estimation of superimposed exponential signals in noise. IEEE Trans Acoust Speech Signal Process 1986, 34(5):10811089. 10.1109/TASSP.1986.1164949
 26.
Beck A, Stoica P, Li J: Exact and approximate solutions of source localization problems. IEEE Trans Signal Process 2008, 5