一种QACO-LEACH无线传感器网络分簇路由算法

Clustering Routing Algorithm for QACO-LEACH Wireless Sensor Networks

在研究经典低功耗自适应集簇分层型协议(Low Energy Adaptive Clustering Hierarchy,LEACH)和基于蚁群的分簇路由算法的基础上,提出了一种基于量子蚁群的无线传感器网络分簇路由算法.该算法采用在簇间路由阶段引入量子蚁群算法的方式,利用量子蚁群算法在全局寻优和收敛速度方面的优势,更好的搜寻到各个簇头到Sink节点的最佳路径进行数据的传输,从而有效的降低了簇头节点的能耗.仿真结果表明,该算法与LEACH算法和蚁群优化分簇路由算法相比,有效的找出最佳路由路径,从而节约了网络能耗,延长了网络生命周期.

Based on the research of Low Energy Adaptive Clustering Hierarchy(LEACH)and Ant Colony-based clustering routing algorithm,a wireless sensor network clustering routing algorithm based on the Quantum Ant Colony algorithm is proposed.The algorithm adopts the method of introducing the Quantum Ant Colony algorithm in the inter-cluster routing stage,and utilizes the advantages of the quantum ant colony algorithm in global optimization and convergence speed,and better searches for the best path from each cluster head to the sink node.Transmission,which effectively reduces the energy consumption of the cluster head node.The simulation results show that compared with LEACH algorithm and ant colony optimization clustering routing algorithm,the algorithm can effectively find the optimal routing path,which saves network energy consumption and make the network life cycle longer.