Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks

Wireless sensor networks (WSN) consist of some nodes that have limited processing power, memory and energy source. These constraints cause the algorithms that presented in this field focus on these constraints. Data aggregation is any process in which information is gathered and expressed in a summary form. Data aggregation has been put forward as an essential paradigm for wireless routing in sensor networks. The idea is to combine the data coming from different sources, eliminating redundancy, minimizing the number of transmissions and thus saving energy. For this purpose, sensor nodes must form aggregation tree, then forward sensed data to the root of this tree. Data is aggregated in intermediate nodes and the results are sent toward the root. In this paper we propose an energy aware algorithm for construction the aggregation tree. The proposed algorithm considers both the energy and distance parameters to construct the tree. Simulation results show that the proposed algorithm has better performance in terms of energy efficiency and number of failed nodes which increases the network lifetime.