Distributed sampling and reconstruction of a physical field using an array of sensors is a problem of considerable interest in environmental monitoring applications of sensor networks. Our recent work has focused on the sampling of bandlimited sensor fields. However, sensor fields are not perfectly bandlimited but typically have rapidly decaying spectra. In a classical sampling set-up it is possible to precede the A/D sampling operation with an appropriate analog anti-aliasing filter. However, in the case of sensor networks, this is infeasible since sampling must precede filtering. We show that even though the effects of aliasing on the reconstruction cannot be prevented due to the "filter-less" sampling constraint, they can be suitably controlled by oversampling and carefully reconstructing the field from the samples. We show using a dither-based scheme that it is possible to estimate non-bandlimited fields with a precision that depends on how fast the spectral content of the field decays. We develop a framework for analyzing non-bandlimited fields that lead to upper bounds on the maximum pointwise error for a spatial bit rate of R bits/meter. We present results for fields with exponentially decaying spectra as an illustration. In particular, we show that for fields f(t) with exponential tails; i.e., F(/spl omega/) < /spl pi//spl alpha//sup -/spl alpha/|/spl omega/|/, the maximum pointwise error decays as c2e/sup -a//sub 1//spl radic/R+ c3 1//spl radic/R (e/sup -2a//sub 1//spl radic/R) with spatial bit rate R bits/meter. Finally, we show that for fields with spectra that have a finite second moment, the distortion decreases as O((1/N)/sup 2/3/) as the density of sensors, N, scales up to infinity . We show that if D is the targeted non-zero distortion, then the required (finite) rate R scales as O (1 //spl radic/D log 1/D).
[1]
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.
[2]
A. W. M. van den Enden,et al.
Discrete Time Signal Processing
,
1989
.
[3]
Thierry Blu,et al.
Sampling signals with finite rate of innovation
,
2002,
IEEE Trans. Signal Process..
[4]
Panganamala Ramana Kumar,et al.
RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN
,
2001
.
[5]
Ingrid Daubechies,et al.
Single-bit oversampled A/D conversion with exponential accuracy in the bit-rate
,
2000,
Proceedings DCC 2000. Data Compression Conference.
[6]
Allen Gersho,et al.
Vector quantization and signal compression
,
1991,
The Kluwer international series in engineering and computer science.
[7]
Martin Vetterli,et al.
Deterministic analysis of oversampled A/D conversion and decoding improvement based on consistent estimates
,
1994,
IEEE Trans. Signal Process..
[8]
Thomas M. Cover,et al.
Elements of Information Theory
,
2005
.
[9]
W. Rudin.
Principles of mathematical analysis
,
1964
.
[10]
Anna Scaglione,et al.
On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks
,
2002,
MobiCom '02.
[11]
Robert M. Gray,et al.
Oversampled Sigma-Delta Modulation
,
1987,
IEEE Trans. Commun..
[12]
Kannan Ramchandran,et al.
Distributed Sampling for Dense Sensor Networks: A "Bit-Conservation Principle"
,
2003,
IPSN.