检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:薛冉[1]
机构地区:[1]廊坊师范学院物理与电子信息学院,河北廊坊065000
出 处:《宁夏大学学报(自然科学版)》2011年第4期337-340,345,共5页Journal of Ningxia University(Natural Science Edition)
基 金:辽宁省科技计划资助项目(2008216005)
摘 要:针对Ad Hoc网络中带QoS约束的多播路由问题,提出了一种自适应粒子群优化的Ad Hoc网络多播路由算法(APSO),将微粒在解空间中的飞行搜索过程映射为多播树的树形变换过程.构建了Ad Hoc网络中QoS多播网络模型,采用罚函数处理约束条件来设计适应度函数.描述了APSO算法求解Ad Hoc网络多播路由问题的实现过程,将QoS多播路由优化问题转化为整数计算问题.仿真结果表明:该算法能快速地找到针对Ad Hoc网络中满足Qos要求的最优多播树,尤其在大规模网络下更能显示该算法的有效性和可靠性.A QoS multicast routing optimization algorithm of network is addressed, in which the searching process of the particles in the solution space is mapped to the multicast tree transformation process. The model of QoS multicast routing in Ad Hoc networks is founded, and the fitness function was designed with penalty function for constraint condition. The realization process of solving QoS multicast routing problem with APSO algorithm is stated, and a new integer coding project is designed, which can translates QoS multicast routing problem into integer calculation problem. The simulation show that the optimal multicast tree satisfying the QoS requirement can be quickly found with this algorithm and the method is valid and reliable.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28