Link stability, loading balance and power control based multi-path routing (SBPMR) algorithm in ad hoc wireless networks

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 co...

Full description

Saved in:
Bibliographic Details
Published in10th International Conference on Telecommunications, 2003. ICT 2003 Vol. 1; pp. 406 - 413 vol.1
Main Authors I-Shyan Hwang, Cheng-Ching Yeh, Chiung-Ying Wang
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
ISBN:0780376617
9780780376618
DOI:10.1109/ICTEL.2003.1191268