Skip to main content
SpringerLink
Log in

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs) for a group of sensor nodes to send collected information to a single sink node. The data aggregation tree contains the sink node, all the source nodes, and some other non-source nodes. Our goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save energies. We prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy algorithm. We also give a distributed version of the approximation algorithm. Extensive simulations are performed to study the performance of the proposed algorithms. The results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Culler D, Estrin D, Srivastava M. Overview of sensor networks. Computer, 2004, 37(8): 41–49

    Article  Google Scholar 

  2. Chong C-Y, Kumar S P. Sensor networks: evolution, opportunities, and challenges. In: Proceedings of the IEEE, 2003, 91(8): 1247–1256

    Article  Google Scholar 

  3. Goel A, Estrin D. Simultaneous optimiation for concave costs: single sink aggregation or single source buy-at-bulk. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms. 2003, 499–505

  4. Karl H, Lobbers M, Neberg T. A data aggregation framework for wireless sensor networks. Technical report TKN-03-016, Telecommunication Network Group, Technical University Berlin, Sept. 2003

  5. Intanagonwiwat C, Govindan R, Estrin D. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM’00). Boston, MA, 2000, 56–67

  6. Yu Y, Krishnamachari B, Prasanna V K. Energy-latency tradeoffs for data gathering in wireless sensor networks. In: Proceedings of the 23rd Conference of IEEE Communication Society (INFOCOM’04). Hong Kong, 2004, 255–266

  7. Schurgers C, Aberhorne O, Srivastava M B. Modulation scaling for energy-aware communication systems. In: Proceedings of International Symposium on Low Power Electronics and Design (ISLPED’01). Huntington Beach, CA, 2001, 96–99

  8. Prabhakar B, Uysal-Biyikoglu E, Gamal A E. Energy-efficient transmission over a wireless link via lazy packet scheduling. In: Proceedings of the 20th Conference of IEEE Communication Society (INFOCOM’01). 2001, 386–394

  9. Intanagonwiwat C, Estrin D, Govindan R, et al. Impact of network density on data aggregation in wireless sensor networks, In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS’02). Austria, 2002, 457–458

  10. Kalpakis K, Dasgupta K, Namjoshi P. Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. The International Journal of Computer and Telecommunications Networking, 2003, 42(6): 697–716

    MATH  Google Scholar 

  11. Wu Y, Fahmy S, Shroff N. On the construction of a maximum-lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm. In: Proceedings of the 26rd Conference of IEEE Communication Society (INFOCOM’08). 2008, 356–360

  12. Ding M, Cheng X, Xue G. Aggregation tree construction in sensor networks. In: Proceedings of IEEE VTC’03. 2003, 2168–2172

  13. Du H, Hu H, Jia X, Energy efficient routing and scheduling for real time data aggregation in wireless sensor networks. Computer Communications, 2006, 29(17): 3527–3535

    Article  Google Scholar 

  14. Luo H, Liu Y, Das K. Routing correlated data with fusion cost in wireless sensor networks. IEEE Trans. on Mobile Computing, 2006, 5(11): 1620–1632

    Article  Google Scholar 

  15. Li D, Liu Q, Jia X, et al. Energy efficient multicast routing in ad hoc networks. Computer Commuinations, 2007, 30: 3746–3756

    Article  Google Scholar 

  16. Chen X, Hu X, Zhu J. Minimum data aggregation time problem in wireless sensor networks. In: Proceedings of 1st int’l Conferenve on Mobile Ad-hoc and Sensor Networks-MSN05. 2005, 133–142

  17. Huang S, Wan P-J, Vu C T, et al. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings of the 26rd Conference of IEEE Communication Society (INFOCOM’07). 2007, 366–372

  18. Li D, Cao J, Liu M, et al. Construction of optimal data aggregation trees for wireless sensor networks. In: Proceedings of ICCCN06. 2006, 475–480

  19. Garey M, Johnson D. The rectilinear steiner tree is NP-complete. SIAM Journal on Applied Mathematics, 1997, 32(4): 826–834

    Article  MathSciNet  Google Scholar 

  20. Chen D, Du D, Hu X, et al. Approximateins for steiner trees with minimum number of steiner points. Theoretical Computer Science, 2001, 262: 83–99

    Article  MATH  MathSciNet  Google Scholar 

  21. Mandoiu I, Zelikovsky A. A note on the MST heuristic for bounded edge-length steiner trees with minimum number of steiner points. Information Processing Letters, 2000, 75(4):165–167

    Article  MATH  MathSciNet  Google Scholar 

  22. Awerbuch B. Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems. In: Proceedings of 19th ACM Symp. on Theory of Computing, ACM, New York. 1987, 230–240

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Data Engineering and Knowledge Engineering, School of Information, Renmin University of China, Beijing, 100872, China

    Deying Li & Qinghua Zhu

  2. Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    Jiannong Cao

Authors
  1. Deying Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiannong Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qinghua Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deying Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, D., Cao, J. & Zhu, Q. Approximation algorithm for constructing data aggregation trees for wireless sensor networks. Front. Comput. Sci. China 3, 524–534 (2009). https://doi.org/10.1007/s11704-009-0039-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-009-0039-x

Keywords

Search

Navigation