An Energy Efficient Query Processing Algorithm Based on Relevant Node Selection for Wireless Sensor Networks

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.

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

[2]  Wei Hong,et al.  Exploiting correlated attributes in acquisitional query processing , 2005, 21st International Conference on Data Engineering (ICDE'05).

[3]  Philippe Bonnet,et al.  Device Database Systems , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[4]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[5]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[6]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[7]  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.

[8]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[9]  Daniel J. Abadi,et al.  REED: Robust, Efficient Filtering and Event Detection in Sensor Networks , 2005, VLDB.