By Topic

Energy Efficient Top-k Query Processing in Dynamic Sensor Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qunhua Pan ; Shanghai JiaoTong Univ., Shanghai ; Shuwang Li ; Minglu Li ; Min-You Wu

Sensor networks may generate a large amount of data during the monitoring process. It is crucial to conserve energy when processing these data. The detected sensory data vary in long monitoring period. The problem is how to design query processing with minimal energy and obtain correct result. In this paper, we propose a history-based approach to optimizing top-k query processing in sensor network and design threshold-estimate-prune-query algorithm. Energy consumption can be reduced by pruning unnecessary sub-queries and query message can be guided to right direction by cached data. Subset of the sensor network will respond the query. We design local-expand-query method to get more correct data when the environment changed. Simulation results show that the number of queried nodes can be significantly reduced in top-k query processing. The expand query can get more accuracy data when the environment varies and data distribution changed.

Published in:

Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on

Date of Conference:

22-24 Aug. 2007