一种基于LEACH协议改进的簇间多跳路由协议

Improved Inter-Cluster Multi-Hop Routing Protocol Based on LEACH Protocol

针对无线传感器网络(WSN)路由协议中能量消耗不均衡问题,研究了一种基于LEACH协议改进的簇间多跳路由协议LEACH-D算法。在分簇过程中,簇头选择增加了节点剩余能量和节点的"度"的因素;在簇间通信阶段,簇头节点按照Dijkstra算法形成的簇头间的最优路径以多跳的方式将信息传递给sink节点,其中权值综合考虑了下一跳簇头的能量和距离因素。通过对LEACH-D、LEACH-C和LEACH算法的网络剩余能量和网络生存时间进行仿真比较,结果表明LEACH-D算法可有效均衡网络的能量消耗,延长WSN的生命周期。

To solve the problem of imbalance in energy consumption of routing protocols for wireless sensor networks（ WSN）, an improved multi-hop routing protocol LEACH-D algorithm is proposed based on the LEACH algorithm. In clustering, the algorithm takes into account a factor of “ degree” and the residual energy of nodes. In intercluster communications, cluster head nodes pass information to the sink through an optimal path according to the Dijkstra algo-rithm. By simulation, LEA CH -D , LEACH-C and LEACH algorithms are compared in terms of network lifetime and residual energy of all nodes. The results show that the LEACH-D protocol can effectively keep balance in network energy consumption, and prolong life span of WSN. The weight function of the algorithm between cluster head nodes is modified by considering energy and the distance.