 Research
 Open Access
 Published:
Location estimation using RSS measurements with unknown path loss exponents
EURASIP Journal on Wireless Communications and Networking volume 2013, Article number: 178 (2013)
Abstract
The location of a mobile station (MS) in a cellular network can be estimated using received signal strength (RSS) measurements that are available from control channels of nearby base stations. Most of the recent RSSbased location estimation methods that are available in the literature rely on the rather unrealistic assumption that signal propagation characteristics are known and independent of time variations and the environment. In this paper, we propose an RSSbased location estimation technique, socalled multiple path loss exponent algorithm (RSSMPLE), which jointly estimates the propagation parameters and the MS position. The RSSMPLE method incorporates antenna radiation pattern information into the signal model and determines the maximum likelihood estimate of unknown parameters by employing the LevenbergMarquardt method. The accuracy of the proposed method is further examined by deriving the CramerRao bound. The performance of the RSSMPLE algorithm is evaluated for various scenarios via simulation results which confirm that the proposed scheme provides a practical position estimator that is not only accurate but also robust against the variations in the signal propagation characteristics.
1 Introduction
Recently, location estimation has been among the most attractive research topics in the area of cellular communications. With accurate position estimation, a variety of applications and services such as emergency services, monitoring and tracking fraud protection, asset tracking, fleet management, mobile yellow pages, and even cellular system design and management can become feasible for cellular networks [1]. These potential applications of wireless positioning have also been recognized by the IEEE, which set up a standardization group 802.15.4a for designing a new physical layer for lowdata rate communications combined with positioning capabilities [2]. Furthermore, the Federal Communications Commission (FCC) in the USA has required wireless providers to locate mobile users within tens of meters for emergency 911 calls [3].
The position of a mobile station (MS) can be determined using multiple radio signals transmitted or received by the MS. Some location estimation methods like assisted global positioning system (AGPS) are based on signals transmitted from satellites, while others rely on measurements of signals between MS and base stations (BS), the socalled networkbased methods. Currently, the best positioning accuracy in cellular systems is provided by AGPS at the expense of a significant increase in network and handset complexity [4]. For instance, modifications on the handset such as an embedded GPS receiver and deployment of location management units (LMU) into the network are needed in order to operate AGPS systems [5]. Compared to AGPS, networkbased methods are relatively less complex. Moreover, they can be used in many situations where the AGPS method cannot be applied, i.e., indoor positioning, but generally with a degradation in accuracy. So far, a wide variety of networkbased positioning techniques have been proposed which use measurements obtained within the cellular networks, such as received signal strength (RSS), time of arrival (TOA), time difference of arrival (TDOA), and angle of arrival (AOA) methods [6–15].
Positioning technology is often based on trilateration in timebased methods like TOA and TDOA, in which the MS position is obtained as the intersection point of three circles constituted by distance estimates [16]. Assurance of proper operation of timebased methods requires the deployment of LMUs [17]. These network elements perform timing measurements of all local transmitters, based on which the actual relative time difference for each BS can be estimated. In a similar manner, AOAbased positioning methods require the implementation of adaptive array antennas, by which the direction of signal arrival can be estimated. At the same time, the handset typically requires software modifications to enable positioning functionality with such a method. Consequently, these methods are not widespread in commercial systems due to their high deployment costs. Therefore, improving the accuracy of positioning systems based on the existing cellular network infrastructure is desired, which is the main motivation of this study.
The system model that is used for location estimation in this paper is based on RSS measurements. One fundamental MS function is to find the BSs with the strongest signal strength for cell selection purposes. Thus, RSSbased methods can be implemented without any hardware enhancement in either the MS or the BS. Distance information between MS and BS can be extracted from RSS measurements using accurate information about the propagation characteristics of the measurement channel. However, in most of the RSSbased location estimation techniques in the literature, it is assumed that the propagation parameters of the measurement channel are accurately known a priori, either through a training period or by assuming a perfect freespace channel condition [18–24]. Such an approach results in degraded positioning accuracy in many practical application scenarios, including mobile tracking techniques in [25, 26]. More specifically, both [25, 26] study Monte Carlobased mobility tracking algorithms under the assumption that the mobile moves in a 2D environment with input as acceleration. In [25], RSS data are used to predict mobile position and velocity using particle filtering techniques, but the method relies on known propagation parameters. In [26], the socalled interacting multiple model method has been extended to predict the state of the mobile for indoor applications by considering multiple fixed environment parameters at the expense of an increase in the number of random processes, whereas the technique herein relies on continuous parameter adaptation.
In this paper, a method that aims to resolve major shortcomings of the existing RSSbased positioning techniques is proposed. In particular, an RSSbased location estimation technique that jointly estimates the propagation parameters and the MS position is explained in Section 2. The CramerRao bound (CRB) derivation and accuracy evaluation are given in Section 3 as a benchmark for performance comparison. In Section 4, simulation results under various scenarios are presented to evaluate the performance of the proposed algorithm. Finally, some concluding remarks are given in Section 5.
2 RSSbased location estimation model
Using RSS together with a path loss (PL) and shadow fading model, a distance estimate between the BS and the MS can be obtained. The propagation model used throughout this paper is a modified version of the log normal model that is widely used in the literature [27–30]. The PL exponent (PLE) is the key parameter in the log normal model. An accurate value of the PLE is required in order to obtain an accurate estimate of the MSBS distance from the corresponding RSS measurement.
In most of the existing studies of RSSbased location estimation techniques in the literature, the channel model is assumed to be known a priori, that is, the path loss characteristics of the coverage area are considered known, either by assuming that the environment is a perfect free space or by extensive measurement and modeling prior to the deployment of location estimation systems. However, the PLE parameter is environment dependent [31, 32]. Even in the same environment, propagation characteristics may change considerably over a long period of time, e.g., due to seasonal and/or weather changes [33]. In [32], it is experimentally demonstrated in an omnidirectional antenna system that the PLE is strongly dependent on the base antenna height and the terrain category. Extension of the experimental study in [32] to directional antenna systems can be found in [34] where the authors show that antenna beamwidth has an additional gain reduction influence on the PLE. In other experimental studies that consider path loss modeling for directional antenna systems [35, 36], the authors compute different PLEs for different areas of the cell that consist of different terrains (but not different PLEs for different directional antennas of the same base station). There are also related studies that utilize single PLE for directional antenna systems [37–39].
The proposed algorithm in this paper estimates the MS location using the available RSS measurements without any need for a training period or any need for the knowledge of the PLE value in the path loss model. The PLE values are determined and calibrated in real time for every mobile using the RSS measurements. By incorporating the antenna radiation patterns of the sectors in a BS into the signal model, an additional improvement in position estimates is provided. In determining the position of a given mobile user, it is assumed that the PLE is the same for all sectors of a given base station, whereas the PLE might be different for another. This is a quite realistic assumption in light of the discussion of the related literature in the previous paragraph, since the mobile user is in the same location with respect to the base station and directional antennas are at the same height.
2.1 Antenna model
Point to multipoint and cellular communication systems commonly use fanbeam antennas for sector coverage. An approximate formula describing the normalized azimuth radiation pattern of the fanbeam antenna using three parameters is given by:
where a_{3dB} is a unitless parameter that determines the pattern value at half power bandwidth (HBW) ϕ=ϕ_{HBW} (in radians) [40], i.e.,
and τ is used to match the pattern to a second field value, ν, at ϕ=ϕ_{ ν } where 0<ν<1, i.e.,
In this paper, τ is evaluated at ϕ_{ ν }=π/2, and the value of ν is taken to be equal to 0.006 that is the inverse of the fronttoside ratio of the normalized pattern and ϕ_{HBW}=π/3 is the recommended value according to ETSI EN 301 2152 Class CS 2 requirement in a local multipoint distribution service pointtomultipoint application [40] (see Figure 1 for the radiation pattern used in this paper).
2.2 Path loss model
In cellular networks, an MS measures received signal code power on a common pilot channel (CPICH) in Universal Mobile Telecommunications System (UMTS) and RSS on a broadcast control channel (BCCH) in GSM systems to determine the received signal level. Signal strength measurements are indexed with base station and sectoral identifiers k and s, respectively, in (4) [18] considering that transmitting cells use different channels (CPICHs or BCCHs):
In (4), R_{k,s} is the received signal strength from sector s of base station k at point (x,y) (in watts); P is the total transmitted power on each sector s (in watts), and A_{k,s}(x,y) and G are the normalized radiation pattern and the antenna gain in azimuth direction, respectively, that belongs to the corresponding cell of sector s; d_{0} (in meters) is the freespace reference distance; d(x,y) (in meters) is the distance between MS and BS at point (x,y); v_{k,s} accounts for shadow fading; α_{ k } is the PLE that is specific for k th base station; and A_{k,s}(ϕ) is represented as A_{k,s}(x,y) since it is possible to determine ϕ with the knowledge of MS and BS coordinates. Herein, it is assumed that P, G, and β are assumed to be known a priori and β is calculated by [32]:
where λ is the wavelength in meters and d_{0} is chosen to be equal to 1 m in a microcell environment [31]. Rewriting the RSS in decibel (dB), we have:
where $\theta ={\left[\begin{array}{ccccc}x& y& {\alpha}_{1}& \dots & {\alpha}_{k}\end{array}\right]}^{T}$.
In this paper, it is assumed that the channels used by distant BSs may have different propagation characteristics. More specifically, the channels used by the cells that are served by the same BS are assumed to have the same PLE, and this PLE is not necessarily the same for other channels. Hence, the value of R_{k,s} and μ_{k,s} depends on α_{ k } in addition to the mobile position, (x,y).
2.3 Problem formulation and the positioning algorithm
Based on the path loss model described above, the distribution of R_{k,s(dB)}(θ) is Gaussian, i.e., we have:
where ${f}_{{R}_{k,s\left(\text{dB}\right)}}\left({R}_{k,s\left(\text{dB}\right)};\theta \right)$ denotes the pdf for the deterministic unknown parameter θ[41]. Assuming R_{k,s(dB)} is independent and identically distributed (i.i.d.), the likelihood function, L(θ) can be written as:
where n is the number of BSs that have RSS measurements for the MS and m is the number of sectors for each BS. Taking into account that R_{k,s(dB)} is an i.i.d. Gaussian random variable, L(θ) becomes:
In order to obtain the maximum likelihood (ML) estimate, θ_{ML} that best approximates the available data, L(θ) should be maximized over θ (see [41], pp. 177). This in turn can be done by computing:
where $argmin$ is the value of θ for which the given function is minimized over the given data set. Note that a distinctive advantage of ML estimate is that it can always be found for a given data set [41].
In this paper, we obtain this estimate using a recursive solution of a nonlinear least squares problem. To this end, define $\mathcal{J}\left(\theta \right)$ to be the cost function (which is to be minimized so that L(θ) in (9) is minimized):
and
where R=[R_{1,1}, R_{1,2}, …R_{n,m−1}, R_{n,m}]^{T} and μ(θ)=[μ_{1,1}, μ_{1,2}, …, μ_{n,m−1}, μ_{n,m}]^{T}, $\mathcal{J}\left(\theta \right)$ can be represented in vector form as:
Thus, any θ^{∗} that satisfies (14) is a solution of (10) if ${\mathbf{f}}^{\prime}\left({\theta}^{\ast}\right)$ is nonsingular, i.e.,
In this paper, the LevenbergMarquardt (LM) method which is a modified version of the GaussNewton method is employed to solve the nonlinear least squares problem [42, 43]. The proposed algorithm which is summarized as Algorithm 1 on the next page employs a linear approximation of the nonlinear equations to find a least squares estimate of these equations iteratively. The vector μ(θ) that consists of nonlinear functions is linearized using the Taylor series expansion in which the secondorder terms are omitted:
Firstorder Taylor series expansion is obtained for μ_{k,s(dB)}(θ) where θ^{(0)} is the initial estimate for θ_{ML} and J^{(0)} is the Jacobian matrix of μ_{k,s(dB)}(θ) at θ^{(0)}. Consequently, the LM step size Δ at each iteration is obtained by solving:
where h>0, e.g., for n=2 BSs and m=3 sectors for each BS, in case θ=[x,y,α_{1},α_{2}] are unknown parameters, the Jacobian matrix J can be represented as:
where $C{\left(\theta \right)}_{\mathit{\text{ks}}}=20log\left({A}_{\mathit{\text{ks}}}\left(\theta \right)\right)10{\alpha}_{k}log\left({d}_{k}\left(\theta \right)\right)$ and d_{ k } represents the distance between k th BS and the MS, that is, ${d}_{k}\left(\theta \right)=\sqrt{{(x{x}_{k})}^{2}+{(y{y}_{k})}^{2}}$. Herein, k index represents the BS, and s represents the sector that belongs to BS k. Since each channel used by different BSs may have a distinct PLE, α parameters are indexed with BS ID, k.
In Algorithm 1, k_{max} is the maximum number of allowed iterations (k_{max}=400 is used in the simulations), and ε_{1} is used to detect how close the estimate is to the desired value (e.g., ε_{1}=10^{−15}). Both parameters are chosen by the user. The damping parameter of the LM algorithm, h, is positive, which guarantees that Δ is a descent direction. Note that for large values of h, we have Δ=J^{T}(θ)f(θ)/h, which implies a short step in the descent direction, which in turn is good if the current iterate is far from the solution. On the other hand, if h is small, then Δ is approximately equal to what we have from the GaussNewton iteration. Since the damping parameter
Algorithm 1 LMbased algorithm for joint estimation of propagation parameters and mobile position
influences both the direction and the size of the step, its update is controlled by the gain ratio ρ in the algorithm. A large positive value of ρ indicates a good approximation which allows us to decrease h so that the LM step is closer to the GaussNewton step, whereas a small or negative ρ is a poor approximation which requires an increase of damping by twofold in order to get closer to the steepest direction and hence increase chances of faster convergence. By this choice of parameters similar to [44], we have observed linear to superlinear convergence in our problem, although it is harder to make specific statements on the convergence rate for the problem in hand. However, it is well known that the LevenbergMarquardt method has a quadratic rate of convergence when Jacobian is a nonsingular square matrix and if the parameter is chosen suitably at each step. The condition of the nonsingularity of Jacobian is too strong, and it is not valid in our problem either. Although the authors show in [42, 43] that the method has quadratic convergence under appropriate assumptions and the choice of the damping parameter, the results are valid only locally. In the next section, we derive the CRB bounds for the proposed method.
3 The CramerRao lower bound
The CRB for RSS estimation depends on the strength of signal, Gaussian random variable and path loss exponent. In radio propagation channel studies, the random variable v in the path loss model (4) is considered a zeromean Gaussian random variable, $\mathrm{i.e.},\phantom{\rule{1em}{0ex}}N(0,{\sigma}_{v}^{2})$, while its standard deviation ${\sigma}_{v}^{2}$ depends on the characteristics of a specific environment [45]. In the computation of the CramerRao bound, we let ${p}_{k,s}=10\underset{10}{log}\mathit{\text{PG}}/\beta {R}_{k,s}$, which is the observed path loss in decibel from 1 m to d meters. Thus, the system of nonlinear equations for location estimation can be rewritten as [46]:
where ${g}_{k,s}\left(\theta \right)=10{\alpha}_{k}\underset{10}{log}{d}_{k}20\underset{10}{log}{A}_{k,s}\left(\varphi \right)$ and the unknown vector parameter θ=[x y α_{1}…α_{ k }]^{T}, k is the index identifying the base stations, while s is the index representing the antenna sector. For each base station k, there are three antenna sectors s=1,2,3 defined. In this setting, the path loss observation p_{ k } defined in (19) has a probability density function:
which is parameterized by the unknown vector parameter θ. If we assume that p_{k,s}, 1≤k≤n,1≤s≤3 are statistically independent observations (which is a reasonable assumption as the transmitted powers are independent), the joint distribution of observation vector p=[p_{1,1}, p_{1,2}, p_{1,3}, …, p_{n,1}, p_{n,2}, p_{n,3}] is obtained as:
The CRB on the covariance matrix of any unbiased estimator $\widehat{\theta}$ is defined as:
where F=−E[Δ_{ θ }(Δ_{ θ } lnf(p;θ))^{T}] is the Fisher information matrix (FIM) [41].
Given the joint distribution of the observation vector p in (21), the equivalent loglikelihood function can be defined as:
from which the Fisher information matrix can be derived as:
Recall that g_{k,s}(θ) is defined by ${g}_{k,s}\left(\theta \right)=10{\alpha}_{k}\underset{10}{log}{d}_{k}20\underset{10}{log}{A}_{k,s}(x,y)$ and θ=[x,y,α_{1},α_{2},…,α_{ k }]^{T}. Subsequently, the gradients of g_{k,s}(θ) can be computed as:
where ${u}_{\mathit{\text{kx}}}=\frac{{x}_{k}x}{{d}_{k}}$, ${u}_{\mathit{\text{ky}}}=\frac{{y}_{k}y}{{d}_{k}}$, δ_{ k l }=1 if k=l, and δ_{ k l }=0, otherwise.
The (k+2)×(k+2) Fisher information matrix can be represented as follows:
In the next section, we further define quantitative performance measures for location estimators based on CRB.
3.1 Accuracy measures
Let $(\widehat{x},\u0177)$ be any unbiased location estimator. Then CRB in (21) provides a lower bound on the variance of the unbiased estimator $(\widehat{x},\u0177)$, that is,
In location estimation applications, a more meaningful performance measure of location estimators is based on the geometric location estimation error $\epsilon =\sqrt{{(\widehat{x}{x}_{k})}^{2}+{(\u0177{y}_{k})}^{2}}$. The meansquared error (MSE) of any unbiased location estimator is lower bounded as (26) describes:
where ε_{rms} is defined as the rootMSE (RMSE) of location estimators.
Since we assume that the path loss exponent value for each base station is independent of each other, the elements of the Fisher information matrix that include the product of partial derivatives of distinct α values reduce to zero. Let ${\stackrel{~}{F}}_{x}$ be the (k+1)×(k+1) special matrix obtained by deleting the first row and column of F, i.e.,
where its components that might be nonzero are shown with parameters a, d_{ i }, e_{ i }, and f_{ i }, i=1,…,n. Similarly, let ${\stackrel{~}{F}}_{y}$ be the same type of special matrix obtained by deleting the second row and column of F. Subsequently, (27) can be rewritten as:
where $det{\stackrel{~}{\mathbf{F}}}_{x}$ (and similarly $det{\stackrel{~}{\mathbf{F}}}_{y}$) can be computed as [20]:
For the case of three base stations with unequal path loss exponents, the FIM matrices are of size 5×5 and the unknown vector parameter is given by θ=[x,y,α_{1},α_{2},α_{3}]^{T}. After some algebraic manipulation, [F^{−1}]_{11} and [F^{−1}]_{22} can be expressed as:
where F is the determinant of the Fisher information matrix and ε_{rms} is defined as the RMSE of location estimators. The closed form expression of the CRB bound is not explicitly given here due to its complexity; instead, only the numerical solutions are presented. On the other hand, each component of the FIM matrix is given in the Appendix.
4 Simulation results
In this section, simulation results for various scenarios are presented and discussed. We assume that all BSs in the network have a threesector configuration where each sector belongs to a cell with identical coverage area and transmit power. The considered network is composed of three BSs as shown in Figure 2. The cell radius is assumed to be 1 km for all cells. Sectoral antennas are modeled by the antenna model described in Section 2. BSs are located at Cartesian coordinates [0, 0], [1500, 0], and [0, 1500] in meters. In order to evaluate the effect of the restrictions mentioned in the GSM and UMTS specifications on the performance of the proposed algorithm, two cases for the RSS measurements are considered separately. In the first case, exact measurements are used in the algorithm. In the second case, measurements are truncated if they are below or above the threshold values mentioned in the standards. In the simulations, it is assumed that BS located at coordinates [0, 0] is the serving cell and the MS does not change its serving cell (i.e., no handover occurs). At each realization, the MS point MS =[x,y] is generated randomly with a uniform distribution inside the area in the first quadrant of the Cartesian coordinates which is bounded by a circle centered at [0, 0] as in Figure 2.
The proposed algorithm computes the ML estimate of the MS position using the RSS measurements and concurrently calibrates the PLE parameters of the channels occupied by different BSs. Recall that this algorithm is referred to as RSSMPLE algorithm. In order to demonstrate the improvement on the positioning accuracy provided by the RSSMPLE algorithm, its performance is compared with those of other algorithms, such as RSS with single PLE algorithm (RSSSPLE) [46], which finds and calibrates a single PLE for all channels, and RSS with known PLE algorithm (RSSKPLE) [18] in which PLE values are known as a priori. Furthermore, the CramerRao bound has been evaluated and compared with the RMSE results of the proposed algorithm.
4.1 Effect of truncated RSS measurements
RSS measurements below −110 dBm and above −48 dBm are truncated in GSM systems. In Figure 3, the effect of such truncation of RSS measurements in the performance of the proposed algorithm is investigated. The case in which all BSs have the same PLE value, i.e., α_{1}=α_{2}=α_{3}=3, is considered in this simulation, during which RSSMPLE and RSSKPLE algorithms are operated both with truncated and original RSS measurements. The truncated measurements represent all RSS measurements below −110 dBm and above −48 dBm. In Figure 3 (and the subsequent figures in the paper), the following legend clarification is necessary to better interpret the results:

