loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)
An Energy Efficient Query Processing Algorithm Based on Relevant Node Selection for Wireless Sensor Networks
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
Guilin Li, Harbin Institute of Technology, China
Jianzhong Li, Harbin Institute of Technology, China
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.
Citation:
Guilin Li, Jianzhong Li, "An Energy Efficient Query Processing Algorithm Based on Relevant Node Selection for Wireless Sensor Networks," snpd, vol. 3, pp.149-154, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.