# Channel-Aware Adaptive Quantization Method for Source Localization in Wireless Sensor Networks

Authors: Guiyun Liu; Jing Yao; Yonggui Liu; Hongbin Chen; Dong Tang
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

This paper considers the problem of source localization using quantized observations in wireless sensor networks where, due to bandwidth constraint, each sensor’s observation is usually quantized into one bit of information. First, a channel-aware adaptive quantization scheme for target location estimation is proposed and local sensor nodes dynamically adjust their quantization thresholds according to the position-based information sequence. The novelty of the proposed approach comes from the fact that the scheme not only adopts the distributed adaptive quantization instead of the conventional fixed quantization,
but also incorporates the statistics of imperfect wireless channels between sensors and the fusion center (binary symmetric channels). Furthermore, the appropriate maximum likelihood estimator (MLE), the performance metric Cramér-Rao lower bound (CRLB), and a sufficient condition for the Fisher information matrix being positive definite are derived, respectively. Simulation results are presented to show that the appropriated CRLB is less than the fixed quantization channel-aware CRLB and the proposed MLE will approach their CRLB when the number of sensors is large enough.


---

## Body

## 1. Introduction

Wireless sensor networks (WSNs) is an emerging technology that can provide an inexpensive solution for lots of applications, including surveillance and urban monitoring [1], smart power monitoring [2], and target localization or tracking [3–8]. Locating a target or object in an area of interest using a wireless sensor network (WSN) is a typical application. The WSN usually employs low-cost densely deployed sensors that have very limited energy and communication bandwidth resources. Its local sensors detect specific events and then forward their sensed observation information to a fusion center (FC). Finally, the FC implements the task of target location estimation [9].A multitude of studies have researched source localization since it has found lots of applications in radar, sonar, and microphone arrays [10, 11]. The localization problem is to estimate the coordinates of a source. Based on measurement models, the localization methods usually use the received signal time of arrival (TOA), the distance measurement, the received signal strength (RSS), the angle of arrival (AOA), the signal energy, and their combinations. It is worthwhile to mention that distance information is not directly available and should be estimated based on other measurement models. On the other hand, techniques based on TOA and time-delay of arrival (TDOA) estimation usually require complicated timing or synchronization.Compared with TOA, TDOA, distance measurement, and RSS, the localization problem based on acoustic energy has practically attracted much attention over the past few years, due to its lower cost, lower complexity, and easier implementation. In this paper, the source localization problem with the use of the energy measurement model in WSNs is considered. These energy-based methods of source localization are classified into two major groups: analog measurement models [12–18] and quantized measurement models [19–24]. Due to bandwidth constraints in WSNs, it is naturally desirable that local sensors only transmit their quantized observations to complete the estimation task. For example, consider a uniform quantizer with certain quantization levels: (1) At each sensor, it observes a received signal power following a power decay model, quantizes the signal using the uniform quantizer, and then communicates to the FC the quantized level; (2) At the FC, it reconstruct the “quantized” observations and estimates the coordinates of a source.For these quantized measurement models, the maximum likelihood target estimator and two heuristic design methods for optimizing quantization threshold have been proposed [20]. Within them, two heuristic design methods are proven to be very robust under various situations. Additionally, the localization problem under nonideal channels between sensors and the FC has been investigated in [21]. For robust localization problems, compared against the classical maximum likelihood estimators (MLEs), the proposed fault tolerant maximum likelihood (FTML) estimator and the subtract on negative add on positive (SNAP) have been shown to be more fault tolerant in [22] and [23], respectively. Recently, Byzantine attacks for localization estimation in WSNs under binary quantized data have been considered in [24] and a novel scheme in conjunction with the identification scheme has been proposed to make the Byzantines ineffective. However, these quantized schemes only consider fixed thresholds in designing local sensors’ quantization schemes, such as the cases with the single threshold and a set of different thresholds.In other words, it is worth noting that the estimation performance for the above quantized localization problems depends on the strategies of selecting sensors’ quantization thresholds, that is, fixed quantization in local sensors. For example, the single threshold or a fixed set of different thresholds have been studied in [19–21]. However, most of the works only considered the fixed quantization schemes in localization problems. Motivated by the observation that adaptive quantization design schemes in distributed estimation problems [25, 26] can outperform fixed quantization schemes [27], we propose novel kinds of quantization schemes that can adjust local sensor nodes’ quantization thresholds adaptively according to sensor nodes’ positions in a region of interest, that is, adaptive quantization schemes for source localization problems are adopted here.As one of the early related works in the distributed estimation problem, a common thresholdτ is applied at all the sensors [27, 28], which is called the fixed quantization approach. It is of great challenge for the approach to make a good choice of the common threshold. To be close to the unknown parameter, a further improvement is to apply a set of thresholds with equal or unequal frequencies and hopes that one of thresholds can be enough close [27, 28]. However, the multithresholding is required to have the knowledge of the prior distribution of the parameter. Recently, being the most related work, a data-dependent distributed adaptive quantization approach is considered and sensors’ thresholds are adjusted dynamically to converge to the unknown parameter [25, 26].As the early related work in the source localization problem, some prior knowledge about the region of interest is assumed and two kinds of intuitive quantization methods are designed to obtain optimal quantization thresholds [20]. Although the heuristic design methods require minimum prior information about the system, identical thresholds are simply employed at all the sensors and their performances are constrained by the fixed common thresholds. In the latest work [29], a dynamic nonidentical threshold design is proposed for making the Byzantines ineffective, where each threshold is calculated based on each sensor’s signal amplitude from the source. In other words, the proposed quantization methods [20, 29] all require some prior distribution knowledge about the source’ unknown parameters.The main contributions of this paper are as follows:(1)
A novel adaptive and channel-aware quantization scheme for target location estimation using one-bit data is proposed. Within it, local sensors’ quantization thresholds are adaptively adjusted according to sensors’ location coordinates and their received binary information.
(2)
The appropriate maximum likelihood estimator (MLE) is derived to seek the estimate of the location of the target, and the metric Cramér-Rao lower bound (CRLB) is derived theoretically to benchmark the performance of locating.
(3)
Some additional simulations show that the proposed channel-aware quantization scheme has better performance than the existing fixed schemes under several cases.The rest of the paper is organized as follows. Section2 introduces our system model. In Section 3, the position-based adaptive quantization scheme is proposed. Their corresponding channel-aware MLE and the channel-aware CRLB both are derived in Section 4. Compared against the classical MLE with the fixed quantization scheme [21], the proposed MLE is evaluated in simulation in Section 5. Finally, conclusions in Section 6 are presented.


## 2. Problem Formulation