‘Truncated RSS are omitted’ means that RSS measurement are truncated and measurements below −110 dBm and above −48 dBm are not used in the simulations.

‘Truncated RSS are used’ means that RSS measurements being truncated and measurements below −110 dBm and above −48 dBm are used in the simulations.

‘RSS are not truncated’ means that RSS measurements are not truncated.
From Figure 3, we note that the positioning RMSE obtained with RSSMPLE algorithm does not exceed 20 m even for σ_{ v }=10 if RSS measurements are not truncated. On the other hand, truncation of RSS measurements dramatically degrades the performance of both RSSMPLE and RSSKPLE algorithms due to the decrease in the number of RSS measurements, i.e., the performance of the proposed algorithm is expected to improve with an increase in the number of available measurements.
Since the truncated measurements represent all RSS measurements below −110 dBm and above −48 dBm, they introduce a large bias in the position estimate when incorporated in the RSS measurement set. Because of this, positioning accuracy of the RSSMPLE algorithm severely degrades when the truncated RSS measurements are not omitted. Compared to the RSSMPLE algorithm, the RSSKPLE algorithm performs better for all σ_{ v } values when truncated RSS measurements are used. This is an expected result since RSSMPLE algorithm estimates PLE values in addition to the coordinates with the same number of RSS measurements.
4.2 Effect of inaccurate knowledge of PLE values
In this subsection, the effect of inaccurate PLE values on positioning accuracy is examined and depicted in Figure 4. Throughout the simulation, the PLE values α_{1}=3.5, α_{2}=2.7, and α_{3}=2.3 are used in the RSSKPLE algorithm, whereas actual PLE values are α_{1}=3.8, α_{2}=3.0, and α_{3}=2.6. Simulations are carried out with both truncated and exact RSS measurements. As shown in Figure 4, the RSSMPLE algorithm outperforms the rivals under mild shadow fading since the proposed algorithm is capable of adapting PLE values in real time. On the other hand, the PLE inaccuracy has a drastic effect on positioning accuracy of RSSKLPLE. As σ_{ v } increases, the adverse effect of the inaccurate PLE values diminishes since shadow fading becomes the main error source.
4.3 Effect of distinct PLE values
This subsection focuses on the performance analysis of RSSMPLE, RSSSPLE, and RSSKPLE algorithms under different channel conditions. In the first scenario, it is assumed that all channels have the same PLE value. In the second scenario, PLE values differ for channels occupied by different BSs.
4.3.1 Equal α_{ 1 }, α_{ 2 }, and α_{ 3 }
Let us first consider the rather unrealistic case where all BSs (i.e., all channels) are assumed to have the same PLE value which is equal to three (see Figures 5 and 6). In Figure 5, the RMSE for the positioning algorithms of interest is shown. Since PLE values of all channels are identical, the RSSSPLE algorithm is expected to outperform the RSSMPLE algorithm for the same number of RSS measurements, which is indeed the case as depicted in Figure 5.
To evaluate the RSSMPLE and RSSSPLE algorithms with respect to the FCC requirements, the positioning error cumulative distribution function (CDF) is shown in Figure 6 for σ_{ v }=6 dB, which is a realistic value in a microcellular environment [31]. The RSSSPLE and RSSKPLE algorithms satisfy the FCC requirements, which mandate 67% CERP within 100 m and 95% CERP within 300 m. Although the RSSMPLE algorithm does not satisfy the FCC requirements, this algorithm offers a solution for environments that possess distinct and variable PLEs.
4.3.2 Distinct α_{ 1 }, α_{ 2 }, and α_{ 3 }
From Figure 5, it is seen that the RSSSPLE algorithm has good performance when all PLEs are equal. However, if BSs have different α values, the RSSMPLE algorithm is expected to outperform the rival algorithms since each PLE is treated separately in the RSSMPLE algorithm (see Figures 7 and 8). Moreover, as σ_{ v } increases, the gap between the positioning RMSE of the RSSMPLE and RSSSPLE algorithms closes since the error variance of the α estimates obtained with RSSMPLE algorithm increases. Such a scenario is simulated for BSs that have different PLE values, i.e., for α_{1}=3.5, α_{2}=2.7, and α_{3}=2.3.
Figure 7 shows that the performance of the RSSSPLE algorithm deteriorates when PLE values of the BSs are unequal. The scenario considered in this simulation can be experienced when a BS that is in the vicinity of the MS is in NLOS condition and other BSs are in LOS condition with the MS. Compared to the RSSSPLE algorithm, positioning accuracy of the RSSMPLE algorithm does not change significantly under these conditions. On the other hand, position estimates obtained with RSSSPLE algorithm are erroneous due to the bias in the α estimate. Moreover, positioning accuracy of RSSMPLE and RSSKPLE algorithms are close even when PLE values vary. Thus, RSSMPLE algorithm satisfies the requirements for a position estimate with low error variance, independent from unknown propagation parameters, i.e., σ_{ v } and α values. The positioning error CDF shown in Figure 8 indicates that the accuracy of mobile positioning can substantially be improved by employing the RSSMPLE algorithm.
4.4 CRB performance evaluation
In this subsection, we evaluate the CRB bound for the equal PLE case and depict the positioning RMSE for the proposed RSSMPLE algorithm in Figure 9. From Figure 9, it is noted that the RMSE is relatively high in the middle area, while it shows better results at boundary areas. Actually, this is expected due to the pattern contribution in location estimation since more signal measurements are available for such cases. Figure 10 depicts the CRB results for the same scenario of the proposed algorithm RSSMPLE. From Figures 9 and 10, it can be concluded that the performance degrades up to 450 m in RMSE and 400 m in CRB. Moreover, it is clearly seen that the radiation pattern has a significant effect on location estimation.
5 Conclusions
In this paper, a practical positioning method that can be implemented in mobile networks with simple modifications in the existing infrastructure is presented. The proposed method, the socalled RSSMPLE, is based on RSS measurements and jointly estimates the MS position and the propagation parameters, namely the PLE value of the measurement channel. The RSSMPLE method does not need a training period to estimate the PLE value of the channel. The most significant feature of the proposed RSSMPLE algorithm is its ability to separately calibrate the PLE value of each channel occupied by different BSs. Moreover, the RSSMPLE algorithm incorporates the antenna radiation pattern information that provides additional improvement in positioning accuracy. Via extensive simulations, the performance of the proposed method has been compared with those of the existing algorithms in terms of positioning RMSE, bias, availability, and CERP under different environmental conditions by changing PLE and SNR values. Simulation results indicate that the RSSMPLE algorithm is robust against variations in the PLE values under different environment conditions.
6 Appendix
6.1 CramerRao bound for the three BS case
The components of the Fisher information matrix are given as below:
References
 1.
