无线传感器网络的路径优化节能算法

Path Optimization Algorithm for Wireless Sensor Networks

目前,LEACH算法的研究与完善主要集中在簇头数量,簇头分布均匀性,普通节点休眠时间等方面,但很少考虑簇头与基站间的通信的最优路径问题,论文提出一种新的能量优化算法——LEACH-DK(LEACH-Dijkstra)算法。该算法在将Dijkstra应用于LEACH算法的过程中,还引入了剩余能量系数和数据量系数,确定簇头与基站之间通信的最优路径,减少簇头能量的损耗。仿真结果表明,与LEACH算法相比,LEACH-DK算法将节点的存活率提高了30%,延长了网络的生存时间,算法的时间复杂度也得到了优化。

At present,the research and improvement of LEACH algorithm mainly focus on the number of cluster heads,the uniformity of cluster head distribution,the sleep time of common nodes,but rarely consider the optimal path of communication between cluster head and base station. A new energy optimization algorithm—LEACH-DK（LEACH-Dijkstra）algorithm is proposed.In the process of applying Dijkstra to LEACH algorithm,the algorithm also introduces the residual energy coefficient and data volume coefficient,reduces the optimal path of communication between cluster head and base station,and reduces the loss of cluster head energy. The simulation results show that the LEACH-DK algorithm improves the survivability of the node by 30% compared with the LEACH algorithm,and extends the lifetime of the network. The time complexity of the algorithm is also optimized.