Research On Hierarchical Data Aggregation Routing Algorithm In WSN

With the rapid progress made in the improvement of sensor, embedded computing, wireless communication and network technologies in recent years, it begin to appear nodes capable of sensing, data processing and radio communication all over the world. People pay tremendous attention to wireless sensor networks composed of such nodes. Wireless sensor networks have a lot of unique features such as random deployment, self-organization, environment adaptation and so on. These features make it have a wide application future and high application value in military, environmental, medical, family and other commercial area.Recent routing protocol has become the hot research of WSN. The study of routing protocol focuses on how to reduce the overall energy dissipated in the network and to maximize the lifetime of network. The reason is that sensor nodes have limited energy supply, computing and communication power and are deployed in inaccessible terrains or disaster relief operation. So comparing to other aspects energy conservation is a problem solved urgently. This paper adopted hierarchical and aggregation technique to save energy based on LEACH. First this paper proposed a new algorithm called CFTC due to the fusion cost hasn't been considered in most of clustering algorithms for wireless sensor networks. The CFTC algorithm takes into account fusion and transmission cost synthetically. Both of the costs are used to determine cluster head. It makes sure that the cluster head selected can perform data fusion effectively and save energy. Meanwhile, the algorithm also considers the residual energy and sets threshold value for every candidate. So energy load among the nodes in network can be balanced. Simulation results show that the CFTC algorithm not only prolongs network lifetime but also decreases total energy consumption comparing with LEACH. Then this paper considered that Transmission cost and fusion cost can significantly affect optimal routing decisions and proposed a routing algorithm called Routing Correlated Data Based on Fusion and Transmission Cost (RCFTC). The algorithm chooses cluster head based on LEACH. Cluster heads adopt different routing for their members according to the both cost. It can make sure that total energy consumption is less during the process of transmission after the correlated data is aggregated effectively. Simulation results show that the algorithm is better than LEACH and increases network lifetime.CFTC and RCFTC adopted a-hop routing scheme which can consume more energy than multiple-hop especially when perform data fusion. So at last this paper discussed the construction of a simple aggregate tree and applied this tree to LEACH. This method can improve the lifetime of network greatly.