A Self-Repair Algorithm for Ad Hoc On-Demand Distance Vector Routing
In this paper we propose SRAODV, a self-repair algorithm for Ad Hoc on-demand distance vector routing in mobile Ad Hoc networks. Due to the ever changing topology and limited bandwidth, it is very hard to maintain good routes, and link break is frequently occurred in mobile Ad Hoc networks. In AODV, the source node broadcasts RREQ message to find a new route to the destination when the link break is occurred. As an improvement of AODV, SRAODV takes the intermediate node, which detects the link break, to repair the break route. Once the intermediate node cannot repair the route in time, the backward pre-hop node tends to find a new route instead. Obviously, the routing mechanism in the worst situation of the new algorithm is AODV, the source node finding a new route to the destination again. Simulations results show that SRAODV improves the throughput and decreases the latency of package delivery. And it is quite suitable for such a dynamic network.
Ad Hoc networks AODV Self-Repair
Jing Feng Huaibei Zhou
Computer School,Wuhan University,Wuhan,China;Advanced Research Center for Sci.and Tech.,Wuhan Univer International School of Software,Wuhan University,Wuhan,China;Advanced Research Center for Sci.and T
国际会议
武汉
英文
2006-09-01（万方平台首次上网日期，不代表论文的发表时间）