Next Article in Journal
Drift Reduction in Pedestrian Navigation System by Exploiting Motion Constraints and Magnetic Field
Next Article in Special Issue
A Movement-Assisted Deployment of Collaborating Autonomous Sensors for Indoor and Outdoor Environment Monitoring
Previous Article in Journal
Experimental Study on Rebar Corrosion Using the Galvanic Sensor Combined with the Electronic Resistance Technique
Previous Article in Special Issue
Clustering and Beamforming for Efficient Communication in Wireless Sensor Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

RSS-Based Method for Sensor Localization with Unknown Transmit Power and Uncertainty in Path Loss Exponent

1
School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China
2
Institute of Electronic and Information Engineering in Dongguan UESTC, Dongguan 523808, China
3
Space Star Technology Co., Ltd. and State Key Laboratory of Space-Ground Integrated Information Technology, Beijing 100191, China
4
Department of Electronics and Information Systems, Akita Prefectural University, Akita 015-0055, Japan
*
Author to whom correspondence should be addressed.
Sensors 2016, 16(9), 1452; https://doi.org/10.3390/s16091452
Submission received: 7 July 2016 / Revised: 23 August 2016 / Accepted: 30 August 2016 / Published: 8 September 2016

Abstract

:
The localization of a sensor in wireless sensor networks (WSNs) has now gained considerable attention. Since the transmit power and path loss exponent (PLE) are two critical parameters in the received signal strength (RSS) localization technique, many RSS-based location methods, considering the case that both the transmit power and PLE are unknown, have been proposed in the literature. However, these methods require a search process, and cannot give a closed-form solution to sensor localization. In this paper, a novel RSS localization method with a closed-form solution based on a two-step weighted least squares estimator is proposed for the case with the unknown transmit power and uncertainty in PLE. Furthermore, the complete performance analysis of the proposed method is given in the paper. Both the theoretical variance and Cramer-Rao lower bound (CRLB) are derived. The relationships between the deterministic CRLB and the proposed stochastic CRLB are presented. The paper also proves that the proposed method can reach the stochastic CRLB.

1. Introduction

Wireless sensor networks (WSNs) have been widely used for monitoring and control in military, environmental, health and commercial systems [1,2,3,4]. A WSN usually consists of tens or hundreds of wirelessly connected sensors. Sensor positioning becomes an important issue. Since the global positioning system (GPS) is currently a costly solution, only a small percentage of sensors are equipped with GPS receivers called reference devices (RDs), whereas the other sensors are blindfolded devices (BDs).
Several geolocation techniques have been used to estimate sensor positions, including the time-of-arrival (TOA)-, the time-difference-of-arrival (TDOA)-, the angle-of-arrival (AOA)-, the received signal strength (RSS)-based methods or hybrid location methods [5,6,7,8]. Among these location techniques, a method based on RSS has attracted much attention because of its low complexity and low cost of devices [9]. For the RSS localization technique, the transmit power and path loss exponent (PLE) are two critical parameters which have significant effects on the positioning accuracy. Many RSS methods and performance analyses have been reported in the literature [10,11,12,13,14,15]. These studies assumed that both the transmit power and PLE are perfectly known. However, this assumption is not suitable for a practical channel environment. Since the transmit power of a sensor in the WSNs depends on its battery, antenna gain, and scheduling algorithm, it is changing with different sensors and times. The additional hardware and software caused by the transmission of the transmit power between RDs and a BD make the WSNs more convoluted. Moreover, the transmit power is usually unknown for non-cooperative applications such as sensor localization in military areas. Compared with the transmit power, the PLE is not only a time-varying parameter but also a function of the channel environment. It changes as the environment and time change. Subsequently, various RSS-based location methods [16,17,18,19,20,21,22] have been proposed to consider the case where both the transmit power and PLE are unknown. Different estimators such as maximum likelihood (ML) and semidefinite programming (SDP) are devised in those algorithms. Although those algorithms can provide the optimum or suboptimum performance, they require a search or alternating process, and cannot give a closed-form solution to sensor localization. The inefficiency incurred by these algorithms may not be feasible to be applied in a practical system. In addition, the performance of the search methods may strongly rely on the initial solution. An improper selection of the initialization may lead to a local minimum and cause a large estimation error. Besides the above localization algorithms, some studies have been reported on performance analyses for sensor localization using RSS measurements [16,23]. The authors in [16] derived the Cramer-Rao lower bound (CRLB) for the RSS location technique considering the case with the unknown transmitted power and PLE. Furthermore, a more practical CRLB was proposed in [23]. Besides the unknown transmitted power and PLE, the derived CRLB in [23] considers both the antenna radiation pattern information and the differences of PLE among RDs. There are deterministic and stochastic CRLBs for the RSS localization technique. The former regards the PLE as a deterministic unknown parameter while the latter models the PLE as a Gaussian random variable. Although the deterministic CRLBs for the RSS localization technique have been addressed in the literature [16,23], the stochastic CRLB of RSS methods has not been studied. This paper will try to derive the stochastic CRLB for RSS-based location methods.
In this paper, a novel RSS localization method based on a two-step weighted least squares (WLS) estimator is proposed for the case with the unknown transmit power and uncertainty in PLE. Furthermore, the complete performance analysis of the proposed method is given in the paper. Since the mobile location is a nonlinear problem, some approximations are essential for the proposed method to obtain the closed-form solution. The perturbation approach retaining only the linear perturbation terms is used here to solve the nonlinear mobile location problem. Theoretical analysis proves that the theoretical variance of the proposed method is equal to the CRLB. This means that the effect of the approximations is extremely small. Compared with the previous research studies, the main contributions of this paper are listed as follows:
(1)
The proposed method can not only provide the closed-form solution but it can also attain the CRLB which is verified by the theoretical analysis and simulations. The existing RSS methods considering the unknown transmit power and uncertainty in PLE require a search process.
(2)
Compared with the deterministic assumption of PLE in the literature [16,17,18,19,20,21,22,23], the stochastic assumption used in this paper is more suitable for a real environment. The existing RSS methods in [16,17,18,19,20,21,22,23] regarded the PLE as a deterministic unknown parameter and tried to estimate it. These methods assumed that there is no prior knowledge on the PLE. Based on this assumption, the deterministic CRLB is derived in [16,23]. Although it is very hard to obtain an exact value of the PLE, approximate estimates of the PLE for typical channel environments can be obtained through a field test which has been reported in the literature [24,25]. To describe the uncertainty of the PLE, this paper models the PLE as a Gaussian random variable whose mean and variance are treated as prior knowledge and can be obtained from experimental analysis.
(3)
The performance analysis for the proposed method is presented in this paper. Both the theoretical variance and stochastic CRLB for the proposed method are derived in the paper. Moreover, some characteristics of the proposed stochastic CRLB for WSN localization are derived in this paper. The relationships between the deterministic CRLB [16] and the proposed stochastic CRLB are presented in Propositions 1 and 2. The paper also proves that the proposed method can reach the stochastic CRLB. These have not been addressed in the literature.
Section 2 briefly introduces the system model. A novel RSS method for the case with the unknown transmit power and uncertainty in the PLE is proposed in Section 3. Section 4 derives the stochastic CRLB. Some characteristics of the proposed methods are given in Section 5. In Section 6, the performance of the proposed algorithm is simulated in terms of the root mean square error (RMSE). The conclusions of this paper are given in Section 7.

