Distributed Sampling for Dense Sensor Networks: A "Bit-Conservation Principle"

We address the problem of deterministic oversampling of bandlimited sensor fields in a distributed communication-constrained processing environment, where it is desired for a central intelligent unit to reconstruct the sensor field to maximum pointwise accuracy.We show, using a dither-based sampling scheme, that is is possible to accomplish this using minimal inter-sensor communication with the aid of a multitude of low-precision sensors. Furthermore, we show the feasibility of having a flexible tradeoff between the average oversampling rate and the Analog to Digital (A/D) quantization precision per sensor sample with respect to achieving exponential accuracy in the number of bits per Nyquist-period, thereby exposing a key underpinning "conservation of bits" principle. That is, we can distribute the bit budget per Nyquist-period along the amplitude-axis (precision of A/D converter) and space (or time or space-time) using oversampling in an almost arbitrary discrete-valued manner, while retaining the same reconstruction error decay profile. Interestingly this oversampling is possible in a highly localized communication setting, with only nearest-neighbor communication, making it very attractive for dense sensor networks operating under stringent inter-node communication constraints. Finally we show how our scheme incorporates security as a by-product due to the presence of an underlying dither signal which can be used as a natural encryption device for security. The choice of the dither function enhances the security of the network.

[1]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[2]  Ingrid Daubechies,et al.  Single-bit oversampled A/D conversion with exponential accuracy in the bit-rate , 2000, Proceedings DCC 2000. Data Compression Conference.

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

[4]  W. Rudin.  Principles of mathematical analysis , 1964 .

[5]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

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

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

[8]  Martin Vetterli,et al.  Error-Rate Characteristics of Oversampled Analog-to-Digital Conversion , 1998, IEEE Trans. Inf. Theory.

[9]  J. R. Higgins.  Sampling theory in Fourier and signal analysis : foundations , 1996 .

[10]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[11]  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..

[12]  Kannan Ramchandran,et al.  A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  R. Marks.  Introduction to Shannon Sampling and Interpolation Theory , 1990 .

[14]  Anna Scaglione,et al.  On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks , 2002, MobiCom '02.

[15]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[16]  Ingrid Daubechies,et al.  Interpolation of bandlimited functions from quantized irregular samples , 2002, Proceedings DCC 2002. Data Compression Conference.