Caching-Based Multipath Routing Protocol

Mobility of nodes and unreliability of wireless channel complicate the task of routing data in mobile ad hoc networks. Using multiple paths for routing instead of just one is an interesting approach to this problem, with the advantage of greater path availability at the cost of higher routing overhead. Existing multipath routing protocols generally involve the destination node in decisions about the multiple paths that are determined on-demand, which causes avoidable over-head. In this paper, we propose a caching-based multi-path routing (CMR) protocol for mobile ad hoc net-works and show that the process of finding new multiple paths can be improved if routes at neighbor nodes are judiciously reused and involvement of destination node is reduced. The proposed protocol derives from analyzing the route information stored at neighbor nodes to generate a set of disjoint multiple routes. Consequently, routing overhead is reduced and better throughput is obtained.