ε-optimal approximation scheme for on-demand multipath routing in ad hoc networks

We present and verify the epsilon-optimal approximation scheme for On-demand Multipath Routing in Ad hoc networks (epsilon-AOMDV), an extension to the well-studied Ad hoc On Distance Vector (AODV). By introducing the hop count limiting parameter -epsilon, we modify the route update conditions and route discovery processes. The proposed protocol selects and maintains the multiple paths that are shorter than epsilon multiple of the length of the advertised shortest route an satisfy the bandwidth requirement. The performance of epsilon - AOMDV is compared against that of AODV and AOMDV. The simulation results show that the proposed protocol is able to achieve a remarkable improvement in the end-to-end delay and packet delivery ratio.