1,073 research outputs found
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
Compressive Identification of Active OFDM Subcarriers in Presence of Timing Offset
In this paper we study the problem of identifying active subcarriers in an
OFDM signal from compressive measurements sampled at sub-Nyquist rate. The
problem is of importance in Cognitive Radio systems when secondary users (SUs)
are looking for available spectrum opportunities to communicate over them while
sensing at Nyquist rate sampling can be costly or even impractical in case of
very wide bandwidth. We first study the effect of timing offset and derive the
necessary and sufficient conditions for signal recovery in the oracle-assisted
case when the true active sub-carriers are assumed known. Then we propose an
Orthogonal Matching Pursuit (OMP)-based joint sparse recovery method for
identifying active subcarriers when the timing offset is known. Finally we
extend the problem to the case of unknown timing offset and develop a joint
dictionary learning and sparse approximation algorithm, where in the dictionary
learning phase the timing offset is estimated and in the sparse approximation
phase active subcarriers are identified. The obtained results demonstrate that
active subcarrier identification can be carried out reliably, by using the
developed framework.Comment: To appear in the proceedings of the IEEE Global Communications
Conference (GLOBECOM) 201
Decentralized Subspace Pursuit for Joint Sparsity Pattern Recovery
To solve the problem of joint sparsity pattern recovery in a decen-tralized
network, we propose an algorithm named decentralized and collaborative subspace
pursuit (DCSP). The basic idea of DCSP is to embed collaboration among nodes
and fusion strategy into each iteration of the standard subspace pursuit (SP)
algorithm. In DCSP, each node collaborates with several of its neighbors by
sharing high-dimensional coefficient estimates and communicates with other
remote nodes by exchanging low-dimensional support set estimates. Experimental
evaluations show that, compared with several existing algorithms for sparsity
pattern recovery, DCSP produces satisfactory results in terms of accuracy of
sparsity pattern recovery with much less communication cost.Comment: 5 pages, 3 figures, accepted by ICASSP 201
- …