Consider a wireless sensor network with a fusion center, whereN locally distributed sensors are densely deployed in a region of interest (ROI) [20]. As shown in Figure 1, the ROI is a two-dimensional square region. Local sensors are assumed to share the communication channel on a time-sharing basis [25]. Additionally, we assume that each sensor and the FC have the prior knowledge of locations of all the sensors. Without loss of generality, each sensor is deployed in a grid for simplicity. The sensors are indexed as {
1,2
,
…
,
N
} according to distances between each other. The sensor i, i
=
1
,
…
,
N is located at the coordinate point x
i
,
y
i, where x
i and y
i denote the x-coordinate (m) and the y-coordinate (m) of the ith sensor, respectively. Additionally, the coordinate of the target is denoted by x
t
,
y
t. For example, 50
,
-
50 and 0,0 are the coordinates of the 6th sensor and the target, respectively.Figure 1
The square ROI of target localization in WSN. The signal power contours of a target are denoted by red solid circles.The target emits an acoustic attenuation signal, which is a function of the Euclidean distance between the target and local sensors [21]:(1)
a
i
2
=
P
0
d
0
n
d
i
n
=
P
0
d
i
2
, where a
i, d
i, and P
0 are the received signal amplitude at the sensor, the Euclidean distance between the target and the ith sensor (i.e., x
i
-
x
t
2
+
y
i
-
y
t
2), and the signal power emitted by the target at a reference distance d
0, respectively. Without loss of generality, d
0 and n are set to 1 and 2, respectively [20]. It is assumed that the target is at least d
0 meters away from any sensors at any times.The observation model for local sensors is considered as given below:(2)
z
i
=
a
i
+
ω
i
, where ω
i denotes the measurement noise process at the sensor i. {
ω
i
,
i
=
1
,
…
,
N
} are assumed to be independent and identically distributed (i.i.d.) white Gaussian noises with mean zero and variance σ
2.In this paper, (1) is shown to be a widely adopted model for the acoustic attenuation signal which is propagating in free space and (2) also is a reasonable model [20]. Without loss of generality, the same model in [20] is simply adopted here. Meanwhile, at each sensor, due to severe bandwidth limitations in WSNs, its received signal amplitude z
i is quantized and then transmitted to the FC. The quantization bit budget for each sensor is supposed to be one bit per sample. The one-bit quantization process for the ith sensor is such that(3)
b
i
=
1
,
if
z
i
≥
τ
i
,
0
,
otherwise
,where τ
i denotes the quantization threshold for the ith sensor. These binary data sequences b
i are reported over wireless channels to the receiving terminals (including subsequent sensors and the FC). There are unavoidable channel imperfections which can not be neglected. The imperfect channels are assumed to be orthogonal binary symmetric channels (BSCs). Here, without loss of generality, each BSC is assumed to be characterised by the same crossover probability p
e. Let b
~
i denote the observation information at the receiving terminals after transmission through BSCs. Thus, we have(4)
P
b
~
i
=
1
∣
b
i
=
1
=
1
-
p
e
,
P
b
~
i
=
0
∣
b
i
=
1
=
p
e
,
P
b
~
i
=
0
∣
b
i
=
0
=
1
-
p
e
,
P
b
~
i
=
1
∣
b
i
=
0
=
p
e
,where P
(
·
) denotes the probability with which the event will occur. Based on the binary sequences {
b
~
i
} above, the FC needs to estimate the parameter vector θ
=
[
P
0
,
x
t
,
y
t
].


## 3. Channel-Aware Position-Based Adaptive Quantization

Generally, the thresholds{
τ
i
,
i
=
1
,
…
,
N
} are the same for all the sensors [20–22]. It is well known that the CRLB exponentially increases with τ
i
-
a
i
2
/
σ
2 [20] for target location estimation to some extent. Thus, to obtain a better estimation result, τ
i is required to be set close to its received signal power a
i. However, the signal power a
i is unknown prior. It motivates us to propose an adaptive quantization scheme that can adaptively decrease the distance τ
i
-
a
i. Meanwhile, it is noted that the CRLB is also a function of the noise parameter σ. It is generally required that the distance τ
i
-
a
i is in the effective range which is related to σ, and the CRLB is enough small [30, 31]. In other words, the location is possibly retrieved from sensors’ binary observations only when τ
i
-
a
i is in the effective range. Thus, without loss of generality, it is assumed that the distance τ
i
-
a
i is in the effective range. Some more discussions will be given in Section 5.It is noted thata
i is directly dependent on the parameter d
i from (1). Thus, it is considered that the close neighbors of the ith sensor have roughly equal received signal amplitude a
i. In other words, the close neighbors of the ith sensor should be assigned almost the same threshold τ
i. Thus, a novel position-based and adaptive quantization scheme is proposed here. Different from the adaptive quantization for distributed parameter estimation [25] being scheduled sequentially, our proposed adaptive quantization scheme is scheduled by the position-based binary sequence.The key principle of the position-based information sequence is that the close neighbors of theith sensor are assigned almost the same threshold. That is, if the ith sensor transmits a binary data {
1
} to the fusion center, its subsequent neighbor will assume that the threshold of the preceding sensor is too small and then will increase the threshold adaptively. Instead, if the ith sensor transmits a binary data {
0
} to the fusion center, its subsequent neighbor will assume that the threshold of the preceding sensor is a little too large and then will decrease the threshold adaptively.The position-based and adaptive quantization scheme consists of two stages: (1) Define the indexes of all local sensors according to their distance information; (2) Update thresholds in order of indexes. For the first stage, it is noted that local sensors are indexed as{
1,2
,
…
,
N
} according to distances between each other as shown in Figure 1. The flowchart of the first-stage operation specially is shown in Figure 2. The sensor locating in the coordinate (
-
50
,
-
50
) is indexed with 1. Then, the procedure needs to decide which sensor will be the next sensor indexed with 2 according to distance information. Within it, it selects the closest sensor with the minimum y-coordinate value, that is, the neighbor locating in the coordinate (
-
50
,
-
30
), and index it with 2. Similarly, the sensor locating in the coordinate (
50
,
-
30
) is indexed with 7, and the sensor locating in the coordinate (
30
,
-
30
) is indexed with 8, and so forth.Figure 2
Flow chart of the first stage of the proposed adaptive quantization scheme.For the second stage, the position-based sequence of transmission can be shown in Figure3. It assumes that the communication channel on a time-sharing basis has a preset number of slots according to the sensors’ indexed order and each sensor has received an acoustic attenuation signal. Let B
~
i
=
b
~
j
:
j
∈
0
,
i
-
1 denote the received binary sequence of the ith sensor, where j is an integer and B
~
1 is empty. Based the fixed threshold τ
1, the 1st sensor generates a binary observation b
1:(5)
b
1
=
1
,
if
z
1
≥
τ
1
,
0
,
otherwise
.
b
1 is transmitted to the fusion center and received by the subsequent 2nd sensor over BSCs. The 2nd sensor will obtain the binary sequence B
~
2 and then calculate τ
2 as follows:(6)
τ
2
=
τ
1
+
Δ
,
if
b
~
1
equals
1
,
τ
1
-
Δ
,
otherwise
,where Δ is a given step-size parameter. For the ith sensor, given the binary sequence B
~
i, its binary observation b
i is generated as(7)
b
i
=
1
,
if
z
i
≥
τ
i
,
0
,
otherwise
,where {
τ
i
,
i
≥
2
} is expressed as(8)
τ
i
=
τ
i
-
1
+
Δ
,
if
b
~
i
-
1
equals
1
,
τ
i
-
1
-
Δ
,
otherwise
.Figure 3
Flow chart of the second stage of the proposed adaptive quantization scheme.Note the signal powera
i is always positive. τ
1 is assumed to be any positive value. Thus, after obtaining τ
i
+
1 (7), it is assumed that the updating procedure is required; that is,(9)
τ
i
+
1
=
τ
i
+
1
,
if
τ
i
+
1
≥
0
,
τ
i
,
otherwise
.It is noted that formula (9) can guarantee τ
i is always nonnegative.Under the setting above, a set of binary observations{
b
(
n
)
} is generated, which can be denoted as B
=
b
1
b
2
⋯
b
N. Effects of unreliable wireless channels between sensors and the FC can not be neglected [30]. Thus, the set of binary observations B is corrupted by the imperfect wireless channels(10)
B
~
=
b
~
1
b
~
2
⋯
b
~
N
, where b
~
(
i
) is the corrupted observation which is sent from the ith sensor to the FC. So based on B
~, estimating the parameter vector θ
=
[
P
0
x
t
y
t
] is our following major goal. Additionally, as shown in Figure 4, the proposed adaptive quantization scheme adaptively decreases the distance τ
i
-
a
i and converges faster to the observed acoustic attenuation signals than the fixed quantization scheme [21]. Within it, τ
F and τ
1 is the fixed quantization threshold and the 1st sensor’s initial threshold for the proposed adaptive quantization scheme, respectively.Figure 4
Dynamic evolution of the quantization threshold versus sensor index.P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
0.01 W, τ
F
=
τ
1
=
1, Δ
=
0.4, and p
e
=
0.01.


