Eliminating Broadcast Storming in Vehicular Ad-Hoc Networks

Abstract

VANETs (Vehicular Ad-hoc Networks) offer diversity of appealing applications. A lot of applications offered by VANETs depend upon the propagation of messages from one vehicle to another vehicle in the network. Several algorithms for useful broadcasting of safety/ warning messages in the network have been presented by different researchers. Vehicles on roads are increasing day by day. Due to this increased number of vehicles and especially during the crest hours, when the networks become very dense, dissemination of the messages blindly in the network causes problems like packet collisions, data thrashing and broadcast storming. In this research, a relative speed based waiting time algorithm has been presented for avoiding broadcast storming problem in the VANETS especially in dense environment. This proposed algorithm calculates the waiting time for each vehicle after receiving the safety/ warning messages according to the relative speed of the vehicles, the distance between the vehicles and range of vehicles. The results show that the proposed relative speed based algorithm is better than already existing algorithms like blind flooding and dynamically broadcasting waiting time algorithm which uses number of neighbors and distance between the vehicles for calculating the waiting time.