Hybrid on Demand Multipath Distance Vector Routing Protocol

摘要

In this paper we propose an extension to well known multipath reactive routing protocol Ad hoc On Demand Multipath Distance Vector (AOMDV). The resulting protocol is called as Hybrid on Demand Multipath Distance Vector (HOMDV). The proposed scheme improves AOMDV by using hello packets to learn neighbors up to two hops in addition to maintaining local connectivity. In this scheme a route requests is sent out only if a node fails to find the destination from its neighbor tables. The simulations are carried out in Qualnet simulator for varying mobility and varying connections. Simulations results shows that our algorithm achieves considerably higher throughput, lower packet loss, delay, route discovery frequency and routing control overhead compared to AOMDV.