## 4. Analysis of MLE and CRLB

### 4.1. MLE

Using the model of BSCs (5), the probability of a received binary observation {
b
~
1
} taking a specific value b (1 or 0), given the initialized threshold τ
1, is expressed as(11)
P
b
~
1
=
b
∣
τ
1
;
θ
=
∑
b
1
=
0
1
P
b
~
1
=
b
∣
b
1
;
θ
P
b
1
∣
τ
1
;
θ
,where P
b
~
1
=
b
∣
b
1
;
θ is equal to P
b
~
1
=
b
∣
b
1 defined in formula (4) and P
b
1
∣
τ
1
;
θ is the probability of a quantized measurement taking a specific value conditioned on the initialized threshold τ
1. According to the sensor observation model in formula (2) and the proposed channel-aware quantization model in formula (5), P
b
1
∣
τ
1
;
θ is given by(12)
P
b
1
∣
τ
1
;
θ
=
q
τ
1
-
a
1
,
b
1
=
1
,
1
-
q
τ
1
-
a
1
,
b
1
=
0
,where q
· is the complementary distribution function of the zero mean, σ
2 variance Gaussian distribution defined as [21](13)
q
x
=
∫
x
+
∞
1
2
π
σ
e
-
x
2
/
2
σ
2
d
x
.In general, according to formula (11), we have(14)
P
b
~
i
=
b
∣
τ
i
;
θ
=
∑
b
i
=
0
1
P
b
~
i
=
b
∣
b
i
;
θ
P
b
i
∣
τ
i
;
θ
,where P
b
i
∣
τ
i
;
θ is the probability of a quantized measurement taking a specific value (b
i) conditioned on the quantization threshold τ
i of the ith sensor. It is given by(15)
P
b
i
∣
τ
i
;
θ
=
q
τ
i
-
a
i
,
b
i
=
1
,
1
-
q
τ
i
-
a
i
,
b
i
=
0
,where τ
i is defined in the above proposed channel-aware adaptive quantization scheme.Thus, the likelihood function of the parameterθ at the FC based on the received binary sequence B
~ can be expressed as(16)
F
θ
=
∏
i
=
1
N
f
b
~
i
∣
B
~
i
;
θ
=
∏
i
=
1
N
P
b
~
i
∣
τ
i
;
θ
,where f
b
~
i
∣
B
~
i
;
θ denotes the conditional probability density function of b
~
i and is equal to P
b
~
i
∣
τ
i
;
θ. It is noted that the variable b
~
i being a Bernoulli random value has only 0 and 1 as possible values. According to formula (14), it is concluded that P
b
~
i
∣
τ
i
;
θ is given as the following: (17)
P
b
~
i
∣
τ
i
;
θ
=
P
b
~
i
=
1
∣
τ
i
;
θ
b
~
i
P
b
~
i
=
0
∣
τ
i
;
θ
1
-
b
~
i
.From formulas (16) and (17), we have(18)
F
θ
=
∏
i
=
1
N
P
b
~
i
=
1
∣
τ
i
;
θ
b
~
i
P
b
~
i
=
0
∣
τ
i
;
θ
1
-
b
~
i
.Then its log-likelihood function is expressed as(19)
L
θ
=
∑
i
=
1
N
b
~
i
ln
⁡
P
b
~
i
=
1
∣
τ
i
;
θ
+
1
-
b
~
i
ln
⁡
P
b
~
i
=
0
∣
τ
i
;
θ
.According to the definition of the MLE [32], for the proposed channel-aware adaptive quantization scheme, the MLE is expressed as(20)
θ
^
=
arg
⁡
max
θ
⁡
L
θ
.It is noted that a systematic grid search, such as the sequential quadratic programming (SQP) [20], is employed to find an approximate maximum point of the global optimal value in the MLE above.


### 4.2.  CRLB

