|Table of Contents|

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

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

Issue:
2011年06期
Page:
744-748
Research Field:
Publishing date:

Info

Title:
Particle Swarm Optimization Based Service Node Placement in Vehicular Ad Hoc Networks
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
PACS:
TN915. 04
DOI:
-
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:
-
Last Update: 2012-10-25