Node mobility aware routing for mobile ad hoc network

Shinichi Furusho, Teruaki Kitasuka, Tsuneo Nakanishi, Akira Fukuda

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)1926-1930
Number of pages5
JournalIEICE Transactions on Communications
VolumeE87-B
Issue number7
Publication statusPublished - Jul 2004

Fingerprint

Mobile ad hoc networks
Routing algorithms

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Furusho, S., Kitasuka, T., Nakanishi, T., & Fukuda, A. (2004). Node mobility aware routing for mobile ad hoc network. IEICE Transactions on Communications, E87-B(7), 1926-1930.

Node mobility aware routing for mobile ad hoc network. / Furusho, Shinichi; Kitasuka, Teruaki; Nakanishi, Tsuneo; Fukuda, Akira.

In: IEICE Transactions on Communications, Vol. E87-B, No. 7, 07.2004, p. 1926-1930.

Research output: Contribution to journalArticle

Furusho, S, Kitasuka, T, Nakanishi, T & Fukuda, A 2004, 'Node mobility aware routing for mobile ad hoc network', IEICE Transactions on Communications, vol. E87-B, no. 7, pp. 1926-1930.
Furusho S, Kitasuka T, Nakanishi T, Fukuda A. Node mobility aware routing for mobile ad hoc network. IEICE Transactions on Communications. 2004 Jul;E87-B(7):1926-1930.
Furusho, Shinichi ; Kitasuka, Teruaki ; Nakanishi, Tsuneo ; Fukuda, Akira. / Node mobility aware routing for mobile ad hoc network. In: IEICE Transactions on Communications. 2004 ; Vol. E87-B, No. 7. pp. 1926-1930.
@article{4d902390e6694f36a7f5b7de35919697,
title = "Node mobility aware routing for mobile ad hoc network",
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.",
author = "Shinichi Furusho and Teruaki Kitasuka and Tsuneo Nakanishi and Akira Fukuda",
year = "2004",
month = "7",
language = "English",
volume = "E87-B",
pages = "1926--1930",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Node mobility aware routing for mobile ad hoc network

AU - Furusho, Shinichi

AU - Kitasuka, Teruaki

AU - Nakanishi, Tsuneo

AU - Fukuda, Akira

PY - 2004/7

Y1 - 2004/7

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

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.

UR - http://www.scopus.com/inward/record.url?scp=3142712236&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3142712236&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:3142712236

VL - E87-B

SP - 1926

EP - 1930

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 7

ER -