Caffery JJ: Wireless Location in CDMA Cellular Radio Systems. Springer, Heidelberg; 2000.
 2.
IEEE P802.15.4a/D4: Part 15.4: Wireless Medium Access Control(MAC) and Physical Layer (PHY) Specifications for LowRate wireless personal area networks (LRWPANs): Amendment of IEEE Std 802.15.4, July 2006. IEEE, Piscataway; 2006.
 3.
Commission FC: Revision of the Commission’s Rules to Ensure Compatibility with Enhanced 911 Emergency Calling Systems, FCC 94102. FC Commission, Washington DC; 1996.
 4.
Borkowski J, Niemela J, Lempiäinen J: Cellular location techniques supporting AGPS positioning. IEEE Vehicular Technol. Conf 2005, 1: 429433.
 5.
Gustafsson F, Gunnarsson F: Mobile positioning using wireless networks: Possibilities and fundamental limitations based on available wireless network measurements. IEEE Signal Process. Mag 2005, 22(4):4153.
 6.
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
 7.
Dil BJ, Havinga PJM: Australasian Telecommunication Networks and Applications Conference, ATNAC 2010. Auckland; 31 October –3 November 2010.
 8.
Lakmali B, Dias D: Database correlation for GSM location in outdoor & indoor environments. The 4th International Conference on Information and Automation for Sustainability, Colombo, 1214 December 2008. IEEE, Piscataway; 2008.
 9.
