Power aware routing for sensor databases

Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [S. Madden et al., 2002] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), and high communication costs, design of energy efficient communication algorithms is of great importance. The data flow in a sensor database is very different from data flow in an ordinary network and poses novel challenges in designing efficient routing algorithms. In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. We give a constant factor approximation algorithm for one class of query, and for other queries give heuristic algorithms. We evaluate the efficiency of the proposed algorithms by simulation and demonstrate their near optimal performance for various network sizes.

[1]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

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

[3]  Bhaskar Krishnamachari,et al.  Maximizing Data Extraction in Energy-Limited Sensor Networks , 2004, IEEE INFOCOM 2004.

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

[5]  Balaji Raghavachari,et al.  Algorithms for finding low degree structures , 1996 .

[6]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[7]  Azzedine Boukerche,et al.  Energy-aware data-centric routing in microsensor networks , 2003, MSWIM '03.

[8]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

[9]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Samuel Madden,et al.  TAG: a Tiny Aggregation Tree for ad-hoc sensor networks , 2002, OSDI 2002.

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

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Andrej Bogdanov,et al.  Power-aware base station positioning for sensor networks , 2004, IEEE INFOCOM 2004.

[14]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, Ad Hoc Networks.

[15]  Martin Fürer,et al.  Approximating the minimum degree spanning tree to within one from the optimal degree , 1992, SODA '92.

[16]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.