非变换簇的WSN分簇路由算法

摘要

针对LEACH算法簇头选取及能量消耗方面的不足,提出一种基于能量、距离和节点度的分簇路由算法CMEDD,通过均匀分簇减少重建过程,对簇头选举公式进行改进,合理选择簇头,从而均衡节点能耗.采用基于代价因子的单跳和多跳相结合的方式建立最优路径进行数据传输.仿真结果表明,与LEACH算法和RMCRW算法相比,CMEDD算法能够有效均衡节点能耗,可相对延长网络生存周期.%Aiming at the insufficiency of cluster head selection and energy consumption of LEACH algorithm,a CMEDD clustering routing algorithm based on energy,distance and node degree is proposed to simplify the reconstruction process by uni-form clustering,improve the way to select cluster head,and select the cluster head reasonably,so that the energy consumption of the nodes can be balanced. Moreover the optimal path was set up by the mode combining single hop and multi hop based on cost factor to transmit data. The simulation results show that compared with LEACH algorithm and RMCRW algorithm,the CMEDD algorithm can more effectively balance the node energy consumption and prolong the network lifetime relatively.