The aforementioned section has presented the channel-aware adaptive quantization scheme. In this section, its CRLB associated with the proposed scheme is derived to determine the lower bound on the variance of any unbiased estimator and provide the best performance benchmark.According to the CRLB for vector parameter [32], the CRLB for the channel-aware adaptive quantization scheme can be given as follows:(21)
CRLB
θ
=
I
θ
-
1
=
-
E
∂
2
L
θ
∂
2
θ
1
-
E
∂
2
L
θ
∂
θ
1
∂
θ
2
-
E
∂
2
L
θ
∂
θ
1
∂
θ
3
-
E
∂
2
L
θ
∂
θ
2
∂
θ
1
-
E
∂
2
L
θ
∂
2
θ
2
-
E
∂
2
L
θ
∂
θ
2
∂
θ
3
-
E
∂
2
L
θ
∂
θ
3
∂
θ
1
-
E
∂
2
L
θ
∂
θ
3
∂
θ
2
-
E
∂
2
L
θ
∂
2
θ
3
-
1
,where I
(
θ
) is the Fisher information matrix (FIM) and θ
i denotes the ith element of θ. According to formulas (19) and (21), we have(22)
∂
2
L
θ
∂
θ
j
∂
θ
k
=
∂
∂
L
θ
/
∂
θ
j
∂
θ
k
=
-
∑
i
=
1
N
b
~
i
∂
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
k
P
2
b
~
i
=
1
∣
τ
i
;
θ
-
∂
2
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
θ
k
P
b
~
i
=
1
∣
τ
i
;
θ
+
1
-
b
~
i
∂
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
k
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
2
-
∂
2
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
θ
k
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
≜
-
∑
i
=
1
N
A
j
,
k
b
~
i
,
τ
i
,
θ
,
j
,
k
∈
1,2
,
3
.Thus,[
I
(
θ
)
]
j
,
k can be derived as(23)
I
θ
j
,
k
=
-
E
∂
2
L
θ
∂
θ
j
∂
θ
k
=
∑
i
=
1
N
E
A
j
,
k
b
~
i
,
τ
i
,
θ
=
a
∑
i
=
1
N
E
τ
i
E
b
~
i
∣
τ
i
A
j
,
k
b
~
i
,
τ
i
,
θ
≜
∑
i
=
1
N
E
τ
i
G
j
,
k
τ
i
,
θ
,where the notation ≜ means that G
j
,
k
(
τ
i
,
θ
)
=
E
b
~
i
|
τ
i
[
A
j
,
k
(
b
~
i
,
τ
i
,
θ
)
]. E
τ
i and E
b
~
i
|
τ
i denote the expectation with respect to (w.r.t.) the distribution P
τ
i
;
θ and the expectation with respect to the conditional distribution P
b
~
i
∣
τ
i
;
θ. It is obvious that(24)
P
b
~
i
,
τ
i
;
θ
=
P
τ
i
;
θ
P
b
~
i
∣
τ
i
;
θ
,where P
b
~
i
∣
τ
i
;
θ is defined in formula (14). It is noted that A
j
,
k
(
b
~
i
,
τ
i
,
θ
) is a function of three variables (b
~
i, τ
i, and θ) and G
j
,
k
(
τ
i
,
θ
) is a function of two variables (τ
i and θ). According to the definition of the expectation of a two-dimensional random variable, E
[
∂
2
L
θ
/
∂
θ
j
∂
θ
k
] equals E
τ
i
,
b
i
[
∂
2
L
θ
/
∂
θ
j
∂
θ
k
]. Thus, =
a follows from the fact that E
τ
i
,
b
i
[
∂
2
L
θ
/
∂
θ
j
∂
θ
j
] equals E
τ
i
E
b
i
|
τ
i
∂
2
L
θ
/
∂
θ
j
∂
θ
k.To obtainI
θ
j
,
k, the probability distribution of the variable τ
i which is actually a discrete random variable is discussed as follows. It is clear that τ
i is a positive and discrete random variable because of the definition of thresholds in the channel-aware position-based adaptive quantization [see (5)–(9)]. There exists a unique integer K such that τ
1
-
K
Δ
≥
0 and τ
1
-
K
+
1
Δ
<
0, where the initialized threshold τ
1
>
0 and the step size Δ
>
0. The possible values of τ
i can be expressed as(25)
τ
i
∈
τ
1
,
τ
2
,
…
,
τ
N
+
K
+
1
,
i
∈
1,2
,
…
,
N
, where τ
(
l
)
≜
τ
1
-
K
Δ
+
(
l
-
1
)
Δ
=
τ
1
-
(
K
+
1
-
l
)
Δ and l
∈
{
1,2
,
…
,
N
+
K
+
1
}. Let P
(
τ
i
=
τ
(
l
)
;
θ
) denote the probability with which the local sensor i uses τ
(
l
) as the quantization threshold. For notational convenience, let(26)
P
i
,
l
≜
P
τ
i
=
τ
l
;
θ
,where the subscript i
∈
{
1,2
,
…
,
N
} and the subscript l
∈
{
1,2
,
…
,
N
+
K
+
1
}. According to formulas (25) and (26), for the given initialized threshold τ
1, P
1
,
K
+
1
=
P
(
τ
1
=
τ
(
K
+
1
)
;
θ
)
=
P
(
τ
1
=
τ
1
;
θ
)
=
1 and P
1
,
l
=
0 for l
≠
K
+
1.Then, for thei
+
1
t
h sensor,(27)
P
i
+
1
,
l
=
P
i
,
l
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
+
P
i
,
l
+
1
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
+
1
,
if
l
=
1
,
P
i
,
l
-
1
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
-
1
+
P
i
,
l
+
1
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
+
1
,
otherwise
,
=
b
P
i
,
l
P
b
~
i
=
0
∣
τ
i
=
τ
l
;
θ
+
P
i
,
l
+
1
P
b
~
i
=
0
∣
τ
i
=
τ
l
+
1
;
θ
,
if
l
=
1
,
P
i
,
l
-
1
P
b
~
i
=
1
∣
τ
i
=
τ
l
-
1
;
θ
+
P
i
,
l
+
1
P
b
~
i
=
0
∣
τ
i
=
τ
l
+
1
;
θ
,
otherwise
,where l
∈
{
1,2
,
…
,
N
+
K
}. Note =
b follows from the fact that the transition probability is expressed as(28)
P
τ
i
+
1
=
τ
k
∣
τ
i
=
τ
l
=
P
b
~
i
=
0
∣
τ
i
=
τ
l
;
θ
,
if
k
-
l
=
0
,
l
=
1
,
or if
k
-
l
=
-
1
,
l
≠
1
,
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
if
k
-
l
=
1
,
0
,
otherwise
, where P
τ
i
+
1
=
τ
(
k
)
∣
τ
i
=
τ
(
l
) denotes the transition probability from the state τ
(
l
) to τ
(
k
) when considering local sequential sensors i and i
+
1. P
b
~
i
∣
τ
i
=
τ
(
l
)
;
θ can be calculated by using formula (14).For example, ifτ
1
=
1, Δ
=
0.4, and N
=
3, we get K
=
2 and N
+
K
+
1
=
6. Additionally, l
∈
{
1,2
,
…
,
6
} and τ
(
l
)
=
τ
1
-
(
K
+
1
-
l
)
Δ
=
1
-
(
3
-
l
)
×
0.4
=
0.4
l
-
0.2. Obviously, τ
1
=
τ
(
K
+
1
)
=
τ
(
3
)
=
1, P
1
,
K
+
1
=
P
1,3
=
1 and P
1
,
l
=
0 for l
≠
3. For the sequent local sensors, the values P
i
,
l can be easily iteratively calculated by using formula (27). Its state diagram of the adaptive quantization threshold τ
i is shown in Figure 5. Within it, P
k
;
j denotes the transition probability from the state τ
(
k
) to τ
(
j
) in formula (28). It is concluded that P
1
;
1
+
P
1
;
2
=
P
2
;
1
+
P
2
;
3
=
P
3
;
2
+
P
3
;
4
=
P
4
;
3
+
P
4
;
5
=
P
5
;
4
+
P
5
;
6
=
1. Its state-transition matrix is(29)
P
1
;
1
P
1
;
2
0
0
0
0
P
2
;
1
0
P
2
;
3
0
0
0
0
P
3
;
2
0
P
3
;
4
0
0
0
0
P
4
;
3
0
P
4
;
5
0
0
0
0
P
5
;
4
0
P
5
;
6
0
0
0
0
0
1
.Figure 5
Example of a state diagram.Theorem 1.
For any unbiased estimatorθ
^, the CRLB associated with the proposed channel-aware position-based adaptive quantization scheme is given by(30)
C
R
L
B
θ
=
I
θ
-
1
,in which I
(
θ
) is defined in formula (21) and given as(31)
I
θ
1,1
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
e
-
τ
l
-
a
i
2
/
σ
2
/
8
π
σ
2
a
i
2
d
i
4
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
2,1
=
I
θ
1,2
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
x
i
-
x
t
/
4
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
3,1
=
I
θ
1,3
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
y
i
-
y
t
/
4
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
2,2
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
a
i
2
x
i
-
x
t
2
/
2
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
3,2
=
I
θ
2,3
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
a
i
2
x
i
-
x
t
y
i
-
y
t
/
2
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
3,3
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
a
i
2
y
i
-
y
t
2
/
2
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
.Proof.
First, we derive the elementI
θ
1,1. According to formulas (22) and (23), we have(32)
I
θ
1,1
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
G
1,1
τ
i
=
τ
l
,
θ
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
E
b
~
i
∣
τ
i
=
τ
l
A
1,1
b
~
i
,
τ
i
=
τ
l
,
θ
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
E
b
~
i
∣
τ
i
=
τ
l
b
~
i
∂
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
P
2
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
-
∂
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
+
1
-
b
~
i
∂
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
2
-
∂
2
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
.
We have(33)
∂
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
∂
θ
1
=
∂
q
τ
l
-
a
i
+
p
e
-
2
p
e
q
τ
l
-
a
i
∂
θ
1
=
1
-
2
p
e
e
-
τ
l
-
a
i
2
/
2
σ
2
2
2
π
P
0
σ
d
i
.
According to formula (8), we have E
b
~
i
|
τ
i
=
τ
l
b
~
i
=
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ and E
b
~
i
|
τ
i
=
τ
l
1
-
b
~
i
=
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
(
l
)
;
θ. Noting the fact above, we have(34)
I
θ
1,1
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
∂
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
e
-
τ
l
-
a
i
2
/
σ
2
8
π
P
0
σ
2
d
i
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
.Similarly, the other elements of I
(
θ
) can be derived. The proof of the theory is done.
The theory above introducesC
R
L
B
(
θ
), and here another conclusion is obtained which can express its performance more directly. Thus, to prove the effectiveness of the proposed adaptive scheme, a theoretical calculation is given through using the eigenvalues of matrix I
(
θ
).Lemma 2.
If matrixA is positive definite, then matrixes A
-
1, A
1, and A
2 are also positive definite, wherein A
-
1 is the inverse matrix of A
=
a
11
a
12
⋯
a
1
n
a
21
a
22
⋯
a
2
n
⋯
⋯
⋱
⋯
a
n
1
a
n
2
⋯
a
n
n, A
1
=
A
+
diag
⁡
t
1
,
t
2
,
…
,
t
n for t
i
>
0
i
∈
1,2
,
…
,
n, and A
2
=
λ
1
a
11
a
12
⋯
a
1
n
a
21
λ
2
a
22
⋯
a
2
n
⋯
⋯
⋱
⋯
a
n
1
a
n
2
⋯
λ
n
a
n
n, for λ
i
>
1
i
∈
{
1,2
,
…
,
n
} [33].Theorem 3.
Let the multiplicity of the positive definite matrixA be 1. Then, if the elements on the main diagonal of A increase, the corresponding eigenvalues of the inverse matrix of the variant are less than the corresponding eigenvalues of the inverse matrix of A.Proof.
By hypothesis,A is positive definite and therefore there exists an orthogonal matrix T such that T
-
1
A
T
=
diag
⁡
λ
1
,
λ
2
,
…
,
λ
n, and λ
i (i
∈
1,2
,
…
,
n) is the eigenvalue of A.
Meanwhile, we have(35)
T
-
1
A
1
T
=
T
-
1
A
+
diag
⁡
t
1
,
t
2
,
…
,
t
n
T
=
diag
⁡
λ
1
,
λ
2
,
…
,
λ
n
+
diag
⁡
t
1
,
t
2
,
…
,
t
n
=
diag
⁡
λ
1
+
t
1
,
λ
2
+
t
2
,
…
,
λ
n
+
t
n
.
By Lemma2, we have that matrixes A
-
1 and A
1 both are positive definite. Then, A
1
-
1 is positive definite. Let η
1
,
η
2
,
…
,
η
n and ζ
1
,
ζ
2
,
…
,
ζ
n be the eigenvalues of A
-
1 and A
1
-
1, respectively.
It is obvious thatT
-
1
A
1
A
1
-
1
T
=
I. It follows that(36)
T
-
1
A
1
A
1
-
1
T
=
T
-
1
A
1
T
T
-
1
A
1
-
1
T
=
diag
⁡
λ
1
+
t
1
,
λ
2
+
t
2
,
…
,
λ
n
+
t
n
diag
⁡
ζ
1
,
ζ
2
,
…
,
ζ
n
=
I
.Hence,(37)
λ
i
+
t
i
ζ
i
=
1
,
i
∈
1,2
,
…
,
n
.
Similarly, we haveT
-
1
A
A
-
1
T
=
I. It follows that(38)
T
-
1
A
A
-
1
T
=
T
-
1
A
T
T
-
1
A
-
1
T
=
diag
⁡
λ
1
,
λ
2
,
…
,
λ
n
diag
⁡
η
1
,
η
2
,
…
,
η
n
=
I
.Hence,(39)
λ
i
η
i
=
1
,
i
∈
1,2
,
…
,
n
.
It therefore follows from (36) and (38) that λ
i
+
t
i
ζ
i
/
λ
i
η
i
=
1
i
∈
1,2
,
…
,
n.
Hence(40)
ζ
i
η
i
=
λ
i
λ
i
+
t
i
,
i
∈
1,2
,
…
,
n
.
SinceA is positive definite, λ
i
>
0. Note that t
i
>
0 and then(41)
ζ
i
η
i
=
λ
i
λ
i
+
t
i
<
λ
i
λ
i
=
1
,
i
∈
1,2
,
…
,
n
.Thus, ζ
i
<
η
i. Similarly, it is derived that the eigenvalues of A
2
-
1 are less than the corresponding eigenvalues of the inverse matrix of A. The proof is now complete.Remarks. The proposed position-based adaptive quantization scheme in Section 3 is easy to apply. According to (20), the MLE is found through a systematic grid search and the lower bound on this time complexity is O
(
N
log
⁡
N
). However, to prove the effectiveness of the proposed adaptive scheme, obtaining the solution of C
R
L
B
(
θ
) by Theorem 1 is not enough. More precisely, the Fisher information matrix I is not invertible when some parameters in (21) are not properly set, such as these parameters: the number of sensors N, the crossover probability p
e, sensors’ random positions (or sensor density), the step-size parameter Δ, and the initial threshold τ
i. The MLE is influenced by all these parameters and has been shown in the following simulations.Nevertheless, Theorem3 introduces the basic principle for designing indexes of all local sensors of stage 1 in Section 3: I is a positive definite matrix with the multiplicity 1 when the indexes of all local sensors change. It is noted that the elements on the main diagonal of the matrix I are larger than the corresponding Fisher information matrix I of the fixed quantization MLE described in [21]. Additionally, Theorem 3 is a sufficient condition but not an equivalent condition. A large number of simulations have shown that the indexes of all local sensors are defined according to their distance information, and then the corresponding matrix I is usually positive definite with the multiplicity 1.


