WSN中LEACH路由算法的改进

IMPROVING LEACH ROUTING ALGORITHM IN WIRELESS SENSOR NETWORK

针对无线传感器网络节点能耗严重失衡问题,以低功耗自适应聚类LEACH(Low Energy Adaptive Clustering Hierarchy)算法为基础,融合最小生成树的思想,提出一种新的LEACH-PD(Low Energy Adaptive Clustering Hierarchy based on Power and Distance)算法。该算法综合参考节点的剩余能量以及节点到基站的距离合理选择簇首,簇间采用多跳转发的方式与基站进行通信。NS2仿真结果证明,与LEACH算法相比,改进后的LEACH-PD算法在网络负载、能量消耗等方面进行优化,能有效延长网络的生存时间。

For serious imbalance issues of energy consumption of nodes in wireless sensor network,based on low energy adaptive clustering hierarchy（LEACH） routing algorithm,and integrated with the idea of minimum spanning tree,we propose a new algorithm of LEACH-PD.The algorithm makes reasonable choice of cluster header according to comprehensive reference of residual energy of the nodes as well as the distance between base station and nodes,the inter-cluster communicates with the base station by multi-hop forwarding.Simulation results provided by NS2 showed that,compared with LEACH,the improved LEACH-PD algorithm can effectively prolong the survival time of the network by optimising network load and energy consumption,etc.