An Approach for Alleviating the Starvation Problem in Road Side Units (RSUs)-based Vehicular Ad Hoc Networks(VANETs)

Scheduling for data exchange in Vehicular Ad Hoc Networks (VANETs) is being considered as a vital issue by the researchers. Road Side Units (RSUs) being the standalone buffer point is to compensate the less connectivity problem due to mobility of vehicles. Here we formulate an RSU-based VANETs model. Due to vehicle mobility and RSU range constraint scheduling is an important issue to meet a vehicle’s issued demand in hard real-time. We investigate existing scheduling algorithm serve a data item only based on vehicles’ submitted requests’ characteristics and avoiding the relationship between a vehicle and its submitted requests which leads a vehicle level starvation problem. In this paper, we address this starvation problem and propose a solution to minimize the problem. Simulation result also supports our proposed approach and offers expected result.