- Research
- Open Access

# Enhancement of wireless positioning in outdoor suburban NLOS environment using hybrid-network-GPS systems

- Saleh O Al-Jazzar
^{1}Email author

**2012**:100

https://doi.org/10.1186/1687-1499-2012-100

© Al-Jazzar; licensee Springer. 2012

**Received:**20 November 2011**Accepted:**10 March 2012**Published:**10 March 2012

## Abstract

This article will introduce a method for locating mobile stations (MSs) in outdoor suburban non-line-of-sight (NLOS) environment. The measurements used to locate the MS are taken from three base stations and a satellite. Such a setup of measurements is named the hybrid-network-GPS system. The proposed method uses constraint nonlinear optimization to minimize the NLOS error. The problem is simplified to three independent nonlinear equations of three unknowns, then it is solved to find the MS location. Numerical simulations are introduced to assess the performance of the proposed method compared with other positioning algorithms.

## Keywords

- NLOS
- GPS
- TOA
- constrained minimization

## 1. Introduction

The well-known non-line-of-sight (NLOS) problem in wireless location has gained a great attention in the last decade. An important aspect of this problem is the huge error it induces in locating wireless devices. Thus, it is of interest to develop wireless positioning algorithms that will minimize the NLOS error.

In the literature, many articles addressed the NLOS problem. These articles differed in their approaches to solve the problem. The articles in [1–6] used nonstatistical methods to locate the mobile station (MS) using network based measurements. In [1], the authors propose using linear-programming method to locate the MS in NLOS environments. The authors in [2], linearize the inequality of range models corrupted with NLOS errors for wireless positioning. In [3], the authors propose a constrained-optimization algorithm to locate the MS using the sequential quadratic programming algorithm. The authors in [4] propose a geometry-assisted location estimation algorithm utilizing the different geometric layouts between the MS and the base stations (BSs). In [5], the authors propose a constrained optimization technique to locate the MS. The method in [6] is a constrained nonlinear optimization approach, with constraints derived from the geometry of the cell layout and range measurements. Satellite assisted techniques were also proposed in [7, 8] for wireless positioning but they did not assume NLOS environment and measurements were taken at more than one satellite.

This article uses the hybrid-network-GPS system to minimize the NLOS error when locating the MS. The proposed method is named the hybrid-network-GPS constrained algorithm (HNGPS-CA) which depends on minimizing a constraint objective function to locate the MS. The proposed objective function used in the HNGPS-CA method has the advantage of guaranteed convexity. This advantage is not guaranteed in the regularly used least square (LS) objective function which might be non-convex in some cases as will be clarified in Section 4. The environment considered in this article is the outdoor suburban NLOS environment. We will consider that there are three time of arrival (TOA) measurements available from three BSs and only one TOA measurement from the satellite.

The rest of the article is organized as follows: Section 2 presents the problem formulation. Section 3 presents the HNGPS-CA algorithm. In Section 4, some insight on the convexity of the objective function will be provided. Section 5 shows simulation results for the proposed method. Conclusions are presented in Section 6.

## 2. Problem formulation

*ψ*

_{ m }= (

*x*

_{ms},

*y*

_{ms}, 0)) with the TOA measurements taken at the receiving BS

_{ i }(location

*ψ*

_{ i }= (

*x*

_{ i },

*y*

_{ i }, 0), where

*i*= 1, 2, 3 which is an index for the BS) and at one GPS satellite (location

*ψ*

_{ s }= (

*x*

_{ s },

*y*

_{ s },

*z*

_{ s })). Then, the true distance between the MS and BS

_{ i }is

Since the consideration for this article is the outdoor suburban environment, then it is reasonable to assume that it is highly unlikely that there will be obstacles between the MS and the GPS satellite in such an environment. Thus, the measured distance between the MS and the GPS satellite $\left({\stackrel{\u0303}{R}}_{s}\right)$ will be assumed to be the same as the true distance (*R*_{
s
}) added to it the measurement noise (*μ*_{
s
}), i.e., ${\stackrel{\u0303}{R}}_{s}={R}_{s}+{\mu}_{s}$. The measurement noise (*μ*_{
s
}) is assumed to be additive white Gaussian noise (AWGN) of zero mean and variance of ${\sigma}_{s}^{2}$.

This assumption is not valid for the connection between the MS and the BSs where it is very likely that obstacles exist in the MS-BSs connections. Thus, we will consider that the distance measurements at the BSs will have NLOS error (unlike the measurement made at the MS-GPS connection).

_{ i }(between BS

_{ i }and MS) would be

