A backup path finding scheme using one-hop search in ad hoc networks

This paper suggests a backup path setup and routing scheme for ad hoc networks. A data path is established by on-demand manner. Intermediate nodes of the established path have a routing table that has next node information for sending data packets. The primary and backup paths are made as a sequence of route control message exchange process. A backup path is a link-disjoint with the primary path, and can protect node failure by setup options. After detecting a link or node failure, a restoration procedure occurs in each node of the primary path. Proposed scheme uses a one-hop pre-search for finding a backup path. Simulation results show that the proposed backup path scheme has better outputs in success ratio of finding backup path, the length of the backup path, and restoration ratio.