Modified Ant Colony Optimization to enhance MANET routing in Adhoc on demand Distance Vector

A Mobile Adhoc Network (MANET) is an assortment of mobile nodes that can establish an adhoc network without any centralized structures. Networking infrastructure such as the base stations is unavailable for MANET. The interconnected collection of wireless nodes depends on its position and, its transmitting and receiving radio capacity to create a wireless connectivity and form a multi-hop graph or an “adhoc” network. Routing in MANET is used for finding the multi-hop paths to transmit the data flow through the network while optimizing one or more performance measures. In this paper, modified Ant Colony Optimization (ACO) has been proposed for the optimization for MANET routing protocol. The modifications have been incorporated in Adhoc On-demand Distance Vector (AODV) routing. The proposed modified Ant Colony Optimization algorithm performs better compared to existing algorithms(AODV and Cooperative Opportunistic Routing in Mobile Adhoc Networks i.e. CORMAN) in terms of end- to-end delay, route acquisition time, throughput, total cache replies and packet delivery ratio.