Wireless integrated network sensors
Communications of the ACM
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A framework for spatio-temporal query processing over wireless sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Snapshot Queries: Towards Data-Centric Sensor Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Approximate Data Collection in Sensor Networks using Probabilistic Models
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
ProcessingWindow Queries in Wireless Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Associated load shedding strategies for computing multi-joins in sensor networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Hi-index | 0.00 |
Wireless sensor networks are demonstrating the valuable potential in a variety of settings, e.g. data analysis and statistics. How to minimize energy consumption and prolong network lifetime become one of the key challenges. In this paper, we propose a continuous approximate window query technique called CWQ to approximately collect data in a specified region in a wireless sensor network. CWQ clusters sensors in the network into several clusters, in which sensors have similar readings. We study how to discover a minimal path to concatenate clusters under non-failure as well as failure cases. Our experiments show that CWQ can provide significant communication (and hence energy) savings.