Node Mobility Aware Routing for Mobile Ad Hoc Network

Shinichi FURUSHO; Teruaki KITASUKA; Tsuneo NAKANISHI; Akira FUKUDA

Node Mobility Aware Routing for Mobile Ad Hoc Network

Shinichi FURUSHO, Teruaki KITASUKA, Tsuneo NAKANISHI, Akira FUKUDA

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.7 pp.1926-1930

Publication Date: 2004/07/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section LETTER (Special Section on Next Generation Networks Software)

Category

Cite this

Copy

Shinichi FURUSHO, Teruaki KITASUKA, Tsuneo NAKANISHI, Akira FUKUDA, "Node Mobility Aware Routing for Mobile Ad Hoc Network" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 7, pp. 1926-1930, July 2004, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_7_1926/_p

Copy

@ARTICLE{e87-b_7_1926,
author={Shinichi FURUSHO, Teruaki KITASUKA, Tsuneo NAKANISHI, Akira FUKUDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Node Mobility Aware Routing for Mobile Ad Hoc Network},
year={2004},
volume={E87-B},
number={7},
pages={1926-1930},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Node Mobility Aware Routing for Mobile Ad Hoc Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1926
EP - 1930
AU - Shinichi FURUSHO
AU - Teruaki KITASUKA
AU - Tsuneo NAKANISHI
AU - Akira FUKUDA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2004
AB - 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.
ER -