1,717 research outputs found
Detection Performance in Balanced Binary Relay Trees with Node and Link Failures
We study the distributed detection problem in the context of a balanced
binary relay tree, where the leaves of the tree correspond to identical and
independent sensors generating binary messages. The root of the tree is a
fusion center making an overall decision. Every other node is a relay node that
aggregates the messages received from its child nodes into a new message and
sends it up toward the fusion center. We derive upper and lower bounds for the
total error probability as explicit functions of in the case where
nodes and links fail with certain probabilities. These characterize the
asymptotic decay rate of the total error probability as goes to infinity.
Naturally, this decay rate is not larger than that in the non-failure case,
which is . However, we derive an explicit necessary and sufficient
condition on the decay rate of the local failure probabilities
(combination of node and link failure probabilities at each level) such that
the decay rate of the total error probability in the failure case is the same
as that of the non-failure case. More precisely, we show that if and only if
Submodularity and Optimality of Fusion Rules in Balanced Binary Relay Trees
We study the distributed detection problem in a balanced binary relay tree,
where the leaves of the tree are sensors generating binary messages. The root
of the tree is a fusion center that makes the overall decision. Every other
node in the tree is a fusion node that fuses two binary messages from its child
nodes into a new binary message and sends it to the parent node at the next
level. We assume that the fusion nodes at the same level use the same fusion
rule. We call a string of fusion rules used at different levels a fusion
strategy. We consider the problem of finding a fusion strategy that maximizes
the reduction in the total error probability between the sensors and the fusion
center. We formulate this problem as a deterministic dynamic program and
express the solution in terms of Bellman's equations. We introduce the notion
of stringsubmodularity and show that the reduction in the total error
probability is a stringsubmodular function. Consequentially, we show that the
greedy strategy, which only maximizes the level-wise reduction in the total
error probability, is within a factor of the optimal strategy in terms of
reduction in the total error probability
Hypothesis Testing in Feedforward Networks with Broadcast Failures
Consider a countably infinite set of nodes, which sequentially make decisions
between two given hypotheses. Each node takes a measurement of the underlying
truth, observes the decisions from some immediate predecessors, and makes a
decision between the given hypotheses. We consider two classes of broadcast
failures: 1) each node broadcasts a decision to the other nodes, subject to
random erasure in the form of a binary erasure channel; 2) each node broadcasts
a randomly flipped decision to the other nodes in the form of a binary
symmetric channel. We are interested in whether there exists a decision
strategy consisting of a sequence of likelihood ratio tests such that the node
decisions converge in probability to the underlying truth. In both cases, we
show that if each node only learns from a bounded number of immediate
predecessors, then there does not exist a decision strategy such that the
decisions converge in probability to the underlying truth. However, in case 1,
we show that if each node learns from an unboundedly growing number of
predecessors, then the decisions converge in probability to the underlying
truth, even when the erasure probabilities converge to 1. We also derive the
convergence rate of the error probability. In case 2, we show that if each node
learns from all of its previous predecessors, then the decisions converge in
probability to the underlying truth when the flipping probabilities of the
binary symmetric channels are bounded away from 1/2. In the case where the
flipping probabilities converge to 1/2, we derive a necessary condition on the
convergence rate of the flipping probabilities such that the decisions still
converge to the underlying truth. We also explicitly characterize the
relationship between the convergence rate of the error probability and the
convergence rate of the flipping probabilities
Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems
The problem of designing bit-to-pattern mappings and power allocation schemes
for orthogonal frequency-division multiplexing (OFDM) systems that employ
subcarrier index modulation (IM) is considered. We assume the binary source
conveys a stream of independent, uniformly distributed bits to the pattern
mapper, which introduces a constraint on the pattern transmission probability
distribution that can be quantified using a binary tree formalism. Under this
constraint, we undertake the task of maximizing the achievable rate subject to
the availability of channel knowledge at the transmitter. The optimization
variables are the pattern probability distribution (i.e., the bit-to-pattern
mapping) and the transmit powers allocated to active subcarriers. To solve the
problem, we first consider the relaxed problem where pattern probabilities are
allowed to take any values in the interval [0,1] subject to a sum probability
constraint. We develop (approximately) optimal solutions to the relaxed problem
by using new bounds and asymptotic results, and then use a novel heuristic
algorithm to project the relaxed solution onto a point in the feasible set of
the constrained problem. Numerical analysis shows that this approach is capable
of achieving the maximum mutual information for the relaxed problem in low and
high-SNR regimes and offers noticeable benefits in terms of achievable rate
relative to a conventional OFDM-IM benchmark.Comment: 18 pages, 16 figures, 2 table
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
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
- …