Authors: Maggie X. Cheng, Li Yin
Addresses: Department of Computer Science, Missouri University of Science and Technology, Rolla, MO 65409, USA. ' Department of Computer Science, Missouri University of Science and Technology, Rolla, MO 65409, USA
Abstract: 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.
Keywords: sensor networks; minimum spanning tree; MST; shortest path tree; SPT; data aggregation; energy efficiency; data gathering; partial aggregation.
International Journal of Sensor Networks, 2008 Vol.4 No.1/2, pp.48 - 54
Available online: 04 Jul 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article