Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Database Management Systems
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Temporal and spatio-temporal aggregations over data streams using multiple time granularities
Information Systems - Special issue: Best papers from EDBT 2002
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Balancing energy efficiency and quality of aggregate data in sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
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
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
A framework for time indexing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
REED: robust, efficient filtering and event detection in sensor networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
ProcessingWindow Queries in Wireless Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
On In-network Synopsis Join Processing for Sensor Networks
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A Distributed Algorithm for Joins in Sensor Networks
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
On Join Location in Sensor Networks
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
A survey of geocast routing protocols
IEEE Communications Surveys & Tutorials
Position-based routing in ad hoc networks
IEEE Communications Magazine
Optimizing query processing in cache-aware wireless sensor networks
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Power efficiency through tuple ranking in wireless sensor network monitoring
Distributed and Parallel Databases
Histogram and other aggregate queries in wireless sensor networks
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Duty cycle aware spatial query processing in wireless sensor networks
Computer Communications
Spatial query processing in wireless sensor networks - A survey
Information Fusion
Hi-index | 0.00 |
We investigate the problem of processing historical queries on a sensor network. Since data is considered to have been already collected at the sensor nodes, the main issue is exploring the spatial component of the query in order to minimize its cost represented by the energy consumption. We assume queries can be issued at any network node, i.e., there is no central base station and all nodes have only local knowledge of the network. On the one hand, a globally optimum query processing plan is desirable but its construction is not possible due to the lack of global knowledge of the network. On the other hand, while a simple network flooding is feasible, it is not a practical choice from a cost perspective. To address this problem we propose a two-phase query processing strategy, where in the first phase a path from the query originator to the query region is found and in the second phase the query is processed within the query region itself. This strategy is supported by analytical models that are used to dynamically select the best processing strategy depending on the query specifics. Our extensive analytical and experimental results show that our analytical models are accurate and that the two-phase strategy is better suited for small to medium sized queries, being up to 10 times more cost effective than a typical network flooding. In addition, the dynamic selection of a query processing technique proved itself capable of always delivering at least as good performance as the most energy efficient strategy for all query sizes.