A Graph-based Model for RSUs Deployment in Vehicular Networks by Considering Urban and Network Limitations and QoS Requirements of Service Advertisement and Discovery

被引:13
作者
Balouchzahi, Nik Mohammad [1 ]
Fathy, Mahmood [1 ]
Akbari, Ahmad [1 ]
机构
[1] Iran Univ Sci & Technol, Sch Comp Engn, Tehran, Iran
关键词
Vehicular networks; RSU placement; Steiner tree; QoS requirements; Urban and network restrictions; STEINER TREE PROBLEM; AD HOC NETWORKS; ROADSIDE UNITS; CONNECTIVITY; ALLOCATION;
D O I
10.3837/tiis.2015.05.006
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The efficient send and receive of information in VANET improves the efficiency of the safety and traffic services advertisment and discovery. However, if the V2V is the only communication system used, the restrictions of the urban environment and network drop the performance of VANET. In order to improve the performance of the network, it is necessary to use V2I communication as well as V2V communication. Therefore, RSUs must be placed in the environment. However due to the high costs of placement, the full coverage of the environment would not be possible. Therefore, it is necessary to optimally install a limited number of RSUs in the environment. In this article a graph-based model is presented to find optimal location of RSUs in the urban scenario. All the urban and VANETs limitations have been applied to the graph in form of weight. Solving the Steiner tree problem leads to find optimal places to install RSUs. In the following, the presented model extends to support QoS requirement of service advertisement and discovery. The simulation results, based on real traces, shows an improvement in performance of the given model in comparison with the other scenarios of RSUs placement.
引用
收藏
页码:1662 / 1681
页数:20
相关论文
共 33 条
[1]   Probabilistic Delay Control and Road Side Unit Placement for Vehicular Ad Hoc Networks with Disrupted Connectivity [J].
Abdrabou, Atef ;
Zhuang, Weihua .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2011, 29 (01) :129-139
[2]   Efficient group-based authentication protocol for location-based service discovery in intelligent transportation systems [J].
Abrougui, Kaouther ;
Boukerche, Azzedine .
SECURITY AND COMMUNICATION NETWORKS, 2013, 6 (04) :473-484
[3]   Design and Evaluation of Context-Aware and Location-Based Service Discovery Protocols for Vehicular Networks [J].
Abrougui, Kaouther ;
Boukerche, Azzedine ;
Pazzi, Richard Werner Nelem .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2011, 12 (03) :717-735
[4]  
Aslam Baber, 2011, 2011 IEEE Consumer Communications and Networking Conference (CCNC 2011), P814, DOI 10.1109/CCNC.2011.5766608
[5]  
Aslam B, 2012, 2012 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), P423, DOI 10.1109/ISCC.2012.6249333
[6]   Analytical model for connectivity of vehicular ad hoc networks in the presence of channel randomness [J].
Babu, A. V. ;
Ajeer, V. K. Muhammed .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2013, 26 (07) :927-946
[7]   Road Side Unit Deployment: A Density-Based Approach [J].
Barrachina, Javier ;
Garrido, Piedad ;
Fogue, Manuel ;
Martinez, Francisco J. ;
Cano, Juan-Carlos ;
Calafate, Carlos T. ;
Manzoni, Pietro .
IEEE INTELLIGENT TRANSPORTATION SYSTEMS MAGAZINE, 2013, 5 (03) :30-39
[8]   IMPROVED APPROXIMATIONS FOR THE STEINER TREE PROBLEM [J].
BERMAN, P ;
RAMAIYER, V .
JOURNAL OF ALGORITHMS, 1994, 17 (03) :381-408
[9]   Approximations for Steiner trees with minimum number of Steiner points [J].
Chen, DG ;
Du, DZ ;
Hu, XD ;
Lin, GH ;
Wang, LS ;
Xue, GL .
JOURNAL OF GLOBAL OPTIMIZATION, 2000, 18 (01) :17-33
[10]  
Chen YH, 2011, LECT NOTES COMPUT SC, V6784, P141