一种LEACH协议的改进算法LEACH_EH

An improved algorithm of LEACH protocol LEACH-EH

根据LEACH协议的特点和局限性对其进行了改进,提出了一种LEACH_EH(LEACH EAHANCE)算法。它使用K_MEANS算法对簇进行一次性分簇,之后结合节点到簇内质心距离与节点自身剩余能量选举出簇头。它将簇形成的顺序由先簇头后成簇变为先成簇后簇头,形成一次分簇多次选举簇头的模式。通过MATLAB进行仿真,实验结果表明,改进后的算法比原来的协议在节点能量均衡方面有了较大的提升,延长了网络生存周期。

This paper propose a LEACH_EH algorithm based on the characteristics and limitations of the LEACH protocol.lt uses the K_MEANS algorithm to cluster only once, and then elects the cluster heads by considersing the distance from node to cluster center and the node＇s residual energy. It makes the order from electing cluster first and clustering second to clustering first and electing cluster second. It forms the formation of clustering only once and electing cluster multi-times. The MATLAB simulation shows that comparing with LEACH, the LEACH_ED algorithm has a great improvement in the energy balance of the node,and prolong the network life cycle abviously.