## 4.1. MLE

Using the model of BSCs (5), the probability of a received binary observation {
b
~
1
} taking a specific value b (1 or 0), given the initialized threshold τ
1, is expressed as(11)
P
b
~
1
=
b
∣
τ
1
;
θ
=
∑
b
1
=
0
1
P
b
~
1
=
b
∣
b
1
;
θ
P
b
1
∣
τ
1
;
θ
,where P
b
~
1
=
b
∣
b
1
;
θ is equal to P
b
~
1
=
b
∣
b
1 defined in formula (4) and P
b
1
∣
τ
1
;
θ is the probability of a quantized measurement taking a specific value conditioned on the initialized threshold τ
1. According to the sensor observation model in formula (2) and the proposed channel-aware quantization model in formula (5), P
b
1
∣
τ
1
;
θ is given by(12)
P
b
1
∣
τ
1
;
θ
=
q
τ
1
-
a
1
,
b
1
=
1
,
1
-
q
τ
1
-
a
1
,
b
1
=
0
,where q
· is the complementary distribution function of the zero mean, σ
2 variance Gaussian distribution defined as [21](13)
q
x
=
∫
x
+
∞
1
2
π
σ
e
-
x
2
/
2
σ
2
d
x
.In general, according to formula (11), we have(14)
P
b
~
i
=
b
∣
τ
i
;
θ
=
∑
b
i
=
0
1
P
b
~
i
=
b
∣
b
i
;
θ
P
b
i
∣
τ
i
;
θ
,where P
b
i
∣
τ
i
;
θ is the probability of a quantized measurement taking a specific value (b
i) conditioned on the quantization threshold τ
i of the ith sensor. It is given by(15)
P
b
i
∣
τ
i
;
θ
=
q
τ
i
-
a
i
,
b
i
=
1
,
1
-
q
τ
i
-
a
i
,
b
i
=
0
,where τ
i is defined in the above proposed channel-aware adaptive quantization scheme.Thus, the likelihood function of the parameterθ at the FC based on the received binary sequence B
~ can be expressed as(16)
F
θ
=
∏
i
=
1
N
f
b
~
i
∣
B
~
i
;
θ
=
∏
i
=
1
N
P
b
~
i
∣
τ
i
;
θ
,where f
b
~
i
∣
B
~
i
;
θ denotes the conditional probability density function of b
~
i and is equal to P
b
~
i
∣
τ
i
;
θ. It is noted that the variable b
~
i being a Bernoulli random value has only 0 and 1 as possible values. According to formula (14), it is concluded that P
b
~
i
∣
τ
i
;
θ is given as the following: (17)
P
b
~
i
∣
τ
i
;
θ
=
P
b
~
i
=
1
∣
τ
i
;
θ
b
~
i
P
b
~
i
=
0
∣
τ
i
;
θ
1
-
b
~
i
.From formulas (16) and (17), we have(18)
F
θ
=
∏
i
=
1
N
P
b
~
i
=
1
∣
τ
i
;
θ
b
~
i
P
b
~
i
=
0
∣
τ
i
;
θ
1
-
b
~
i
.Then its log-likelihood function is expressed as(19)
L
θ
=
∑
i
=
1
N
b
~
i
ln
⁡
P
b
~
i
=
1
∣
τ
i
;
θ
+
1
-
b
~
i
ln
⁡
P
b
~
i
=
0
∣
τ
i
;
θ
.According to the definition of the MLE [32], for the proposed channel-aware adaptive quantization scheme, the MLE is expressed as(20)
θ
^
=
arg
⁡
max
θ
⁡
L
θ
.It is noted that a systematic grid search, such as the sequential quadratic programming (SQP) [20], is employed to find an approximate maximum point of the global optimal value in the MLE above.


