Distributive Aware Probabilistic Back Propagation (DAPBP) Routing Scheme for Vehicular Networks

There are many broadcast methods developed for vehicular networks to know information about the neighbors and to transmit useful data to other vehicles. As the conventional schemes suffer with broadcast storm problem, we have proposed new distribution aware probabilistic back propagation routing scheme. This routing scheme is developed based upon the distribution of the vehicles with probabilistic and backward propagation of the packet. In this mechanism, timer is set to forward the packet based on the probabilistic nature of the distribution of the vehicles and redundant nodes are refrained using backward propagation factor. The assumption was made that all vehicles know its surrounding information like speed and position by periodically sending the location information packet. This protocol reduces redundancy up to 80% and ensures the availability of the nodes as double in high dense and velocity scenario. Using the simulation method, detailed algorithm is implemented. We compared proposed routing scheme with conventional schemes. Our results ensure better performance in two factors: (1) Retransmission saving per node: it is related to the redundancy (unwanted transmission of same messages), (2) availability of the retransmission nodes: it ensures the packet delivery and link stability at high dynamic behavior.