On the Construction of Data Aggregation Tree with Maximized Lifetime in Wireless Sensor Networks
Hui Wang, Hongbin Chen · 2019
Sensor play an important role in the growth of big data. It is a basic operation for nodes to periodically transmit reports to a sink in many applications in a Wireless Sensor Network (WSN). Because of the limited energy of the nodes, it is important to process data efficiently. Under such applications, a tree is generally adopted the path structure for maintaining the routing tables of sensors. In this paper, considering the difference in the amount of data collected and the speed of data acquisition, we assign different acquisition frequency to the nodes. In addition, we propose a new Minimum Spanning Tree (MST) algorithm which is devoted to construct a data aggregation tree with the lowest energy consumption so that the network lifetime is maximized. Simulation results illustrate that the proposed algorithm outperforms traditional MST in terms of energy consumption.