# Linear least squares localization in sensor networks

- First Online:

- Received:
- Accepted:

DOI: 10.1186/s13638-015-0298-1

- Cite this article as:
- Wang, Y. J Wireless Com Network (2015) 2015: 51. doi:10.1186/s13638-015-0298-1

**Part of the following topical collections:**

## Abstract

Localization in sensor networks is critical for search and rescue. Linear least squares (LLS) estimation is a sub-optimum but low-complexity localization algorithm based on measurements of location-related parameters. Commonly, there are two types of LLS localization algorithms using range measurements; one is based on introducing a dummy variable (called *LLS-I*), and the other is based on the subtraction of the reference measured range (called *LLS-II*). Moreover, their respective weighted LLS (WLLS) algorithms (called *WLLS-I* and *WLLS-II*) can be adopted to further improve the localization accuracy. In addition, hybridization of different types of measurements can fix the deficiencies of one type of measurements. In this paper, we compare the localization performances of different LLS and WLLS algorithms in both non-hybrid time-of-arrival (TOA) and hybrid TOA/received signal-strength (RSS) networks. Simulation results show that if the variances of measurements are unavailable, the *LLS-II* localization algorithm should be adopted in both non-hybrid and hybrid networks using their respective reference selection criterions. If the variances of measurements are available, the two-step *WLLS-I* algorithm should be utilized to localize the agent in both non-hybrid and hybrid networks.

### Keywords

Hybrid localization Received-signal-strength (RSS) Reference selection Time-of-arrival (TOA) Ultra-wideband (UWB) Weighted linear least squares (WLLS)## 1 Introduction

Determining the location of a target is one of the fundamental functions of sensor networks [1-5]. Real-time and accurate position information plays a crucial role in a variety of wireless applications [6,7], such as logistics, search-and-rescue operations, and location-based services. In the conventional two-step localization method [8], location-related parameters, such as range and angle-of-arrival (AOA) information, are estimated in the first step, and the position of the agent is then estimated based on these location-related parameters using geometric and statistical algorithms. Specifically, range information is commonly adopted in the first step of localization, which can be measured using time-of-arrival (TOA) or received-signal-strength (RSS) estimates [9]. Maximum likelihood (ML) estimator can be adopted in the second step of range-based localization if the variances of range measurements are available. It is well known that ML estimator is an optimum estimator since it can asymptotically achieve the Cramér-Rao lower bound (CRLB) for high signal-to-noise ratios (SNRs) and/or large signal bandwidths [9]. If the variance information about measured range is unavailable, a nonlinear least squares (NLS) estimator can be adopted, which assumes all the variances are identical and employs uniform weighting. Solving the NLS estimation problem requires an explicit minimization of a nonlinear as well as non-convex cost function, which cannot in general be solved analytically. Therefore, numerical search algorithms, such as the Newton-Newton, the Gauss-Raphson, or the steepest descent algorithms, are usually employed to approximate the NLS estimate [6]. However, the drawbacks of these numerical search algorithms are intensive computation as well as good initialization requirement to avoid erroneously converging to the local minima of the NLS cost function [7].

In order to avoid the explicit minimization problem and obtain a closed form solution, the nonlinear expressions of observations can be linearized using the linear least squares (LLS) algorithms. Commonly, there are two types of LLS algorithms using range measurements. One type of LLS algorithm is based on the utilization of a dummy variable (called *LLS-I*) [10]. The other type of LLS algorithm is based on the subtraction of the reference measured range (called *LLS-II*), which was initially proposed in [11] and its reference selection method was discussed in [12] and [13] for non-hybrid networks and hybrid TOA/RSS networks, respectively. For the line-of-sight (LOS) and non-line-of-sight (NLOS) application scenarios, the LLS localization performance was studied in [12,14]. Compared with iterative algorithms (e.g., ML and NLS approaches), LLS estimation is a sub-optimum localization algorithm [15]. However, LLS estimation usually has a reasonable positioning accuracy and lower implementation complexity, which is essential to many wireless applications, such as internet of things and wireless sensor networks, due to their strict constraints on energy consumption, signal processing capability, cost, and so on. Moreover, the weighted LLS (WLLS) algorithms can further improve the LLS localization accuracy. The WLLS localization algorithms based on the utilization of a dummy variable (called *WLLS-I*) were discussed in [16-18], where the two-step *WLLS-I* localization technique outperforms the conventional one-step *WLLS-I* localization technique due to that the constraint of the dummy variable is exploited, while the other one based on the subtraction of the reference measured range (called *WLLS-II*) was discussed in [12,13].

