The common issue of mobile ad-hoc network is rising with time and it is the optimal path selection between nodes. There is a process of improving the efficiency of routing and it has been advocated lately. According to this process a stable path is to be selected to lower the latency. The probability and availability of the routing path that sis usually subjected to failures of links due to the mobility of the nodes. Our aim on the issues where the nodes of the network move according to the model proposed by Random Direction.

It can allow to derive at the approximate and exact probabilities expression. On the availability of the path basis selecting f optimal route can help us to study the problem. Therefore finally we make an approach to enhance the reactive routing protocol’s efficiency.

In this paper we studied the probabilities of availability and duration of routing paths in MANETs. This is a main issue that enables in providing short and reliable route disruption times. By focusing on the meal of random direction we can able to derive at the approximate and exact expressions for the availability and the probability of the duration of the path. In the terms of route stability the used these derived results to determine the path of optimal.

For the most desirable number of hops we provide accurate and approximate expressions. We also showcased some of the optimal path properties and finally on the basis of our results we approach to selecting and discover routes that accounts the time taken for the transfer of data and also reduce the reactive routing protocols overhead. This is a well known approach and is widely in use. This proposed theory has taken a lot of time for being discovered and it is the most ideal way for route stability under random mobility model.