Ahonen S, Laitinen H: Database correlation method for UMTD location. IEEE Vehicular Technol. Conf 2003, 4: 26962700.
 10.
Spirito M, Mattioli A: Preliminary experimental results of a GSM mobile phones positioning system based on timing advance. IEEE Vehicular Technol. Conf 1999, 4: 20722076.
 11.
Spirito M: On the accuracy of cellular mobile station location estimation. IEEE Trans. Vehicular Technol 2001, 50(3):674685. 10.1109/25.933304
 12.
KhalafAllah M: Nonparametric Bayesian filtering for location estimation, position tracking and global localization of mobile terminals in outdoor wireless environments. EURASIP J Adv. Signal Process 2008, 2008: 114.
 13.
Borkowski J, Lempiäinen J: Pilot correlation positioning method for urban UMTS networks. Proceedings of the 11th European Wireless Conference, Nicosia, 10–13 April 2005. vol. 2. IEEE, Piscataway; 2005.
 14.
Pan W, Wu J, Jiang Z, Wang Y, You X: Mobile position tracking by TDOADoppler hybrid estimation in mobile cellular system, IEEE International Conference on Communications, Glasgow, 24–28 June 2007. IEEE, Piscataway; 2007.
 15.
Türkyilmaz O, Alagöz F, Gür G, Tugcu T: Environmentaware location estimation in cellular networks. EURASIP J. Adv. Signal Process 2008, 2008: 276456. 10.1155/2008/276456
 16.
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.
 17.
