Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 9 Big Island, Hawaii January 03-January 06 ISBN: 0-7695-2268-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.2005.67
Many routing protocols in mobile ad-hoc networks have been developed by many researchers. One of ad-hoc routing protocol types is the on-demand routing that establishes a route to a destination node only when required. But it is necessary to re-establish a new route when its route breaks down. However, most of on-demand routing protocols re-establish a new route after a route break.In this paper, we propose a new route maintenance algorithm to avoid route breaks because each intermediate node on an active route detects a danger of a link break to an upstream node and re-establishes a new route before a route break. We propose this algorithm based on AODV (Ad-hoc On-demand Distance Vector routing protocol) that is one of the routing protocols under study by the IETF MANET Working Group. Then, we evaluate the performance of our proposal by computer simulations.
Citation:
Masayuki Tauchi, Tetsuo Ideguchi, Takashi Okuda, "Ad-Hoc Routing Protocol Avoiding Route Breaks Based on AODV," hicss, vol. 9, pp.322a, Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 9, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||