Energy-efficient Data Gathering Algorithm in Sensor Networks with Partial Aggregation

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.

Department(s)

Computer Science

Keywords and Phrases

MST; SPT; Data Aggregation; Data Gathering; Energy Efficiency; Minimum Spanning Tree; Partial Aggregation; Shortest Path Tree; Sensor networks

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2008 Inderscience, All rights reserved.

Publication Date

01 Jan 2008

Link to Full Text

Share

 
COinS