南京理工大学学报（自然科学版）2011，Vol.35Issue(6)：744-748,5.
基于粒子群算法的车载自组网服务节点部署
Particle Swarm Optimization Based Service Node Placement in Vehicular Ad Hoc Networks
摘要
Abstract
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.关键词
车载自组网/连通性/服务节点/粒子群算法Key words
vehicular Ad Hoc networks/coverage connectivity/service nodes/particle swarm optimization分类
信息技术与安全科学引用本文复制引用
李元振,廖建新,朱晓民,李俊青..基于粒子群算法的车载自组网服务节点部署[J].南京理工大学学报（自然科学版）,2011,35(6):744-748,5.基金项目
国家杰出青年科学基金(60525110) （60525110）
国家"973"计划资助项目(2007 CB307 100 （）
2007CB307103) （）
国家自然科学基金(61072057 （）
60902051) （）
中央高校基本科研业务费专项资金(BUPT2009RC0505) （BUPT2009RC0505）
国家科技重大专项(2011ZX03002-001-01 （）
2011 ZX03002-002-01) （）
