A Collective Scheduling Algorithm for Vehicular Ad Hoc Network

Vehicular ad hoc network deals with traffic congestions. It also ensures the safety and convenience of drivers and passengers. Safety is one of the most important aspects in VANETs, and to make it safe and reliable, its performance needs to be enhanced. To enhance the performance, there is a need to control the congestion. In the high-density region, congestion control becomes a challenging task and special characteristics of VANETs (e.g. high rate of topology changes, high mobility) make it more challenging. In this paper, collective scheduling strategy is proposed. In this strategy, priority of the message is defined which mainly depends on three factors, i.e. size of messages, type of messages and state of networks. Based on these factors, messages priorities are calculated and then these messages are scheduled. Collective scheduling uses the concept of clustering while assigning priority of information. Simulation is carried out to demonstrate improvement in comparison with collective scheduling with tabu search scheduling.