期刊文献+

蚁群寻优自适应多路径流量分配算法研究

Research on Adaptive Multi-path Traffic Allocation Based on Ant Optimization Algorithm
原文传递
导出
摘要 针对MANET多路径自适应流量分配,提出了蚂蚁寻优自适应多路径流量分配算法。根据反应路径质量的权重动态确定多路径流量的比例,使得网络资源充分利用;利用蚂蚁算法作为流量分配的最优解搜索策略,获得更优的分配结果;依据前次流量分配结果构造蚂蚁算法的初始信息素,提高搜索效率。仿真表明:该算法在平均端到端延迟、报文成功传输率、控制开销、负载平衡性能方面有一定的提升。 In order to adaptively allocate traffic among multi-path in MANET, a scheme called Adaptive Multi-path Traffic Allocation Based on Ant Optimization Algorithm is proposed, which dynamically determines the ratio of multi-path traffic by the path weights which reflect the quality of paths. By this way, the net resource is utilized sufficiently. This scheme uses ant algorithm, which speeds up the searching rate, as searching method for the optimization solution for traffic allocation. The initial information element of ant algorithm is constructed according to the former traffic allocation result, which further improves the searching efficiency. Simulation indicates that the scheme obtains better performance in average end-to-end delay, successful packets delivery ratio, cost control, traffic balance.
作者 隆文超
出处 《通信技术》 2008年第2期100-102,共3页 Communications Technology
关键词 蚁群寻优 流量分配 多路径路由 ant optimization traffic allocation multi-path routing
  • 相关文献

参考文献5

  • 1Lee J S, Gerla M. AODV-BR: Backup Routing in Ad hoc Networks[J]. Proceedings of IEEE WCNC 2000, Chicago, 2000 1311-1316.
  • 2Nasipuri h, Samir R D. On-Demand Multipath Routing for Mobile hd Hoc Networks[J]. Proceedings of IEEE ICCCN'99 Boston, 1999: 64-70.
  • 3Park O V, Corson S M, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks[J]. Proceedings of IEEE INFOCOM'97, Kobe, 1997:1405-1413
  • 4Raju J, Garcia-Luna-Aceves J J. A New Approach to Ondemand Loop-Free Multipath Routing[J]. Proceedings of IEEE ICCCN'99, Boston, 1999: 522-527.
  • 5Stutzle T, Hoos H H, MAX-MIN Ant System[J]. Future Generation Computer System, 2000, 16(08): 889-914.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部