where *η*_{
i
} is the effective NLOS component and *μ*_{
i
} is the measurement noise, which can be considered as AWGN of zero mean and variance of ${\sigma}_{i}^{2}$. Since the NLOS causes the signal to arrive from a path which is longer than the true distance, then *η*_{
i
} ≥ 0. It is generally considered that the NLOS error (*η*_{
i
}) is usually much more severe than the measurement noise (*μ*_{
i
}).

_{i}which we will call $\left({\stackrel{\u0304}{l}}_{i}\right)$, as follows:

This distance can be practically obtained by assuming the MS will receive the signal from the satellite and then transmits the TOA measurement to BS_{
i
} or retransmits the same signal and the BS_{
i
} computes the total distance $\left({\stackrel{\u0304}{l}}_{i}\right)$.

Since the GPS satellite is located far from the earth surface (i.e., *R*_{
s
} is a huge distance when compared to cells dimensions), then $\left({\stackrel{\u0304}{l}}_{i}\right)$ is much greater than *l*_{
i
}$\left(i.e.,\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}{\stackrel{\u0304}{l}}_{i}>>{l}_{i}\right)$.

Next, the HNGPS-CA method is presented to locate the MS accurately in the presence of the NLOS error.

## 3. Hybrid-network-GPS constrained algorithm

*R*

_{ i }(for

*i*= 1, 2, 3). In other words, the objective function that will be minimized is

where *α*_{
i
} (for *i* = 1*;* 2*;* 3) are positive weighting factors for the objective function (i.e., *α*_{
i
} *>* 0). Each positive weighting factor (*α*_{
i
}) can be chosen separately, depending on the measurement accuracy [5] or the measurement geometry [6]. Recall that *R*_{
i
} is function of *x*_{ms} and *y*_{ms} as shown in (1), and they are the variables over which *F*_{HNGPS-CA}(*x*_{ms}, *y*_{ms}) in (5) is minimized.

is the fact that using the objective function in (5) is assured to be convex. Whereas, the one in (6) might be non-convex in some cases as will be explained in Section 4.

*R*

_{ s }which represents the distance between the MS and the GPS satellite (which is very close to its measured value ${\stackrel{\u0303}{R}}_{s}$ if we neglect the measured noise

*μ*

_{ s }remembering that

*R*

_{ s }

*>> μ*

_{ s }). The locus of

*R*

_{ s }will be a circle on the earth plane (the

*x*-

*y*plane) as shown in Figure 1. This circle is centered at (

*x*

_{ s },

*y*

_{ s }) with radius ${r}_{s}=\sqrt{\left({R}_{s}^{2}-{z}_{s}^{2}\right)}$. Thus, the MS estimated coordinates must be located on this circle, i.e.,

Thus, (7) provides an equality constraint on finding (*x*_{ms}, *y*_{ms}) when applying the HNGPS-CA.

where *λ* is the Lagrange multiplier.

*x*

_{ms},

*y*

_{ms},

*λ*), we take its derivative with respect to the variables upon which ζ(

*x*

_{ms},

*y*

_{ms},

*λ*) depends, i.e., (

*x*

_{ms},

*y*

_{ms},

*λ*) separately and equate each result to zero,

Thus, (9), (10), and (11) provide three independent nonlinear equations with three unknowns (*x*_{ms}, *y*_{ms}, *λ*). These equations can be solved to find the unknowns especially the MS location coordinates (*x*_{ms}, *y*_{ms}). We will use numerical techniques to solve these equations. Here, we use fsolve.m in MATLAB to solve the set of nonlinear equations in (9), (10), and (11).

## 4. Convexity of the objective functions

As shown in Section 3, we use the objective function *F*_{HNGPS-CA}(*x*_{ms}, *y*_{ms}) in (5) rather than the LS obcetive function (*F*_{LS}(*x*_{ms}, *y*_{ms})) shown in (6). To verify this choice, let us look at the objective functions *F*_{HNGPS-CA}(*x*_{ms}, *y*_{ms}) and *F*_{LS}(*x*_{ms}, *y*_{ms}).

*x*

_{ms}

*, y*

_{ms}) in

*F*

_{LS}(

*x*

_{ms}

*, y*

_{ms}) and

*F*

_{HNGPS-CA}(

*x*

_{ms},

*y*

_{ms}). Thus, we can write (6) as follows

*l*

_{ i }in (3), the function

*f*

_{ i }can be simplified to

*η*

_{ i }which always has a nonnegative value, i.e.,

*η*

_{ i }≥ 0. Also,

*η*

