Close category search window
 

Link stability, loading balance and power control based multi-path routing (SBPMR) algorithm in ad hoc wireless 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)
I-Shyan Hwang ; Dept. of Comput. Eng. & Sci., Yuan-Ze Univ., Chung-li, Taiwan ; Cheng-Ching Yeh ; Chiung-Ying Wang

Ad hoc wireless networks are well known to have a high overhead and experience frequent routing failures because mobile hosts have rapidly changing topologies. This paper presents a novel SBPMR algorithm to solve these problems. Of particular emphasis is the link stability, loading balance, power control and multi-path routing to ensure reliable transmission. Based on the above considerations, route discovery, a reply procedure, and a route maintenance scheme are established according to the principles of cost computing to establish reliable, loading balance and multi-path routing. The link stable based method use GPS technology to determine the position of the host and the speed of motion, and uses RREQ to forward nodal information to neighboring hosts to determine their next positions. Then, the Time To Live (TTL), which influences the link stability within the transmission range between two hosts, is acquired. The loading balance routing method evaluates the number of forwarding paths for which each host is responsible. The proposed multi-path routing guarantees that each pair of the source host and the destination host has no more than three routing paths to prevent single path routing requests from having to be resent when the routing path breaks down, reducing overhead and the amount of network traffic.

Published in:
Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:1 )

Date of Conference: 23 Feb.-1 March 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.