Path based routing algorithm for ad hoc networks

In reactive routing protocols for ad hoc networks, the network wide flooding generates a significant amount of traffic overhead. The goal of This work is to reduce this overhead. We propose a path based route discovery scheme which can find a route to the destination with lower overhead than flooding-based route discovery. We also showed that the probability of finding a path to the destination by using path based routing request is not negligible. The path obtained through path based routing request may be far from optimal. Thus, we propose a route expanding scheme which can discover a better path based on the path discovered in path based routing discovery phase. By simulation, we showed that integrating these two schemes has better performance than existing reactive routing protocols like DSR.