2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom) (2008)
Mar. 17, 2008 to Mar. 21, 2008
This research is motivated by large-scale pervasive sensing applications. We examine the benefits and costs of caching data for such applications. We propose and evaluate several approaches to querying for, and then caching data in a sensor field data server. We show that for some application requirements (i.e., when delay drives data quality), policies that emulate cache hits by computing and returning approximate values for sensor data yield a simultaneous quality improvement and cost savings. This win-win is because when system delay is sufficiently important, the benefit to both query cost and data quality achieved by using approximate values outweighs the negative impact on quality due to the approximation. In contrast, when data accuracy drives quality, a linear trade-off between query cost and data quality emerges. We also identify caching and lookup policies for which the sensor field query rate is bounded when servicing an arbitrary workload of user queries. This upper bound is achieved by having multiple user queries share the cost of a single sensor field query. Finally, we demonstrate that our results are robust to the manner in which the environment being monitored changes using models for two different sensing systems.
J. F. Kurose, E. Nahum, D. Yates and P. Shenoy, "Data Quality and Query Cost in Pervasive Sensing Systems," 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom)(PERCOM), vol. 00, no. , pp. 195-205, 2008.