Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increases of end-to-end delay and routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a main route fails. Generally, the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when nodes move rapidly in the network. But when the nodes don't move rapidly, the backup routing schemes generate higher routing traffic than the single-path routing schemes, because they need to exchange packets to find backup routes. In this paper, we proposed RBR (Reactive Backup Routing) algorithm which provides more stable data delivery than the previous backup routing schemes through the backup route re-discovery phase and the selective maintenance of backup routes. RBR also decreases routing overheads by maintaining backup routes selectively. In order to evaluate the performance, OPNET simulator was used to compare the proposed RBR with the single-path routing scheme and some of the well known backup routing schemes.
展开▼