Borkowski J, Lempiäinen J: Practical networkbased techniques for mobile positioning in UMTS. EURASIP J. Appl. Signal Process 2006, 2006: 012930.
 18.
Budka K, Calin D, Chen B, Jeske D: A Bayesian method to improve mobile geolocation accuracy. IEEE Vehicular Technol. Conf 2002, 2: 10211025.
 19.
Chu KMK, Leung KRPH, JKY Ng, Li CH: Locating mobile stations with statistical directional propagation model in AINA ’04. Proceedings of the 18th International Conference on Advanced Information Networking and Applications, Washington, 29  31 March 2004. IEEE, Piscataway; 2004.
 20.
Qi Y, Kobayashi H: CramerRao Lower bound for geolocation in nonlineofsight environment. IEEE Int. Conf. Acoustics, Speech, Signal Process. (ICASSP) 2002, 3: 24732476.
 21.
Yamamoto R, Matsutani H, Matsuki H, Oono T, Ohtsuka H: Position location technologies using signal strength in cellular systems. IEEE Vehicular Technol. Conf 2001, 4: 25702574.
 22.
Aso M, Saikawa T, Hattori T: Maximum likelihood location estimation using signal strength and the mobile station velocity in cellular systems. Vehicular Technol. Conf 2003, 2: 742746.
 23.
