利用蚁群优化寻址的Ad Hoc网络路由研究  

Multipath routing of ant colony system in Ad Hoc networks

作　　者：王振朝[1] 王静[1] 王伊瑾[1] 

机构地区：[1]河北大学电信学院,河北保定071002

出　　处：《计算机工程与应用》2010年第31期91-94,共4页Computer Engineering and Applications

摘　　要：针对Ad Hoc网络拓扑结构易变,带宽受限和节点能量受限的特征,将优化的蚁群算法引入简单相关多路路由算法,提出一种基于蚁群优化的简单相关多路径路由算法(ACO-SNDMR)。该算法结合了蚁群算法的分布性、并行性、正反馈以及简单相关多路径节能和可靠性强的优点,能提供带有网络约束条件下的路由,经仿真表明了算法的有效性,且在性能上优于简单相关多路径算法。Ad hoc network has the characteristics of variable topology,bandwidth limited and energy constrained.According to these characteristics, this paper introduces the ant colony algorithm to the simple nondisjoint multipath and proposes a new multipath algorithm （ACO-SNDMR）.The new algorithm combines the distributed character,parallelism and positive feed- back character of ant colony algorithm with the advantages of energy efficiency and reliability of the simple nondisjoint can provide the routing with constraints.The simulation results show that the new algorithm is effective and superior to the sim- ple nondisjoint multipath algorithm.

关 键 词：ADHOC网络 蚁群算法 多路径 路由算法 

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