Congestion-Aware Routing in Software Defined Vehicular Networks

Abstract

Vehicular communications have been extensively studied due to their potential to provide safety and intelligence in transportation. Regardless, due to the increase in mobility and complex communication environments, it has become challenging to dispense different requirements such as the decrease in latency and an increase in reliability for communicating information related to safety. With the use of distributed algorithms, routing vehicular data from one vehicle to another vehicle over multiple hops has been done in literature before. An approach using distributed algorithms would yield inefficient to have control over the congestion of the network. To overcome this, Software Defined Networking's coordination capacities are leveraged to find the ideal vehicle-to-vehicle (V2V) multi-hop routes. In order to accomplish this goal, a centralized routing algorithm known as Congestion-Aware Routing (CAR) is employed utilizing principles from graph theory to select efficient and uncongested paths for communication between vehicles.