一种基于蚁群优化的分簇路由算法

A clustering routing algorithm based on ant colony optimization

在无线传感器网络路由协议的研究中,能量高效是其首要设计目标。传统LEACH协议产生簇头数目比较随机,并且簇头直接与基站通信导致能量消耗过快。在分析传统和改进LEACH路由协议的基础上,提出了一种簇头数目固定的簇头选择机制,解决了簇头分布不均匀的问题。并且将蚁群优化算法应用到无线传感器网络的路径选择中,利用蚁群的动态适应性和寻优能力,在簇头与基站之间形成一条最优路径进行通信。在Matlab平台下对新提出的算法进行仿真测试实验,实验结果表明,相对于LEACH路由协议,该算法降低了平均能量消耗,延长了网络的生命周期。

The energy efficient is the main design goals for research on routing protocols of wireless sensor network. In traditional LEACH the number of cluster heads is random and cluster head communicates with base stations directly which leading to the excessive energy consumption. On the basis of analyzing the traditional and improved LEACH routing protocol, a determined number of cluster heads selection mechanism is proposed and the problem of uneven cluster heads distribution is solved. Meanwhile, a routing algorithm is proposed in which the ant colony optimization algorithm （ACO） is used, the dynamic adaptability and optimization capabilities of the ant colony are utilized to get the optimum route between the cluster heads and BS. The simulation experiment results show that the algorithm effectively balances the network energy consumption and prolongs the network life cycle compared with LEACH.