Route hitting probability for a class of ad hoc routing protocols

We compute the probability that a path is discovered by a class of reactive routing protocols which we denote as random reactive protocols. These reactive protocols do not flood the network, but attempt to find a path from the source to the destination by sending a packet to a destination chosen randomly. Several protocols, including VRR or AODV-NF can be included in this class. We compute the route hitting probability for such packet, namely the probability that the packet will encounter a node which has a path to the destination. We analytically model the performance of a route discovery scheme which does not rely on flooding to find the connection destination, and show that such system is theoretically promising.