期刊文献+

Ad Hoc网络基于寿命估算MMAS的QoS组播路由优化算法 被引量:5

QoS Multicast Routing Optimization Algorithm in Ad Hoc Networks Based on MMAS with Lifetime Estimation
下载PDF
导出
摘要 Ad Hoc网络QoS组播路由问题的目标是在动态网络拓扑图里生成一棵连通源节点和一组目的节点的带约束的最小生成树,已经被证明为NP完全问题.蚁群算法作为一种基于计算智能的计算方法,已成为解决Ad Hoc网络QoS组播路由问题的新的潜在力量.针对Ad Hoc网络中基于蚁群算法的QoS组播路由算法存在网络开销大、早熟收敛和信息素更新规则设置不合理等问题,提出一种基于寿命估算MMAS的Ad Hoc网络QoS组播路由优化算法,因其具有较好的平衡局部搜索和全局搜索能力,收敛结果可接近全局最优.NS2平台仿真结果也证明该算法具有较高的数据包传输率和较低的端到端分组时延,性能指标有进一步提高. The goal of QoS multicast routing problem in Ad Hoc network, which has been proved to be a NP complete problem,is to generate a constrained minimum spanning tree connecting source nodes and a group of destination nodes among the dynamic network topology. Based on computational intelligence algorithms as representation of heuristic search algorithrns lAnt colony algorithms have become a potential power for solving this problem. However, QoS multicast routing algorithms based on ant colony algorithms in Ad Hoc network are confronted with numerous difficulties such as the large cost,premature convergence and unreasonable the rule of up- dating pheromone. Therefore, this paper proposes a QoS multicast routing optimization algorithm based on MMAS with lifetime esti- mation ( MMAS_LE } in Ad Hoc network, which is capable of balancing local search and global search and converging to the global optimum. Stimulation results on NS2 show that the proposed algorithm has a high delivery ratio and a low end-to-end delay of packet transmission, and further improves the performance index.
出处 《小型微型计算机系统》 CSCD 北大核心 2015年第1期44-48,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61272404)资助 广东省自然科学基金项目(S2012010010383 S2013040015755)资助 广东省育苗工程(自然科学)项目(2013LYM_0119)资助
关键词 AD HOC网络 蚁群算法 寿命估算 QOS组播路由 Ad Hoc network ant colony algorithm lifetime estimation QoS multicast routing
  • 相关文献

参考文献12

  • 1Abdullah M S, Alkahtani M E,Woodward K. Al-Begin. An over-view of quality of service (QoS) and QoS routing in communica-tion networks [J]. PGnet,2003:1-17.
  • 2Liang Zong-jie. Research on Ad Hoc network power efficient andQoS routing based on train detections [ D ]. Chengdu : SouthwestJiaotong University ,2010.
  • 3Se-young L, Hyeong S C. An ant system based multicasting in mo-bile ad hoc network [ C ] ? Proceedings of the 2005 IEEE Congresson Evolutionary Computation 2-5 Sept,2005 ,2;1583-1588.
  • 4Chien-Chung S,Chaipom J. Ad Hoc Multicast routing algorithmwith swarm intelligence [ J]. Mobile Networks and Applications,2005,10(1-2) :47-59.
  • 5Mesut G, Sorges U, Bouazlzi L. ARA:The ant-colony based routingalgorithm for MANETs [ C]. Proceedings of the International Con-ference on Parallel Processing Workshops(ICCPW2002), Canada,2002:79-85.
  • 6Heissenbttel M, Kommunikation T B. Ants-based routing in largeseale mobile Ad Hoc networks.C]. In Kommunikation in VerteiltenSystem (KiVS03) ,2003:91-99.
  • 7Zheng X Q,Guo W,Liu R. An ant-based distributed routing algo-rithm for Ad hoc networks[C]. Proceedings of International Confer-ence on Communications,Circuits and Systems (ICCCAS2004 ),2004:412417.
  • 8Shen C C, Chai P J. Ad Hoc multicast routing algorithm with swarmintelligence [ J ] ? Mobile Networks and Applications,2005 :47-59.
  • 9Lee S Y. An ant system based multicasting in mobile Ad Hoc net-work[ J]. Evolutionary Computation,2005,2: 1583-1588.
  • 10姚金涛,祝胜林,孔宇彦.具有寿命估算的最大-最小蚂蚁系统[J].计算机工程与应用,2011,47(24):27-29. 被引量:4

二级参考文献11

  • 1蔡光跃,董恩清.遗传算法和蚁群算法在求解TSP问题上的对比分析[J].计算机工程与应用,2007,43(10):96-98. 被引量:28
  • 2Dorigo M.Optimization, leaming and natural algorithms[D].Italy: Politccnico diMilano,Dcpartment of Electronics, 1992.
  • 3Bullnheimer B,Hartl R F,Strauss C.An improved ant system algorithm for the vehicle routing problem[J].Annals of Operations Research, 1999,89:319-328.
  • 4Dorigo M, Maniczzo V, Colomi A.Ant system: optimization by a colony of cooperating agents[J].IEEE Transactions on Systems, Man, and Cybernetics- Part B, 1996,26 (l) : 29-41.
  • 5Dorigo M, GambardeUa L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Trans- actions on Evolutionary Computation, 1997,1 ( 1 ) : 53-66.
  • 6Stutzle T,Hoos H.Max-min ant system[J].Future Generation Computer Systems, 2000,16 (9) : 889-914.
  • 7Garey M R, Johnson D S.Computers and intractability:a guido to the theory of NP2 completaness[M].San Francisco:Freeman W H, 1979.
  • 8Casanucva F F,Molipc M E, Schlechte J A,et al.Guias de la pituitary society para el diagnostico y tratamiento de los prolactinomas[J].Aniraal Behavior,2007,54(8).
  • 9许昌,常会友,徐俊,衣杨.一种新的融合分布估计的蚁群优化算法[J].计算机科学,2010,37(2):186-188. 被引量:6
  • 10冀俊忠,黄振,刘椿年,代启国.基于多粒度的旅行商问题描述及其蚁群优化算法[J].计算机研究与发展,2010,47(3):434-444. 被引量:19

共引文献3

同被引文献46

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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