基于LEACH协议的簇头选举改进算法

Improved Cluster-head Election Algorithm Based on LEACH Protocol

针对典型LEACH分簇路由协议中簇头选举随机性的问题,提出一种LEACH的改进簇头选举方法,该方法先依据能耗模型确定最低能耗的簇头个数,随后优化簇头选举机制,在簇头选举时设置一个动态的能量阀值,同时增加剩余能量和节点密度因素;在簇间通信阶段,簇头节点将按照最低能耗以多跳的方式将信息传递给中心节点。仿真结果显示,新算法既能减少网络的总能耗,延长网络寿命,又能使节点的能耗更加的均衡。

According to the randomness of the typical LEACH routing protocol in cluster head selection, this paper proposes an improved protocol of cluster head selection. In this protocol, It optimizes the number of cluster head nodes according to the energy consumption model, then optimizes the cluster head selection mechanism by setting a dynamic energy threshold and considering the residual energy and node density. In the inter-cluster communication stage, the cluster head nodes will transmit messages to the sink node by multi-hop according to the minimum energy consumption. The simulation results show that the new algo- rithm can not only reduce the total energy consumption, extend the network lifetime, but also make the node energy consumption more balanced.