Research On Fixed Cluster Routing Protocol Of WSN Based On LEACH

Wireless sensor networks(WSNs) can monitor, sense, collect and process information of various environments in real-time, then transmit information to the sink node through wireless communication. Its broad application prospect makes great attraction of academic, military and industry communities. The traditional wireless routing protocols are not suitable for the WSNs, for it have the features of large quantities of sensor nodes, limited energy, computing ability and transmission bandwidth. Therefore, it's very important to design a routing protocol which can save energy and prolong survival time of the WSNs effectively.The typical routing protocol LEACH has deficiency in the cluster-heads election and cluster-heads routing way. To solve these problems, an improved algorithm based on LEACH protocol is proposed in this thesis. First of all, given the geographical information of all nodes, the network is divided into several fixed clusters by the sink node. RENND algorithm is used in the cluster-heads election phase, the residual energy of all nodes and the distances between nodes in clusters are taken into account, then a more rational cluster-head is elected by using an improved cluster-heads competition function. CRCL algorithm is used during the data transmission phase. By using of the greedy method, an optimal cluster-heads routing chain is formed among all cluster-heads, then data are transmitted to the sink node along the chain. At last, the simulation results show that the improved synthetical algorithm can achieve better performance on both prolonging survival time and reducing energy consumption of the WSNs. For example, the improved synthetical algorithm can enhance 1.56 times in LND compared with LEACH.