Zhou J, Ng JY: A data fusion approach to mobile location estimation based on ellipse propagation model within a cellular radio network, The 21st International Conference on Advanced Information Networking and Applications Niagara Falls, 21  23 May 2007. IEEE, Piscataway; 2007.
 24.
Akar M, Mitra U: Variations on optimal and suboptimal handoff control for wireless communication systems. IEEE J. Selected Areas Commun 2001, 19(6):11731185. 10.1109/49.926373
 25.
Mihaylova L, Angelova D, Honary S, Bull D, Canagarajah N, Ristic B: Mobility tracking in cellular networks using particle filtering. IEEE Trans. Wireless Commun 2007, 6(10):35893599.
 26.
Achutegui K, Rodas J, Escudero CJ, Miguez J: A modelswitching sequential Monte Carlo algorithm for indoor tracking with experimental RSS data. The International Conference on Indoor Positioning and Indoor Navigation (IPIN), Zurich, 15–17 September 2010. IEEE, Piscataway; 2010.
 27.
Turkka J, Renfors M: Path loss measurements for a nonlineofsight mobiletomobile environment The 8th International Conference on ITS Telecommunications, Phuket, 24–24 October 2008. IEEE, Piscataway; 2008.
 28.
Srinivasa S, Haenggi M: Path loss exponent estimation in large wireless networks. CERN Document Server, Meyrin; 2008.
 29.
