Energy-efficient data gathering algorithm in sensor networks with partial aggregation

Maggie X. Cheng, Li Yin

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


In sensor networks, data aggregation at intermediate nodes can significantly reduce redundant data and reduce communication load. However, there are scenarios where data aggregation is restricted. In this paper, we study the problem of building an energy-efficient tree structure that can be used for both aggregate data and non-aggregate data. Such a tree provides a transition between the optimal solutions for both aggregate data and for non-aggregate data. A single parameter can be used to control the transition. We proposed a new algorithm Balanced Aggregation Tree (BAT) for tree construction and also suggested how to determine the value of the control parameter for the highest energy efficiency of a given network.

Original languageEnglish (US)
Pages (from-to)48-54
Number of pages7
JournalInternational Journal of Sensor Networks
Issue number1-2
StatePublished - 2008
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


  • Data aggregation
  • MST
  • Minimum Spanning Tree
  • SPT
  • Sensor networks
  • Shortest Path Tree


Dive into the research topics of 'Energy-efficient data gathering algorithm in sensor networks with partial aggregation'. Together they form a unique fingerprint.

Cite this