A low overhead Ad Hoc routing protocol with route recovery

Chang Wu Yu; Tung Kuang Wu; Rei Heng Cheng; Po Tsang Chen

doi:10.1007/11599463_65

A low overhead Ad Hoc routing protocol with route recovery

Chang Wu Yu, Tung Kuang Wu, Rei Heng Cheng, Po Tsang Chen

Department of Information Management

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

1 Citation (Scopus)

Abstract

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 the 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. Experimental results show that our protocol finds a backup route around 50% of cases and achieve better (or as good) in term of the packet delivery rate than the major Ad Hoc routing protocols, but with much less overhead.

Original language	English
Title of host publication	Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings
Publisher	Springer Verlag
Pages	666-675
Number of pages	10
ISBN (Print)	3540308563, 9783540308560
DOIs	https://doi.org/10.1007/11599463_65
Publication status	Published - 2005
Event	1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005 - Wuhan, China Duration: 2005 Dec 13 → 2005 Dec 15

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3794 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005
Country	China
City	Wuhan
Period	05-12-13 → 05-12-15

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11599463_65

Fingerprint Dive into the research topics of 'A low overhead Ad Hoc routing protocol with route recovery'. Together they form a unique fingerprint.

Cite this

Yu, C. W., Wu, T. K., Cheng, R. H., & Chen, P. T. (2005). A low overhead Ad Hoc routing protocol with route recovery. In Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings (pp. 666-675). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3794 LNCS). Springer Verlag. https://doi.org/10.1007/11599463_65

Yu, Chang Wu ; Wu, Tung Kuang ; Cheng, Rei Heng ; Chen, Po Tsang. / A low overhead Ad Hoc routing protocol with route recovery. Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings. Springer Verlag, 2005. pp. 666-675 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{913943b4715d430c912ba0c66fc766c5,

title = "A low overhead Ad Hoc routing protocol with route recovery",

abstract = "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 the 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. Experimental results show that our protocol finds a backup route around 50% of cases and achieve better (or as good) in term of the packet delivery rate than the major Ad Hoc routing protocols, but with much less overhead.",

author = "Yu, {Chang Wu} and Wu, {Tung Kuang} and Cheng, {Rei Heng} and Chen, {Po Tsang}",

year = "2005",

doi = "10.1007/11599463_65",

language = "English",

isbn = "3540308563",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "666--675",

booktitle = "Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings",

address = "Germany",

note = "1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005 ; Conference date: 13-12-2005 Through 15-12-2005",

}

Yu, CW, Wu, TK, Cheng, RH & Chen, PT 2005, A low overhead Ad Hoc routing protocol with route recovery. in Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3794 LNCS, Springer Verlag, pp. 666-675, 1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005, Wuhan, China, 05-12-13. https://doi.org/10.1007/11599463_65

A low overhead Ad Hoc routing protocol with route recovery. / Yu, Chang Wu; Wu, Tung Kuang; Cheng, Rei Heng; Chen, Po Tsang.

Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings. Springer Verlag, 2005. p. 666-675 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3794 LNCS).

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

TY - GEN

T1 - A low overhead Ad Hoc routing protocol with route recovery

AU - Yu, Chang Wu

AU - Wu, Tung Kuang

AU - Cheng, Rei Heng

AU - Chen, Po Tsang

PY - 2005

Y1 - 2005

N2 - 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 the 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. Experimental results show that our protocol finds a backup route around 50% of cases and achieve better (or as good) in term of the packet delivery rate than the major Ad Hoc routing protocols, but with much less overhead.

AB - 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 the 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. Experimental results show that our protocol finds a backup route around 50% of cases and achieve better (or as good) in term of the packet delivery rate than the major Ad Hoc routing protocols, but with much less overhead.

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

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

U2 - 10.1007/11599463_65

DO - 10.1007/11599463_65

M3 - Conference contribution

AN - SCOPUS:33646850194

SN - 3540308563

SN - 9783540308560

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

SP - 666

EP - 675

BT - Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings

PB - Springer Verlag

T2 - 1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005

Y2 - 13 December 2005 through 15 December 2005

ER -

Yu CW, Wu TK, Cheng RH, Chen PT. A low overhead Ad Hoc routing protocol with route recovery. In Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings. Springer Verlag. 2005. p. 666-675. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11599463_65