Enhancements for local repair in AODV-based ad-hoc networks

Citations

SCOPUS

1

초록

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.

키워드

Ad-Hoc; AODV; Route-Recovery; WRP; Ad hoc on demand distance vector; Ad-Hoc; AODV; AODV protocols; Local recoveries; Recovery process; Route-Recovery; WRP; Recovery; Repair; Ubiquitous computing; Routing protocols
제목
Enhancements for local repair in AODV-based ad-hoc networks
저자
Shin, H.-H.; Lee, S.; Kim, B.-S.
DOI
10.1007/978-3-642-38027-3_61
발행일
2013
유형
Conference Paper
저널명
Lecture Notes in Computer Science
권
7861 LNCS
페이지
570 ~ 576