Mobility based algorithm for mobile ad-hoc network

Author

Furusho, Shinichi ; Kitasuka, Teruaki ; Nakanishi, Tsuneo ; Fukuda, Akira

Author_Institution

Graduate Sch. of Inf. Sci. & Electr. Eng., Kyushu Univ., Fukuoka, Japan

Volume

1

fYear

2003

fDate

28-30 Aug. 2003

Firstpage

334

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.

Keywords

ad hoc networks; mobile radio; telecommunication network routing; telecommunication traffic; error transaction; mobile ad-hoc network; mobility based algorithm; node mobility; on-demand routing; packet congestion; relay node; Ad hoc networks; Cities and towns; Communication system control; Computational modeling; Data communication; Information science; Large scale integration; Mobile computing; Relays; Routing protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Computers and signal Processing, 2003. PACRIM. 2003 IEEE Pacific Rim Conference on

Print_ISBN

0-7803-7978-0

Type

conf

DOI

10.1109/PACRIM.2003.1235785

Filename

1235785