scholarly journals A Hierarchical Routing Scheme With Load Balancing in Software Defined Vehicular Ad Hoc Networks

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 73774-73785 ◽  
Author(s):  
Yangshui Gao ◽  
Zhilong Zhang ◽  
Dan Zhao ◽  
Yi Zhang ◽  
Tao Luo
2019 ◽  
Vol 68 (2) ◽  
pp. 1852-1865 ◽  
Author(s):  
Fan Li ◽  
Xiaoyu Song ◽  
Huijie Chen ◽  
Xin Li ◽  
Yu Wang

2020 ◽  
Vol 5 (1) ◽  
pp. 56-63
Author(s):  
Chi-Fu Huang ◽  
Jyun-Hao Jhang

Due to advances in wireless communication technologies, wireless transmissions gradually replace traditional wired data transmissions. In recent years, vehicles on the move can also enjoy the convenience of wireless communication technologies by assisting each other in message exchange and form an interconnecting network, namely Vehicular Ad Hoc Networks (VANETs). In a VANET, each vehicle is capable of communicating with nearby vehicles and accessing information provided by the network. There are two basic communication models in VANETs, V2V and V2I. Vehicles equipped with wireless transceiver can communicate with other vehicles (V2V) or roadside units (RSUs) (V2I). RSUs acting as gateways are entry points to the Internet for vehicles. Naturally, vehicles tend to choose nearby RSUs as serving gateways. However, due to uneven density distribution and high mobility nature of vehicles, load imbalance of RSUs can happen. In this paper, we study the RSU load-balancing problem and propose two solutions. In the first solution, the whole network is divided into sub-regions based on RSUs’ locations. A RSU provides Internet access for vehicles in its sub-region and the boundaries between sub-regions change dynamically to adopt to load migration. In the second solution, vehicles choose their serving RSUs distributedly by taking their future trajectories and RSUs’ loading information into considerations. From simulation results, the proposed methods can improve packet delivery ratio, packet delay, and load balance among RSUs.


2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Siddharth Shelly ◽  
A. V. Babu

We propose an enhancement for the well-known greedy perimeter stateless routing (GPSR) protocol for vehicular ad hoc networks (VANETs), which exploits information about link reliability when one-hop vehicles are chosen for forwarding a data packet. In the proposed modified routing scheme, a tagged vehicle will select its one-hop forwarding vehicle based on reliability of the corresponding communication link. We define link reliability as the probability that a direct link among a pair of neighbour vehicles will remain alive for a finite time interval. We present a model for computing link reliability and use this model for the design of reliability based GPSR. The proposed protocol ensures that links with reliability factor greater than a given threshold alone are selected, when constructing a route from source to destination. The modified routing scheme shows significant improvement over the conventional GPSR protocol in terms of packet delivery ratio and throughput. We provide simulation results to justify the claim.


2017 ◽  
Vol 72 (3-4) ◽  
pp. 189-197 ◽  
Author(s):  
Zouina Doukha ◽  
Sofian Ali BenMussa ◽  
Kayhan Zrar Ghafoor ◽  
Iman Loumachi ◽  
Samira Moussaoui

Sign in / Sign up

Export Citation Format

Share Document