首页 | 本学科首页   官方微博 | 高级检索  
     

利用蚁群优化寻址的Ad Hoc网络路由研究
引用本文:王振朝,王静,王伊瑾.利用蚁群优化寻址的Ad Hoc网络路由研究[J].计算机工程与应用,2010,46(31):91-94.
作者姓名:王振朝  王静  王伊瑾
作者单位:河北大学 电信学院,河北 保定 071002
摘    要:针对Ad Hoc网络拓扑结构易变,带宽受限和节点能量受限的特征,将优化的蚁群算法引入简单相关多路路由算法,提出一种基于蚁群优化的简单相关多路径路由算法(ACO-SNDMR)。该算法结合了蚁群算法的分布性、并行性、正反馈以及简单相关多路径节能和可靠性强的优点,能提供带有网络约束条件下的路由,经仿真表明了算法的有效性,且在性能上优于简单相关多路径算法。

关 键 词:AdHoc网络  蚁群算法  多路径  路由算法  
收稿时间:2010-1-19
修稿时间:2010-3-29  

Multipath routing of ant colony system in Ad Hoc networks
WANG Zhen-chao,WANG Jing,WANG Yi-jin.Multipath routing of ant colony system in Ad Hoc networks[J].Computer Engineering and Applications,2010,46(31):91-94.
Authors:WANG Zhen-chao  WANG Jing  WANG Yi-jin
Affiliation:College of Electronic & Informational Engineering,Hebei University,Baoding,Hebei 071002,China
Abstract: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.
Keywords:Ad Hoc network  ant colony algorithm  multipath  routing algorithm
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号