By Topic

A path compression technique for on-demand ad-hoc routing protocols

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

3 Author(s)
Giruka, V.C. ; Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA ; Singhal, M. ; Yarravarapu, S.P.

Ad-hoc on-demand routing protocols like AODV establish and maintain routes on-demand. However, the paths established by on-demand protocols, which are optimal during the route establishment phase, become sub-optimal over time due to node mobility. We propose a path compression algorithm (PCA) that optimizes the established routes when feasible without incurring extra overhead. By utilizing a promiscuous mode of operation, nodes 'hear' hop counts embedded in the IP optional header of data packets to find shorter paths. PCA avoids unnecessary aggressive and ephemeral route updates, which improves the protocol performance. Routing path optimality is important as the optimal path reduces the packet drop ratio, the end-to-end delay, and the energy dissipation of end-to-end data transmission. We conducted simulations using GloMoSim to evaluate the performance of our algorithm and compared it with AODV and a related protocol in the literature - SHORT. Our simulation results show that PCA achieves high delivery rate, low control overhead, low end-to-end delivery and low average hop count compared to both AODV and SHORT.

Published in:

Mobile Ad-hoc and Sensor Systems, 2004 IEEE International Conference on

Date of Conference:

25-27 Oct. 2004