Maximizing Path Durations in Mobile Ad-Hoc Networks

We study the problem of path selection in mobile ad-hoc networks. Based on our earlier results we propose a novel scheme that (i) maximizes the expected durations of selected paths and (ii) performs local path recovery by computing the probability a cached alternative path is still available in the event of a failure of a primary path in use. We evaluate the performance of our proposed scheme using ns-2 simulation and show that it yields a significant improvement in path durations.