The Optimization Study Of LEACH Routing Algorithm For Wireless Sensor Network

Wireless sensor network (WSN) is an integrated disciplines of an informationacquisition and processing，which consists of large energy, communications, processingcapacity, computing power limited wireless sensor nodes self-organized and is widelyused in environmental detection, disaster relief, military, medical and industrialapplications. Limited by theirs own hardware condition, nodes often come to be invaliddue to the energy depletion, which would lead to the network paralysis. Becoming themost important resources，Energy is directly related to the survival time of network，andthe sensor node’s energy is mainly consumed in wireless communication. Therefore,routing protocol has become a hotspot in wireless sensor network. Key research is howto improve energy utilization of the network, and prolong the network life cycle.Based on clustering routing protocol LEACH (low energy adaptive clusteringhierarchy) protocol and on the basis of an in-depth study on LEACH in the process ofselecting Cluster heads, the number of Cluster heads, unreasonable distribution, andwithout considering Node and residual energy of Node Density, this paper proposes aPoints at the Cluster algorithm based on Node Density(PCND). First of all, this paperintroduce time delayTw ait, and take the residual energy of nodes, continuous nonelectedcluster head round number and the number of neighbor nodes in consideration.. Itimproves the density of large area high residual nodes and the possibility of nodeelection of cluster heads. By the optimal rate of cluster heads through the network, wecould choose reasonable number of cluster heads. Secondly, with the concept ofcompetition radius introduced, the competition radius less residual energy of node’scandidacy is canceled, which could avoid adjacent nodes being a cluster head, so thatthe cluster nodes are reasonably distributed in the monitoring area.According to the LEACH protocol, the cluster heads communicate with the Sinknode by single hop，which is because the defect of energy consumption rate of clusternodes is too fast. Ant colony algorithm is proposed based on the inter cluster multi hoprouting algorithm. In data transmission phase，with the introduction of ant colonyalgorithm combined with LEACH, we take an overall consideration on node residualenergy and distance, data transmission delay and other factors so that to reasonablyselect the next hop cluster heads through the update of pheromones. Eventually wecould find a cluster heads by the source to the Sink node of the optimal multiple hops routing between clusters.Compared with LEACH algorithm, this paper carries on the simulation of theimproved algorithm proposed by MATLAB. Through the network of cluster distribution,50%death node distribution, energy consumption, network life cycle, and Sink node toreceive data performance indexes such as contrast, the simulation experiments show thatthe improved algorithm of cluster number and distribution is more homogeneous thanLEACH, with energy consumption more balanced, data quantity nearly7timesincreased and the first node dies82%delayed so that to greatly prolong the networklifetime.