基于粒子群优化的ad hoc网络最小能耗多播路由算法  

Minimum energy consumption multicast routing in ad hoc networks based on particle swarm optimization

作　　者：朱晓建[1,2] 沈军[1,2] 

机构地区：[1]东南大学计算机科学与工程学院,江苏南京211189 [2]东南大学计算机网络和信息集成教育部重点实验室,江苏南京211189

出　　处：《通信学报》2012年第3期52-58,共7页Journal on Communications

基　　金：国家自然科学基金资助项目(61070159);国家重点基础研究发展计划("973"计划)基金资助项目(2009CB320501)~~

摘　　要：在无线ad hoc网络中,设备使用电池提供能量,随着多播应用日益广泛,如何构造最小能耗多播树是一个重要问题。针对选择不同的中继节点集对构造最小能耗多播树的影响,提出了一种优化最小能耗多播树构造的离散粒子群算法。为了避免离散粒子群算法早熟收敛,引入惯性权重策略,以平衡算法的全局搜索能力和局部搜索能力。模拟实验结果表明改进后的离散粒子群算法具有较强的优化能力,有效地优化了最小能耗多播树的构造。In wireless ad hoc networks,because devices are powered by batteries,and multicast applications are con-stantly emerging,how to construct a multicast tree of the minimum energy consumption is an important problem.For the effect of the different choices of relay nodes to the construction of the minimum energy consumption multicast tree,a discrete particle swarm optimization algorithm to optimize the construction of the minimum energy consumption multi-cast tree was proposed.In order to avoid the premature convergence of the discrete particle swarm optimization algorithm,an inertia weight strategy was introduced to balance the global searching ability and the local searching ability.The re-sults of simulated experiments show that the modified discrete particle swarm optimization algorithm has strong optimi-zation ability,and can effectively optimize the construction of the minimum energy consumption multicast tree.

关 键 词：无线ADHOC网络 多播路由 最小能耗 粒子群优化 

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