Abstract-- The day by day size of city and number of vehicle on the road rapidly increasing, so vehicle to vehicle (V2V) communication networks size keeps on increasing. Vehicle consists of nodes which can act as host as well as router. With the high speed movement of vehicles the configuration of network keeps on changing. So new issues in dynamically change of scenario of routes: one has to devise for appropriate mechanisms, and deployment for determining new routes for vehicle to vehicle communication. In this paper we propose conceptually a routing protocol for VANETs for minimizing time for searching process for new routes as well as minimize the overhead consequently and improving the performance of VANETs. KEYWORDS: VANETs, Backtracking, overhead, V2V I. INTRODUCTION In VANETs, vehicle to vehicle (V2V) reside in a peer to peer fashion and it is connected to each other through single hop as well as multi hop paths. Basically each vehicle acts as an autonomous body in VANETs and these vehicles are involved in route search and route management process. In VANETs V2V communication don’t have a fixed infrastructure because random motion of vehicles. Mobile adhoc networks (MANETs) nodes are connected single hop as well as multihop communication path but vehicular adhoc networks nodes are connected single hop, multihop or vehicles are directly connected road side unit. The topology of the vehicular networks keeps on changing very rapidly so calls for new routes and these further demands for increasing maintenance overhead. However maintaining and discovery of routes is always very difficult task because it is not only the destination node changing its location but also the source node also changing location and in this scenario it again has to deploy from beginning a destination discovery process for finding out a new routing path. Also the path from destination to source in reply process is dynamic which call for similar attention. The routing protocols in vehicle to vehicle communication are based on push-pull strategies which involve greater routing and control packets overhead. This is possible only when enhanced bandwidth which in turn degrades the throughput of overall system. Therefore the effective bandwidth utilization is of prime concern and maintain throughput of all system. Various routing protocols have been devised which have been categorized in three types namely Table Driven Routing, On Demand Routing and Hybrid Routing protocols. Table Driven Routing Involves periodical maintenance of table and this incorporates additional overhead other than routing issues. On Demand Routing don’t need to maintain the tables which reduce the overhead of table maintenance but Packets are communicated in request reply fashion which considerably wastes network bandwidth. In On Demand routing protocol the searching process for new routes is time taking. Hybrid Routing incorporate the better features of both the On Demand and Table Driven Routing protocol. This helps in high level scalability of adhoc networks. The main objective of this paper is to minimize time for searching process for new routes as well as minimize the overheads involved in route discovery and there after route maintenance.. After this introduction we have given related work in section 2, proposed routing protocol in section 3, performance analysis in section 4 and finally the conclusion and future work in last section 5. II. RELATED WORK Routing is a process of sending data packets from source node to destination node, therefore routing in vehicular ad-hoc networks is a critical issue because rate of link failure is high when node is moving fast. we introduce some design goal of routing protocol, first is minimum control of overhead, second is minimum processing of overhead, third is multi-hop routing capability, fourth is dynamic topology maintenance and fifth is distributed routing approach and last scalability, security and quality of service (QoS) etc. Any single protocol not well works in all environments. There are a number of routing protocols existing in various networks such as AODV (Ad-hoc On Demand Distance Vector routing), DSR (Dynamic Source Routing), DSDV (Destination Sequenced Distance Vector routing), FSR (Fisheye State Routing) and some protocols regarding Minimize Delay based Routing Protocol (MDRP) for V2V Communication in VANETs Babu Ram and Dr. Neelendra Badal Department of Computer Science & Engineering KNIT, Sultanpur, India Baburam748@gmail.com, n_badal@hotmail.com International Journal of Computer Science and Information Security (IJCSIS), Vol. 15, No. 4, April 2017 264 https://sites.google.com/site/ijcsis/ ISSN 1947-5500