Research Article
Adaptive Data Quality for Persistent Queries in Sensor Networks
@INPROCEEDINGS{10.1007/978-3-642-10625-5_9, author={Vasanth Rajamani and Christine Julien}, title={Adaptive Data Quality for Persistent Queries in Sensor Networks}, proceedings={Quality of Service in Heterogeneous Networks. 6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2009 and 3rd International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, AAA-IDEA 2009, Las Palmas, Gran Canaria, November 23-25, 2009 Proceedings}, proceedings_a={QSHINE}, year={2012}, month={10}, keywords={Adaptive fidelity gossip}, doi={10.1007/978-3-642-10625-5_9} }- Vasanth Rajamani
Christine Julien
Year: 2012
Adaptive Data Quality for Persistent Queries in Sensor Networks
QSHINE
Springer
DOI: 10.1007/978-3-642-10625-5_9
Abstract
Wireless sensor networks are emerging as a convenient mechanism to constantly monitor the physical world. The volume of information in such networks can be extremely large. And, to be meaningful to applications, this information must be processed at the right level of accuracy. However, there is an inherent trade-off between achieving a high degree of data accuracy and the communication overhead associated with achieving it. We present a simple mechanism for spatially approximate query processing. We present a protocol that leverages gossip based routing to collect network data from a randomly selected set of nodes at a user-defined level of accuracy. We extend this protocol to address persistent queries, long running queries where network data is collected periodically, by treating a persistent query as a temporal aggregate of individual queries. Finally, we provide a novel protocol that dynamically adapts its accuracy based on the quality of the responses to individual requests in the persistent query. We describe this protocol in detail and evaluate its performance through simulation.