作　　者： ; ; ;

机构地区： 华南农业大学信息学院

出　　处： 《小型微型计算机系统》 2010年第1期62-66,共5页

摘　　要： 求解两个或多个限制参数的QoS多播路由问题,已被证明为NP-complete问题,而随着Ad hoc网络中多媒体和实时应用需求的不断提升,有效的QoS多播路由算法成为重要研究内容.针对Ad hoc网络的动态性和QoS参数的多样性,给出一种解决该问题的捕食逃逸PSO方法,算法通过对MAODV路由发现过程发现的QoS有效路径进行编码和寻优处理,借助于捕食逃逸行为使算法能够以较大概率获取全局最优QoS多播路由.在NS2平台上的仿真结果表明了捕食逃逸PSO解决Ad hoc网络QoS多播路由问题的可胜任性. To solve QoS-based Multicast routing problem with multiple contraints has been proved as NP complete problem. With the increasing of multimedia and real-time applications＇ requirement in Ad hoc networks, effective QoS-based Multicast routing algoritms become important research issues. Because of Ad hoe networks＇s dynamics and QoS parameters＇s diversity, this paper proposes a QoS multicast routing algorithm based on predatory escaping PSO, which encodes the effective QoS multicast paths found out by MAODV＇s routes-finding procedure and then optimizes QoS multicast tree. Experimental results on NS2 show that the proposed algorithm is competitive on QoS-based Multicast routing problem in Ad hoc networks.

关 键 词： 粒子群优化算法 捕食逃逸 多播路由

领　　域： [自动化与计算机技术] [自动化与计算机技术]