基于灰色关联度的Leach算法的改进

Leach算法是无线传感器网络中应用最为广泛的分簇路由协议之一,但是该算法的簇头是随机产生的,有可能导致节点过早死亡,从而使整个网络崩溃。针对这一问题,提出一种基于优选簇头的改进Leach算法——gc Leach算法。改进算法引入灰色关联度思想对簇头进行分区选举,兼顾考虑了簇头的剩余能量以及位置分布,有效地避免了簇头分布不合理,以及簇头剩余能量过低导致的节点过早死亡的情况。仿真结果表明,改进后的gc Leach算法能够有效地降低网络能耗,延长网络生命周期。

Improved Leach Algorithms Based on Gray Correlation Degree

Leach algorithms is one of the most used widely clustering routing protocol in wireless sensor networks, but the cluster head of Leach algorithm is randomly generated, it may lead nodes to premature deaths and then collapse of the entire network. To solve this problem, this paper propose a improved algorithm based on Leach--gcLeach algorithm based on optimal cluster head. Improved algorithm for the introduction of gray correlation degree to partition the cluster head election, both considered the remaining energy of the cluster heads and the location of the distribution, effectively, avoid the situation of the irrational distribution of cluster head,as well as the low remaining energy of cluster head leads nodes to premature death. Simulation results show that, improved gcLeach algorithm can effectively reduce energy consumption, and prolong the network lifetime.