Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Monitoring Top-k Query inWireless Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Probabilistic top-k and ranking-aggregate queries
ACM Transactions on Database Systems (TODS)
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
POT: an efficient top-k monitoring method for spatially correlated sensor readings
Proceedings of the 5th workshop on Data management for sensor networks
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Processing Top-k Monitoring Queries in Wireless Sensor Networks
SENSORCOMM '09 Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications
A Cross Pruning Framework for Top-k Data Collection in Wireless Sensor Networks
MDM '10 Proceedings of the 2010 Eleventh International Conference on Mobile Data Management
Energy-efficient top-k query processing in wireless sensor networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Distributed adaptive top-k monitoring in wireless sensor networks
Journal of Systems and Software
PAQ: time series forecasting for approximate query answering in sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Hi-index | 0.00 |
Processing top-k queries in energy-efficient manner is an important topic in wireless sensor networks. It can keep sensor nodes from transmitting redundant data to base station by filtering methods utilizing thresholds on sensor nodes, which decreases the communication cost between the base station and sensor nodes. Quantiles installed on sensor nodes as thresholds can filter many unlikely top-k results from transmission for saving energy. However, existing quantile filter methods consume much energy when getting the thresholds. In this paper, we develop a new top-k query algorithm named QFBP which is to get thresholds by prediction. That is, QFBP algorithm predicts the next threshold on a sensor node based on historical information by A utoregR essive I ntegrated M oving A verage models. By predicting using ARIMA time series models, QFBF can decrease the communication cost of maintaining thresholds. Experimental results show that our QFBP algorithm is more energy-efficient than existing quantile filter algorithms.