Angle-Based Tree Structure Algorithm Of Data-Aggregation For Wireless Sensor Networks

Wireless Sensor Network is a new and self-organized wireless network without complex infrastructure. With the development of microelectronics, sensor and telecommunication technology, wireless sensor networks develop rapidly, some successful application has been made in the military and civilian aspects. Because of its broad applications, wireless sensor networks have a bright future of development. Compared with traditional networks, sensor networks have the following features: A sensor network typically consists of a large number of nodes with a dense distribution. Each node is impossible to maintain global information. The nodes have very limited energy, storage space and computing ability. Wireless sensor networks usually work in high-risk regions and unable to get close, sensor nodes are likely to be battery powered, and it is often very difficult to change or recharge batteries for these nodes. Of these, energy efficiency for extending network lifetime is one of the most important topics. So it is important to search new routing protocols for wireless sensor networks to extend the lifetime of wireless sensor networks.An angle-based tree structure algorithm (ATDA) is proposed for data aggregation in wireless sensor networks. The ATDA algorithm is distributed and each node only needs to know the information of it's neighbors. In this algorithm, the network is first divided into levels according to the minimal hops to sink; then the whole network is constructed into a tree structure with sink being the root of the tree. The father of each node is selected according to the deflexion angle, the smaller the angle, the bigger the odds of being chosen as a father, which made the distance and consumption of transmitting least.The optimize scheme of ATDA mainly took load-balance into account. The optimize scheme analyzed the density of nodes disposal and considered residual power of nodes, which can avoid using nodes with low energy. In this algorithm, tree structure formed by ATDA is dynamic changed according to residual power of nodes which realized load balance of nodes. Finally, the performance of the two algorithms ATDA and the optimize scheme is showed by simulation and contrasted to with GIT. The results of simulation show that energy consumption of the whole network is decreased and the number of live nodes is increased. Particularly in the large and medium-sized sensor networks, the algorithm has obvious advantages in saving energy and load balance.