Workload-Aware Query Routing Trees in Wireless Sensor Networks

Continuous queries in wireless sensor networks are established on the premise of a routing tree that provides each sensor with a path over which answers can be transmitted to the query processor. We found that these structures are sub- optimality constructed in predominant data acquisition systems leading to an enormous waste of energy. In this paper we present MicroPulse1, a workload-aware optimization algorithm for query routing trees in wireless sensor networks. Our algorithm is established on profiling recent data acquisition activity and on identifying the bottlenecks using an in-network execution of the critical path method. A node S utilizes this information in order to locally derive the time instance during which it should wake up, the interval during which it should deliver its workload and the workload increase tolerance of its parent node. We additionally provide an elaborate description of energy-conscious algorithms for disseminating and maintaining the critical path cost in a distributed manner. Our trace-driven experimentation with real sensor traces from Intel Research Berkeley shows that MicroPulse can reduce the data acquisition costs by many orders.

[1]  Vladimir Zadorozhny,et al.  Algebraic optimization of data delivery patterns in mobile sensor networks , 2004, Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004..

[2]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[3]  Andreas Pitsillides,et al.  The MicroPulse Framework for Adaptive Waking Windows in Sensor Networks , 2007, 2007 International Conference on Mobile Data Management.

[4]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[5]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[6]  Alexandros Labrinidis,et al.  Multi-criteria routing in wireless sensor-based pervasive environments , 2005, Int. J. Pervasive Comput. Commun..

[7]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[8]  Mohamed A. Sharaf,et al.  Balancing energy efficiency and quality of aggregate data in sensor networks , 2004, The VLDB Journal.

[9]  Bernard Harris,et al.  Graph theory and its applications , 1970 .

[10]  Vladimir Zadorozhny,et al.  Timely data delivery in sensor networks using whirlpool , 2005, DMSN '05.

[11]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[12]  Erik Buchmann,et al.  Query processing in sensor networks , 2010, Distributed and Parallel Databases.

[13]  Jeffrey Considine,et al.  Approximate aggregation techniques for sensor databases , 2004, Proceedings. 20th International Conference on Data Engineering.

[14]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[15]  Dimitrios Gunopulos,et al.  Microhash: an efficient index structure for fash-based sensor devices , 2005, FAST'05.

[16]  Ye Sun,et al.  Power-efficient data dissemination in wireless sensor networks , 2003, MobiDe '03.

[17]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[18]  John Anderson,et al.  An analysis of a large scale habitat monitoring application , 2004, SenSys '04.

[19]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.