Close category search window
 

Efficient on-demand routing for mobile ad-hoc wireless access 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

3 Author(s)
Joo-Han Song ; Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC, Canada ; Wong, V.W.S. ; Leung, V.C.M.

In this paper, we consider a mobile ad-hoc wireless access network in which mobile nodes can access the Internet via a stationary gateway node or access point. Mobile nodes that are outside the transmission range of the gateway can continue to communicate with the gateway via a multi-hop connection with their neighboring nodes. The ad-hoc on-demand distance vector (AODV) routing protocol is extended by incorporating the concept of load-balancing (LB). We call this the LB-AODV routing protocol. Simulation results show that in a congested network environment, our proposed LB-AODV has a higher packet delivery fraction, a lower end-to-end delay and control overhead when compared with both AODV and gossip-based routing protocols.

Published in:
Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE  (Volume:1 )

Date of Conference: 1-5 Dec. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.