_{ i }is actually a distance and function of the estimated MS coordinates $\left({\widehat{x}}_{\mathsf{\text{ms}}},\phantom{\rule{0.3em}{0ex}}{\u0177}_{\mathsf{\text{ms}}}\right)$, where {^} represents the estimated value of the variable, i.e., for example $\widehat{v}$ is the estimated value of

*v*. Since

*η*

_{ i }is a positive error which increases as the estimated MS coordinates $\left({\widehat{x}}_{\mathsf{\text{ms}}},\phantom{\rule{0.3em}{0ex}}{\u0177}_{\mathsf{\text{ms}}}\right)$ get further from the actual MS coordinates (

*x*

_{ms},

*y*

_{ms}), then

*η*

_{ i }is a convex surface which has a minima (zero value) at (

*x*

_{ms},

*y*

_{ms}). Now, because

*μ*

_{ i }is a noise signal it can have both negative and positive values. If it has a positive value then the surface

*η*

_{ i }+

*μ*

_{ i }has a value which is greater than zero, i.e.,

*η*

_{ i }+

*μ*

_{ i }

*>*0 and has a minima at (

*x*

_{ms},

*y*

_{ms}). Thus,

*f*

_{ i }= (

*η*

_{ i }+

*μ*

_{ i })

^{2}will be convex in this case and

*F*

_{LS}which is the summation of positively weighted convex functions (

*f*

_{ i }) for

*i*= 1, 2, 3 will be convex in this case as well [9]. Whereas, if

*μ*

_{ i }is negative, i.e.,

*μ*

_{ i }

*<*0, then parts of the surface

*η*

_{ i }+

*μ*

_{ i }will be below zero and other parts will be above zero with the minimum located at (

*x*

_{ms},

*y*

_{ms}) to be below zero. When taking the square of

*η*

_{ i }+

*μ*

_{ i }, i.e., (

*η*

_{ i }+

*μ*

_{ i })

^{2}, then, the point (

*x*

_{ms},

*y*

_{ms}) will have a local maxima and the surface surrounding it will be decreasing until it hits the zero level. Then, the surface (

*η*

_{ i }+

*μ*

_{ i })

^{2}is reflected back to the increasing mode as we get further from the point (

*x*

_{ms},

*y*

_{ms}), causing (

*η*

_{ i }+

*μ*

_{ i })

^{2}to be a non-convex surface, i.e.,

*f*

_{ i }will be non-convex in this case, causing

*F*

_{LS}which is the summation of positively weighted non-convex functions (

*f*

_{ i }) for

*i*= 1, 2, 3 will be non-convex in this case [9]. This is illustrated in Figure 2. Thus, when minimizing

*F*

_{LS}we will reach an unwanted local minimum which is not located at (

*x*

_{ms},

*y*

_{ms}). So, there will be an error in locating the MS.

*F*

_{HNGPS-CA}in (5) can be written as follows

*g*

_{ i }can be simplified to

*h*

_{ i }which is defined as

*R*

_{ s }is the distance between the MS and the satellite which is much greater than zero, i.e.,

*R*

_{ s }

*>>*0, and because

*R*

_{ s }

*>> μ*

_{ i }and

*R*

_{ s }

*>> μ*

_{ s }, then

*h*

_{ i }

*>>*0 for all realistic values of

*μ*

_{ i }and

*μ*

_{ s }. Thus, the function

*g*

_{ i }is the square of the summation of a positive surface (

*η*

_{ i }) which has a minimum value of zero at (

*x*

_{ms},

*y*

_{ms}) and a positive variable (

*h*

_{ i }). So,

*g*

_{ i }is always a convex function and has a minimum value at (

*x*

_{ms},

*y*

_{ms}). This is illustrated in Figure 3. Thus,

*F*

_{HNGPS-CA}is convex as well because the positively weighted sum of convex functions is also convex [9] (recall that ${F}_{\mathsf{\text{HNGPS}}-\mathsf{\text{CA}}}={\Sigma}_{i=1}^{3}\phantom{\rule{0.3em}{0ex}}{\alpha}_{i}{g}_{i}$). This will assure that when minimizing

*F*

_{HNGPS-CA}we will not reach an unwanted local minimum as the case for minimizing

*F*

_{LS}, but rather we will reach the true MS location (

*x*

_{ms},

*y*

_{ms}).

## 5. Simulation results

