Intersensor Collaboration in Distributed Quantization Networks

Several key results in distributed source coding offer the intuition that little improvement in compression can be gained from intersensor communication when the information is coded in long blocks. However, when sensors are restricted to code their observations in small blocks (e.g., one) or desire fidelity of a computation applied to source realizations, intelligent collaboration between sensors can greatly reduce distortion. For networks where sensors are allowed to "chat" using a side channel that is unobservable at the fusion center, we provide asymptotically-exact characterization of distortion performance and optimal quantizer design in the high-resolution (low-distortion) regime using a framework called distributed functional scalar quantization (DFSQ). The key result is that chatting can dramatically improve performance even when intersensor communication is at very low rate. We also solve the rate allocation problem when communication links have heterogeneous costs and provide a detailed example to demonstrate the theoretical and practical gains from chatting. This example for maximum computation gives insight on the gap between chatting and distributed networks, and how to optimize the intersensor communication.

[1]  Vivek K Goyal High-rate transform coding: how high is high, and does it matter? , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[2]  Vivek K. Goyal,et al.  Distributed Scalar Quantization for Computing: High-Resolution Analysis and Extensions , 2008, IEEE Transactions on Information Theory.

[3]  Yuval Kochman,et al.  The Dispersion of Lossy Source Coding , 2011, 2011 Data Compression Conference.

[4]  Aslan Tchamkerten,et al.  On cooperation in multi-terminal computation and rate distortion , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[5]  Prakash Narayan,et al.  Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing , 2010, IEEE Transactions on Information Theory.

[6]  Adrian Segall Bit allocation and encoding for vector sources , 1976, IEEE Trans. Inf. Theory.

[7]  Tamás Linder,et al.  High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding , 1999, IEEE Trans. Inf. Theory.

[8]  Vivek K. Goyal,et al.  Distributed Functional Scalar Quantization Simplified , 2012, IEEE Transactions on Signal Processing.

[9]  David L. Neuhoff,et al.  Quantization , 2022, IEEE Trans. Inf. Theory.

[10]  Vivek K. Goyal,et al.  Chatting in distributed quantization networks , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[12]  Sergio Verdú,et al.  Fixed-Length Lossy Compression in the Finite Blocklength Regime , 2011, IEEE Transactions on Information Theory.

[13]  Gregory W. Wornell,et al.  Source Coding With Distortion Side Information , 2008, IEEE Transactions on Information Theory.

[14]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[15]  W. R. Bennett,et al.  Spectra of quantized signals , 1948, Bell Syst. Tech. J..

[16]  Neil L. Gerr,et al.  A simple class of asymptotically optimal quantizers , 1983, IEEE Trans. Inf. Theory.

[17]  Robert M. Gray,et al.  Asymptotically optimal quantizers (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[18]  Michelle Effros,et al.  Functional Source Coding for Networks with Receiver Side Information ∗ , 2004 .

[19]  David L. Neuhoff,et al.  The Other Asymptotic Theory of Lossy Source Coding , 1992, Coding And Quantization.

[20]  Vincent Y. F. Tan,et al.  On the dispersions of three network information theory problems , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[21]  R. Wesel,et al.  Efficient universal recovery in broadcast networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[22]  ROBERT M. GRAY Asymptotically Optimal Quantizers , 2008 .

[23]  Piyush Gupta,et al.  Interactive Source Coding for Function Computation in Collocated Networks , 2012, IEEE Transactions on Information Theory.

[24]  P. F. Panter,et al.  Quantization distortion in pulse-count modulation with nonuniform spacing of levels , 1951, Proceedings of the IRE.

[25]  James A. Bucklew,et al.  Multidimensional asymptotic quantization theory with r th power distortion measures , 1982, IEEE Trans. Inf. Theory.

[26]  Toby Berger,et al.  Rate-distortion for correlated sources with partially separated encoders , 1982, IEEE Trans. Inf. Theory.

[27]  W. W. Peterson,et al.  Bit Allocation and Encoding for Vector Sources , 1976 .

[28]  Prakash Ishwar,et al.  Some Results on Distributed Source Coding for Interactive Function Computation , 2011, IEEE Transactions on Information Theory.

[29]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[30]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[31]  Hüseyin Arslan,et al.  A survey of spectrum sensing algorithms for cognitive radio applications , 2009, IEEE Communications Surveys & Tutorials.

[32]  Ram Zamir,et al.  The rate loss in the Wyner-Ziv problem , 1996, IEEE Trans. Inf. Theory.

[33]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .