Abstract
Sensor networks generate a large amount of data during monitoring process. These data must be sparingly exacted to conserve energy. There are two methods to obtain data: “push” and “pull”. When the sensory data satisfied a preset condition, they are “push”ed towards the base station. The “pull” method is to actively query the sensor networks for any interesting sensory data. The problem is how to plan the query and save the energy. When a query has been executed, there are some hints that can be kept to optimize the subsequent query processing. Energy consumption can be reduced by not contacting nodes whose values either can be predicted or are unlikely to be used. In this paper, we propose a history-sensitive based method to optimize top-k query processing in sensor networks. The top-k query looks for and utilizes the historical data in each sensor node. Subsequent top-k queries are guided by these historical data, therefore, to improve the entire query process. Simulation results show that the number of query hops can be reduced and the delays in response are improved.
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
Babcock, B., Olston, C.: Distributed top-k monitoring. In: Proc. of the 2003 ACM SIGMOD Intl. Conf. on Management of Data, San Diego, California, USA (June 2003)
Deshpande, A., Guestrin, C., Madden, S., Hellerstein, J., Hong, W.: Model-driven data acquisition in sensor networks. In: Proc. of VLDB 2004 (2004)
Madden, S., Franklin, M.J.: Fjording the stream: An architechture for queries over streaming sensor data. In: Proc. Of ICDE 2002 (2002)
Madden, S., Franklin, M., Hellerstein, J., Hong, W.: The design of an acquisitional query processor for sensor networks. In: Proc. of ACM SIGMOD 2003 (2003)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of IEEE INFOCOM 2000 (2000)
Yang, H., Ye, F., Sikdar, B.: A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks. In: Proc. of WCNC 2002 (2002)
Madden, S., Szewczyk, R., Franklin, M.J., Culler, D.: Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks. In: Workshop on Mobile Computing and Systems Applications (2002)
Yu, W., Le Nam, T., Xuan, D., Zhao, W.: Query Aggregation for Providing Efficient Data Services in Sensor Networks. In: Proc. of IEEE Mobile Sensor and Ad-hoc and Sensor Systems (MASS) (October 2004)
Pan, Q., Li, M., Wu, M.-Y.: A semantic-based architecture for sensor networks. Annals of telecommunications 60(7-8), 928–943 (2005)
Bruno, N., Chaudhurl, S., Gravano, L.: Top-k Selection Queries over Relational Databases: Mapping Strategies and Performance Evaluation. ACM Transactions on Database Systems 27(2), 153–187 (2002)
Donjerkovic, D., Ramakrishnan, R.: Probabilistic optimization of top N queries. In: Proc. of VLDB 1999 (1999)
Chen, C., Ling, Y.: A sampling-based estimator for top-k selection query. In: Proc. Of ICDE 2002 (2002)
Silberstein, A., Braynard, R., Ellis, C., Munagala, K.: A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks. In: Proc. of ICDE 2006 (2006)
Palmer, C.R., Gregory Steffan, J.: Generating network topologies that obey power law. In: Proc. of the IEEE GLOBECOM, San Francisco, pp. 434–438 (2000)
ZeinalipourYazti, D., Vagena, Z., Gunopulos, D., Kalogeraki, V., Tsotras, V.: The Threshold Join Algorithm for Top-k Queries in Distributed Sensor Networks. In: Proc. of DMSN 2005, Trondheim, Norway, August 29 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, Q., Li, M., Wu, MY. (2006). History-Sensitive Based Approach to Optimizing Top-k Queries in Sensor Networks. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_57
Download citation
DOI: https://doi.org/10.1007/11943952_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)