Shirahama J, Ohtsuki T: RSSbased localization in environments with different path loss exponent for each link. IEEE Vehicular Technology Conference, Singapore, 11–14 May 2008. IEEE, Piscataway; 2008.
 30.
Popescu I, Nikitopoulos D, Constantinou P, Nafornita I: ANN prediction models for outdoor environment. IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications, Helsinki, 11–14 September 2006. IEEE, Piscataway; 2006.
 31.
Rappaport T: Wireless Communications. Prentice Hall PTR, New Jersey; 2002.
 32.
Erceg V, Greenstein LJ, Tjandra SY, Parkoff SR, Gupta A, Kulic B, Julius AA: An empirically based path loss model for wireless channels in suburban environments. IEEE J. Selected Areas Commun 1999, 17(7):19991205.
 33.
Martinez K, Hart JK, Ong R: Environmental sensor networks. Computer 2004, 37: 5056.
 34.
Greenstein LJ, Erceg V: Gain reductions due to scatter on wireless paths with directional antennas. IEEE Commun. Lett 1999, 3(6):169171.
 35.
Wilson PF, Papazian PB, Cotton MG, Lo Y: Advanced antenna test bed characterization for wideband wireless communications, NTIA Technical report. US Department of Commerce, Washington DC; 1999.
 36.
