J.J. Park et al. (Eds.): GPC 2013, LNCS 7861, pp. 570–576, 2013. © Springer-Verlag Berlin Heidelberg 2013 Enhancements for Local Repair in AODV-Based Ad-Hoc Networks Hyun-Ho Shin 1 , Seungjin Lee 2 , and Byung-Seo Kim 2 1 Dept. of Telecommunication System, SamSung Electronics, Korea 2 Dept. of Computer and Information Communications Eng. Hongik University, Korea {hyunho1986,seungjin1230}@gmail.com, jsnbs@hongik.ac.kr Abstract. 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 perfor- mance evaluations for the proposed method will be provided in the upcoming works. Keywords: WRP, AODV, Ad-Hoc, Route-Recovery. 1 Introduction In a past decade, wireless ad-hoc networks have been extensively researched be-cause they have capabilities of self-configurable and self-healing, flexibility and scalability. As a results, applications based on wireless ad-hoc networks remarkably increase, for example, vehicular networks, Machine-to-Machine communications (M2M), internet of things, future tactical networks, public safety networks and so on [1][2]. The wire- less ad-hoc networks enable nodes to communicate over wireless multi-hop distances without any infrastructures. In order to implement this capability, the networks re- quire Wireless Routing Protocols (WRPs) to find the optimal multi-hop path from the source to the destination. One of the well-known WRPs is Ad-hoc On-demand Dis- tance Vector (AODV) routing protocol. While the protocol uses routing tables like routing protocols for wired networks, it searches the route only when it is needed, so that it reduce the overhead maintaining unnecessary route information [3]. Unlike conventional routing protocols used in the wired networks, WRPs are criti- cal to the overheads and channel conditions. Since the channel conditions and net- work topologies in the wireless networks have time-varying nature, the built routes are frequently broken and recovered. Therefore, in WRPs, how fast to detect and to recover the broken links are essential research area for WRPs as shown in [4]-[10]. The link breaks in [4] are detected by a data transmission failure in Medium Access