850 research outputs found
Decentralized Estimation over Orthogonal Multiple-access Fading Channels in Wireless Sensor Networks - Optimal and Suboptimal Estimators
Optimal and suboptimal decentralized estimators in wireless sensor networks
(WSNs) over orthogonal multiple-access fading channels are studied in this
paper. Considering multiple-bit quantization before digital transmission, we
develop maximum likelihood estimators (MLEs) with both known and unknown
channel state information (CSI). When training symbols are available, we derive
a MLE that is a special case of the MLE with unknown CSI. It implicitly uses
the training symbols to estimate the channel coefficients and exploits the
estimated CSI in an optimal way. To reduce the computational complexity, we
propose suboptimal estimators. These estimators exploit both signal and data
level redundant information to improve the estimation performance. The proposed
MLEs reduce to traditional fusion based or diversity based estimators when
communications or observations are perfect. By introducing a general message
function, the proposed estimators can be applied when various analog or digital
transmission schemes are used. The simulations show that the estimators using
digital communications with multiple-bit quantization outperform the estimator
using analog-and-forwarding transmission in fading channels. When considering
the total bandwidth and energy constraints, the MLE using multiple-bit
quantization is superior to that using binary quantization at medium and high
observation signal-to-noise ratio levels
Adaptive Quantizers for Estimation
In this paper, adaptive estimation based on noisy quantized observations is
studied. A low complexity adaptive algorithm using a quantizer with adjustable
input gain and offset is presented. Three possible scalar models for the
parameter to be estimated are considered: constant, Wiener process and Wiener
process with deterministic drift. After showing that the algorithm is
asymptotically unbiased for estimating a constant, it is shown, in the three
cases, that the asymptotic mean squared error depends on the Fisher information
for the quantized measurements. It is also shown that the loss of performance
due to quantization depends approximately on the ratio of the Fisher
information for quantized and continuous measurements. At the end of the paper
the theoretical results are validated through simulation under two different
classes of noise, generalized Gaussian noise and Student's-t noise
Optimal Identical Binary Quantizer Design for Distributed Estimation
We consider the design of identical one-bit probabilistic quantizers for
distributed estimation in sensor networks. We assume the parameter-range to be
finite and known and use the maximum Cram\'er-Rao Lower Bound (CRB) over the
parameter-range as our performance metric. We restrict our theoretical analysis
to the class of antisymmetric quantizers and determine a set of conditions for
which the probabilistic quantizer function is greatly simplified. We identify a
broad class of noise distributions, which includes Gaussian noise in the
low-SNR regime, for which the often used threshold-quantizer is found to be
minimax-optimal. Aided with theoretical results, we formulate an optimization
problem to obtain the optimum minimax-CRB quantizer. For a wide range of noise
distributions, we demonstrate the superior performance of the new quantizer -
particularly in the moderate to high-SNR regime.Comment: 6 pages, 3 figures, This paper has been accepted for publication in
IEEE Transactions in Signal Processin
Fusing Censored Dependent Data for Distributed Detection
In this paper, we consider a distributed detection problem for a censoring
sensor network where each sensor's communication rate is significantly reduced
by transmitting only "informative" observations to the Fusion Center (FC), and
censoring those deemed "uninformative". While the independence of data from
censoring sensors is often assumed in previous research, we explore spatial
dependence among observations. Our focus is on designing the fusion rule under
the Neyman-Pearson (NP) framework that takes into account the spatial
dependence among observations. Two transmission scenarios are considered, one
where uncensored observations are transmitted directly to the FC and second
where they are first quantized and then transmitted to further improve
transmission efficiency. Copula-based Generalized Likelihood Ratio Test (GLRT)
for censored data is proposed with both continuous and discrete messages
received at the FC corresponding to different transmission strategies. We
address the computational issues of the copula-based GLRTs involving
multidimensional integrals by presenting more efficient fusion rules, based on
the key idea of injecting controlled noise at the FC before fusion. Although,
the signal-to-noise ratio (SNR) is reduced by introducing controlled noise at
the receiver, simulation results demonstrate that the resulting noise-aided
fusion approach based on adding artificial noise performs very closely to the
exact copula-based GLRTs. Copula-based GLRTs and their noise-aided counterparts
by exploiting the spatial dependence greatly improve detection performance
compared with the fusion rule under independence assumption
On Distributed Linear Estimation With Observation Model Uncertainties
We consider distributed estimation of a Gaussian source in a heterogenous
bandwidth constrained sensor network, where the source is corrupted by
independent multiplicative and additive observation noises, with incomplete
statistical knowledge of the multiplicative noise. For multi-bit quantizers, we
derive the closed-form mean-square-error (MSE) expression for the linear
minimum MSE (LMMSE) estimator at the FC. For both error-free and erroneous
communication channels, we propose several rate allocation methods named as
longest root to leaf path, greedy and integer relaxation to (i) minimize the
MSE given a network bandwidth constraint, and (ii) minimize the required
network bandwidth given a target MSE. We also derive the Bayesian Cramer-Rao
lower bound (CRLB) and compare the MSE performance of our proposed methods
against the CRLB. Our results corroborate that, for low power multiplicative
observation noises and adequate network bandwidth, the gaps between the MSE of
our proposed methods and the CRLB are negligible, while the performance of
other methods like individual rate allocation and uniform is not satisfactory
- …