Node synchronization based redundant routing for mobile ad-hoc networks

Wonjong Noh, Yunkuk Kim, Sun-Shin An

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper proposes a new on-demand redundant-path routing protocol considering node synchronization based path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward the destination by involving intermediate nodes with relatively mode adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulations using the Network Simulator 2 (ns-2).

Original languageEnglish
Pages (from-to)365-370
Number of pages6
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2928
Publication statusPublished - 2003 Dec 1

Fingerprint

Mobile ad hoc networks
Mobile Ad Hoc Networks
Patient Selection
Redundancy
Synchronization
Routing
Path
Traffic control
Vertex of a graph
Routing protocols
Simulators
Traffic Control
Reconfiguration
Routing Protocol
Reachability
Simulator
Adjacent
Imply
Series
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{d442e60838d340f48a394c6ab75d5274,
title = "Node synchronization based redundant routing for mobile ad-hoc networks",
abstract = "This paper proposes a new on-demand redundant-path routing protocol considering node synchronization based path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward the destination by involving intermediate nodes with relatively mode adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulations using the Network Simulator 2 (ns-2).",
author = "Wonjong Noh and Yunkuk Kim and Sun-Shin An",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2928",
pages = "365--370",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Node synchronization based redundant routing for mobile ad-hoc networks

AU - Noh, Wonjong

AU - Kim, Yunkuk

AU - An, Sun-Shin

PY - 2003/12/1

Y1 - 2003/12/1

N2 - This paper proposes a new on-demand redundant-path routing protocol considering node synchronization based path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward the destination by involving intermediate nodes with relatively mode adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulations using the Network Simulator 2 (ns-2).

AB - This paper proposes a new on-demand redundant-path routing protocol considering node synchronization based path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward the destination by involving intermediate nodes with relatively mode adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulations using the Network Simulator 2 (ns-2).

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

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

M3 - Article

VL - 2928

SP - 365

EP - 370

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -