By Topic

Maximizing Path Durations in Mobile Ad-Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yijie Han ; University of Maryland, College Park, ; Richard J. La

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.

Published in:

2006 40th Annual Conference on Information Sciences and Systems

Date of Conference:

22-24 March 2006