Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Modulation scaling for Energy Aware Communication Systems
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient top-K query calculation in distributed networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The threshold join algorithm for top-k queries in distributed sensor networks
DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Monitoring Top-k Query inWireless Sensor Networks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Energy and quality aware query processing in wireless sensor database systems
Information Sciences: an International Journal
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Sensor Resource Management driven by threat projection and priorities
Information Sciences: an International Journal
Aggregation in sensor networks with a user-provided quality of service goal
Information Sciences: an International Journal
IEEE Communications Magazine
Supporting multi-dimensional queries in mobile P2P network
Information Sciences: an International Journal
Top-k query evaluation in sensor networks with the guaranteed accuracy of query results
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
TJJE: An efficient algorithm for top-k join on massive data
Information Sciences: an International Journal
Minimum connected cover of a query region in heterogeneous wireless sensor networks
Information Sciences: an International Journal
Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network
Information Sciences: an International Journal
| Hi-index | 0.07 |
Top-k query in a wireless sensor network is to find the k sensor nodes with the highest sensing values. To evaluate the top-k query in such an energy-constrained network poses great challenges, due to the unique characteristics imposed on its sensors. Existing solutions for top-k query in the literature mainly focused on energy efficiency but little attention has been paid to the query response time and its effect on the network lifetime. In this paper we address the query response time and its effect on the network lifetime through the study of the top-k query problem in sensor networks with the response time constraint. We aim at finding an energy-efficient routing tree and evaluating top-k queries on the tree such that the network lifetime is significantly prolonged, provided that the query response time constraint is met too. To do so, we first present a cost model of energy consumption for answering top-k queries and introduce the query response time definition. We then propose a novel joint query optimization framework, which consists of finding a routing tree in the network and devising a filter-based evaluation algorithm for top-k query evaluation on the tree. We finally conduct extensive experiments by simulation to evaluate the performance of the proposed algorithms, in terms of the total energy consumption, the maximum energy consumption among nodes, the query response time, and the network lifetime. The experimental results showed that there is a non-trivial tradeoff between the query response time and the network lifetime, and the joint query optimization framework can prolong the network lifetime significantly under a specified query response time constraint.