Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks

  • Yuzhen Liu
  • Weifa Liang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5031)


In this paper we consider the problem of finding multiple routing trees in sensor networks for the evaluation of a class of aggregate queries including AVG, MIN, MAX, and COUNT with an objective to maximizing the network lifetime. Due to the NP hardness of the problem, we instead devise a heuristic algorithm for it. Unlike the previous work that focused on finding a single routing tree for query evaluation, we introduce the concept of multiple routing trees, and use these trees to evaluate aggregate queries, provided that different routing trees are used at different stages of the network lifetime. To evaluate the performance of the proposed algorithm, we conduct extensive experiments by simulation. The experimental results show that the proposed algorithm outperforms existing algorithms based on a single routing tree. We also prove that the approximation ratio of a known approximation algorithm for the identical energy case is a constant, and provide tighter lower and upper bounds on the optimal network lifetime for the non-identical energy case.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Govindan, R., Hellerstein, J.M., Hong, W., Madden, S., Franklin, M., Shenker, S.: The sensor network as a database. Technical Report 02-771, Computer Science Department, University of Southern California (September 2002)Google Scholar
  2. 2.
    Madden, S., Szewczyk, R., Franklin, M.J., Culler, D.: Supporting aggregate queries over ad hoc wireless sensor networks. In: Proc. 4th IEEE Workshop on Mobile Computing and System Applications, pp. 49–58. IEEE, Los Alamitos (2002)CrossRefGoogle Scholar
  3. 3.
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad hoc sensor networks. ACM SIGOPS Operating Systems Review 36(SI), 131–146 (2002)CrossRefGoogle Scholar
  4. 4.
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: The design of an acquisitional query processor for sensor networks. In: Proc. SIGMOD 2003, pp. 491–502. ACM Press, New York (2003)CrossRefGoogle Scholar
  5. 5.
    Yao, Y., Gehrke, J.: The cougar approach to in-network query processing in sensor networks. ACM SIGMOD Record 31(3), 9–18 (2002)CrossRefGoogle Scholar
  6. 6.
    Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proc. the Hawaii International Conference on System Sciences, pp. 3005–3014. IEEE, Los Alamitos (2000)Google Scholar
  7. 7.
    Lindsey, S., Raghavendra, C.S.: PEGASIS: Power-efficient gathering in sensor information systems. In: Proc. Aerospace Conference, pp. 1125–1130. IEEE, Los Alamitos (2002)Google Scholar
  8. 8.
    Tan, H.Ö., Körpeoǧlu, İ.: Power efficient data gathering and aggregation in wireless sensor networks. ACM SIGMOD Record 32(4), 66–71 (2003)CrossRefGoogle Scholar
  9. 9.
    Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Computer Networks 42, 697–716 (2003)CrossRefzbMATHGoogle Scholar
  10. 10.
    Buragohain, C., Agrawal, D., Suri, S.: Power aware routing for sensor databases. In: Proc. INFOCOM 2005, pp. 1747–1757 (2005)Google Scholar
  11. 11.
    Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad hoc networks. In: Proc. INFOCOM 2000, pp. 22–31. IEEE, Los Alamitos (2000)Google Scholar
  12. 12.
    Fürer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one optimal. J. Algorithms 17, 409–423 (1994)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yuzhen Liu
    • 1
  • Weifa Liang
    • 1
  1. 1.Department of Computer ScienceThe Australian National UniversityCanberraAustralia

Personalised recommendations