ERA

Download the full-sized PDF of Optimizing Query Processing in Cache-Aware Wireless Sensor NetworksDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3HD7NW57

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

Optimizing Query Processing in Cache-Aware Wireless Sensor Networks Open Access

Descriptions

Author or creator
Nascimento, Mario
Alencar, Romulo
Brayner, Angelo
Additional contributors
Subject/Keyword
Database
Cache
Wireless sensor networks
Query optimization
Database Systems
Type of item
Computing Science Technical Report
Computing science technical report ID
TR09-05
Language
English
Place
Time
Description
Technical report TR09-05. It is a well known fact that minimizing energy consumption in Wireless Sensor Networks (WSNs) is crucial for its usability; and minimizing the flow of data is one way to achieve that. Most WSN models assume the existence of a base station where query results could in principle be cached, however, the opportunity for re-using such cached data for minimizing data traffic in the WSN has not been well explored thus far. Aiming at filling this gap, we investigate the cache-aware query processing problem in WSNs. We propose an approach that first clips an original rectangular query area into a polygon by selecting a suitably good subset of the cached queries for reuse. Next, this polygon is partitioned into rectangular sub-queries that are then submitted to the WSN. Finding the cost-wise best combination of polygon clipping and rectangular partitioning amounts to a highly combinatorial problem that justifies the use of efficient and effective heuristics. This paper presents algorithms that are used within a cost-driven optimization search to find a good \"query-plan\". Algorithms for maintaining the cache consistency are also presented. Our proposal does not dependent on any particular algorithm for processing queries in a WSN; as long as there is a well-defined a cost-model for the same, any proposal can be used. Experimental results show that our heuristic algorithms are orders of magnitude faster than an exhaustive search, and yield no more than 10% loss compared to the optimal query cost, and are never worse than the two obvious alternatives, i.e., not using the cache at all or using all of it.
Date created
2009
DOI
doi:10.7939/R3HD7NW57
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-29T16:47:59.458+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 433423
Last modified: 2015:10:12 17:30:59-06:00
Filename: TR09-05.pdf
Original checksum: e108814e516b6121a7cb4b1dd43ba795
Well formed: false
Valid: false
Status message: Lexical error offset=427107
Page count: 12
Activity of users you follow
User Activity Date