By Topic

Path based routing algorithm for 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
$31 $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)
Zeng, W. ; Sch. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA ; Suda, T.

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.

Published in:

Computer Communications and Networks, 2004. ICCCN 2004. Proceedings. 13th International Conference on

Date of Conference:

11-13 Oct. 2004