Research On Routing Algorithm For Wireless Sensor Networks Based On Clustering

Wireless sensor network is a kind of new wireless network which has no base equipment. Because of its broad application prospects, wireless sensor network causes attentions from both academic and industry field and becomes a hot research topic. Routing protocol, the core technology of wireless sensor network, is one of the most important application researches.The main content of this paper is the research of routing protocol of wireless sensor network. The emphasis is put on the first completely distributed hierarchy routing protocol——LEACH. According to the flaw of LEACH, the paper presents some solutions to improve the protocol.On the basis of in-depth study of LEACH protocol, aiming at the problem caused by the random selection of cluster headers, a regional partitioned clustering routing algorithm (RPCRA) is proposed in this paper. Through compartmentalizing the whole network to several regions and one node in each region being chosen as the cluster header, a more evenly distribution of the clusters can be obtained in the network. Considering the characteristic of limited communication range of sensor nodes, a multihop routing algorithm (RPCMR) based on RPCRA is proposed in this paper. Through constructing tree structures and sequential neighbor lists to select routing nodes, nodes communicate with each other in manner of multihop. In view of the fact that the cluster headers have direct effect on the performance of the network, Genetic Algorithm (GA) is introduced into LEACH protocol. By using GA to select cluster headers, LEACH can be improved.Using OPNET, the RPCRA and RPCMR are simulated, and the improved algorithm based on GA is simulated by using Matlab. Simulation results show that the overall improved algorithms can provide higher performance in energy conservation and network lifetime extension in a certain degree. Based on LEACH, the paper proposes some methods on how to improve the performance of wireless sensor network. The work of the paper has directive significance for the study of routing protocol.