论文部分内容阅读
Ad Hoc网络QoS组播路由问题的目标是在动态网络拓扑图里生成一棵连通源节点和一组目的节点的带约束的最小生成树,已经被证明为NP完全问题.蚁群算法作为一种基于计算智能的计算方法,已成为解决Ad Hoc网络QoS组播路由问题的新的潜在力量.针对Ad Hoc网络中基于蚁群算法的QoS组播路由算法存在网络开销大、早熟收敛和信息素更新规则设置不合理等问题,提出一种基于寿命估算MMAS的Ad Hoc网络QoS组播路由优化算法,因其具有较好的平衡局部搜索和全局搜索能力,收敛结果可接近全局最优.NS2平台仿真结果也证明该算法具有较高的数据包传输率和较低的端到端分组时延,性能指标有进一步提高.
Ad Hoc Networks The goal of QoS multicast routing problem is to generate a constrained minimum spanning tree that connects a source node and a set of destination nodes in a dynamic network topology map and has been proved to be an NP complete problem.As an ant colony algorithm, The calculation method based on computational intelligence has become a new potential force for solving QoS multicast routing problems in Ad Hoc networks.Aiming at the problem that the QoS multicast routing algorithm based on ant colony algorithm in Ad Hoc networks has large network overhead, premature convergence and pheromone updating This paper proposes a QoS multicast routing optimization algorithm based on Lifetime Estimation (MMAS) for Ad Hoc networks, which has the advantages of balanced local search and global search ability, and can converge to the global optimal convergence result.NS2 platform simulation The result also proves that this algorithm has higher packet transmission rate and lower end-to-end packet delay, and the performance index is further improved.