## 4.2.  CRLB

The aforementioned section has presented the channel-aware adaptive quantization scheme. In this section, its CRLB associated with the proposed scheme is derived to determine the lower bound on the variance of any unbiased estimator and provide the best performance benchmark.According to the CRLB for vector parameter [32], the CRLB for the channel-aware adaptive quantization scheme can be given as follows:(21)
CRLB
θ
=
I
θ
-
1
=
-
E
∂
2
L
θ
∂
2
θ
1
-
E
∂
2
L
θ
∂
θ
1
∂
θ
2
-
E
∂
2
L
θ
∂
θ
1
∂
θ
3
-
E
∂
2
L
θ
∂
θ
2
∂
θ
1
-
E
∂
2
L
θ
∂
2
θ
2
-
E
∂
2
L
θ
∂
θ
2
∂
θ
3
-
E
∂
2
L
θ
∂
θ
3
∂
θ
1
-
E
∂
2
L
θ
∂
θ
3
∂
θ
2
-
E
∂
2
L
θ
∂
2
θ
3
-
1
,where I
(
θ
) is the Fisher information matrix (FIM) and θ
i denotes the ith element of θ. According to formulas (19) and (21), we have(22)
∂
2
L
θ
∂
θ
j
∂
θ
k
=
∂
∂
L
θ
/
∂
θ
j
∂
θ
k
=
-
∑
i
=
1
N
b
~
i
∂
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
k
P
2
b
~
i
=
1
∣
τ
i
;
θ
-
∂
2
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
θ
k
P
b
~
i
=
1
∣
τ
i
;
θ
+
1
-
b
~
i
∂
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
k
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
2
-
∂
2
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
/
∂
θ
j
∂
θ
k
1
-
P
b
~
i
=
1
∣
τ
i
;
θ
≜
-
∑
i
=
1
N
A
j
,
k
b
~
i
,
τ
i
,
θ
,
j
,
k
∈
1,2
,
3
.Thus,[
I
(
θ
)
]
j
,
k can be derived as(23)
I
θ
j
,
k
=
-
E
∂
2
L
θ
∂
θ
j
∂
θ
k
=
∑
i
=
1
N
E
A
j
,
k
b
~
i
,
τ
i
,
θ
=
a
∑
i
=
1
N
E
τ
i
E
b
~
i
∣
τ
i
A
j
,
k
b
~
i
,
τ
i
,
θ
≜
∑
i
=
1
N
E
τ
i
G
j
,
k
τ
i
,
θ
,where the notation ≜ means that G
j
,
k
(
τ
i
,
θ
)
=
E
b
~
i
|
τ
i
[
A
j
,
k
(
b
~
i
,
τ
i
,
θ
)
]. E
τ
i and E
b
~
i
|
τ
i denote the expectation with respect to (w.r.t.) the distribution P
τ
i
;
θ and the expectation with respect to the conditional distribution P
b
~
i
∣
τ
i
;
θ. It is obvious that(24)
P
b
~
i
,
τ
i
;
θ
=
P
τ
i
;
θ
P
b
~
i
∣
τ
i
;
θ
,where P
b
~
i
∣
τ
i
;
θ is defined in formula (14). It is noted that A
j
,
k
(
b
~
i
,
τ
i
,
θ
) is a function of three variables (b
~
i, τ
i, and θ) and G
j
,
k
(
τ
i
,
θ
) is a function of two variables (τ
i and θ). According to the definition of the expectation of a two-dimensional random variable, E
[
∂
2
L
θ
/
∂
θ
j
∂
θ
k
] equals E
τ
i
,
b
i
[
∂
2
L
θ
/
∂
θ
j
∂
θ
k
]. Thus, =
a follows from the fact that E
τ
i
,
b
i
[
∂
2
L
θ
/
∂
θ
j
∂
θ
j
] equals E
τ
i
E
b
i
|
τ
i
∂
2
L
θ
/
∂
θ
j
∂
θ
k.To obtainI
θ
j
,
k, the probability distribution of the variable τ
i which is actually a discrete random variable is discussed as follows. It is clear that τ
i is a positive and discrete random variable because of the definition of thresholds in the channel-aware position-based adaptive quantization [see (5)–(9)]. There exists a unique integer K such that τ
1
-
K
Δ
≥
0 and τ
1
-
K
+
1
Δ
<
0, where the initialized threshold τ
1
>
0 and the step size Δ
>
0. The possible values of τ
i can be expressed as(25)
τ
i
∈
τ
1
,
τ
2
,
…
,
τ
N
+
K
+
1
,
i
∈
1,2
,
…
,
N
, where τ
(
l
)
≜
τ
1
-
K
Δ
+
(
l
-
1
)
Δ
=
τ
1
-
(
K
+
1
-
l
)
Δ and l
∈
{
1,2
,
…
,
N
+
K
+
1
}. Let P
(
τ
i
=
τ
(
l
)
;
θ
) denote the probability with which the local sensor i uses τ
(
l
) as the quantization threshold. For notational convenience, let(26)
P
i
,
l
≜
P
τ
i
=
τ
l
;
θ
,where the subscript i
∈
{
1,2
,
…
,
N
} and the subscript l
∈
{
1,2
,
…
,
N
+
K
+
1
}. According to formulas (25) and (26), for the given initialized threshold τ
1, P
1
,
K
+
1
=
P
(
τ
1
=
τ
(
K
+
1
)
;
θ
)
=
P
(
τ
1
=
τ
1
;
θ
)
=
1 and P
1
,
l
=
0 for l
≠
K
+
1.Then, for thei
+
1
t
h sensor,(27)
P
i
+
1
,
l
=
P
i
,
l
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
+
P
i
,
l
+
1
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
+
1
,
if
l
=
1
,
P
i
,
l
-
1
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
-
1
+
P
i
,
l
+
1
P
τ
i
+
1
=
τ
l
∣
τ
i
=
τ
l
+
1
,
otherwise
,
=
b
P
i
,
l
P
b
~
i
=
0
∣
τ
i
=
τ
l
;
θ
+
P
i
,
l
+
1
P
b
~
i
=
0
∣
τ
i
=
τ
l
+
1
;
θ
,
if
l
=
1
,
P
i
,
l
-
1
P
b
~
i
=
1
∣
τ
i
=
τ
l
-
1
;
θ
+
P
i
,
l
+
1
P
b
~
i
=
0
∣
τ
i
=
τ
l
+
1
;
θ
,
otherwise
,where l
∈
{
1,2
,
…
,
N
+
K
}. Note =
b follows from the fact that the transition probability is expressed as(28)
P
τ
i
+
1
=
τ
k
∣
τ
i
=
τ
l
=
P
b
~
i
=
0
∣
τ
i
=
τ
l
;
θ
,
if
k
-
l
=
0
,
l
=
1
,
or if
k
-
l
=
-
1
,
l
≠
1
,
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
if
k
-
l
=
1
,
0
,
otherwise
, where P
τ
i
+
1
=
τ
(
k
)
∣
τ
i
=
τ
(
l
) denotes the transition probability from the state τ
(
l
) to τ
(
k
) when considering local sequential sensors i and i
+
1. P
b
~
i
∣
τ
i
=
τ
(
l
)
;
θ can be calculated by using formula (14).For example, ifτ
1
=
1, Δ
=
0.4, and N
=
3, we get K
=
2 and N
+
K
+
1
=
6. Additionally, l
∈
{
1,2
,
…
,
6
} and τ
(
l
)
=
τ
1
-
(
K
+
1
-
l
)
Δ
=
1
-
(
3
-
l
)
×
0.4
=
0.4
l
-
0.2. Obviously, τ
1
=
τ
(
K
+
1
)
=
τ
(
3
)
=
1, P
1
,
K
+
1
=
P
1,3
=
1 and P
1
,
l
=
0 for l
≠
3. For the sequent local sensors, the values P
i
,
l can be easily iteratively calculated by using formula (27). Its state diagram of the adaptive quantization threshold τ
i is shown in Figure 5. Within it, P
k
;
j denotes the transition probability from the state τ
(
k
) to τ
(
j
) in formula (28). It is concluded that P
1
;
1
+
P
1
;
2
=
P
2
;
1
+
P
2
;
3
=
P
3
;
2
+
P
3
;
4
=
P
4
;
3
+
P
4
;
5
=
P
5
;
4
+
P
5
;
6
=
1. Its state-transition matrix is(29)
P
1
;
1
P
1
;
2
0
0
0
0
P
2
;
1
0
P
2
;
3
0
0
0
0
P
3
;
2
0
P
3
;
4
0
0
0
0
P
4
;
3
0
P
4
;
5
0
0
0
0
P
5
;
4
0
P
5
;
6
0
0
0
0
0
1
.Figure 5
Example of a state diagram.Theorem 1.
For any unbiased estimatorθ
^, the CRLB associated with the proposed channel-aware position-based adaptive quantization scheme is given by(30)
C
R
L
B
θ
=
I
θ
-
1
,in which I
(
θ
) is defined in formula (21) and given as(31)
I
θ
1,1
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
e
-
τ
l
-
a
i
2
/
σ
2
/
8
π
σ
2
a
i
2
d
i
4
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
2,1
=
I
θ
1,2
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
x
i
-
x
t
/
4
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
3,1
=
I
θ
1,3
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
y
i
-
y
t
/
4
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
2,2
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
a
i
2
x
i
-
x
t
2
/
2
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
3,2
=
I
θ
2,3
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
a
i
2
x
i
-
x
t
y
i
-
y
t
/
2
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
,
I
θ
3,3
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
a
i
2
y
i
-
y
t
2
/
2
π
σ
2
d
i
4
e
-
τ
l
-
a
i
2
/
σ
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
.Proof.
First, we derive the elementI
θ
1,1. According to formulas (22) and (23), we have(32)
I
θ
1,1
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
G
1,1
τ
i
=
τ
l
,
θ
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
E
b
~
i
∣
τ
i
=
τ
l
A
1,1
b
~
i
,
τ
i
=
τ
l
,
θ
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
E
b
~
i
∣
τ
i
=
τ
l
b
~
i
∂
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
P
2
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
-
∂
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
+
1
-
b
~
i
∂
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
2
-
∂
2
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
.
We have(33)
∂
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
∂
θ
1
=
∂
q
τ
l
-
a
i
+
p
e
-
2
p
e
q
τ
l
-
a
i
∂
θ
1
=
1
-
2
p
e
e
-
τ
l
-
a
i
2
/
2
σ
2
2
2
π
P
0
σ
d
i
.
According to formula (8), we have E
b
~
i
|
τ
i
=
τ
l
b
~
i
=
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ and E
b
~
i
|
τ
i
=
τ
l
1
-
b
~
i
=
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
(
l
)
;
θ. Noting the fact above, we have(34)
I
θ
1,1
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
∂
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
/
∂
θ
1
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
=
∑
i
=
1
N
∑
l
=
1
N
+
K
+
1
P
τ
i
=
τ
l
;
θ
1
-
2
p
e
2
e
-
τ
l
-
a
i
2
/
σ
2
8
π
P
0
σ
2
d
i
2
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
1
-
P
b
~
i
=
1
∣
τ
i
=
τ
l
;
θ
.Similarly, the other elements of I
(
θ
) can be derived. The proof of the theory is done.
The theory above introducesC
R
L
B
(
θ
), and here another conclusion is obtained which can express its performance more directly. Thus, to prove the effectiveness of the proposed adaptive scheme, a theoretical calculation is given through using the eigenvalues of matrix I
(
θ
).Lemma 2.
If matrixA is positive definite, then matrixes A
-
1, A
1, and A
2 are also positive definite, wherein A
-
1 is the inverse matrix of A
=
a
11
a
12
⋯
a
1
n
a
21
a
22
⋯
a
2
n
⋯
⋯
⋱
⋯
a
n
1
a
n
2
⋯
a
n
n, A
1
=
A
+
diag
⁡
t
1
,
t
2
,
…
,
t
n for t
i
>
0
i
∈
1,2
,
…
,
n, and A
2
=
λ
1
a
11
a
12
⋯
a
1
n
a
21
λ
2
a
22
⋯
a
2
n
⋯
⋯
⋱
⋯
a
n
1
a
n
2
⋯
λ
n
a
n
n, for λ
i
>
1
i
∈
{
1,2
,
…
,
n
} [33].Theorem 3.
Let the multiplicity of the positive definite matrixA be 1. Then, if the elements on the main diagonal of A increase, the corresponding eigenvalues of the inverse matrix of the variant are less than the corresponding eigenvalues of the inverse matrix of A.Proof.
By hypothesis,A is positive definite and therefore there exists an orthogonal matrix T such that T
-
1
A
T
=
diag
⁡
λ
1
,
λ
2
,
…
,
λ
n, and λ
i (i
∈
1,2
,
…
,
n) is the eigenvalue of A.
Meanwhile, we have(35)
T
-
1
A
1
T
=
T
-
1
A
+
diag
⁡
t
1
,
t
2
,
…
,
t
n
T
=
diag
⁡
λ
1
,
λ
2
,
…
,
λ
n
+
diag
⁡
t
1
,
t
2
,
…
,
t
n
=
diag
⁡
λ
1
+
t
1
,
λ
2
+
t
2
,
…
,
λ
n
+
t
n
.
By Lemma2, we have that matrixes A
-
1 and A
1 both are positive definite. Then, A
1
-
1 is positive definite. Let η
1
,
η
2
,
…
,
η
n and ζ
1
,
ζ
2
,
…
,
ζ
n be the eigenvalues of A
-
1 and A
1
-
1, respectively.
It is obvious thatT
-
1
A
1
A
1
-
1
T
=
I. It follows that(36)
T
-
1
A
1
A
1
-
1
T
=
T
-
1
A
1
T
T
-
1
A
1
-
1
T
=
diag
⁡
λ
1
+
t
1
,
λ
2
+
t
2
,
…
,
λ
n
+
t
n
diag
⁡
ζ
1
,
ζ
2
,
…
,
ζ
n
=
I
.Hence,(37)
λ
i
+
t
i
ζ
i
=
1
,
i
∈
1,2
,
…
,
n
.
Similarly, we haveT
-
1
A
A
-
1
T
=
I. It follows that(38)
T
-
1
A
A
-
1
T
=
T
-
1
A
T
T
-
1
A
-
1
T
=
diag
⁡
λ
1
,
λ
2
,
…
,
λ
n
diag
⁡
η
1
,
η
2
,
…
,
η
n
=
I
.Hence,(39)
λ
i
η
i
=
1
,
i
∈
1,2
,
…
,
n
.
It therefore follows from (36) and (38) that λ
i
+
t
i
ζ
i
/
λ
i
η
i
=
1
i
∈
1,2
,
…
,
n.
Hence(40)
ζ
i
η
i
=
λ
i
λ
i
+
t
i
,
i
∈
1,2
,
…
,
n
.
SinceA is positive definite, λ
i
>
0. Note that t
i
>
0 and then(41)
ζ
i
η
i
=
λ
i
λ
i
+
t
i
<
λ
i
λ
i
=
1
,
i
∈
1,2
,
…
,
n
.Thus, ζ
i
<
η
i. Similarly, it is derived that the eigenvalues of A
2
-
1 are less than the corresponding eigenvalues of the inverse matrix of A. The proof is now complete.Remarks. The proposed position-based adaptive quantization scheme in Section 3 is easy to apply. According to (20), the MLE is found through a systematic grid search and the lower bound on this time complexity is O
(
N
log
⁡
N
). However, to prove the effectiveness of the proposed adaptive scheme, obtaining the solution of C
R
L
B
(
θ
) by Theorem 1 is not enough. More precisely, the Fisher information matrix I is not invertible when some parameters in (21) are not properly set, such as these parameters: the number of sensors N, the crossover probability p
e, sensors’ random positions (or sensor density), the step-size parameter Δ, and the initial threshold τ
i. The MLE is influenced by all these parameters and has been shown in the following simulations.Nevertheless, Theorem3 introduces the basic principle for designing indexes of all local sensors of stage 1 in Section 3: I is a positive definite matrix with the multiplicity 1 when the indexes of all local sensors change. It is noted that the elements on the main diagonal of the matrix I are larger than the corresponding Fisher information matrix I of the fixed quantization MLE described in [21]. Additionally, Theorem 3 is a sufficient condition but not an equivalent condition. A large number of simulations have shown that the indexes of all local sensors are defined according to their distance information, and then the corresponding matrix I is usually positive definite with the multiplicity 1.