Hybrid localization techniques [19,20], such as the hybrid TOA/RSS or AOA/RSS techniques, are proposed to enhance localization accuracy as well as fix the deficiencies of one type of measurements, such as the insufficiency of measurements to uniquely localize the agent. The effect of inaccurate measurements on hybrid AOA/RSS LLS localization was discussed in [21].

In this paper, we compare the localization performances of different LLS and WLLS algorithms in both non-hybrid TOA and hybrid TOA/RSS networks, which gives guidance to localization algorithm selection in different sensor networks. Simulation results show that if the variances of measurements are unavailable, the *LLS-II* localization algorithm should be adopted in both non-hybrid and hybrid networks using their respective reference selection criterions. If the variances of measurements are available, the two-step *WLLS-I* algorithm should be utilized to localize the agent in both non-hybrid and hybrid networks.

The rest of the paper is organized as follows. Section 2 introduces the system model. Section 3 briefly reviews the two common LLS localization algorithms. The WLLS location estimators are given in Section 4. Section 5 provides simulation results, and the last section concludes the paper.

## 2 System model

For the hybrid TOA/RSS network, we assume that the agent is connected to different anchors, and these anchors are able to measure the range between the agent and anchors via TOA or RSS parameters. Let *N* be the total number of all anchors in the localization network. Without loss of generality, we assume that the agent can measure TOA-based ranges from anchors with indexes *і* ∈{1,2,…,*S*} and measure RSS-based ranges from anchors with indexes *і* ∈{*S* + 1,*S* + 2,…,*N*} (*S* ≤ *N*). For the non-hybrid TOA network, we assume that the agent can measure TOA-based ranges from all *N* anchors, i.e., *S* = *N*.

*і*th (

*і*= 1,2,…,

*N*) anchor is denoted as \( {\widehat{d}}_i \). Let

**p**= [

*x y*]

^{T}be the unknown two-dimensional (2-D) coordinate of the agent, which is to be estimated, and let

**p**= [

*x*

_{і}

*y*

_{і}]

^{T}be the known 2-D coordinate of the

*і*th anchor. The error-free range between the agent and the

*і*th anchor is calculated as

*n*

_{і}is the ranging error in \( {\widehat{d}}_i \), which results from TOA or RSS estimation disturbance. It is assumed that {

*n*

_{і}} are independent Gaussian processes with zero mean and variances \( \left\{{\sigma}_i^2\right\} \).

*c*is the propagation speed of ranging signals, \( {\widehat{\tau}}_{\mathrm{RTT}} \) is measured round trip time, and \( {\widehat{\tau}}_{\mathrm{TAT}} \) is measured turnaround time. In additive white Gaussian noise (AWGN) channel, the CRLB of mean square ranging error (MSRE) from the

*і*th (

*і*∈{1,2,…,

*S*}) anchor is [8]

*і*th anchor, ε

_{і}denotes the received signal energy, \( {\mathcal{N}}_0 \) denotes the one-side power spectral density of AWGN, and

*β*denotes the effective signal bandwidth defined by

with *K*(*f*) denoting the Fourier transform of the ranging signal. In harsh environments, such as in buildings or urban canyons, ultra-wideband (UWB) signals can be adopted to achieve high-accuracy range measurements [22].

*d*,

*P*

_{0}denotes the received power in decibels at reference distance

*d*

_{0},

*γ*is the path-loss exponent with typical value between 2 and 6, and

*V*is commonly modeled as a zero-mean Gaussian random variable with variance \( {\sigma}_{\mathrm{sh}}^2 \), which represents the large-scale fading variations (i.e., shadowing) [9]. The CRLB of MSRE from the

*і*th (

*і*∈{

*S*+ 1,

*S*+ 2,…,

*N*}) anchor is [8]

