On rate-constrained distributed estimation in unreliable sensor networks

We study the problem of estimating a physical process at a central processing unit (CPU) based on noisy measurements collected from a distributed, bandwidth-constrained, unreliable, network of sensors, modeled as an erasure network of unreliable "bit-pipes" between each sensor and the CPU. The CPU is guaranteed to receive data from a minimum fraction of the sensors and is tasked with optimally estimating the physical process under a specified distortion criterion. We study the noncollaborative (i.e., fully distributed) sensor network regime, and derive an information-theoretic achievable rate-distortion region for this network based on distributed source-coding insights. Specializing these results to the Gaussian setting and the mean-squared-error (MSE) distortion criterion reveals interesting robust-optimality properties of the solution. We also study the regime of clusters of collaborative sensors, where we address the important question: given a communication rate constraint between the sensor clusters and the CPU, should these clusters transmit their "raw data" or some low-dimensional "local estimates"? For a broad set of distortion criteria and sensor correlation statistics, we derive conditions under which rate-distortion-optimal compression of correlated cluster-observations separates into the tasks of dimension-reducing local estimation followed by optimal distributed compression of the local estimates.

[1]  Toby Berger,et al.  The CEO problem [multiterminal source coding] , 1996, IEEE Trans. Inf. Theory.

[2]  David J. Sakrison,et al.  Source encoding in the presence of random disturbance (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[3]  Gary L. Wise,et al.  A note on a common misconception in estimation , 1985 .

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  Kannan Ramchandran,et al.  n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes , 2004, IEEE Transactions on Information Theory.

[6]  Toby Berger,et al.  An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem , 2004, IEEE Journal on Selected Areas in Communications.

[7]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[8]  Vinod M. Prabhakaran,et al.  Rate region of the quadratic Gaussian CEO problem , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  Yasutada Oohama,et al.  The Rate-Distortion Function for the Quadratic Gaussian CEO Problem , 1998, IEEE Trans. Inf. Theory.

[10]  Kannan Ramchandran,et al.  Generalized coset codes for distributed binning , 2005, IEEE Transactions on Information Theory.

[11]  Michael Gastpar,et al.  Source-Channel Communication in Sensor Networks , 2003, IPSN.

[12]  Toby Berger,et al.  Robust coding schemes for distributed sensor networks with unreliable sensors , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[13]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[14]  K. Ramchandran,et al.  Rate-constrained robust estimation for unreliable sensor networks , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[15]  J. Chou,et al.  Tracking and exploiting correlations in dense sensor networks , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[16]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[17]  J. Wolfowitz.  The rate distortion function for source coding with side information at the decoder , 1979 .

[18]  Eric B. Hall,et al.  Some aspects of fusion in estimation theory , 1991, IEEE Trans. Inf. Theory.

[19]  Deborah Estrin,et al.  Next Century Challenges: Mobile Networking for Smart Dust , 1999, MobiCom 1999.

[20]  Kannan Ramchandran,et al.  Distributed compression in a dense microsensor network , 2002, IEEE Signal Process. Mag..

[21]  Jack K. Wolf,et al.  Transmission of noisy information to a noisy receiver with minimum distortion , 1970, IEEE Trans. Inf. Theory.

[22]  Kannan Ramchandran,et al.  Distributed source coding using syndromes (DISCUSS): design and construction , 1999 .

[23]  D. Marco,et al.  Reliability vs. efficiency in distributed source coding for field-gathering sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[24]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[25]  Kannan Ramchandran,et al.  Distributed source coding: symmetric rates and applications to sensor networks , 2000, Proceedings DCC 2000. Data Compression Conference.

[26]  K. Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).