The Multiple Continuous Query Fragmentation for the Efficient Sensor Network Management


The KIPS Transactions:PartD, Vol. 13, No. 7, pp. 867-878, Dec. 2006
10.3745/KIPSTD.2006.13.7.867,   PDF Download:

Abstract

In the past few years, the research of sensor networks is forced dramatically. Specially, while the research for maintaining the power of a sensor is focused, we are also concerned with query processing related with the optimization of multiple continuous queries for decreasing in unnecessary energy consumption of sensor networks. We present the fragmentation algorithm to solve the redundancy problem in multiple continuous queries that increases in the count or the amount of transmitting data in sensor networks. The fragmentation algorithm splits one query into more than two queries using the query index (QR-tree) in order to reduce the redundant query region between a newly created query and the existing queries. The R*-tree should be reorganized to the QR-tree right to the structure suggested. In the result, we preserve 20 percentage of the total energy in the sensor networks.


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]
J. U. Park, M. H. Jo, H. S. Kim, D. H. Lee, J. H. Son, "The Multiple Continuous Query Fragmentation for the Efficient Sensor Network Management," The KIPS Transactions:PartD, vol. 13, no. 7, pp. 867-878, 2006. DOI: 10.3745/KIPSTD.2006.13.7.867.

[ACM Style]
Jung Up Park, Myung Hyun Jo, Hak Soo Kim, Dong Ho Lee, and Jin Hyun Son. 2006. The Multiple Continuous Query Fragmentation for the Efficient Sensor Network Management. The KIPS Transactions:PartD, 13, 7, (2006), 867-878. DOI: 10.3745/KIPSTD.2006.13.7.867.