Multiple Disjoint Paths Routing Using Implicit Source Routes in Wireless Ad Hoc Networks

In this paper, we propose a Multiple Disjoint Path (MDP) routing protocol to maximize network throughput and minimize the protocol overheads in wireless ad hoc networks. MDP consists of two components: virtual source routing and core heuristic. Virtual source routing constructs virtual paths that do not suffer from scalability, privacy and efficiency problems caused by long paths for DSR in large networks. Core heuristic is to ensure the efficiency of request packet propagation in route discovery operation. Our simulation results reveal that MDP performs at a satisfactory level in dense networks in terms of connectivity and transmission efficiency. Network resources can be utilized so that network throughput can be significantly increased at a cost of minimal protocol overheads comparatively.