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 |
| Pages | 666-675 |
| Number of pages | 10 |
| Publication status | Published - 2005 Dec 1 |
| 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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
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).