Abstract
Many applications using sensing data require the fast retrieval of aggregated information in sensor networks. In this paper, distributed spatial index structure in sensor networks for time-efficient aggregation query processing is proposed. The main idea is to logically organize sensors in underlying networks into distributed R-Tree structure, named Sensor Tree. Each node of the Sensor Tree has pre-aggregated results which are the collection of the values of aggregated result for sensing data of the same type of sensors within Minimum Bounding Rectangle (MBR). If a spatial region query is required, the processing of the query searches the location of the target sensor from the root of the Sensor Tree. And then it finally sends the values of pre-aggregated result of that sensor. By the proposed Sensor Tree aggregation query processing on any region, response time and energy consumption can be reduced since it avoids flooding query to the leaf sensor or non-relevant sensors in the sensor networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Considine, J., Li, F., Kollios, G., Byers, J.: Approximate Aggregation Techniques for ensor Databases. In: Proceedings of ICDE 2004 (2004)
Cupta, H., Das, S.R., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: Proceedings of MobiHoc 2003 (2003)
Demirbas, N., Ferhatosmanoglu, H.: Peer-to-Peer Spatial Queries in Sensor Networks. In: Proceedings of P2P 2003 (2003)
Gao, J., Guibas, L.J., Hershberger, J., Zhang, L.: Fractionally Cascaded Information in a Sensor Network. In: Proceedings of IPSN 2004 (2004)
Guttaman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proceedings of SIGMOD 1984 (1984)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: Proceedings of MobiCom 2000 (2000)
Lazaridis, I., Mehrotra, S.: Progressive Approximate Aggregate Queries with a Multi- Resolution Tree Structure. In: Proceedings of SIGMOD 2001 (2001)
Li, X., Kim, Y.J., Govindan, R., Hong, W.: Multi-dimensional Range Queries in Sensor Networks. In: Proceedings of SenSys 2003 (2003)
Madden, S., Franklin, M.J.: Fjording the Stream: An Architecture for Queries over Streaming Sensor Data. In: Proceedings of ICDE 2002 (2002)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks. In: Proceedings of OSDI 2002 (2002)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: The Design of an Acquisitional Query Processor For Sensor Networks. In: Proceedings of SIDMOD 2003 (2003)
Madden, S., Szewzyk, R., Franklin, M.J., Culler, D.: Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks. In: Proceedings of WMCSA 2002 (2002)
Yao, Y., Gehrke, J.: Ouery Processing for Sensor Networks. In: Proceedings of CIDR 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SY., Bae, HY. (2005). Using Pre-aggregation for Efficient Spatial Query Processing in Sensor Environments. In: Gallagher, M., Hogan, J.P., Maire, F. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2005. IDEAL 2005. Lecture Notes in Computer Science, vol 3578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508069_4
Download citation
DOI: https://doi.org/10.1007/11508069_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26972-4
Online ISBN: 978-3-540-31693-0
eBook Packages: Computer ScienceComputer Science (R0)