Research And Improvement Of Clustering Routing Algorithm Of Wireless Sensor Networks

Wireless Sensor Networks(WSN) is a kind of networks with multiple hops, self-organizing and wireless communication mode, which composed a large number of cheap micro sensor nodes that are randomly deployed in the monitored area and capable of information collection, data processing and transmission.In this paper, the basic theoretical research in wireless sensor network technology launched in clustering routing algorithm. The wireless sensor network nodes have the features of limited hardware and software and energy resources, therefore, to maintain network performance while minimizing energy consumption of nodes and extend the network life cycle is necessary.Design rational network routing topology structure and data transmission mode has very important significance for improving network performance and the network life cycle. In this paper, rationality of wireless sensor network routing topology and effectiveness of data transmission are the perspectives. Improved algorithm I-LEACH and I-HEED are proposed with analyzes and studies of two typical clustering routing algorithm LEACH and HEED. Specific research and contributions are as follows:First, a brief description and summary of the wireless sensor network technology concepts, development, research, etc.,introduces of the wireless sensor network protocol stack, network node structure and features, as well as the application fields of wireless sensor networks, studies of the technical standard and performance evaluation criteria for wireless sensor network routing protocols, and analysis and comparsion of typical wireless sensor network routing algorithm.Second,focus on research and analysis of the clustering routing algorithm. Two different types of clustering routing algorithm LEACH and HEED is selected as research object. The implementation of these two kinds of wireless sensor networks routing algorithm is described in detail, and limitation is analyzed. Based on the full use of the advantage of LEACH algorithm, this paper presents an improved routing algorithm I-LEACH, I-LEACH routing algorithm is proposed in the following aspects:(1) the threshold formula;(2) the optimal cluster head number;(3) the cluster head distribution. The I-HEED routing algorithm is proposed to improve the lack of HEED. Improvements are as follow:(1) design an uneven clustering mechanism;(2) isolated nodes to design a treatment method for HEED routing algorithm generated.Finally, the improved algorithm proposed in this paper be tested in simulation, the network lifetime, cluster head node distribution and energy balance of the networks were compared to verify the advances of the improved routing algorithm. The comparison and analysis of the simulation results shows that the improved wireless sensor network routing algorithm has better network performance and longer network lifetime.