[1]李元振,廖建新,朱晓民,等.基于粒子群算法的车载自组网服务节点部署[J].南京理工大学学报(自然科学版),2011,(06):744-748.
 LI Yuan-zhen,LIAO Jian-xin,ZHU Xiao-min,et al.Particle Swarm Optimization Based Service Node Placement in Vehicular Ad Hoc Networks[J].Journal of Nanjing University of Science and Technology,2011,(06):744-748.
点击复制

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

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

卷:
期数:
2011年06期
页码:
744-748
栏目:
出版日期:
2011-12-31

文章信息/Info

Title:
Particle Swarm Optimization Based Service Node Placement in Vehicular Ad Hoc Networks
作者:
李元振12廖建新2朱晓民2李俊青1
1. 聊城大学计算机学院,山东聊城252059; 2. 北京邮电大学网络与交换技术国家重点实验室,北京100876
Author(s):
LI Yuan-zhen12 LIAO Jian-xin2ZHU Xiao-min2LI Jun-qing1
1. School of Computer Science,Liaocheng University,Liaocheng 252059,China; 2. State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China
关键词:
车载自组网 连通性 服务节点 粒子群算法
Keywords:
vehicular Ad Hoc networks coverage connectivity service nodes particle swarm optimization
分类号:
TN915. 04
摘要:
为了提高车载自组网( VANETs) 覆盖率,该文提出了一种城市场景下VANETs 中基于 连通性的服务节点部署方案。通过理论分析得出服务节点扩展覆盖某一区域的概率,依据该概 率和VANETs 特点,提出了VANETs 中的服务节点优化部署模型,并基于粒子群算法( PSO) 提 出了解决方案。将服务节点的位置信息抽象为粒子进行解的搜索。给出了利用PSO 进行最优 解搜索的计算步骤。仿真实验结果表明,该文算法能实现服务节点的最优部署,并具有较快的 收敛速度和较好的收敛性。
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.

参考文献/References:

[1] 常促宇,向勇,史美林. 车载自组网的现状与发展[J]. 通信学报, 2007, 28( 11) : 116-126.
[2] Fan L,Yu W. Routing in vehicular ad hoc networks: A survey[J]. IEEE Veh Technol Mag, 2007,2 ( 2) : 12-22.
[3] Bernsen J,Manivannan D. Unicast routing protocols for vehicular ad hoc networks: A critical comparison and classification[J]. Pervasive and Mobile Computing. 2009,5 ( 1) : 1-18.
[4] 嵇玮玮,刘中. 能量有效的无线传感器网络节点选 择[J]. 南京理工大学学报, 2009, 33( 4) : 495-500.
[5] 刘丽萍,王智,孙优贤. 无线传感器网络部署及其覆 盖问题研究[J]. 电子与信息学报. 2006,28 ( 9) : 1752-1757.
[6] Farahmand F,Cerutti I,Patel A N,et al. Relay node placement in vehicular delay-tolerant networks[A]. IEEE Global Telecommunications Conference ( GLOBECOM) [C]. New Orleans,USA: IEEE, 2008: 1-5.
[7] Pan L,Xiaoxia H,Yuguang F, et al. Optimal placement of gateways in vehicular networks[J]. IEEE Trans Veh Technol, 2007, 56( 6) : 3421-3430.
[8] Desai M,Manjunath D. On the connectivity in finite Ad Hoc networks[J]. IEEE Commun Lett,2002,6( 10) : 437-439.
[9] Gore A D. Comments on“On the connectivity in finite Ad Hoc networks”[J]. IEEE Commun Lett,2006,10 ( 2) : 88-90.
[10] Gore A D. Correction to“Comments on‘On the connectivity in finite Ad Hoc networks’”[J]. IEEE Commun Lett, 2006, 10( 5) : 359.
[11] Yousefi S,Altman E,El-Azouzi R, et al. Analytical model for connectivity in vehicular Ad Hoc networks[J]. IEEE Trans Veh Technol, 2008, 57( 6) : 3341-3356.
[12] 李元振,廖建新,李彤红,等. 一种基于竞争转发的 城市场景车载Ad Hoc 网络路由算法[J]. 电子学 报. 2009, 37( 12) : 2639-2645.
[13] Kennedy J,Eberhart R. Particle swarm optimization[A]. IEEE International Conference on Neural Networks[C]. Perth,WA,Australia: IEEE, 1995. 1942-1948.

备注/Memo

备注/Memo:
基金项目: 国家杰出青年科学基金( 60525110) ; 国家“973”计划资助项目( 2007CB307100; 2007CB307103) ; 国家自 然科学基金( 61072057; 60902051) ; 中央高校基本科研业务费专项资金( BUPT2009RC0505) ; 国家科技 重大专项( 2011ZX03002-001-01; 2011ZX03002-002-01) 作者简介: 李元振( 1979 -) ,男,博士,主要研究方向: 车载Ad Hoc 网络,宽带通信网与下一代网络,E-mail: liyuanzhen@163. com。
更新日期/Last Update: 2012-10-25