基于粒子群算法的车载自组网服务节点部署  

Particle Swarm Optimization Based Service Node Placement in Vehicular Ad Hoc Networks

作　　者：李元振[1,2] 廖建新[2] 朱晓民[2] 李俊青[1] 

机构地区：[1]聊城大学计算机学院,山东聊城252059 [2]北京邮电大学网络与交换技术国家重点实验室,北京100876

出　　处：《南京理工大学学报》2011年第6期744-748,共5页Journal of Nanjing University of Science and Technology

基　　金：国家杰出青年科学基金(60525110);国家'973'计划资助项目(2007CB307100;2007CB307103);国家自然科学基金(61072057;60902051);中央高校基本科研业务费专项资金(BUPT2009RC0505);国家科技重大专项(2011ZX03002-001-01;2011ZX03002-002-01)

摘　　要：为了提高车载自组网(VANETs)覆盖率,该文提出了一种城市场景下VANETs中基于连通性的服务节点部署方案。通过理论分析得出服务节点扩展覆盖某一区域的概率,依据该概率和VANETs特点,提出了VANETs中的服务节点优化部署模型,并基于粒子群算法(PSO)提出了解决方案。将服务节点的位置信息抽象为粒子进行解的搜索。给出了利用PSO进行最优解搜索的计算步骤。仿真实验结果表明,该文算法能实现服务节点的最优部署,并具有较快的收敛速度和较好的收敛性。To improve the network coverage rates of vehicular Ad Hoc networks（VANETs）,a connectivity-based service node placement strategy for VANETs in city scenarios is proposed.The probability that one service node extension covers a geographic point is obtained through theoretical analysis.The optimal placement model of service nodes in VANETs is described based on the probability and the characteristics of VANETs.One solution based on particle swarm optimization（PSO）is given.The service node ＇ s location is used as particle to find the optimal solution.The procedure of the PSO algorithm to find the optimal solution is presented.Simulation results show that the scheme can realize optimal collocation of service nodes and has fast convergence rate and good convergence.

关 键 词：车载自组网 连通性 服务节点 粒子群算法 

分 类 号：TN915.04[电子电信—通信与信息系统]