2. System Model

The basic RSS model is briefly introduced in this section. Assume that (x, y) is the position of a BD to be estimated and the known coordinate of the ith RD in a N -RDs system is (xi, yi). Without loss of generality, the position of the first RD can be set to be (0, 0). Denote the measurement with noise of { * } as { * } . The true distance between the ith RD and BD can be modeled as:
r i 2 = ( x i x ) 2 + ( y i y ) 2 = k i 2 x i x 2 y i y + k
where k i = x i 2 + y i 2 and k = x 2 + y 2 .
Since the measured received power P i at RD i (in decibel milliwatts) can be modeled as a log-normal variable [10], the relation between P i and r i is:
P i = P 0 10 β log 10 ( r i r 0 ) + n i
where β is the PLE, n i is a zero-mean Gaussian random process with variance σ 2 in decibels, P 0 is the reference power at reference distance r 0 and it depends on the transmit power. Typically, r0 = 1 m. Note that Equation (2) is the most popular RSS model and has been widely used in the literature [10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]. Moreover, the model has been validated by a variety of measurement results [10,21,25]. For several non-cooperative applications such as mobile location in military areas, the transmit power is usually unknown to RDs which leads to the unknown P 0 . The PLE β is a function of the environment and varies typically between 2 (free space) and 4. For particular environments, β may be known from experimental analysis. The earlier research [10,11,12,13,14,15] on mobile locations using RSS measurements assumed that β can be exactly obtained. This assumption is not suitable for a real situation since β changes as the channel environment and time change. To improve the positioning accuracy, several studies [16,17,18,19,20,21,22,23] subsequently regarded the PLE as a deterministic unknown parameter and tried to estimate it. Compared with the deterministic assumption in [16,17,18,19,20,21,22,23], this paper models the PLE as a Gaussian random variable whose mean and variance can be obtained from experimental analysis.
Considering the uncertainty of PLE, β in this paper is modeled as:
β = β 0 + n β
where β0 is the mean of β and can be obtained through the field test, and the disturbance n β is used to describe the uncertainty of the PLE, caused by the changes of environment and time, which is assumed to be an independent zero-mean Gaussian distribution with variance σ β 2 based on the law of large numbers.

3. Closed-Form Solutions

