Priority based efficient data scheduling technique for VANETs

As vehicular networks are gaining popularity, large number of vehicles want to take advantage of these networks, by utilizing the information they have, in order to take decision. Vehicle receives data from other vehicles or from the road side units (RSUs) available across the road. Since RSUs act as router to connect with the external world as well as it is a high capacity storage place where important data (e.g. data used in traffic safety, location dependent query, etc.) can be stored for download purpose for other vehicles moving through the service area. Since the RSUs have limited communication range and vehicles usually moves at very high speed in the service area, they have limited time to serve data to vehicles moving in the service area. For this purpose RSUs have to schedule data in such a way that maximum vehicles can get benefit from the data available with the RSUs. There are many algorithms proposed in the past to schedule data at RSUs. This paper proposes a mechanism to schedule data of those vehicles which are in the coverage range of the RSU. The proposed algorithm outperforms to serve requests whose deadline is about to expire i.e. vehicles which have left the service area after forwarding request to RSU. This scheme performs well in dense network and has good results in highway scenario.