A new tree based double covered broadcast protocol for VANET

In vehicular ad hoc networks, many applications require a less delay and high packet delivery ratio. Many broadcast protocols have been widely discussed recently in this context. However, in some of them The selection procedure of the forwarding nodes is lengthy, and selects a large number of forwarding nodes and also the Large packet size, because of which traffic increases which leads to congestion and the problem of less delivery of packets. In order to decrease the forwarding nodes to a lesser amount and to increase packet delivery ratio we propose a mechanism which is based on tree approach rather that graphical approach. The Mechanism uses fixed length packets and guarantees that each node is either a forwarding node or covered by at least two forwarding nodes (not including the children nodes of this node). We also uses the basic shortest path tree technique to build a spanning tree with source node as the root among all network nodes and let the parent nodes do the forwarding and the non-parent nodes not. This mechanism achieves a low number of parent nodes, high packet delivery ratio, low control overhead, and short path lengths. We evaluate the proposed mechanism using both theoretical analysis and computer simulations.