Although there seems a simple relation between average received power and distance, it is quite challenging to obtain the exact relation between them. Since RSS can have significant fluctuations even over short distances and/or small time intervals in a practical wireless environment due to complicated signal propagation mechanisms, therefore, the accuracy of RSS-based ranging is commonly low, which is also true for UWB signals. For example, according to the IEEE 802.15.4a NLOS residential UWB channel model [23], the lower bound *σ*_{і},_{CRLB,RSS} is about 1.76 m at *d*_{і}
*=* 10 m with *γ* = 4.58 and *σ*_{sh}
*=* 3.51 dB [8].

## 3 LLS localization algorithms

In the second localization step, we adopt different LLS localization algorithms to convert the nonlinear range measurements in (3) into linear models in **p** and give a close form location estimate \( {\widehat{\mathbf{p}}}_{\mathrm{LLS}} \).

### 3.1 *LLS-I* localization algorithm

*R*=

*x*

^{2}+

*y*

^{2}and define

**Λ**≜ [

*x y R*]

^{T}. Then, we can rewrite (9) in matrix form as

**Λ**is given by [10]

*LLS-I*location estimate of the agent is simply extracted from the first and second entries of \( {\widehat{\boldsymbol{\Lambda}}}_{\mathrm{LLS}} \), that is

### 3.2 *LLS-II* localization algorithm

*r*th anchor as the reference anchor for example without loss of generality. By subtracting the nonlinear expression of the

*r*th anchor in (3) from the rest of the expressions, we have

where we define \( {k}_i\triangleq {x}_i^2+{y}_i^2 \), *і* = 1,2,…,*N*.

*LLS-II*location estimate of the agent is given by [6]

*LLS-II-1*) is the simplest way for reference selection [11], which arbitrarily selects one anchor as the reference anchor to realize LLS localization. The second LLS approach (called

*LLS-II-2*) obtains

*N*×(

*N*-1)/2 linear equations by selecting each anchor as the reference anchor for the other

*N*-1 measurements [14]. In the third LLS method (called

*LLS-II-3*), the average of all range measurements is obtained as the reference range, thus resulting in

*N*linear equations [15]. For non-hybrid localization network, the fourth LLS technique (called

*LLS-II-RS*) selects the reference anchor with the shortest measured range among all the range measurements [12], and the index of the reference anchor is given by

*H-LLS-II-RS*) selects the TOA-based anchor with the shortest measured range as reference [13], and the index of the reference anchor is given by

where *C*_{TOA} denotes the index set for all the TOA-based anchors.

## 4 WLLS localization algorithms

If the variances of measurements are available, the WLLS localization algorithms can be adopted to further improve the localization accuracy compared with LLS localization algorithms discussed above.

### 4.1 *WLLS-I* localization algorithm

*WLLS-I*location estimate (called

*OS-WLLS-I*) can be written as

Symbol diag(**a**) denotes a diagonal matrix with its main diagonal entries being vector **a**. Note that since the error-free ranges {*d*_{і}} are not available in practice, the noisy measurements \( \left\{{\widehat{d}}_i\right\} \) are used to evaluate the weighted matrix **C**_{I}.

*WLLS-I*localization algorithm (called

*TS-WLLS-I*) utilizes the constraint of the dummy variable

*R*=

*x*

^{2}+

*y*

^{2}to further enhance the localization accuracy compared with the

*OS-WLLS-I*algorithm. According to [16], the

*TS-WLLS-I*location estimate can be written as

### 4.2 *WLLS-II* localization algorithm

*WLLS-II*localization performance and the

*WLLS-II*location estimate can be written as

**C**

_{II}is the weighted matrix and its elements can be derived as [13]

with *i*,*j* = 1,2,…,*N*,*i ≠ r*,*j ≠ r*, and *I*(*i*,*j*) is an indicator function which is 1 for *i* = *j*, and is 0 otherwise.

## 5 Numerical simulation results

*N*= 4 anchors is used to localize one agent. The area is a square of

*L*×

*L*m

^{2}and

*L*is fixed to 10 m. There are two sets of anchors (set I and set II) in Figure 1. Set I contains

*S*= 2 TOA-based ranging anchors located at

**p**

_{1}= (0,0) and

**p**

_{2}= (

*L*,0) respectively. Set II contains N-S = 2 RSS-based ranging anchors located at

**p**

_{3}= (

*L*,

*L*) and

**p**

_{4}= (0,

*L*), respectively. The agent location

**p**is changed with 2 m intervals within [1,9] m both in

*x*and

