Research And Improve Of Routing Algorithm For Wireless Sensor Network

As one of the newest network technologies, wireless sensor networks is integrated of sensor technology, embedded computer and communication technology. One reasonable routing algorithm can improve the performance of wireless sensor networks. LEACH protocol is a classic routing protocol. Compared with the flat routing protocol, it shows a better practical result. But with the increasing of sensor network nodes and the characteristic of the algorithm, the shortcomings of LEACH protocol are exposed more and more.This paper is inadequate for the LEACH protocol to make corresponding improvements.The LEACH protocol random elects cluster head and less energy nodes have the same probability to be elected as the cluster head, which will be greatly affect the network lifetime. Based on the node residual energy as the main reference, improved protocol put a jump up for a limited distance into the surrounding cluster. Thus, it avoids the low energy node being elected as cluster head node. This paper also introduces the concept of the optimal number of cluster heads. According to the corresponding model, the optimal formula for calculating the number of cluster heads is achieved, which playes a good role in the network load of the cluster and distribution of the cluster head. In the data transmission stage, for the data redundancy caused by the member nodes collecting information around the parameters, this paper proposes a algorithm that without loss of data fusion to improve the reliability of the information collection.Compared with the LEACH protocol, simulation results show that the energy-based cluster head election and the method that limit cluster node for load balancing increase the effective electoral rounds, and also improve the network lifetime.