Rahman TA, Ser GB: Propagation measurement in IMT2000 band in Malaysia environment. TENCON 2000 2000, 1: 7781.
 37.
Wang SW, Wang I: Effects of soft handoff, frequency reuse and nonideal antenna sectorization on CDMA system capacity. 43rd IEEE Vehicular Technology Conference, Secaucus, 18–20 May 1993. IEEE, Piscataway; 1993.
 38.
Vavoulas A, Vaiopoulos N, Varoutas DA, Chipouras A, Stefano G: Performance improvement of fixed wireless access networks by conjunction of dual polarization and time domain radio resource allocation technique. Int. J Commun. Syst 2010, 24: 483491.
 39.
Park J, Jang JW, Park SG, Sung W: Capacity of sectorized distributed networks employing adaptive collaboration from remote antennas. IEICE Trans 2010, E93B: 35343537. 10.1587/transcom.E93.B.3534
 40.
Runyon D: Optimum directivity coverage of fanbeam antennas. IEEE Antennas Propagation Mag 2002, 44(2):6670. 10.1109/MAP.2002.1003636
 41.
Kay SM: Fundamentals of Statistical Signal Processing: Estimation Theory. Prentice Hall PTR, New Jersey; 1993.
 42.
Yamashita N, Fukushima M: On the rate of convergence of the LevenbergMarquardt methods. Comput Suppl 2001, 15: 237249.
 43.
Fan JY, Yuan YX: On the quadratic convergence of the LevenbergMarquardt method without nonsingularity assumption. Computing 2005, 74: 2339. 10.1007/s0060700400831
 44.
Madsen K, Nielsen HB, Tingleff O: Methods for Nonlinear Least Squares Problems. Informatics and Mathematical Modelling Technical University of Denmark, Lyngby; 2004.
 45.
Pahlavan K, Levesque A: Wireless Information Networks. John Wiley and Sons, Inc., New York; 1995.
 46.
Li X: RSSbased location estimation with unknown pathloss model. IEEE Trans. Wireless Commun 2006, 5(12):36263633.
Acknowledgements
The authors would like to thank the referees for their constructive comments which improved the exposition of the paper.
The authors dedicate this article in memory of one of its coauthors, Frederic Kerem Harmanci, who passed away between the completion of his article and its publication.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
About this article
Cite this article
Zeytinci, M.B., Sari, V., Harmanci, F.K. et al. Location estimation using RSS measurements with unknown path loss exponents. J Wireless Com Network 2013, 178 (2013). https://doi.org/10.1186/168714992013178
Received:
Accepted:
Published:
Keywords
 Mobile positioning; Location estimation; CramerRao bound; Received signal strength