Stochastically consistent caching and dynamic duty cycling for erratic sensor sources

  • Authors:

  • Shanzhong Zhu;Wei Wang;Chinya V. Ravishankar

  • Affiliations:

  • Department of Computer Science and Engineering, University of California, Riverside, CA;Department of Computer Science and Engineering, University of California, Riverside, CA;Department of Computer Science and Engineering, University of California, Riverside, CA

  • Venue:
  • DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a novel dynamic duty cycling scheme to maintain stochastic consistency for caches in sensor networks. To reduce transmissions, base stations often maintain caches for erratically changing sensor sources. Stochastic consistency guarantees the cache-source deviation is within a pre-specified bound with a certain confidence level. We model the erratic sources as Brownian motions, and adaptively predict the next cache update time based on the model. By piggybacking the next update time in each regular data packet, we can dynamically adjust the relaying nodes' duty cycles so that they are awake before the next update message arrives, and are sleeping otherwise. Through simulations, we show that our approach can achieve very high source-cache fidelity with low power consumption on many real-life sensor data. On average, our approach consumes 4-5 times less power than GAF [1], and achieves 50% longer network lifetime.