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.

[1]  Sean P. Meyn,et al.  The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning , 2000, SIAM J. Control. Optim..

[2]  Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue , 2006, Comput. Networks.

[3]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  Yijie Han,et al.  Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[5]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[6]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[7]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .