Route recovery process of Ad-hoc On-demand Distance Vector (AODV) protocol has been extensively studied. However, the recovery process still requires long delays and overheads. In this paper, an enhanced method to perform quick local recovery process is proposed. In the proposed method, when a link is broken, a node detecting a link-break asks to neighbor nodes who can be a substitute for a node causing the link- break. If there is such a node, then the recovery is quickly and locally completed. The proposed method does not increase overhead to find the substitute comparing to the conventional AODV protocol. This paper provides only the idea at this time, but the performance evaluations for the proposed method will be provided in the upcoming works. © 2013 Springer-Verlag.
CITATION STYLE
Shin, H. H., Lee, S., & Kim, B. S. (2013). Enhancements for local repair in AODV-based ad-hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7861 LNCS, pp. 570–576). https://doi.org/10.1007/978-3-642-38027-3_61
Mendeley helps you to discover research relevant for your work.