From Equation (2), r i can be obtained:
r i = 10 ( P 0 P i ) / 10 β
Substituting Equation (1) into Equation (4) gives:
2 x i x + 2 y i y k + 10 P 0 / 5 β 10 P i / 5 β = k i
With the RSS noise and PLE disturbance, the error vector derived from Equations (2) and (4) is:
e = Y G Z
where G = [ 2 x 1 2 y 1 1 10 P 1 / 5 β 2 x N 2 y N 1 10 P N / 5 β ] , Y = [ k 1 k N ] , Z = [ x y k 10 P 0 / 5 β ] .
The first step WLS estimator of Z can be obtained from Equation (5):
Z = arg min { ( Y G Z ) T Ψ 1 ( Y G Z ) } = ( G T Ψ 1 G ) 1 G T Ψ 1 Y
where ψ is the covariance matrix of e:
ψ = cov ( e ) = E ( e e T )
It should be noted that matrix G contains the unknown parameter β. To solve Equation (6), the mean β0 of β is used in G . Matrix G becomes:
G = [ 2 x 1 2 y 1 1 10 P 1 / 5 β 0 2 x N 2 y N 1 10 P N / 5 β 0 ]
Ignoring the square error term derived from Equation (5), the element e i of e can be expressed as:
e i = ln 10 5 β 0 2 10 P 0 P i 5 β 0 ( β 0 n i + ( P 0 P i ) n β )
From Equation (8), the expectations of e i e j and e i 2 can be obtained:
E ( e i e j ) = E [ ( ln 10 5 β 0 2 10 P 0 P i 5 β 0 ) ( ln 10 5 β 0 2 10 P 0 P j 5 β 0 ) ( β 0 n i + ( P 0 P i ) n β ) ( β 0 n j + ( P 0 P j ) n β ) ] = ( ln 10 5 β 0 2 10 P 0 P i 5 β 0 ) ( ln 10 5 β 0 2 10 P 0 P j 5 β 0 ) ( P 0 P i ) ( P 0 P j ) σ β 2
E ( e i 2 ) = E [ ( ln 10 5 β 0 2 10 P 0 P i 5 β 0 ) 2 ( β 0 n i + ( P 0 P i ) n β ) 2 ] = ( ln 10 5 β 0 2 10 P 0 P i 5 β 0 ) 2 ( β 0 2 σ 2 + ( P 0 P i ) 2 σ β 2 )
Substituting Equations (9) and (10) into Equation (7) gives:
ψ = cov ( e ) = E ( e e T ) = B Q B
where
B = d i a g { [ ln 10 5 β 0 2 10 P 0 P 1 5 β 0 ln 10 5 β 0 2 10 P 0 P N 5 β 0 ] }
Q = [ β 0 2 σ 2 + ( P 0 P 1 ) 2 σ β 2 ( P 0 P 1 ) ( P 0 P 2 ) σ β 2 ( P 0 P 1 ) ( P 0 P N ) σ β 2 ( P 0 P 2 ) ( P 0 P 1 ) σ β 2 β 0 2 σ 2 + ( P 0 P 2 ) 2 σ β 2 ( P 0 P 2 ) ( P 0 P N ) σ β 2 ( P 0 P N ) ( P 0 P 1 ) σ β 2 ( P 0 P N ) ( P 0 P 2 ) σ β 2 β 0 2 σ 2 + ( P 0 P N ) 2 σ β 2 ]
Since the covariance matrix ψ depends on the unknown P i and P 0 , further approximation is necessary to make the problem solvable. First, the approximate value P i can be used in ψ to replace P i . Second, the approximate estimate of P 0 can be obtained using the least square (LS) estimator:
Z = ( G T G ) 1 G T Y
P 0 = 5 β log 10 Z 4
The covariance matrix of Z can be calculated by using the perturbation approach. Further, Δ is denoted as error perturbation. In the presence of noise and disturbance,
G = G 0 + Δ G
Z = Z 0 + Δ Z
Y = Y 0
Equation (6) can be rewritten as:
( G T Ψ 1 G ) Z = G T Ψ 1 Y
Substituting Equations (16)–(18) into Equation (19) gives:
( ( G 0 T + Δ G T ) Ψ 1 ( G 0 + Δ G ) ) ( Z 0 + Δ Z ) = ( G 0 T + Δ G T ) Ψ 1 Y 0
Ignoring the square error term, Equation (20) can be simplified as:
G 0 T Ψ 1 G 0 Z 0 + G 0 T Ψ 1 Δ G Z 0 + Δ G T Ψ 1 G 0 Z 0 + G 0 T Ψ 1 G 0 Δ Z = G 0 T Ψ 1 Y 0 + Δ G T Ψ 1 Y 0
Without the noise of P i and the disturbance of the PLE,
G 0 Z 0 = Y 0
Substituting Equation (22) into Equation (21) gives:
G 0 T Ψ 1 Δ G Z 0 = G 0 T Ψ 1 G 0 Δ Z Δ Z = ( G 0 T Ψ 1 G 0 ) 1 G 0 T Ψ 1 Δ G Z 0
Since G 0 Z 0 = Y 0 , Equation (5) implies that:
e = Y 0 ( G 0 + Δ G ) Z 0 = Y 0 G 0 Z 0 Δ G Z 0 = Δ G Z 0
Substituting Equation (24) into Equation (23) gives:
Δ Z = ( G 0 T Ψ 1 G 0 ) 1 G 0 T Ψ 1 e
Substituting Equation (25) into cov ( Z ) , the covariance matrix of Z can be obtained:
cov ( Z ) = E [ Δ Z Δ Z T ] = ( G T Ψ 1 G ) 1 G T Ψ 1 E [ e e T ] Ψ 1 G ( G T Ψ 1 G ) 1 = ( G T Ψ 1 G ) 1 G T Ψ 1 Ψ Ψ 1 G ( G T Ψ 1 G ) 1 = ( G T Ψ 1 G ) 1
The estimation accuracy can be further improved using the relationship between x, y and k. The first step of the solution of Z in Equation (6) is based on the assumption of independent x, y and k. However, those parameters are correlated by Equation (1). The results can be revised as follows using the relation of Equation (1):
e = Y G Z
where Y = [ Z 1 2 Z 2 2 Z 3 ] , G = [ 1 0 0 1 1 1 ] , Z = [ x 2 y 2 ] .
Let the estimation errors of x, y and k be μ 1 , μ 2 , and μ 3 . Then the elements of Z become:
Z 1 = x + μ 1 ,   Z 2 = y + μ 2 ,   Z 3 = k + μ 3
Substituting Equation (28) into Equation (27) and ignoring the square error term, the entries of e can be expressed as:
e 1 = 2 x μ 1 ,   e 2 = 2 y μ 2 ,   e 3 = μ 3
Subsequently, the covariance matrix of e is:
Ψ = E ( e e T ) = B { cov ( Z ) } ( 1 : 3 ) × ( 1 : 3 ) B
where B = d i a g { [ 2 x , 2 y , 1 ] } . In fact, B is unknown as B contains the true BD position x and y. As in Equation (11), B can be approximated as B = d i a g { [ 2 Z 1 , 2 Z 2 , 1 ] } .
The second step of the WLS solution is:
Z = ( G T Ψ 1 G ) 1 G T Ψ 1 Y
Similarly, the covariance matrix of Z can be obtained by using the perturbation approach:
cov ( Z ) = ( G T Ψ 1 G ) 1
The position estimation Z :
Z = s i g n ( Z ) Z
In summary, the steps of the proposed method can be listed as follows:
(1)
Estimate ψ through substituting Equations (14) and (15) into Equation (11).
(2)
The first weight solution of BD can be obtained through substituting Equation (11) into Equation (6).
(3)
The final solution of BD can be obtained from Equation (33).
From the definition of Z in Equation (28) and by ignoring the square error term, Z can be rewritten as:
Z 1 x 2 = 2 x e x ,   Z 2 y 2 = 2 y e y
where e x and e y are the estimation errors of x, y respectively. The covariance matrix of Z can be obtained from Equation (34):
cov ( Z ) = B 1 cov ( Z ) B 1
where B = d i a g { [ 2 x 2 y ] } .
From Equations (26), (30), (32) and (35), the covariance matrix of Z can be finally obtained:
cov ( Z ) = ( B cov ( Z ) 1 B ) 1 = ( B G T Ψ 1 G B ) 1 = ( B G T B 1 { cov ( Z ) ( 1 : 3 ) × ( 1 : 3 ) } 1 B 1 G B ) 1

4. Cramer-Rao Lower Bound

