进化计算的移动自组网服务节点部署算法研究  

Evolutionary Computation of Mobile AD Hoc Network Service Node Deployment Algorithms

作　　者：段淑敏[1] 母军臣[2] 

机构地区：[1]开封大学旅游学院,河南开封475004 [2]开封大学软件学院,河南开封475004

出　　处：《计算机仿真》2014年第4期307-309,378,共4页Computer Simulation

摘　　要：研究空间网络资源优化分配问题,在移动自组网络中,网络节点区域处在一个变化的状态,很难形成固定的划分。传统的节点部署算法主要针对节点的固定分布特征,完成簇头节点设定,一旦网络节点不定,很难针对上述不定变化建立稳定的分布模型,造成节点服务覆盖不准。为了提高移动自组网中的节点服务覆盖率,提出了进化的移动自组网服务节点部署算法。改进算法首先对车载自组网的节点部署模型进行研究,将其转化为在保证网络覆盖概率大于设定阈值的同时服务节点个数最少的迭代优化问题;然后利用改进的粒子群算法进行迭代寻优,将最优部署方法映射到粒子的维度空间进行最优值搜索。仿真结果表明,改进算法能有效的对服务节点进行优化部署,且算法的收敛速度较快。In order to improve the mobile AD hoc network nodes service coverage, we put forward the evolution ary computation of mobile AD hoe network service node deployment algorithm. In this algorithm, firstly, the AD hoe network node deployment model was researched and converted to guarantee that the network coverage in probability is greater than the threshold value set and at the same time, the service nodes are least. Then, the improved particle swarm algorithm was applied in the iterative optimization and the optimal deployment scheme mapping for particle di mension space optimal value search. The simulation results show that the proposed algorithm can effectively carry out the service node optimization deployment, and speed up the convergence of the algorithm.

关 键 词：移动自组网 粒子群 服务节点 节点部署 

分 类 号：TP37[自动化与计算机技术—计算机系统结构]