Distortion-rate bounds for distributed estimation using wireless sensor networks

Authors:
Ioannis D. Schizas;Georgios B. Giannakis;Nihar Jindal
Affiliations:
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN;Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN;Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN
Venue:
EURASIP Journal on Advances in Signal Processing
Year:
2008

Citing 8
Cited 1

Elements of information theory

Elements of information theory
A generalized VQ method for combined compression and estimation

ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04
The quadratic Gaussian CEO problem

IEEE Transactions on Information Theory
The rate-distortion function for the quadratic Gaussian CEO problem

IEEE Transactions on Information Theory
Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder

IEEE Transactions on Information Theory
The Distributed Karhunen–Loève Transform

IEEE Transactions on Information Theory
An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem

IEEE Journal on Selected Areas in Communications
On rate-constrained distributed estimation in unreliable sensor networks

IEEE Journal on Selected Areas in Communications

Distributed Kalman smoothing in static Bayesian networks

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We deal with centralized and distributed rate-constrained estimation of random signal vectors performed using a network of wireless sensors (encoders) communicating with a fusion center (decoder). For this context, we determine lower and upper bounds on the corresponding distortion-rate (D-R) function. The nonachievable lower bound is obtained by considering centralized estimation with a single-sensor which has all observation data available, and by determining the associated D-R function in closed-form. Interestingly, this D-R function can be achieved using an estimate first compress afterwards (EC) approach, where the sensor (i) forms the minimum mean-square error (MMSE) estimate for the signal of interest; and (ii) optimally (in the MSE sense) compresses and transmits it to the FC that reconstructs it. We further derive a novel alternating scheme to numerically determine an achievable upper bound of the D-R function for general distributed estimation usingmultiple sensors. The proposed algorithm tackles an analytically intractable minimization problem, while it accounts for sensor data correlations. The obtained upper bound is tighter than the one determined by having each sensor performing MSE optimal encoding independently of the others. Numerical examples indicate that the algorithm performs well and yields D-R upper bounds which are relatively tight with respect to analytical alternatives obtained without taking into account the cross-correlations among sensor data.