It is well known that the CRLB sets a lower limit for the variance or covariance matrix of any unbiased estimate of unknown parameters [26].
There are deterministic and stochastic CRLBs for RSS location methods. The deterministic CRLB is based on the assumption that the PLE is a deterministic unknown process and was derived in [16,23]. However, the stochastic CRLB for the RSS location technique has not been studied in the literature to the best of our knowledge. The subsection derives the stochastic CRLB for RSS-based algorithms where the PLE is modeled as a temporal Gaussian process whose mean and variance can be obtained from experimental analysis. Studies in [24,25] show that the typical values and variation range of PLEs for different channel environments can be estimated through field tests.
Let P = [ P 1 P N ] T be a RSS measurement vector and a parameter vector θ to be estimated, where θ is [ x y P 0 β ] T . The CRLB matrix is defined as the inverse of the Fisher information matrix (FIM) J θ :
E ( ( θ θ ) ( θ θ ) T ) J θ 1
where θ is an estimate of θ .
The FIM is determined by [26]:
J θ = E [ ln f ( P ; θ ) θ ( ln f ( P ; θ ) θ ) T ]
Using the Bayes’ theorem,
f ( P ; θ ) = f ( P | θ ) f ( θ )
Substituting Equation (39) into Equation (38) gives
J θ = E [ ln f ( P | θ ) θ ( ln f ( P | θ ) θ ) T ] + E [ ln f ( P | θ ) θ ( ln f ( θ ) θ ) T ] + E [ ln f ( θ ) θ ( ln f ( P | θ ) θ ) T ] + E [ ln f ( θ ) θ ( ln f ( θ ) θ ) T ]
From Equation (2), the probability density function (PDF) f ( P | θ ) can be written as:
f ( P | θ ) = i = 1 N f ( P i | θ )
where
f ( P i | θ ) = 1 2 π σ exp ( ( P i P 0 + 10 β log 10 ( r i ) ) 2 2 σ 2 )
The log of f ( P | θ ) is:
ln f ( P | θ ) = i = 1 N ln f ( P i | θ )
Substituting Equation (42) into ln f ( P | θ ) / θ i gives:
ln f ( P | θ ) x = i = 1 N ( P i P 0 + 10 β log 10 r i σ 2 ) 10 β r i ln 10 x i x r i
ln f ( P | θ ) y = i = 1 N ( P i P 0 + 10 β log 10 r i σ 2 ) 10 β r i ln 10 y i y r i
ln f ( P | θ ) P 0 = i = 1 N ( P i P 0 + 10 β log 10 r i σ 2 ) ( 1 )
ln f ( P | θ ) β = i = 1 N ( P i P 0 + 10 β log 10 r i σ 2 ) ( 10 log 10 ( r i ) )
Since E [ P i P 0 + 10 β log 10 ( r i ) ] = 0 , the expectation of ln f ( P | θ ) / θ i is:
E [ ln f ( P | θ ) / θ i ] = 0
In the presence of the uncertainty of the PLE, the PDF of the PLE can be obtained from Equation (3):
f ( θ ) = 1 2 π σ β exp ( ( β β ) 2 2 σ β 2 )
Substituting Equation (44) into ln f ( θ ) / θ i gives:
ln f ( θ ) θ i = { 0 θ i β β β 0 σ β 2 θ i = β
It can be easily derived from Equation (45) that:
E [ ln f ( θ ) / θ i ] = 0
Substituting Equations (43) and (46) into Equation (40) gives:
J θ = E [ ln f ( P | θ ) θ ( ln f ( P | θ ) θ ) T ] + E [ ln f ( θ ) θ ( ln f ( θ ) θ ) T ]
Substituting Equations (42) and (45) into Equation (47) gives:
J θ = H Q s 1 H T + Q θ
where H = [ 10 β r 1 ln 10 x 1 x r 1 10 β r 2 ln 10 x 2 x r 2 10 β r N ln 10 x N x r N 10 β r 1 ln 10 y 1 y r 1 10 β r 2 ln 10 y 2 y r 2 10 β r N ln 10 y N y r N 1 1 1 10 log 10 ( r 1 ) 10 log 10 ( r 2 ) 10 log 10 ( r N ) ] , Q s = d i a g { [ σ 2 σ 2 ] } , Q θ = d i a g { [ 0 0 0 1 / σ β 2 ] } .
It should be noted that H Q s 1 H T is the FIM of the deterministic CRLB in [16].
Finally, the proposed CRLB is derived as:
C R L B x , y = [ ( H Q s 1 H T + Q θ ) 1 ] 2 × 2
The analytical formula of the CRLB can help to reduce the computational complexity and assist the performance analysis. It can be observed from Appendix A that the analytical formula of the derived CRLB is expressed as:
[ ( H Q s 1 H T + Q θ ) 1 ] 2 × 2 = ( ln 10 10 β ) 2 [ a b c d ] 1 = ( ln 10 10 β ) 2 1 a d b c [ d b c a ]
where a, b, c and d can be obtained from Equations (A14)–(A17) respectively.

5. Performance Analysis

The relationships between the deterministic and stochastic CRLBs are provided in the following propositions.
Proposition 1. 
In the RSS localization technique, the deterministic CRLB is higher than the proposed stochastic CRLB.
t r { J s 1 } = t r { ( H Q s 1 H T + Q θ ) 1 } t r { J d 1 } = t r { ( H Q s 1 H T ) 1 }
where J s and J d are the FIMs for stochastic and deterministic CRLBs, respectively.
Proof. 
Since Q θ is a positive semi-definite matrix, Equation (51) holds.□
This proposition shows that the prior knowledge σ β 2 of the PLE can help to improve the positioning accuracy.
Proposition 2. 
The proposed stochastic CRLB reduces to the deterministic CRLB if no prior information on the PLE is given.
Proof. 
For the case without prior information on the PLE, the variance σ β 2 of the PLE will approach infinity. This means 1 / σ β 2 0 and Q θ 0 . Substituting Q θ = 0 into Equation (48), J s = H Q s 1 H T + Q θ = H Q s 1 H T = J d .□
This gives a sanity check for the proposed CRLB.
Proposition 3. 
The proposed method can attain its stochastic CRLB:
cov ( Z ) = ( B G T B 1 { cov ( Z ) ( 1 : 3 ) × ( 1 : 3 ) } 1 B 1 G B ) 1 = [ ( H Q s 1 H T + Q θ ) 1 ] 2 × 2 = [ J θ 1 ] 2 × 2
Proof. 
It can be proved from Appendix B. □
Proposition 3 shows that the proposed method can provide an optimum performance.

6. Simulation Results

A square region of dimensions 40 m × 40 m is considered for the simulations, where the positions of the BD and RDs are randomly distributed in the square space 0 ≤ x, y ≤ 40 m.
The RMSEs are defined as E [ ( x x ) 2 + ( y y ) 2 ] in the units of m, and are obtained from the average of 5000 independent runs. To compare with the proposed method, the LS localization method Equation (14) is used here due to its closed-form solution. Two search algorithms (ML and SDP) are selected for comparisons. The joint ML estimation of x, y, P 0 and β can be formulated as [21]:
min x , y , P 0 , β i = 1 N ( P i P 0 + 10 β log 10 ( r i ) ) 2
The ML estimator is solved by the MATLAB routine lsqnonlin using the Levenberg-Marquardt method. Obviously, Equation (53) is non-convex which may lead to multiple local minima. This implies that the performance of the ML estimator strongly relies on the initial solution. Besides the ML-LM method, an SDP algorithm given in [15] is also included in the simulations since its object function is convex which means its global minima can be obtained. The MATLAB package CVX [27] is used to solve the SDP algorithm. The solver of CVX is SeDuMi [28]. It should be noted that SDP [15] is generally based on the fact that both the transmit power and PLE are available. A summary of the considered algorithms is given in Table 1.
Comparisons among the deterministic CRLB [16], the proposed stochastic CRLB and the theoretical variance of the proposed method are also given in the simulations.
Figure 1 shows the RMSEs versus standard deviations (stds) σ of the RSS measurements when the PLE is equal to 4; then number of RDs is six and the std σ β of PLE uncertainty is 0.2. It can be seen from the figure that all three methods (the proposed method, ML-TRUE and SDP-TRUE) provide much better performances than the others (LS method, ML-LS and SDP-P5). The performance of the proposed method is similar to those of the ML-TRUE and SDP-TRUE algorithms. It can be observed from Figure 1 that ML-LS performs worse than ML-TRUE. This verifies that the ML estimator depends heavily on its initial solution. Performance comparisons between SDP-P5 and SDP-TRUE in Figure 1 show that a little uncertainty on the transmit power and PLE (5% in simulations) will greatly degrade the performance of the SDP algorithm. It should be noted that both the ML-TRUE and SDP-TRUE algorithms require the true values of the transmit power and PLE, which is not suitable for a real channel situation. Figure 1 also shows that the proposed method can reach its CRLB.
The average running time is compared in Table 2. In the simulation, the PLE is equal to 4, σ β = 0.2 , σ = 4 dB, the number of RDs is six, and the CPU is i7-2600 3.4 GHZ. It can be seen from Table 2 that the average running times of the ML-LS and SDP-P5 are approximately 60 and 412 times longer than the proposed method. The ML-TRUE has half the running time of the ML-LS since the true initial point may help the ML estimator reach the local minima faster, whereas SDP-TRUE and SDP-P5 have similar running times due to their global minima. As expected, the LS and the proposed method with the closed-form solutions have the shortest running times.
Performance comparisons with different σ β are recorded in Figure 2. In this simulation, the std σ β of PLE uncertainty is varied from 0.1 to 0.5, the number of RDs is six, β 0 = 4 , and σ = 4 dB. It can be also observed that the proposed method outperforms the other three algorithms (the LS method, ML-LS and SDP-P5).
The effect of different numbers of RDs is simulated in Figure 3. In this simulation, σ β = 0.2 , β 0 = 4 , and σ = 4 dB. The number of RDs is varied from six to 10. As the number of RDs increases, the performance of all algorithms becomes better as shown in Figure 3. For various numbers of RDs, the proposed method performs better than other three algorithms (LS method, ML-LS and SDP-P5). This proves the scalability of the proposed method.
Figure 4 is performed to verify Propositions 1 and 3. The simulation environments of Figure 4 are the same as that of Figure 1. It can be seen from Figure 4 that the theoretical variance of the proposed method is equal to the stochastic CRLB, which means the proposed method can reach its corresponding CRLB. This conclusion matches Proposition 3. Figure 4 also shows that the proposed stochastic CRLB has a better performance than the deterministic CRLB which is in line with Proposition 1. This implies that the positioning accuracy can be improved by the prior information of the PLE.
Proposition 2 is evaluated in Figure 5. In this simulation, the std σ β of the PLE uncertainty is varied from 0.01 to 3.51, the number of RDs is 10, β 0 = 4 , and σ = 4 dB. Figure 5 shows that the stochastic CRLB gradually reaches the deterministic CRLB as the PLE uncertainty σ β increases. The results mean that the proposed CRLB reduces to the deterministic CRLB if no prior information on the PLE is given, which verifies Proposition 2.

7. Conclusions

A novel RSS localization method based on a two-step WLS estimator is proposed for the case with the unknown transmit power and uncertainty in the PLE. Compared with other localization methods, the proposed method can not only provide the closed-form solution but it can also attain the CRLB which is verified by the theoretical analysis and simulations. Both the theoretical variance and stochastic CRLB for the proposed method are derived in the paper. The paper proves that the deterministic CRLB is higher than the proposed stochastic CRLB and the stochastic CRLB reduces to the deterministic CRLB if no prior information on the PLE is given. An experimental proof of the proposed method is left for a future study.

Acknowledgments

This work was supported by the Open Research Fund of the State Key Laboratory of Space-Ground Integrated Information Technology under Grant No. 2014_CXJJ-DH_09, the Guangdong Provincial Natural Science Foundation of China (2015A030313821), and Dongguan city social science and technology development program (2013108101002). The authors would like to thank the anonymous referees for their suggestions and comments.

Author Contributions

Jiyan Huang and Peng Liu conceived and designed the experiments; Wei Lin performed the experiments; Jiyan Huang and Guan Gui analyzed the data; Peng Liu contributed analysis tools; Jiyan Huang wrote the paper.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

To estimate [ J θ 1 ] 2 × 2 , H and Q θ are decomposed as:
H = [ H 1 T H 2 T ] T , Q θ = [ 0 0 0 Q 1 ]
where H 1 = [ 10 β ln 10 x 1 x r 1 2 10 β ln 10 x N x r N 2 10 β ln 10 y 1 y r 1 2 10 β ln 10 y N y r N 2 ] ,   H 2 = [ 1 1 10 log 10 ( r 1 ) 10 log 10 ( r N ) ] ,   Q 1 = d i a g { [ 0 1 / σ β 2 ] } .
Substituting Equation (A1) into Equation (48) gives:
J θ = [ H 1 Q s 1 H 1 T H 1 Q s 1 H 2 T H 2 Q s 1 H 1 T H 2 Q s 1 H 2 T + Q 1 ]
From the matrix inversion lemma [29],
[ A 11 A 12 A 21 A 22 ] 1 = [ ( A 11 A 12 A 22 1 A 21 ) 1 A 11 1 A 12 ( A 21 A 11 1 A 12 A 22 ) 1 ( A 21 A 11 1 A 12 A 22 ) 1 A 21 A 11 1 ( A 22 A 21 A 11 1 A 12 ) 1 ]
Using the above equation, [ J θ 1 ] 2 × 2 becomes:
[ J θ 1 ] 2 × 2 = ( H 1 Q s 1 H 1 T H 1 Q s 1 H 2 T ( H 2 Q s 1 H 2 T + Q 1 ) 1 H 2 Q s 1 H 1 T ) 1 = ( H 1 ( Q s 1 Q s 1 H 2 T ( H 2 Q s 1 H 2 T + Q 1 ) 1 H 2 Q s 1 ) H 1 T ) 1
From the second moment matrix inversion formula,
[ a b c d ] 1 = 1 a d b c [ d b c a ]
Then ( H 2 Q s 1 H 2 T + Q 1 ) 1 can be expressed as:
( Q 1 + H 2 Q s 1 H 2 T ) 1 = [ N σ 2 1 σ 2 i = 1 N 10 log 10 r i 1 σ 2 i = 1 N 10 log 10 r i 1 σ 2 i = 1 N ( 10 log 10 r i ) 2 + 1 σ β 2 ] 1 = γ [ 1 σ 2 i = 1 N ( 10 log 10 r i ) 2 + 1 σ β 2 1 σ 2 i = 1 N 10 log 10 r i 1 σ 2 i = 1 N 10 log 10 r i N σ 2 ]
where
γ = 1 N σ 2 ( 1 σ 2 i = 1 N ( 10 log 10 r i ) 2 + 1 σ β 2 ) 1 σ 4 ( i = 1 N 10 log 10 r i ) 2
From Equations (A1) and (A6), we have:
Q s 1 H 2 T ( Q 1 + H 2 Q s 1 H 2 T ) 1 H 2 Q s 1 = γ C
where
C i j = 1 σ 6 10 log 10 r i i = 1 N 10 log 10 r i + ( 1 σ 6 i = 1 N ( 10 log 10 r i ) 2 + 1 σ 4 σ β 2 ) + N σ 6 10 log 10 r j 10 log 10 r i 1 σ 6 10 log 10 r j i = 1 N 10 log 10 r i
Substituting Equation (A8) into Equation (A4) gives:
[ J θ 1 ] 2 × 2 = ( H 1 ( Q s 1 γ C ) H 1 T ) 1
Substituting H 1 and Q s into H 1 Q s 1 H 1 T gives:
H 1 Q s 1 H 1 T = ( 10 β σ ln 10 ) 2 [ i = 1 N ( x i x ) 2 r i 4 i = 1 N ( x i x ) ( y i y ) r i 4 i = 1 N ( x i x ) ( y i y ) r i 4 i = 1 N ( y i y ) 2 r i 4 ]
Substituting Equation (A9) into γ H 1 C H 1 T gives:
γ H 1 C H 1 T = γ ( 10 β ln 10 ) 2 [ i = 1 N x i x r i 2 j = 1 N C i j x j x r j 2 i = 1 N x i x r i 2 j = 1 N C i j y j y r j 2 i = 1 N y i y r i 2 j = 1 N C i j x j x r j 2 i = 1 N y i y r i 2 j = 1 N C i j y j y r j 2 ]
From Equations (A11) and (A12), [ J θ 1 ] 2 × 2 becomes:
[ J θ 1 ] 2 × 2 = ( ln 10 10 β ) 2 [ a b c d ] 1 = ( ln 10 10 β ) 2 1 a d b c [ d b c a ]
where
a = 1 σ 2 i = 1 N ( x i x ) 2 r i 4 γ i = 1 N x i x r i 2 j = 1 N C i j x j x r j 2
b = 1 σ 2 i = 1 N ( x i x ) ( y i y ) r i 4 γ i = 1 N x i x r i 2 j = 1 N C i j y j y r j 2
c = 1 σ 2 i = 1 N ( x i x ) ( y i y ) r i 4 γ i = 1 N y i y r i 2 j = 1 N C i j x j x r j 2
d = 1 σ 2 i = 1 N ( y i y ) 2 r i 4 γ i = 1 N y i y r i 2 j = 1 N C i j y j y r j 2

Appendix B

It can be seen from Equation (36) that cov ( Z ) ( 1 : 3 ) × ( 1 : 3 ) should be obtained firstly to estimate cov ( Z ) . To evaluate { cov ( Z ) } ( 1 : 3 ) × ( 1 : 3 ) , G is decomposed as:
G = [ G 1 G 2 ]
where
G 1 = [ 2 x 1 2 y 1 1 2 x N 2 y N 1 ] ,   G 2 = [ 10 P 1 / 5 β 10 P N / 5 β ] = 10 P 0 / 5 β [ 10 ( P 0 P 1 ) / 5 β 10 ( P 0 P N ) / 5 β ] = 10 P 0 / 5 β [ r 1 2 r N 2 ]
Substituting Equation (B1) into Equation (26) gives:
cov ( Z ) = ( G T Ψ 1 G ) 1 = [ G 1 T ψ 1 G 1 G 1 T ψ 1 G 2 G 2 T ψ 1 G 1 G 2 T ψ 1 G 2 ] 1
Using the matrix inversion lemma (Equation (A3)), { cov ( Z ) } ( 1 : 3 ) × ( 1 : 3 ) becomes:
{ cov ( Z ) } ( 1 : 3 ) × ( 1 : 3 ) = ( G 1 T ψ 1 G 1 G 1 T ψ 1 G 2 ( G 2 T ψ 1 G 2 ) 1 G 2 T ψ 1 G 1 ) 1 = ( G 1 T ( ψ 1 ψ 1 G 2 ( G 2 T ψ 1 G 2 ) 1 G 2 T ψ 1 ) G 1 ) 1
Substituting Equations (11) and (B4) into Equation (36) gives:
cov ( Z ) = ( B G T B 1 G 1 T B 1 ( Q 1 Q 1 B 1 G 2 ( G 2 T ψ 1 G 2 ) 1 G 2 T B 1 Q 1 ) B 1 G 1 B 1 G B ) 1
Substituting B , G , and B into B G T B 1 gives:
B G T B 1 = [ 2 x 0 0 2 y ] [ 1 0 1 0 1 1 ] [ 1 2 x 0 0 0 1 2 y 0 0 0 1 ] = [ 1 0 2 x 0 1 2 y ]
Substituting Equation (B6) and G 1 into B G T B 1 G 1 T gives:
B G T B 1 G 1 T = [ 1 0 2 x 0 1 2 y ] [ 2 x 1 2 x N 2 y 1 2 y N 1 1 ] = [ 2 x 1 2 x 2 x N 2 x 2 y 1 2 y 2 y N 2 y ]
It can be seen from Equation (4) that:
r i 2 = 10 P 0 P i 5 β
P 0 P i = 10 β log 10 ( r i )
Substituting Equations (B8) and (B9) into B and Q gives:
B = d i a g { [ ln 10 5 β 2 r 1 2 ln 10 5 β 2 r N 2 ] }
Q = Q 1 + Q 2 = β 2 σ 2 I + ( σ β β A ) ( σ β β A ) T
where
A = [ 10 log 10 ( r 1 ) 10 log 10 ( r N ) ] T
Using the matrix inversion lemma [29], Q 1 can be expressed as:
Q 1 = ( β 2 σ 2 I + ( σ β β A ) ( σ β β A ) T ) 1 = 1 β 2 σ 2 I 1 β 2 σ 2 ( σ β β A ) ( 1 + ( σ β β A ) T ( σ β β A ) β 2 σ 2 ) 1 ( σ β β A ) T 1 β 2 σ 2 = 1 β 2 σ 2 I 1 β 2 σ 4 η A A T
where
η = 1 σ β 2 + 1 σ 2 i = 1 N ( 10 log 10 r i ) 2
Substituting Equations (B7) and (B10) into B G T B 1 G 1 T B 1 gives:
B G T B 1 G 1 T B 1 = [ ( x 1 x ) 10 β 2 r 1 2 ln 10 ( x N x ) 10 β 2 r N 2 ln 10 ( y 1 y ) 10 β 2 r 1 2 ln 10 ( y N y ) 10 β 2 r N 2 ln 10 ]
It can be observed from Equations (A1) and (B15) that:
B G T B 1 G 1 T B 1 = β H 1
Substituting Equations (B16) and (B13) into Equation (B5) gives:
cov ( Z ) = ( H 1 ( β 2 Q 1 β 2 Q 1 B 1 G 2 ( G 2 T ψ 1 G 2 ) 1 G 2 T B 1 Q 1 ) H 1 T ) 1 = ( H 1 ( Q s 1 ( 1 σ 4 η A A T + P β 2 G 2 T ψ 1 G 2 ) ) H 1 T ) 1
where
P = ( 1 σ 2 I 1 σ 4 η A A T ) B 1 G 2 G 2 T B 1 ( 1 σ 2 I 1 σ 4 η A A T ) = 1 σ 4 B 1 G 2 G 2 T B 1 1 σ 6 η B 1 G 2 G 2 T B 1 A A T 1 σ 6 η A A T B 1 G 2 G 2 T B 1 + 1 σ 8 η 2 A A T B 1 G 2 G 2 T B 1 A A T
Substituting G 2 and Equation (B10) into G 2 T B 1 gives:
G 2 T B 1 = 10 P 0 5 β 5 β 2 ln 10 [ 1 1 ]
Similarly, A A T becomes:
A A T = [ ( 10 log 10 r 1 ) 2 10 log 10 r 1 10 log 10 r N 10 log 10 r N 10 log 10 r 1 ( 10 log 10 r N ) 2 ]
Substituting G 2 and Equation (11) into G 2 T ψ 1 G 2 gives:
G 2 T ψ 1 G 2 = G 2 T B 1 Q 1 B 1 G 2 = G 2 T B 1 ( 1 β 2 σ 2 I 1 β 2 σ 4 η A A T ) B 1 G 2 = 1 σ 2 β 2 G 2 T B 1 B 1 G 2 1 β 2 σ 4 η G 2 T B 1 A A T B 1 G 2
where
G 2 T B 1 B 1 G 2 = ( 10 P 0 5 β 5 β 2 ln 10 ) 2 N
G 2 T B 1 A A T B 1 G 2 = ( 10 P 0 5 β 5 β 2 ln 10 ) 2 ( i = 1 N 10 log 10 r i ) 2
Substituting Equations (B22) and (B23) into Equation (B21) gives:
G 2 T ψ 1 G 2 = N σ 2 β 2 ( 10 P 0 5 β 5 β 2 ln 10 ) 2 1 β 2 σ 4 η ( 10 P 0 5 β 5 β 2 ln 10 ) 2 ( i = 1 N 10 log 10 r i ) 2
From Equations (B19) and (B20) we have:
B 1 G 2 G 2 T B 1 = ( 10 P 0 5 β 5 β 2 ln 10 ) 2 1 N × N
B 1 G 2 G 2 T B 1 A A T = ( 10 P 0 5 β 5 β 2 ln 10 ) 2 i = 1 N 10 log 10 ( r i ) [ 10 log 10 ( r 1 ) 10 log 10 ( r N ) 10 log 10 ( r 1 ) 10 log 10 ( r N ) ]
A A T B 1 G 2 G 2 T B 1 = ( B 1 G 2 G 2 T B 1 A A T ) T
A A T B 1 G 2 G 2 T B 1 A A T = ( 10 P 0 5 β 5 β 2 ln 10 ) 2 ( i = 1 N 10 log 10 r i ) 2 [ ( 10 log 10 r 1 ) 2 10 log 10 r 1 10 log 10 r N 10 log 10 r N 10 log 10 r 1 ( 10 log 10 r N ) 2 ]
Substituting Equations (B24)–(B28) into Equation (B18) gives:
[ P β 2 G 2 T ψ 1 G 2 ] i j = γ ( η σ 4 1 σ 6 i = 1 N 10 log 10 ( r i ) 10 log 10 ( r j ) 1 σ 6 i = 1 N 10 log 10 ( r i ) 10 log 10 ( r i ) + 1 σ 8 η ( i = 1 N 10 log 10 ( r i ) ) 2 ( 10 log 10 r i ) ( 10 log 10 r j ) )
From Equations (A7), (B14) and (B20), we have:
[ 1 σ 4 η A A T ] i j = γ ( 1 σ 4 η γ ( 10 log 10 r i ) ( 10 log 10 r j ) ) = γ ( N σ 6 ( 10 log 10 r i ) ( 10 log 10 r j ) 1 σ 8 η ( 10 log 10 r i ) ( 10 log 10 r j ) ( i = 1 N 10 log 10 r i ) 2 )
From Equations (B29) and (B30), we have:
[ 1 σ 4 η A A T + P β 2 G 2 T ψ 1 G 2 ] i j = γ ( N σ 6 ( 10 log 10 r i ) ( 10 log 10 r j ) η σ 4 1 σ 6 i = 1 N 10 log 10 r i 10 log 10 r j 1 σ 6 i = 1 N 10 log 10 r i 10 log 10 r i ) = γ C i j
Substituting (B31) into (B17) gives:
{ cov ( Z ) } ( 1 : 3 ) × ( 1 : 3 ) = ( H 1 ( Q s 1 γ C ) H 1 T ) 1 = [ J θ 1 ] 2 × 2

References

  1. Akyildiz, I.F.; Su, W.; Sankarasubramaniam, Y.; Cayirci, E. A survey on sensor networks. IEEE Commun. Mag. 2002, 40, 102–114. [Google Scholar] [CrossRef]
  2. Wang, H.; Elson, J.; Girod, L.; Estrin, D.; Yao, K. Target Classification and Localization in Habitat Monitoring. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Hong Kong, China, 6–10 April 2003; Volume 4, pp. 6–10.
  3. Wang, Y.; Xu, D.; Li, F. Providing Location-aware Location Privacy Protection for Mobile Location-based Services. Tsinghua Sci. Technol. 2016, 21, 243–259. [Google Scholar] [CrossRef]
  4. Li, F.; Chen, Z.; Wang, Y. Localized Geometric Topologies with Bounded Node Degree for Three Dimensional Wireless Sensor Networks. EURASIP J. Wirel. Commun. Netw. 2012, 1, 157. [Google Scholar] [CrossRef]
  5. Li, F.; Zhao, L.; Fan, X.; Wang, Y. Hybrid Position-based and DTN Forwarding for Vehicular Sensor Networks. Int. J. Distributed Sens. Net. 2012, 10, 186146. [Google Scholar] [CrossRef]
  6. Dai, L.; Wang, Z.; Wang, J.; Wang, J.; Zhang, Y. Accurate Position Location in TDS-OFDM Based Digital Television Broadcasting Networks. In Proceedings of the 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC’10), Istanbul, Turkey, 26–30 September 2010; pp. 2621–2625.
  7. Liang, J.; Wang, D.; Su, L.; Chen, B.; Chen, H.; So, H.C. Robust MIMO Radar Target Localization via Nonconvex Optimization. Signal Process. 2016, 122, 33–38. [Google Scholar] [CrossRef]
  8. Chen, H.; Gao, F.; Martins, M.; Huang, P.; Liang, J. Accurate and efficient node localization for mobile sensor networks. Mob. Netw. Appl. 2013, 18, 141–147. [Google Scholar] [CrossRef]
  9. Patwari, N.; Ash, J.; Kyperountas, S.; Hero, A., III; Moses, R.; Correal, N. Locating the nodes: Cooperative localization in wireless sensor networks. IEEE Signal Process. Mag. 2005, 22, 54–69. [Google Scholar] [CrossRef]
  10. Patwari, N.; Hero, A.O., III; Perkins, M.; Correal, N.S.; O’Dea, R.J. Relative location estimation in wireless sensor networks. IEEE Trans. Signal Process. 2003, 51, 2137–2148. [Google Scholar] [CrossRef]
  11. Wann, C.-D.; Chin, H.-C. Hybrid TOA/RSSI Wireless Location with Unconstrained Nonlinear Optimization for Indoor UWB Channels. In Proceedings of the 2007 IEEE Wireless Communications and Networking Conference, Hong Kong, China, 11–15 March 2007; pp. 3940–3945.
  12. Hatami, A.; Pahlavan, K. Hybrid TOA-RSS Based Localization Using Neural Networks. In Proceedings of the 2006 IEEE Global Telecommunications Conference, San Francisco, CA, USA, 27 November–1 December 2006; pp. 1–5.
  13. Talampas, M.C.R.; Low, K.-S. Integrating Active and Passive Received Signal Strength-based Localization. In Proceedings of the 2014 IEEE International Symposium on Intelligent Signal Processing and Communication Systems, Kuching, Malaysia, 1–4 December 2014; pp. 153–158.
  14. Yan, Y.-S.; Wang, H.-Y.; Shen, X.-H.; Yang, F.-Z.; Chen, Z. Efficient Convex Optimization Method for Underwater Passive Source Localization Based on RSS with WSN. In Proceedings of the 2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC), Kyoto, Japan, 25–30 March 2012; pp. 171–174.
  15. Ouyang, R.W.; Wong, A.K.-S.; Lea, C.-T. Received Signal Strength-Based Wireless Localization via Semidefinite Programming: Noncooperative and Cooperative Schemes. IEEE Trans. Veh. Technol. 2010, 59, 1307–1317. [Google Scholar] [CrossRef]
  16. Wang, G.; Chen, H.; Li, Y.; Jin, M. On Received-Signal-Strength Based Localization with Unknown Transmit Power and Path Loss Exponent. IEEE Wirel. Commun. Lett. 2012, 1, 536–539. [Google Scholar] [CrossRef]
  17. Li, X. RSS-based location estimation with unknown path loss model. IEEE Trans. Wirel. Commun. 2006, 5, 3626–3633. [Google Scholar] [CrossRef]
  18. Salman, N.; Ghogho, M.; Kemp, A. On the joint estimation of the RSS-based location and path-loss exponent. IEEE Wirel. Commun. Lett. 2012, 1, 34–37. [Google Scholar] [CrossRef]
  19. So, H.C.; Lin, L. Linear least squares approach for accurate received signal strength based source localization. IEEE Trans. Signal Process. 2011, 59, 4035–4040. [Google Scholar] [CrossRef]
  20. Chan, Y.T.; Lee, B.H.; Inkol, R.; Chan, F. Received Signal Strength Localization with an Unknown Path Loss Exponent. In Proceedings of the 2011 Canadian Conference on Electrical and Computer Engineering, Niagara Falls, ON, Canada, 8–11 May 2011; pp. 456–459.
  21. Tomic, S.; Beko, M.; Dinis, R. RSS-Based Localization in Wireless Sensor Networks Using Convex Relaxation: Noncooperative and Cooperative Schemes. IEEE Trans. Veh. Technol. 2015, 64, 2037–2050. [Google Scholar] [CrossRef]
  22. Wang, G.; Yang, K. A new approach to sensor node localization using RSS measurements in wireless sensor networks. IEEE Trans. Wirel. Commun. 2011, 10, 1389–1395. [Google Scholar] [CrossRef]
  23. Zeytinci, M.B.; Sari, V.; Harmanci, F.K.; Anarim, E.; Akar, M. Location estimation using RSS measurements with unknown path loss exponents. EURASIP J. Wirel. Commun. Netw. 2013, 2013, 178. [Google Scholar] [CrossRef]
  24. Rappaport, T.S. Wireless Communications: Principles and Practice; Prentic Hall PTR: Upper Saddle River, NJ, USA, 1996. [Google Scholar]
  25. MATLAB Implementation of the WINNER Phase II Channel Model, ver1.1. Available online: http://projects.celtic-initiative.org/winner+/phase_2_model.html (accessed on 23 August 2016).
  26. Kay, S.M. Fundamentals of Statistical Signal Processing: Estimation Theory; Prentice-Hall: Upper Saddle River, NJ, USA, 1993. [Google Scholar]
  27. CVX: Matlab Software for Disciplined Convex Programming, version 1.21; CVX Research: Austin, TX, USA, May 2010.
  28. Sturm, J.F. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Meth. Softw. 1998, 11, 625–653. [Google Scholar] [CrossRef]
  29. Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
