In a city environment, the routing protocol is designed for VANET. Obtaining not only shortest path but the most efficient path for the packet to reach its destination is the main goal in VANET. Packets are routed through the fastest path rather than the shortest path. Fastest path is considered as the shortest time for the packet to reach destination irrespective distance. While the shortest path is the path that adopted by routing protocol to a network condition and performs routing accordingly. VANET have transported system which consists real-time vehicle safety estimated traffic condition on real-time dense vehicle network. A number of safety models in vehicle applications such as collision avoidance, lane management, and emergency braking assistance system fully depends on accurate and reliable knowledge of vehicles positioning their one-hop node area. In this paper presents, the performance of evaluation of Ad-Hoc On Demand Vector Routing (AODV) protocol in terms of energy consumption, packet delivery ratio, average end-to-end delay, packet loss. In our approach, we propose the VBFR algorithm to improve the performance of the cooperative positioning. In AODV, the node inside each hop is allowed to communicate themselves and RSU to reach their destination node. This system considers each vehicle get to communicate with nearest node and RSU to transmit or receive the message like the emergency or update their position and send RREQ to them and wait for RREP after selecting a one-hop node in a forward direction.