A low overhead dynamic route repairing mechanism for mobile ad hoc networks

Chang Wu Yu, Tung-Kuang Wu, Rei Heng Cheng

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Many routing protocols have been designed for ad hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60% of time. Simulation results also demonstrate that our protocol achieves better (or as good) in terms of the packet delivery rate, control packet overhead and communication delay than the major ad hoc routing protocols under light and moderate traffic conditions.

Original languageEnglish
Pages (from-to)1152-1163
Number of pages12
JournalComputer Communications
Volume30
Issue number5
DOIs
Publication statusPublished - 2007 Mar 8

Fingerprint

Mobile ad hoc networks
Network protocols
Ad hoc networks
Routing protocols
Communication
Routers
Telecommunication traffic
Wireless networks
Repair
Topology

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Yu, Chang Wu ; Wu, Tung-Kuang ; Cheng, Rei Heng. / A low overhead dynamic route repairing mechanism for mobile ad hoc networks. In: Computer Communications. 2007 ; Vol. 30, No. 5. pp. 1152-1163.
@article{b63e1f9ed8ce4d549681252358b59afe,
title = "A low overhead dynamic route repairing mechanism for mobile ad hoc networks",
abstract = "Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Many routing protocols have been designed for ad hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60{\%} of time. Simulation results also demonstrate that our protocol achieves better (or as good) in terms of the packet delivery rate, control packet overhead and communication delay than the major ad hoc routing protocols under light and moderate traffic conditions.",
author = "Yu, {Chang Wu} and Tung-Kuang Wu and Cheng, {Rei Heng}",
year = "2007",
month = "3",
day = "8",
doi = "10.1016/j.comcom.2006.12.008",
language = "English",
volume = "30",
pages = "1152--1163",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "5",

}

A low overhead dynamic route repairing mechanism for mobile ad hoc networks. / Yu, Chang Wu; Wu, Tung-Kuang; Cheng, Rei Heng.

In: Computer Communications, Vol. 30, No. 5, 08.03.2007, p. 1152-1163.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A low overhead dynamic route repairing mechanism for mobile ad hoc networks

AU - Yu, Chang Wu

AU - Wu, Tung-Kuang

AU - Cheng, Rei Heng

PY - 2007/3/8

Y1 - 2007/3/8

N2 - Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Many routing protocols have been designed for ad hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60% of time. Simulation results also demonstrate that our protocol achieves better (or as good) in terms of the packet delivery rate, control packet overhead and communication delay than the major ad hoc routing protocols under light and moderate traffic conditions.

AB - Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Many routing protocols have been designed for ad hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60% of time. Simulation results also demonstrate that our protocol achieves better (or as good) in terms of the packet delivery rate, control packet overhead and communication delay than the major ad hoc routing protocols under light and moderate traffic conditions.

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

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

U2 - 10.1016/j.comcom.2006.12.008

DO - 10.1016/j.comcom.2006.12.008

M3 - Article

VL - 30

SP - 1152

EP - 1163

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 5

ER -