Mobility Based Algorithm for Mobile Ad-hoc Network

Shinichi Furusho, Teruaki Kitasuka, Tsuneo Nakanishi, Akira Fukuda

Research output: Contribution to conferencePaper

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 initiator must do rerouting to discover an alternate route. Many packets generated by these processes cause packet congestion and apply load on nodes. Those degrade network performance. It is important to construct a stable route when route discovery. 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, our proposing algorithm can reduce route breaks: 3.1 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18.5 % higher rate.

Original languageEnglish
Pages334-337
Number of pages4
Publication statusPublished - Nov 7 2003
Event2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada
Duration: Aug 28 2003Aug 30 2003

Other

Other2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
CountryCanada
CityVictoria, B.C.
Period8/28/038/30/03

Fingerprint

Routing algorithms
Mobile ad hoc networks
Network performance

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Furusho, S., Kitasuka, T., Nakanishi, T., & Fukuda, A. (2003). Mobility Based Algorithm for Mobile Ad-hoc Network. 334-337. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

Mobility Based Algorithm for Mobile Ad-hoc Network. / Furusho, Shinichi; Kitasuka, Teruaki; Nakanishi, Tsuneo; Fukuda, Akira.

2003. 334-337 Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

Research output: Contribution to conferencePaper

Furusho, S, Kitasuka, T, Nakanishi, T & Fukuda, A 2003, 'Mobility Based Algorithm for Mobile Ad-hoc Network' Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada, 8/28/03 - 8/30/03, pp. 334-337.
Furusho S, Kitasuka T, Nakanishi T, Fukuda A. Mobility Based Algorithm for Mobile Ad-hoc Network. 2003. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.
Furusho, Shinichi ; Kitasuka, Teruaki ; Nakanishi, Tsuneo ; Fukuda, Akira. / Mobility Based Algorithm for Mobile Ad-hoc Network. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.4 p.
@conference{ae7060c223ad458fb31b7e108e2282bd,
title = "Mobility Based Algorithm 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 initiator must do rerouting to discover an alternate route. Many packets generated by these processes cause packet congestion and apply load on nodes. Those degrade network performance. It is important to construct a stable route when route discovery. 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, our proposing algorithm can reduce route breaks: 3.1 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18.5 {\%} higher rate.",
author = "Shinichi Furusho and Teruaki Kitasuka and Tsuneo Nakanishi and Akira Fukuda",
year = "2003",
month = "11",
day = "7",
language = "English",
pages = "334--337",
note = "2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) ; Conference date: 28-08-2003 Through 30-08-2003",

}

TY - CONF

T1 - Mobility Based Algorithm for Mobile Ad-hoc Network

AU - Furusho, Shinichi

AU - Kitasuka, Teruaki

AU - Nakanishi, Tsuneo

AU - Fukuda, Akira

PY - 2003/11/7

Y1 - 2003/11/7

N2 - In ad-hoc On-demand routing algorithm, when a route is broken a relay node must perform error transaction and the initiator must do rerouting to discover an alternate route. Many packets generated by these processes cause packet congestion and apply load on nodes. Those degrade network performance. It is important to construct a stable route when route discovery. 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, our proposing algorithm can reduce route breaks: 3.1 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18.5 % higher rate.

AB - In ad-hoc On-demand routing algorithm, when a route is broken a relay node must perform error transaction and the initiator must do rerouting to discover an alternate route. Many packets generated by these processes cause packet congestion and apply load on nodes. Those degrade network performance. It is important to construct a stable route when route discovery. 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, our proposing algorithm can reduce route breaks: 3.1 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18.5 % higher rate.

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

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

M3 - Paper

SP - 334

EP - 337

ER -