## 5. Performance Evaluation

In this section, some simulations are given to assess the performance of the proposed MLE in Section4.1. Its CRLB provides a benchmark (lower bound) for comparison. Our MLE is also compared with the fixed quantization MLE described in [21]. In order to find the global optimal value in the proposed MLE, a systematic grid search, such as the sequential quadratic programming (SQP), is employed to find an approximate maximum point. Additionally, it is assumed that the WSNs are uniformly deployed as shown in Figure 1.Here, we consider five simulation scenarios. Scenario1 considers the performance of different quantization methods versus the number of sensors N. Scenario 2 considers CRLBs of different quantization methods versus different crossover probabilities p
e. Scenario 3 examines the effect of the sensor density and the initial position of the target on CRLBs of different quantization methods. Scenario 4 considers the performance of different quantization methods versus the step-size parameter Δ. Scenario 5 examines the effective range of the parameter α
-
τ
i
2
/
σ
2 and discusses the problem of initial threshold designing. Note the prefix F and the prefix P denote the performances for the fixed quantization scheme [21] and the proposed adaptive quantization scheme in Section 3, respectively. For example, the F-CRLB and the P-CRLB denote the CRLBs for the fixed quantization scheme and the proposed adaptive quantization scheme, respectively. Additionally, their subscripts P, X, and Y denote their corresponding performances for parameters P
0, x
t, and y
t, respectively.Scenario 1.
The performances of fixed and adaptive channel-aware CRLBs are compared for different numbers of sensors. As shown in Figure6, it is noted that the proposed channel-aware adaptive quantization scheme has a lower CRLB than the classical fixed quantization scheme [21]. As N increases, both P-CRLB and F-CRLB become lower. Further, the proposed MLE will approach its appropriate CRLB when the number of sensors is large enough, as shown in Figures 6 and 7.Figure 6
CRLB versus the number of sensorsN. P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
1 W, τ
F
=
τ
1
=
0.8, Δ
=
0.8, and p
e
=
0.01.Figure 7
RMS versus the number of sensorsN. P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
1W, τ
F
=
τ
1
=
0.8, Δ
=
0.8, and p
e
=
0.01.Scenario 2.
The performances of fixed and adaptive channel-aware CRLBs are compared for different crossover probabilities, as shown in Figure8. It is noted that the proposed channel-aware adaptive quantization scheme has a lower CRLB than the classical fixed quantization scheme [21] for different crossover probabilities p
e. Additionally, the performances of both fixed and adaptive channel-aware quantization schemes degrade as p
e increases. However, if parameter p
e is enough small, that is, the wireless channel gets better, the proposed adaptive quantization scheme will be quite robust to the uncertainty of quantization thresholds, similarly depicted in the distributed estimation problem [25].Figure 8
CRLB versus different crossover probabilities.P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
1 W, τ
F
=
τ
1
=
0.8, Δ
=
0.8, and N
=
12.Scenario 3.
The performances of the adaptive channel-aware CRLB are examined for different sensor densities. The sensor density of ROI in Figure9 is 4 times than that in Figure 1. Within it, the suffix 2 denotes the performances for the high-density case. For example, the P-CRLB2 denote the CRLB for the higher-density case in Figure 9, and the P-CRLB denote the CRLB for the case in Figure 1. Figure 10 shows that a higher density can get a better performance under numbers of sensors. This is more due to the density effect. The higher-density sensors mean that the key principle in the proposed position-based quantization scheme, that is, close neighbors of the ith sensor are assigned almost the same threshold, is more reasonable and accurate.Figure 9
The higher sensor-density square ROI of target localization in WSN.Figure 10
CRLB versus the sensor density.P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
1 W, τ
F
=
τ
1
=
0.8, Δ
=
0.8, and p
e
=
0.01.To further examine the effect of the initial position of the target, we uniformly choose the initial position of the target as(
0,0
), (
10,0
), (
20,0
), (
30,0
), (
40,0
), and (
50,0
), respectively. Their performances of fixed and adaptive channel-aware CRLBs are shown in Figure 11. From this figure, we see the target’s initial position has little effect on the localization performance of both fixed and adaptive channel-aware schemes. The target’s initial position, specially, has very little effect on the performance for estimating y
t. If the initial position of (
50,0
) is chosen, that is, the position is far from the y-axis, the performance for estimating x
t will worsen slightly. The observation is consistent with Theorem 1.Figure 11
CRLB versus different locations of the target.P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
1 W, τ
F
=
τ
1
=
0.8, Δ
=
0.8, N
=
36, and p
e
=
0.01.Scenario 4.
The performances of fixed and adaptive channel-aware CRLBs are compared for different step-size parametersΔ, as shown in Figure 12. Firstly, the fixed channel-aware CRLB is constant under different step-size parameters. Then, a larger Δ gets a better performance because the proposed position-based scheme with a larger Δ can track α
i more quickly. Thus, an overestimated step size is generally chosen in practice.Figure 12
CRLB versus the step-size parameterΔ. P
0
=
64 W, x
t
=
y
t
=
0m, σ
2
=
1 W, τ
F
=
τ
1
=
0.3, N
=
12, and p
e
=
0.01.Scenario 5.
As claimed in Theorem1, the adaptive channel-aware CRLB is a function of (
α
i
-
τ
i
)
2
/
σ
2, which is one of the key variables. As shown in Figure 13, for the given target, the CRLB increases dramatically when τ
i is larger. Meanwhile, the effective range of τ
i is narrowed and the deterioration rate of the CRLB is increased rapidly when σ is larger. Additionally, as shown in Figure 14, the curves of (
α
i
-
τ
i
)
2
/
σ
2 show that the theoretical variation for σ
=
0.5 is larger and has more obvious influence on the estimation performance.Figure 13
CRLB as a function ofα
i
-
τ
i for different σ. P
0
=
128 W, x
t
=
y
t
=
0m, Δ
=
0.3, N
=
6, and p
e
=
0.01.Figure 14
The maximum and minimum of(
α
i
-
τ
i
)
2
/
σ
2 for different τ
1. Δ and ∇ denote their values for σ
2
=
1 W and σ
2
=
0.25 W, respectively. P
0
=
128 W, x
t
=
y
t
=
0m, Δ
=
0.3, N
=
6, and p
e
=
0.01.


## 6. Conclusion

In this paper, the quantization scheme in source localization problems under imperfect communication channels was investigated. A novel adaptive quantization scheme using one-bit data was developed and the appropriate channel-aware MLE which incorporates channel statistics information at the FC was also proposed. Additionally, the CRLBs for the adaptive quantization scheme was derived to benchmark the estimation performance and then a sufficient condition for the corresponding Fisher information matrix being positive definite was introduced. Finally, simulation results show that the MLE is effective and the crossover probability of BSCs greatly influences the performance of the CRLB.



---

*Source: 214081-2015-10-04.xml*