Optimizations To Multipath Routing Protocols In Mobile Ad hoc Networks

Mobile Ad hoc Networks are typically characterized by high mobility and frequent link failures. As a result, routing algorithms selecting a single path during route creation have to make frequent route discoveries resulting in decreased throughput and high endto-end delay. Multipath routing approaches like AOMDV make use of pre-computed routes determined during route discovery. This solution, however, suffers during high mobility because the alternate paths are not actively maintained. Hence, precisely when needed, the routes are often broken. In this paper, the information gathered by a node about its neighbor, in addition to those proposed in [1], is used to dynamically determine the node to which a particular data packet has to be forwarded. Using this approach a better load balancing can be obtained in addition to utilization of the additional routes, if feasible, and in the process maintaining these routes. We also explore the possibility of implementing QoS using such a scheme.