A Routing ID-based Node-disjoint Multipath Scheme for Ad Hoc Networks

Abstract

In ad hoc networks, many single-path-based routing methods have been proposed. With the single-path-based method, when route breakages occur, it is necessary to repair the route in each route break. As a countermeasures this, multipath routing methods have been proposed. Multiple paths employ two countermeasures: load balancing and detours. In general, the multipath routing method can generate a large number of control packets. Meanwhile, Source initiated tree-based Routing ID Routing (SRIDR) has been proposed as a multipath routing method to limit the number of control packets by using the routing ID. However, SRIDR does not ensure that the multiple paths are disjointed each other. In this paper, we propose a new node-disjoint multipath routing method, which is based on SRIDR. We have implemented our proposed method. We also have conducted simulation experiments with respect to the average number of node-disjoint paths, the time for discovering multiple paths, and the total bytes of control packets. We have confirmed that our proposed method increases the average number of paths as the network size increases. In addition, we have confirmed that our proposed method's total bytes of control packets are less than those of the existing method, MP-OLSR.