Multi-path ad hoc routing considering path redundancy

Sangkyung Kim; Wonjong Noh; Sunshin An

doi:10.1109/ISCC.2003.1214099

Multi-path ad hoc routing considering path redundancy

Sangkyung Kim, Wonjong Noh, Sunshin An

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

13 Citations (Scopus)

Abstract

This paper proposes a new on-demand multi-path routing protocol considering path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on 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 rediscoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulation using the network simulator 2 (ns-2).

Original language	English
Title of host publication	Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003
Pages	45-50
Number of pages	6
DOIs	https://doi.org/10.1109/ISCC.2003.1214099
Publication status	Published - 2003
Event	8th IEEE International Symposium on Computers and Communication, ISCC 2003 - Kemer-Antalya, Turkey Duration: 2003 Jun 30 → 2003 Jul 3

Publication series

Name	Proceedings - IEEE Symposium on Computers and Communications
ISSN (Print)	1530-1346

Other

Other	8th IEEE International Symposium on Computers and Communication, ISCC 2003
Country/Territory	Turkey
City	Kemer-Antalya
Period	03/6/30 → 03/7/3

Keywords

Mobile ad hoc network
On-demand ad hoc routing
Redundancy based routing

ASJC Scopus subject areas

Software
Signal Processing
General Mathematics
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1109/ISCC.2003.1214099

Cite this

Kim, S, Noh, W & An, S 2003, Multi-path ad hoc routing considering path redundancy. in Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003., 1214099, Proceedings - IEEE Symposium on Computers and Communications, pp. 45-50, 8th IEEE International Symposium on Computers and Communication, ISCC 2003, Kemer-Antalya, Turkey, 03/6/30. https://doi.org/10.1109/ISCC.2003.1214099

@inproceedings{89a81a44bd004dd3b535113a8f0a02e2,

title = "Multi-path ad hoc routing considering path redundancy",

abstract = "This paper proposes a new on-demand multi-path routing protocol considering path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on 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 rediscoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulation using the network simulator 2 (ns-2).",

keywords = "Mobile ad hoc network, On-demand ad hoc routing, Redundancy based routing",

author = "Sangkyung Kim and Wonjong Noh and Sunshin An",

year = "2003",

doi = "10.1109/ISCC.2003.1214099",

language = "English",

isbn = "076951961X",

series = "Proceedings - IEEE Symposium on Computers and Communications",

pages = "45--50",

booktitle = "Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003",

}

TY - GEN

T1 - Multi-path ad hoc routing considering path redundancy

AU - Kim, Sangkyung

AU - Noh, Wonjong

AU - An, Sunshin

PY - 2003

Y1 - 2003

N2 - This paper proposes a new on-demand multi-path routing protocol considering path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on 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 rediscoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulation using the network simulator 2 (ns-2).

AB - This paper proposes a new on-demand multi-path routing protocol considering path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on 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 rediscoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulation using the network simulator 2 (ns-2).

KW - Mobile ad hoc network

KW - On-demand ad hoc routing

KW - Redundancy based routing

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

U2 - 10.1109/ISCC.2003.1214099

DO - 10.1109/ISCC.2003.1214099

M3 - Conference contribution

AN - SCOPUS:84883853533

SN - 076951961X

SN - 9780769519616

T3 - Proceedings - IEEE Symposium on Computers and Communications

SP - 45

EP - 50

BT - Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003

T2 - 8th IEEE International Symposium on Computers and Communication, ISCC 2003

Y2 - 30 June 2003 through 3 July 2003

ER -

Multi-path ad hoc routing considering path redundancy

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this