Abstract: Mobile Ad Hoc Network (MANET) is an autonomous system of functionally equivalent mobile nodes, which must be able to communicate while moving, without any kind of wired infrastructure. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host�s wireless transmissions. To this end, mobile nodes must cooperate to provide the routing service. Routing in mobile environment is challenging due to the constraints existing on the resources (transmission bandwidth CPU time and battery power) and the required ability of the protocol to effectively track topological changes. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be robust, simple and energy conserving. Efficient, dynamic routing is also one of the key challenges in this network. In recent past, this problem has been addressed by several research efforts, resulting in a large body of literature. Each node participating in the network acts both as host and a router and must therefore be willing to forward packets for other nodes. For this purpose, a number of routing protocols like Dynamic Source Routing (DSR) Protocol, Ad Hoc On-Demand Distance Vector (AODV) Routing, Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Algorithm (TORA) have been implemented. This study presents a new on demand protocol for routing in ad hoc networks that selects a route of smallest hop count and consisting of nodes in a non-existing path. Our protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. The path selection method used in this protocol always prefers to a route with more non-forwarding nodes and provides the solution to cope with network mobility by selecting route efficiently. Our route finding protocol provides loop free routes even while able to repair broken links. Because the protocol does not require global periodic routing advertisements the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that require such advertisements. Nevertheless, we can still maintain most of the advantages of basic Distance vector routing mechanisms. Our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also point out future research issues in the context of individual routing approaches as well as from the overall system perspective.