Research Of LEACH Algorithm Based On Coverage And Data Transmission Chain

The advance of the sensor technology micro-electromechanical systems modernnetwork and wireless communication promotes the emergence and development ofwireless sensor network. The characteristics of WSN determine its own particularity.The energy of node is limited and it can’t be replenished, It is necessary to find asolution to prolong the lifetime of WSN, and the problem of energy consumptionbecomes a hot research hotspot in WSN.Efficient routing protocol is essential for WSN. LEACH is the typicalrepresentative. It was the first one to propose the idea of clustering. The topology isdivided into several clusters, and the cluster head is responsible for gathering the datafrom the sensor nodes in its cluster, and send its data to the base station by the clusterhead, obviously it reduces the distance of data transmission. Besides, it brings themechanism of cluster head rotation. The network re-clusters after a while. Thereforethe energy consumption equally share to each sensor node and prolong the life time ofthe network. However, since the cluster head selection has great randomness, thecluster head sets in each round is different, the number of cluster head is unreasonable,and always with the uneven distribution of cluster heads. These all cause the entireenergy consumption can’t be balanced to each node and reduces the lifetime of thenetwork. The improved algorithm named EDTA_HWSN is proposed, it is based onthe drawbacks of LEACH.First it calculates the optimal number of cluster headsbased on the topology environment. Then it adds high-energy node into the topology,and selects the optimal cluster head set based on the coverage of the cluster head set.Finally, it forms the data transmission chain based on the distance from cluster headto BS. In data transfer phase, the integrating data of cluster head is transmitted to itsthe hop cluster hop, not to the base station.MATLAB is used to perform the simulation experiment. Results show that theEDTA_HWSN extends the lifetime of network significantly. The time of first nodedies,20%nodes die,50%nodes die, all nodes die extends about42%,49%,48%,41%comparing with LEACH, and extends about12%,34%,36%,43%comparing withLEACH-C, and extends about29%,27%,24%,18%comparing with HEED. It hasbetter clustering effects, and has a better scalability. In one word, EDTA_HWSNalgorithm dramatically increases network performance.