基于蚂蚁算法的Ad Hoc网络QoS多播路由  

QoS Multicast Routing Based on Ant Algorithm in Ad Hoc Network

作　　者：王新生[1] 贾冬艳[1] 李学[1] 刘清[1] 

机构地区：[1]燕山大学信息科学与工程学院,秦皇岛066004

出　　处：《计算机工程》2009年第11期218-220,共3页Computer Engineering

摘　　要：针对当前移动AdHoc网络的特点和基于QoS的多播路由问题,提出一种基于蚂蚁算法的QoS多播路由算法,引入"优奖差罚"的信息素更新机制,克服基本蚂蚁算法收敛速度慢和易于陷入局部最优解的缺点。实验和分析结果表明,该算法可以找到一棵费用趋于最小、状态稳定的多播路由树,提高了带宽利用率,降低了网络时延和端到端代价。Aiming at the feature of Ad Hoc networks and multicast routing problem of Quality of Service（QoS）, this paper presents a QoS multicast routing algorithm based on ant algorithm. This algorithm overcomes the disadvantages of ant algorithm such as low convergence speed and local optimal solution by adjusting the rate of pheromone of the worst and the best path. Experimental and analysis results show that a broadcast tree at the near lowest cost and most stable state can be found. This algorithm solves the QoS multicast routing problems of Ad Hoc networks in bandwidth, delay and end-to-end cost.

关 键 词：AD HOC网络 蚂蚁算法 服务质量 多播路由 

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