Power-Aware Query Processing Using Optimized Distributed R-tree in Sensor Networks


The KIPS Transactions:PartD, Vol. 13, No. 1, pp. 23-28, Feb. 2006
http://dx.doi.org/10.3745/KIPSTD.2006.13D.1.023,   PDF Download:
Keywords: sensor networks, query processing, spatial Index
Abstract

In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. Pandey, S. H. Eo, H. S. Kim, H. Y. Bae, "Power-Aware Query Processing Using Optimized Distributed R-tree in Sensor Networks," The KIPS Transactions:PartD, vol. 13, no. 1, pp. 23-28, 2006. DOI: http://dx.doi.org/10.3745/KIPSTD.2006.13D.1.023.

[ACM Style]
Suraj Pandey, Sang Hun Eo, Ho Seok Kim, and Hae Young Bae. 2006. Power-Aware Query Processing Using Optimized Distributed R-tree in Sensor Networks. The KIPS Transactions:PartD, 13, 1, (2006), 23-28. DOI: http://dx.doi.org/10.3745/KIPSTD.2006.13D.1.023.