The results in this section are averaged over 2,000 ensemble runs. The BSs locations are (0, 0), (8.66, 0) and (4.33, 7.5) with all units in km. The MS location is (*x*_{ms}, *y*_{m s}) where *x*_{ms} = 4.33 · (*u* + 0.5) in km, *y*_{ms} = 0.5 · (7.5 + *u*) in km and *u* is a random variable uniformly distributed in the region [0,1]. Two NLOS environment models are assumed. The first case considered to model the NLOS effect is the disk of scatterers (DOS) environments presented in [10]. In the DOS model, the scatterers are located on a solid circular disk of fixed radius *R*_{
d
} with the MS at the center. The distance to a scatterer from the MS, *r*_{DOS}, is uniformly distributed over [0, *R*_{
d
}], and the angle is uniformly distributed over [0, 2*π*]. The radius *R*_{
d
} is set to 300 m. In the second case we assume that the NLOS error is a ratio of the measured distance. The reasoning behind this assumption is the fact that as the wave travels through a larger distance there will be a higher probability that the NLOS error will be larger. Thus, in this case *η*_{
i
} = *βl*_{
i
} where *β* is the NLOS error factor and it is assumed to be 0.3 in the simulations. The range measurement error is assumed to have 50 m^{2} variance, i.e,${\sigma}_{s}^{2}=50\phantom{\rule{0.3em}{0ex}}{\mathsf{\text{m}}}^{2}$. The weight factors (*α*_{1}, *α*_{2}, *α*_{3}) in (9) and (10) are all set to 1.

*x*-axis gives 0.59 at the

*y*-axis which means that 59% of the time the error is below 100 m, whereas, it was 18 and 12% for the RSA and LLOP algorithms, respectively, for the same location error (100 m). As for the location error of 200 m, the HNGPS-CA, RSA and LLOP algorithms had an error of less than 200 m with a probability of 95, 50 and 34%, respectively. Thus, clearly the HNGPS-CA is giving better performance than the RSA and LLOP algorithms. The same conclusion can be achieved by looking at Figure 5. Thus, both figures indicate that the HNGPS-CA algorithm performs considerably better than both the LLOP and RSA algorithms.

## 6. Conclusion

An algorithm, named HNGPS-CA, is proposed and investigated via simulations for mitigating the effect of NLOS error in outdoor suburban NLOS environment. The HNGPS-CA algorithm locates the MS by minimizing an objective function formed from TOA measurements at three BSs and utilizes the equality constraint provided by the GPS TOA measurement. This proposed objective function of the HNGP-CA algorithm has the guaranteed convexity advantage over the regularly used LS objective function. Simulations results showed that the proposed HNGPS-CA algorithm gave better performance than other positioning algorithms.

## Declarations

## Authors’ Affiliations

## References

- Venkatesh S, Buehrer R: NLOS mitigation using linear programming in ultrawideband location-aware networks.
*IEEE Trans Veh Technol*2007, 56: 3182-3198.View ArticleGoogle Scholar - Wei W, Jin-Yu X, Zhong-Liang Z: A new NLOS error mitigation algorithm in location estimation.
*IEEE Trans Veh Technol*2005, 54: 2048-2053. 10.1109/TVT.2005.858177View ArticleGoogle Scholar - Yu K, Guo Y: Improved positioning algorithms for nonline-of-sight environments.
*IEEE Trans Veh Technol*2008, 57: 2342-2353.View ArticleGoogle Scholar - Feng K-T, Chen C-L, Chen CH: GALE: an enhanced geometry-assisted location estimation algorithm for NLOS environments.
*IEEE Trans Mobile Comput*2008, 7: 199-213.View ArticleGoogle Scholar - Al-Jazzar S, Ghogho M, McLernon D: A joint TOA/AOA constrained minimization method for locating wireless devices in non-line-of-sight environment.
*IEEE Trans Veh Technol*2009, 58: 468-472.View ArticleGoogle Scholar - Venkatraman S, Caffery J Jr, You H-R: A novel TOA location algorithm using LOS range estimation for NLOS environments.
*IEEE Trans Veh Technol*2004, 53: 1515-1524. 10.1109/TVT.2004.832384View ArticleGoogle Scholar - Akopian D, Syrjarinne J: A fast positioning method without navigation data decoding for assisted GPS receivers.
*IEEE Trans Veh Technol*2009, 58: 4640-4645.View ArticleGoogle Scholar - Djuknic G, Richton R: Geolocation and assisted GPS.
*Computer*2001, 34: 123-125. 10.1109/2.901174View ArticleGoogle Scholar - Boyd S, Vandenberghe L:
*Convex Optimization*. Cambridge University Press, Cambridge; 2009.Google Scholar - Rooyen P, Lotter M, Wyk D:
*Space-Time Processing for CDMA Mobile Communications*. Kluwer Academic Publishers, Norwell; 2000.Google Scholar - Caffery J: A new approach to the geometry of TOA location. In
*IEEE VTS Fall VTC 2000*. Boston, MA, USA; 2000:1943-1949.Google Scholar

## Copyright

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