3,453 research outputs found
On the Effect of Correlated Measurements on the Performance of Distributed Estimation
We address the distributed estimation of an unknown scalar parameter in
Wireless Sensor Networks (WSNs). Sensor nodes transmit their noisy observations
over multiple access channel to a Fusion Center (FC) that reconstructs the
source parameter. The received signal is corrupted by noise and channel fading,
so that the FC objective is to minimize the Mean-Square Error (MSE) of the
estimate. In this paper, we assume sensor node observations to be correlated
with the source signal and correlated with each other as well. The correlation
coefficient between two observations is exponentially decaying with the
distance separation. The effect of the distance-based correlation on the
estimation quality is demonstrated and compared with the case of unity
correlated observations. Moreover, a closed-form expression for the outage
probability is derived and its dependency on the correlation coefficients is
investigated. Numerical simulations are provided to verify our analytic
results.Comment: 5 page
Decentralized sequential change detection using physical layer fusion
The problem of decentralized sequential detection with conditionally
independent observations is studied. The sensors form a star topology with a
central node called fusion center as the hub. The sensors make noisy
observations of a parameter that changes from an initial state to a final state
at a random time where the random change time has a geometric distribution. The
sensors amplify and forward the observations over a wireless Gaussian multiple
access channel and operate under either a power constraint or an energy
constraint. The optimal transmission strategy at each stage is shown to be the
one that maximizes a certain Ali-Silvey distance between the distributions for
the hypotheses before and after the change. Simulations demonstrate that the
proposed analog technique has lower detection delays when compared with
existing schemes. Simulations further demonstrate that the energy-constrained
formulation enables better use of the total available energy than the
power-constrained formulation in the change detection problem.Comment: 10 pages, two-column, 10 figures, revised based on feedback from
reviewers, accepted for publication in IEEE Trans. on Wireless Communication
On Power Allocation for Distributed Detection with Correlated Observations and Linear Fusion
We consider a binary hypothesis testing problem in an inhomogeneous wireless
sensor network, where a fusion center (FC) makes a global decision on the
underlying hypothesis. We assume sensors observations are correlated Gaussian
and sensors are unaware of this correlation when making decisions. Sensors send
their modulated decisions over fading channels, subject to individual and/or
total transmit power constraints. For parallel-access channel (PAC) and
multiple-access channel (MAC) models, we derive modified deflection coefficient
(MDC) of the test statistic at the FC with coherent reception.We propose a
transmit power allocation scheme, which maximizes MDC of the test statistic,
under three different sets of transmit power constraints: total power
constraint, individual and total power constraints, individual power
constraints only. When analytical solutions to our constrained optimization
problems are elusive, we discuss how these problems can be converted to convex
ones. We study how correlation among sensors observations, reliability of local
decisions, communication channel model and channel qualities and transmit power
constraints affect the reliability of the global decision and power allocation
of inhomogeneous sensors
Gossip Algorithms for Distributed Signal Processing
Gossip algorithms are attractive for in-network processing in sensor networks
because they do not require any specialized routing, there is no bottleneck or
single point of failure, and they are robust to unreliable wireless network
conditions. Recently, there has been a surge of activity in the computer
science, control, signal processing, and information theory communities,
developing faster and more robust gossip algorithms and deriving theoretical
performance guarantees. This article presents an overview of recent work in the
area. We describe convergence rate results, which are related to the number of
transmitted messages and thus the amount of energy consumed in the network for
gossiping. We discuss issues related to gossiping over wireless links,
including the effects of quantization and noise, and we illustrate the use of
gossip algorithms for canonical signal processing tasks including distributed
estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page
Distributed Detection and Estimation in Wireless Sensor Networks
In this article we consider the problems of distributed detection and
estimation in wireless sensor networks. In the first part, we provide a general
framework aimed to show how an efficient design of a sensor network requires a
joint organization of in-network processing and communication. Then, we recall
the basic features of consensus algorithm, which is a basic tool to reach
globally optimal decisions through a distributed approach. The main part of the
paper starts addressing the distributed estimation problem. We show first an
entirely decentralized approach, where observations and estimations are
performed without the intervention of a fusion center. Then, we consider the
case where the estimation is performed at a fusion center, showing how to
allocate quantization bits and transmit powers in the links between the nodes
and the fusion center, in order to accommodate the requirement on the maximum
estimation variance, under a constraint on the global transmit power. We extend
the approach to the detection problem. Also in this case, we consider the
distributed approach, where every node can achieve a globally optimal decision,
and the case where the decision is taken at a central node. In the latter case,
we show how to allocate coding bits and transmit power in order to maximize the
detection probability, under constraints on the false alarm rate and the global
transmit power. Then, we generalize consensus algorithms illustrating a
distributed procedure that converges to the projection of the observation
vector onto a signal subspace. We then address the issue of energy consumption
in sensor networks, thus showing how to optimize the network topology in order
to minimize the energy necessary to achieve a global consensus. Finally, we
address the problem of matching the topology of the network to the graph
describing the statistical dependencies among the observed variables.Comment: 92 pages, 24 figures. To appear in E-Reference Signal Processing, R.
Chellapa and S. Theodoridis, Eds., Elsevier, 201
- …