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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Yu, C. W., Wu, T. K., Cheng, R. H., & Chen, P. T. (2005). A low overhead Ad Hoc routing protocol with route recovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3794 LNCS, pp. 666–675). Springer Verlag. https://doi.org/10.1007/11599463_65
Mendeley helps you to discover research relevant for your work.