Figure 1. Performance comparison under different RSS noises.
Figure 1. Performance comparison under different RSS noises.
Sensors 16 01452 g001
Figure 2. Performance comparison under different PLE uncertainties.
Figure 2. Performance comparison under different PLE uncertainties.
Sensors 16 01452 g002
Figure 3. Performance comparison under different numbers of RDs.
Figure 3. Performance comparison under different numbers of RDs.
Sensors 16 01452 g003
Figure 4. Comparison among the proposed stochastic CRLB, the deterministic CRLB, and the theoretical variance of the proposed method under different RSS noises.
Figure 4. Comparison among the proposed stochastic CRLB, the deterministic CRLB, and the theoretical variance of the proposed method under different RSS noises.
Sensors 16 01452 g004
Figure 5. Comparison among the proposed stochastic CRLB, the deterministic CRLB, and the theoretical variance of the proposed method under different PLE uncertainties.
Figure 5. Comparison among the proposed stochastic CRLB, the deterministic CRLB, and the theoretical variance of the proposed method under different PLE uncertainties.
Sensors 16 01452 g005
Table 1. The summary of the considered algorithms.
Table 1. The summary of the considered algorithms.
AlgorithmDescription
LSThe LS estimator in Equation (14) with the closed-form solution
ML-TRUEThe ML estimator in Equation (53) initialized with the true values of the positions of BD, transmit power and PLE
ML-LSThe ML estimator in Equation (53) initialized with the solution of LS
SDP-TRUEThe SDP estimator in [15] initialized with the true transmit powers and PLE
SDP-P5The SDP estimator in [15] initialized with 5% uncertainty about the transmit power and PLE
The proposed methodThe proposed method in Equation (33) with unknown transmit power and PLE
Table 2. The average running time of the considered algorithms.
Table 2. The average running time of the considered algorithms.
AlgorithmTime (ms)
LS0.874
ML-TRUE34.035
ML-LS59.728
SDP-TRUE408.806
SDP-P5407.404
The proposed method0.988

Share and Cite

MDPI and ACS Style

Huang, J.; Liu, P.; Lin, W.; Gui, G. RSS-Based Method for Sensor Localization with Unknown Transmit Power and Uncertainty in Path Loss Exponent. Sensors 2016, 16, 1452. https://doi.org/10.3390/s16091452

AMA Style

Huang J, Liu P, Lin W, Gui G. RSS-Based Method for Sensor Localization with Unknown Transmit Power and Uncertainty in Path Loss Exponent. Sensors. 2016; 16(9):1452. https://doi.org/10.3390/s16091452

Chicago/Turabian Style

Huang, Jiyan, Peng Liu, Wei Lin, and Guan Gui. 2016. "RSS-Based Method for Sensor Localization with Unknown Transmit Power and Uncertainty in Path Loss Exponent" Sensors 16, no. 9: 1452. https://doi.org/10.3390/s16091452

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop