针对Ad hoc网络拓扑结构的多变和基本蚁群算法易失去多解的情况,在对算法的节点选择进行改进后,提出把蚁群算法与DSR、AODV和DSDV相结合,即ant-DSR、ant-AODV和ant-DSDV。利用改进的蚁群算法寻找最优路径,在节点速率、停留时间这2种不同场景下分析比较了端到端时延、吞吐量、路由开销和跳数等参数的性能。仿真结果表明,先应式路由协议比按需路由协议在提高性能上更适合于蚁群算法,但却增加了路由开销,并且每个节点产生最优路径时需要更多的计算。
Aiming at Ad hoc network changing topology and basic ant colony easy to lose multiple solutions,this paper proposes the combining method of ant colony algorithm and DSR, AODV and DSDV,called ant-DSR, ant-AODV and ant-DSDV after improving the next hop node selection.The improved ant colony algorithm is used to find the optimal path.The end to end delay,throughput,routing overhead, and hop count performance parameters are analyzed and compared in such two scenarios as node rate and pause time. The simulation results show that the first routing protocol is more adaptable to the ant colony algorithm to improve performance compared with on-demand routing protocols ,but it increases routing overhead and requires more calculation to find the optimal path in each node.