Abstract
In VANETs (Vehicular Ad-hoc Networks), the num-ber of vehicles increased continuously, leading to significant traffic problems like traffic congestion, a feasible path, and associated events like accidents. Though, the Intelligent Transportation System (ITS) providing excellent services, such as safety appli-cations and emergency warnings. However, ITS has limitations regarding traffic management tasks, scalability, and flexibility because of the enormous number of vehicles. Therefore, extending the traditional VANET architecture is indeed a must. Thus, in the recent period, the design of the SD-VANETs (Software-Defined Networking defined VANETs) has gained significant interest and made VANET more intelligent. The SD-VANET architecture can handle the aforesaid VANET challenges. The centralized (logically) SDN architecture is programmable and also has global information about the VANET architecture. Therefore, it can effortlessly handle scalability, traffic management, and traffic congestion issues. The traffic congestion problem leads to longer trip times, decreases the vehicles’ speed, and prolong average end-to-end delay. Though, somewhere, some routes in the network are available with capacity, which can minimize the congestion problem and its characteristics. Therefore, we proposed heuristic algorithms called Congestion-Free Path (CFP) and Optimize CFP (OCFP), in SD-VANET architecture. The proposed algorithms address the traffic congestion issue and also provide a feasible path (less end-to-end delay) for a vehicle in VANET. We used the NS-3 simulator to evaluate the performance of the proposed algorithms, and for generating a real scenario of VANET traffic; we use the SUMO module. The results show that the proposed algorithms decrease road traffic congestion drastically compared to exiting approaches.
Highlights
In the current communication era, VANETs have received the significant attention of the researchers because of its unique and critical characteristics like frequent changes in topology, link failure, network stability, efficient traffic management, safety, congestion, and reliability [1], [2]
To minimize the computational time, we input : Graph of road map G(V, R) output: reliable congestion free path subject to the minimum utilization ψ and average minimum delay rμ 1 SDN Controller ← path request 2 if ψ ≤ 0.5 : the requested path is congestion-free return path request 3 else : (i) check “k” alternative congestion-free paths (i.e., “k” = 15) (ii) select path based on ψ and rμ, subject to the constraints (iii) return path request 4 update Graph road map status (G (V, R)) 5 end proposed, the proposed Optimized heuristic Congestion Free Path (CFP) algorithm (OCFP), the controller only computes the best path among the “k” (i.e., “k” = 15) alternative routes
In VANET, the congestion problem leads to longer trip times, decreases the vehicle’s speed, and prolong delay
Summary
In the current communication era, VANETs have received the significant attention of the researchers because of its unique and critical characteristics like frequent changes in topology, link failure, network stability, efficient traffic management, safety, congestion, and reliability [1], [2]. To overcome the congestion problem in VANETs and its characteristics (i.e., prolong end-to-end delay, longer trip times, an emergency condition), we look at controlled (logically) SDN architecture. The purpose of the SDN controller is to improve and optimize the overall network performance like path selection, traffic control, congestion control, and efficient communication. The current approaches focused on the performance of SD-VANET routing, link stability, heterogeneity, offloading, and mobility These approaches do not distribute the vehicles based on vehicles’ density proactively; which causes congestion and prolongs the end-to-end delay. In this paper, we proposed heuristic algorithms called CFP and OCFP in the SD-VANET architecture These algorithms proactively distribute the vehicles on roads according to vehicles’ density and compute the congestion-free path and its characteristics such as long queuing delay, longer trip times, decrease the vehicle’s speed, and safety.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
