By Topic

Data Caching Based Queries in Multi-sink Sensor Networks

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
$33 $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

3 Author(s)
Jinbao Li ; Sch. of Comput. Sci. & Technol., Heilongjiang Univ., Harbin, China ; Shouling Ji ; Jinghua Zhu

Considering limited storage space, limited energy and other constraints of sensors, a query mechanism based on data caching in Multi-Sink sensor networks is proposed. This mechanism extractes the common subtree of a network firstly, and then caches a sink's query results at the common root of a common subtree according to certain cashing strategies. When some other sinks submit the same query, it only needs to send the cached query results to the query sink. This data sharing mechanism based on common subtree caching can reduce communication cost obviously and improve query efficiency. In order to achieve a higher level of data sharing, we propose a Loop Removing Algorithm (LR) which can enlarge the size of a common subtree effectively. Simulation results indicate that the LR and the data caching based query processing method proposed in this paper can reduce the average energy consumption and response time of queries significantly.

Published in:

Mobile Ad-hoc and Sensor Networks, 2009. MSN '09. 5th International Conference on

Date of Conference:

14-16 Dec. 2009