检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南师范大学增城学院,广州511363 [2]华南农业大学信息学院,广州510642 [3]湖北工业大学计算机学院,武汉430068
出 处:《小型微型计算机系统》2015年第1期44-48,共5页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(61272404)资助;广东省自然科学基金项目(S2012010010383;S2013040015755)资助;广东省育苗工程(自然科学)项目(2013LYM_0119)资助
摘 要: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.
关 键 词:AD HOC网络 蚁群算法 寿命估算 QOS组播路由
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112