Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
TiNA: a scheme for temporal coherency-aware in-network aggregation
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Cleaning and querying noisy sensors
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Sensor: the atomic computing particle
ACM SIGMOD Record
IEEE Transactions on Computers
Correct Execution of Continuous Monitoring Queries in Wireless Sensor Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Entropy-based sensor selection heuristic for target localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Error characteristics of ad hoc positioning systems (aps)
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Sensor node selection for execution of continuous probabilistic queries in wireless sensor networks
Proceedings of the ACM 2nd international workshop on Video surveillance & sensor networks
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Collaborative in-network processing for target tracking
EURASIP Journal on Applied Signal Processing
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Maximum mutual information principle for dynamic sensor query problems
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Range search on multidimensional uncertain data
ACM Transactions on Database Systems (TODS)
Proceedings of the 2008 ACM symposium on Applied computing
Quality-Aware Probing of Uncertain Data with Resource Constraints
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
Distributed and Parallel Databases
A probabilistic filter protocol for continuous queries
QuaCon'09 Proceedings of the 1st international conference on Quality of context
Hi-index | 0.00 |
A common approach to improve the reliability of query results based on error-prone sensors is to introduce redundant sensors. However, using multiple sensors to generate the value for a data item can be expensive, especially in wireless environments where continuous queries are executed. Moreover, some sensors may not be working properly and their readings need to be discarded. In this paper, we propose a statistical approach to decide which sensor nodes to be used to answer a query. In particular, we propose to solve the problem with the aid of continuous probabilistic query (CPQ), which is originally used to manage uncertain data and is associated with a probabilistic guarantee on the query result. Based on the historical data values from the sensor nodes, the query type, and the requirement on the query, we present methods to select an appropriate set of sensors and provide reliable answers for several common aggregate queries. Our statistics-based sensor node selection algorithm is demonstrated in a number of simulation experiments, which shows that a small number of sensor nodes can provide accurate and robust query results.