Maximizing Path Durations in Mobile Ad-Hoc Networks

The authors study the problem of path selection in mobile ad-hoc networks. Based on the earlier results the authors propose a novel scheme that maximizes the expected durations of selected paths and 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. The authors evaluate the performance of the proposed scheme using ns-2 simulation and show that it yields a significant improvement in path durations.