蚁群优化算法在Ad Hoc网络路由中的应用

针对蚁群算法固有的搜索时间长、易陷入局部最优解的缺点，提出一种改进的基于蚁群算法的Ad Hoc网络路由算法。通过采取赌轮方式和扩散信息素提高路由搜索能力，绕开能量低的邻居节点均衡网络节点能量；同时对路由表做出修改，提高路由算法性能，增强算法的适应能力。经过与已有路由算法AODV的仿真比较，结果表明该算法不仅增加了路径的搜索多样性，减少了路径收敛时间，而且提高了网络的生存时间。

Ant colony optimization applied in Ad Hoc network routing

Concerning the shortcomings of ant colony algorithm such as inherent long search time, being easy to fall into the local optimal solution, an improved Ad Hoc network routing algorithm based on ant colony algorithm was proposed. By using the roulette wheel method and spreading pheromones to improve the routing searching capability, bypassing the low energy neighbor node to equilibrium network node energy, while modifying routing tables, the routing algorithm performance was improved, and the adaptability of the algorithm was enhanced. By comparing the improved routing algorithm with AODV, the simulation results show that the algorithm not only increases the search diversity of roads and reduces the convergence time, but also improves network lifetime.