History-Sensitive Based Approach to Optimizing Top-k Queries in Sensor Networks

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.

[1]  David E. Culler,et al.  Supporting aggregate queries over ad-hoc wireless sensor networks , 2002, Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Luis Gravano,et al.  Top-k selection queries over relational databases: Mapping strategies and performance evaluation , 2002, TODS.

[3]  Biplab Sikdar,et al.  A dynamic query-tree energy balancing protocol for sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[4]  Kamesh Munagala,et al.  A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[5]  Raghu Ramakrishnan,et al.  Probabilistic Optimization of Top N Queries , 1999, VLDB.

[6]  Samuel Madden,et al.  Fjording the stream: an architecture for queries over streaming sensor data , 2002, Proceedings 18th International Conference on Data Engineering.

[7]  Chung-Min Chen,et al.  A sampling-based estimator for top-k selection query , 2002, Proceedings 18th International Conference on Data Engineering.

[8]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[10]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[11]  Dimitrios Gunopulos,et al.  The threshold join algorithm for top-k queries in distributed sensor networks , 2005, DMSN '05.

[12]  Christopher Olston,et al.  Distributed top-k monitoring , 2003, SIGMOD '03.

[13]  Dong Xuan,et al.  Query aggregation for providing efficient data services in sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[14]  Minglu Li,et al.  A semantic-based architecture for sensor networks , 2005, Ann. des Télécommunications.

[15]  Christopher R. Palmer,et al.  Generating network topologies that obey power laws , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).