Impact of Data Retrieval Pattern on Homogeneous Signal Field Reconstruction in Dense Sensor Networks

We analyze the impact of data retrieval pattern on the reconstruction performance of a one-dimensional homogeneous random field measured by a large-scale sensor network. From a networking perspective, we connect data retrieval protocols and different sampling schemes. Specifically, we show that the data retrieval pattern affects the efficiency of reconstruction; as the number of received packets M increases, the deterministic retrieval pattern that schedules sensors to transmit from equally spaced locations results in a faster decay of distortion than the random pattern does. In particular, we show that the ratio of the excess reconstruction distortion under the random retrieval pattern to that under the deterministic one grows as logM+O(loglogM). Comparing the reconstruction performance directly, we further show that, in the high measurement signal-to-noise ratio (SNR) regime, the benefit from carefully scheduling sensor transmissions from specific locations instead of collecting in a random fashion is substantial. In the low SNR regime, however, using the random pattern results in little reconstruction performance loss. Finally, as Mrarrinfin, we show the strong convergence property of reconstruction distortion under the random pattern

[1]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[2]  Elias Masry,et al.  Poisson sampling and spectral estimation of continuous-time processes , 1978, IEEE Trans. Inf. Theory.

[3]  M. Micheli Random Sampling of a Continuous-time Stochastic Dynamical System: Analysis, State Estimation, and Applications , 2001 .

[4]  B. Liu,et al.  Error bounds for jittered sampling , 1965 .

[5]  E. M. Hartwell Boston , 1906 .

[6]  Lang Tong,et al.  Sensor networks with mobile access: optimal random access and coding , 2004, IEEE Journal on Selected Areas in Communications.

[7]  S. Resnick A Probability Path , 1999 .

[8]  A. V. Balakrishnan A note on the sampling principle for continuous signals , 1957, IRE Trans. Inf. Theory.

[9]  I. Bilinskis,et al.  Digital alias-free signal processing in the GHz frequency range , 1996 .

[10]  Leonard Kleinrock,et al.  QoS control for sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[11]  Brian M. Sadler,et al.  Information retrieval and processing in sensor networks: deterministic scheduling vs. random access , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[12]  David R. Cox,et al.  The Theory of Stochastic Processes , 1967, The Mathematical Gazette.

[13]  Oscar A.Z. Leneman Random sampling of random processes - Optimum linear interpolation. , 1966 .

[14]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[15]  Lang Tong,et al.  Quality-of-service specific information retrieval for densely deployed sensor networks , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[16]  J. D. T. Oliveira,et al.  The Asymptotic Theory of Extreme Order Statistics , 1979 .

[17]  Elias Masry Polynomial interpolation and prediction of continuous-time processes from random samples , 1997, IEEE Trans. Inf. Theory.

[18]  Ivars Bilinskis,et al.  Randomized Signal Processing , 1992 .

[19]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Lang Tong,et al.  Sensor networks with mobile agents , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[21]  O. Leneman,et al.  Random sampling of random processes: Mean-square comparison of various interpolators , 1966 .