Dynamic route switching protocol in mobile ad hoc networks

Kuo-Feng Ssu, Chih Hsun Chou, Chi Sheng Chiu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Due to limited bandwidth, “how to decrease routing overhead” is an important issue in mobile ad hoc networks. Several multipath routing protocols have been proposed to reduce the frequency of route discovery. However, in rapidly changed network topologies, some backup paths may be broken before a host uses them. Additionally, to obtain multiple loopfree paths, some protocols only select backup paths that are equal or shorter than the first found path. Longer routing paths are discarded even if they can stay available longer than the primary path. This paper presents a dynamic route switching protocol (DRSP) to locate more useful and longlived routing paths. The protocol not only considers node mobility but energy consumption also. Based on the prediction, expired backup paths are erased automatically so that the possibility of unsuccessful delivery can be reduced. The mobility prediction can also adjust appropriate transmission power. The DRSP protocol was implemented on ns-2 and evaluation results show that the DRSP outperformed AODV, DSR, and AOMDV.

Original languageEnglish
Pages (from-to)147-155
Number of pages9
JournalInternational Journal of Ad Hoc and Ubiquitous Computing
Volume1
Issue number3
DOIs
Publication statusPublished - 2006 Jan 1

Fingerprint

Mobile ad hoc networks
Network protocols
Power transmission
Routing protocols
Energy utilization
Topology
Bandwidth

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{eab6db2c19ce475cbe704ac8ff56d58f,
title = "Dynamic route switching protocol in mobile ad hoc networks",
abstract = "Due to limited bandwidth, “how to decrease routing overhead” is an important issue in mobile ad hoc networks. Several multipath routing protocols have been proposed to reduce the frequency of route discovery. However, in rapidly changed network topologies, some backup paths may be broken before a host uses them. Additionally, to obtain multiple loopfree paths, some protocols only select backup paths that are equal or shorter than the first found path. Longer routing paths are discarded even if they can stay available longer than the primary path. This paper presents a dynamic route switching protocol (DRSP) to locate more useful and longlived routing paths. The protocol not only considers node mobility but energy consumption also. Based on the prediction, expired backup paths are erased automatically so that the possibility of unsuccessful delivery can be reduced. The mobility prediction can also adjust appropriate transmission power. The DRSP protocol was implemented on ns-2 and evaluation results show that the DRSP outperformed AODV, DSR, and AOMDV.",
author = "Kuo-Feng Ssu and Chou, {Chih Hsun} and Chiu, {Chi Sheng}",
year = "2006",
month = "1",
day = "1",
doi = "10.1504/IJAHUC.2006.009884",
language = "English",
volume = "1",
pages = "147--155",
journal = "International Journal of Ad Hoc and Ubiquitous Computing",
issn = "1743-8225",
publisher = "Inderscience Enterprises Ltd",
number = "3",

}

Dynamic route switching protocol in mobile ad hoc networks. / Ssu, Kuo-Feng; Chou, Chih Hsun; Chiu, Chi Sheng.

In: International Journal of Ad Hoc and Ubiquitous Computing, Vol. 1, No. 3, 01.01.2006, p. 147-155.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dynamic route switching protocol in mobile ad hoc networks

AU - Ssu, Kuo-Feng

AU - Chou, Chih Hsun

AU - Chiu, Chi Sheng

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Due to limited bandwidth, “how to decrease routing overhead” is an important issue in mobile ad hoc networks. Several multipath routing protocols have been proposed to reduce the frequency of route discovery. However, in rapidly changed network topologies, some backup paths may be broken before a host uses them. Additionally, to obtain multiple loopfree paths, some protocols only select backup paths that are equal or shorter than the first found path. Longer routing paths are discarded even if they can stay available longer than the primary path. This paper presents a dynamic route switching protocol (DRSP) to locate more useful and longlived routing paths. The protocol not only considers node mobility but energy consumption also. Based on the prediction, expired backup paths are erased automatically so that the possibility of unsuccessful delivery can be reduced. The mobility prediction can also adjust appropriate transmission power. The DRSP protocol was implemented on ns-2 and evaluation results show that the DRSP outperformed AODV, DSR, and AOMDV.

AB - Due to limited bandwidth, “how to decrease routing overhead” is an important issue in mobile ad hoc networks. Several multipath routing protocols have been proposed to reduce the frequency of route discovery. However, in rapidly changed network topologies, some backup paths may be broken before a host uses them. Additionally, to obtain multiple loopfree paths, some protocols only select backup paths that are equal or shorter than the first found path. Longer routing paths are discarded even if they can stay available longer than the primary path. This paper presents a dynamic route switching protocol (DRSP) to locate more useful and longlived routing paths. The protocol not only considers node mobility but energy consumption also. Based on the prediction, expired backup paths are erased automatically so that the possibility of unsuccessful delivery can be reduced. The mobility prediction can also adjust appropriate transmission power. The DRSP protocol was implemented on ns-2 and evaluation results show that the DRSP outperformed AODV, DSR, and AOMDV.

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

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

U2 - 10.1504/IJAHUC.2006.009884

DO - 10.1504/IJAHUC.2006.009884

M3 - Article

VL - 1

SP - 147

EP - 155

JO - International Journal of Ad Hoc and Ubiquitous Computing

JF - International Journal of Ad Hoc and Ubiquitous Computing

SN - 1743-8225

IS - 3

ER -