基于最优能耗多播树构造的Ad hoc网络节点路由算法研究  

Ad hoc Network Node Routing Algorithm Based on the Optimal Energy Consumption Multicast Tree Structure

作　　者：李渊[1] 杨立波[1] 

机构地区：[1]太原大学计算机工程系,太原030009

出　　处：《计算机科学》2013年第4期115-118,共4页Computer Science

基　　金：国家自然科学基金(J1526987435)资助

摘　　要：针对Ad hoc网络中最小能耗多播树的生成和优化问题,提出了基于最优能耗多播树构造的Ad hoc网络节点路由算法。在该算法中,首先将最小能耗多播树生成问题转化为不同中继节点集合幂空间中的动态寻优问题,构建基于最优能耗多播树求解模型;然后利用改进的粒子群算法对不同维度空间上代表中继节点链路的粒子的权值进行映射和修正计算,再依据粒子适应度值对粒子的局部极值和全局极值进行更新;最后根据粒子位置和速度更新机制进行迭代计算,将最终的全局极值点和极值作为最优多播树的节点位置和能耗值。实验仿真证明,该算法具有较好的粒子多样性,全局搜索和局部搜索能力较好,并且优化能力较强。In order to solve Ad hoc least energy consumption multicast tree generation and optimization problems,this paper put forward Ad hoc network node routing algorithm based on the optimal energy consumption multicast tree structure.In this algorithm,the minimum cost multicast tree generation problem is first transformed into different relay node set power space of the dynamic optimization problem,and solving model based on the optimal energy consumption multicast tree is built.And the improved particle swarm optimization（pso） algorithm is used to make mapping and correction calculation for the right value of particle representing relay point link in different dimension space and then according to the particle fitness value,the particle＇s local extremum and global extremum are updated.Accor-ding to the particle position and velocity update mechanism of the iterative calculation,eventually global extreme value point and extreme value are used as the most optimal multicast tree node position and energy consumption value.The simulation results show that this algorithm has better particle diversity and global search and local search ability are good,and the optimization ability is strong.

关 键 词：AD HOC网络 多播树 粒子群 最优能耗 

分 类 号：F257[经济管理—国民经济]