By Topic

An Energy Efficient Query Processing Algorithm Based on Relevant Node Selection for Wireless 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

2 Author(s)
Guilin Li ; Harbin Institute of Technology, China ; Jianzhong Li

In this paper a novel energy efficient algorithm based on relevant node selection is proposed to deal with a new kind of approximate query, named node number constraint query, for wireless sensor networks. The query processing algorithm is composed of three parts: relevant node selection algorithm, energy efficient query dissemination and result collection algorithm. According to the user's precision request, our algorithm selects a part of nodes to answer the user's query then sends query and collects result in an energy efficient way. Simulation results show that the query processing algorithm based on relevant node selection can not only guarantee the precision of the result but also save much more energy than other algorithms.

Published in:

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on  (Volume:3 )

Date of Conference:

July 30 2007-Aug. 1 2007