基于自适应蚁群优化的Ad Hoc网络路由算法  

Self-adaptive ant colony optimization routing algorithm for mobile Ad Hoc network

作　　者：郝建东[1] 毛力[1] 张端[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122

出　　处：《计算机工程与设计》2009年第21期4832-4834,共3页Computer Engineering and Design

摘　　要：针对蚁群优化固有的搜索时间长、易陷入局部最优解的缺点,提出一种改进的基于蚁群优化的Ad Hoc网络路由算法。通过增加自适应因子提高路由搜索能力,充分考虑节点间的时延来改进信息的更新机制,同时对路由表做出修改,提高路由算法性能,增强算法的适应能力。经过与已有路由算法DSR和AODV的仿真比较,结果表明该算法在成功传输率和平均端到端延迟上表现了较好的性能。An improved routing algorithm based on ant colony algorithm is proposed for the shortcomings of ant algorithm. To avoid getting into local optimal solutions and searching too long, accelerate the convergence rate, self-adaptive factor is added to improve search strategy, time delay is taken fully into account for information updating process and routing table is modified. By comparing the improved routing algorithm with DSR and AODV, simulation results show that the proposed algorithm is reasonable and efficient.

关 键 词：Ad HOC网络 蚁群优化 自适应 按需路由 信息素 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]