Node Mobility Aware Routing for Mobile Ad Hoc Network

Shinichi FURUSHO  Teruaki KITASUKA  Tsuneo NAKANISHI  Akira FUKUDA  

IEICE TRANSACTIONS on Communications   Vol.E87-B   No.7   pp.1926-1930
Publication Date: 2004/07/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: Special Section LETTER (Special Section on Next Generation Networks Software)
relative speed,  ad hoc network,  routing protocol,  DSR,  

Full Text: PDF>>
Buy this Article

In ad-hoc on-demand routing algorithm, when a route is broken a relay node must perform error transaction and the source node must do rerouting to discover an alternate route. It is important to construct a stable route when route discovery occurs. In this paper, we use relative speeds among nodes as a measure of node mobility. Our routing algorithm chooses nodes of lower relative speed as relay nodes. As a result of our simulation, when there is one session in the network, our proposing algorithm can reduce the number of route breaks: about 3 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18% higher rate. However, in the congested traffic situation our algorithm should be improved.