1,521 research outputs found
Distributed Detection over Fading MACs with Multiple Antennas at the Fusion Center
A distributed detection problem over fading Gaussian multiple-access channels
is considered. Sensors observe a phenomenon and transmit their observations to
a fusion center using the amplify and forward scheme. The fusion center has
multiple antennas with different channel models considered between the sensors
and the fusion center, and different cases of channel state information are
assumed at the sensors. The performance is evaluated in terms of the error
exponent for each of these cases, where the effect of multiple antennas at the
fusion center is studied. It is shown that for zero-mean channels between the
sensors and the fusion center when there is no channel information at the
sensors, arbitrarily large gains in the error exponent can be obtained with
sufficient increase in the number of antennas at the fusion center. In stark
contrast, when there is channel information at the sensors, the gain in error
exponent due to having multiple antennas at the fusion center is shown to be no
more than a factor of (8/pi) for Rayleigh fading channels between the sensors
and the fusion center, independent of the number of antennas at the fusion
center, or correlation among noise samples across sensors. Scaling laws for
such gains are also provided when both sensors and antennas are increased
simultaneously. Simple practical schemes and a numerical method using
semidefinite relaxation techniques are presented that utilize the limited
possible gains available. Simulations are used to establish the accuracy of the
results.Comment: 21 pages, 9 figures, submitted to the IEEE Transactions on Signal
Processin
Massive MIMO for Wireless Sensing with a Coherent Multiple Access Channel
We consider the detection and estimation of a zero-mean Gaussian signal in a
wireless sensor network with a coherent multiple access channel, when the
fusion center (FC) is configured with a large number of antennas and the
wireless channels between the sensor nodes and FC experience Rayleigh fading.
For the detection problem, we study the Neyman-Pearson (NP) Detector and Energy
Detector (ED), and find optimal values for the sensor transmission gains. For
the NP detector which requires channel state information (CSI), we show that
detection performance remains asymptotically constant with the number of FC
antennas if the sensor transmit power decreases proportionally with the
increase in the number of antennas. Performance bounds show that the benefit of
multiple antennas at the FC disappears as the transmit power grows. The results
of the NP detector are also generalized to the linear minimum mean squared
error estimator. For the ED which does not require CSI, we derive optimal gains
that maximize the deflection coefficient of the detector, and we show that a
constant deflection can be asymptotically achieved if the sensor transmit power
scales as the inverse square root of the number of FC antennas. Unlike the NP
detector, for high sensor power the multi-antenna ED is observed to empirically
have significantly better performance than the single-antenna implementation. A
number of simulation results are included to validate the analysis.Comment: 32 pages, 6 figures, accepted by IEEE Transactions on Signal
Processing, Feb. 201
Data-Efficient Quickest Outlying Sequence Detection in Sensor Networks
A sensor network is considered where at each sensor a sequence of random
variables is observed. At each time step, a processed version of the
observations is transmitted from the sensors to a common node called the fusion
center. At some unknown point in time the distribution of observations at an
unknown subset of the sensor nodes changes. The objective is to detect the
outlying sequences as quickly as possible, subject to constraints on the false
alarm rate, the cost of observations taken at each sensor, and the cost of
communication between the sensors and the fusion center. Minimax formulations
are proposed for the above problem and algorithms are proposed that are shown
to be asymptotically optimal for the proposed formulations, as the false alarm
rate goes to zero. It is also shown, via numerical studies, that the proposed
algorithms perform significantly better than those based on fractional
sampling, in which the classical algorithms from the literature are used and
the constraint on the cost of observations is met by using the outcome of a
sequence of biased coin tosses, independent of the observation process.Comment: Submitted to IEEE Transactions on Signal Processing, Nov 2014. arXiv
admin note: text overlap with arXiv:1408.474
Decentralized Maximum Likelihood Estimation for Sensor Networks Composed of Nonlinearly Coupled Dynamical Systems
In this paper we propose a decentralized sensor network scheme capable to
reach a globally optimum maximum likelihood (ML) estimate through
self-synchronization of nonlinearly coupled dynamical systems. Each node of the
network is composed of a sensor and a first-order dynamical system initialized
with the local measurements. Nearby nodes interact with each other exchanging
their state value and the final estimate is associated to the state derivative
of each dynamical system. We derive the conditions on the coupling mechanism
guaranteeing that, if the network observes one common phenomenon, each node
converges to the globally optimal ML estimate. We prove that the synchronized
state is globally asymptotically stable if the coupling strength exceeds a
given threshold. Acting on a single parameter, the coupling strength, we show
how, in the case of nonlinear coupling, the network behavior can switch from a
global consensus system to a spatial clustering system. Finally, we show the
effect of the network topology on the scalability properties of the network and
we validate our theoretical findings with simulation results.Comment: Journal paper accepted on IEEE Transactions on Signal Processin
- …