基于节点权值的簇头选举优化算法

Improved Cluster Head Election Algorithm Based on Weight Value

LEACH是无线传感器网络中一种经典的降低网络耗能的分簇路由算法,该算法可有效的延长网络的生命周期,具有平面路由协议无可比拟的优越性。但其簇头选举机制是随机的,没有考虑候选节点的剩余能量等因素。本文基于LEACH提出了一种改进算法,通过节点权值来选择簇头,权值是本轮候选节点的剩余能量、节点密度和距离基站远近的一种数学关系的度量。依此来均衡网络负载,延长整个网络的生命周期。

LEACH is a classic clustering algorithm which reduces the energy consumption in wireless sensor networks,the algorithm can prolong the lifecycle effectively, and has some incomparable advantages compared with plane routing protocol. But the cluster heads are selected randomly without considering the left energy and other factors. In this paper,we proposed an improved clustering algorithm based on LEACH, the nodes are selected as cluster heads by weight value each round. Weight value is a type of mathnatical relationship measurement of candidate nodes on residual energy, the distance to the base station, number of neighbors. Thus the energy consumption of nodes can be balanced and the network lifecycle can be prolonged.