*y*directions, yielding a 5 × 5 grid of possible agent locations. The mean square position error (MSPE) of different techniques are simulated at each location on the grid, and then average over all the agent locations on the grid. For

*LLS-II-1*, the anchor-1 is selected as the reference anchor.

_{i}, which is

_{0}is the SNR at the reference distance

*d*

_{0}and γ is the path-loss exponent. According to (8) and [24], we simply assume RSS-based ranging error variance \( {\sigma}_{\mathrm{RSS},i}^2 \) as

where *η*(*η* ≥ 1) controls the relation between the two ranging error variances since TOA-based ranging usually has higher accuracy than RSS-based ranging, especially when adopting UWB signals. In the following simulations, we assume *d*_{0} = 1, SNR_{0} ∈[20:30] dB with increasing step ∆ = 2 dB, and γ = 2 unless otherwise specified. For each simulation setting, 10^{3} simulations are run to get the average performance.

*η*= 1, simulation results are depicted in Figure 2. The

*LLS-II-1*algorithm performs the worst among all the algorithms and the CRLB provides the lower bound for them. The localization accuracy of the

*LLS-I*algorithm is the same as that of both

*LLS-II-2*and

*LLS-II-3*algorithms, which is slightly lower than the accuracy of the

*H-LLS-II-RS*algorithm. The

*LLS-RS*algorithm beats all the other LLS algorithms. The reason is that

*LLS-I*,

*LLS-II-2*, and

*LLS-II-3*algorithms equally utilize all the range measurements (also their errors), while

*H-LLS-II-RS*and

*LLS-II-RS*algorithms suppress the influence of ranging errors on the localization accuracy through reference selection. For the non-hybrid TOA-based localization scenario, it is obvious that

*H-LLS-II-RS*and

*LLS-II-RS*algorithms are the same, thus having the same performance. However, for the hybrid TOA/RSS localization scenario that the variances of both RRS-based and TOA-based ranging are the same, the

*LLS-II-RS*algorithm outperforms the

*H-LLS-II-RS*algorithm, since the

*H-LLS-II-RS*algorithm never selects a RSS-based anchor as the reference even if its range measurement is the shortest. Moreover, the WLLS algorithms outperform the LLS algorithms since all measurements are weighted according to their reliability. The

*OS-WLLS-I*algorithm has almost identical localization accuracy to the

*WLLS-II*algorithm, since they both utilize the variances of the measurements. Furthermore, the

*TS-WLLS-I*algorithm beats all the other WLLS algorithms and attains the CRLB in high SNR regions, since it further exploit the constraint of the dummy variable.

*η*= 2, simulation results are depicted in Figure 3. Different from Figure 2, the

*LLS-II-1*algorithm outperforms

*LLS-I*,

*LLS-II-2*, and

*LLS-II-3*algorithms. The reason is that the

*LLS-II-1*algorithm selects a TOA-based anchor with small ranging variance as the reference, which can more effectively suppress the ranging errors on the localization accuracy than those three LLS algorithms, since they equally utilize the inaccurate RSS-based range measurements and the accurate TOA-based range measurements. Moreover,

*LLS-II-RS*and

*H-LLS-II-RS*algorithms have nearly identical localization accuracy, since the effect of larger RSS-based ranging variances plays an almost identical role as that of range measurements on the final localization performance.

*η*= 5, simulation results are depicted in Figure 4. Since the variances of RSS-based ranging become larger, the SNR

_{0}range is changed to [30:40] dB to get reasonable localization results. The localization performances of both

*LLS-II-1*and

*LLS-II-RS*techniques are nearly identical and the

*H-LLS-II-RS*technique beats all the other LLS techniques, since the effect of larger RSS-based ranging variances plays a more important role than that of range measurements on the final localization performance.

## 6 Conclusions

If the variances of range measurements are unavailable, the *LLS-II* localization algorithm should be adopted in both non-hybrid and hybrid networks using their respective reference selection criterions. If the variances of range measurements are available, the two-step *WLLS-I* algorithm should be utilized to localize the agent in both non-hybrid and hybrid networks. Although only LOS scenarios are considered in the paper, the idea can be extended to NLOS scenarios.

## Acknowledgements

This research was supported by the Doctor Foundation of Tianjin Normal University (52XB1417).

## Copyright information

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.