An Efficient Parallel Routing Algorithm for Manets Using Ant Colony Optimization

Abstract

Ad hoc networking is widely used to manage emergency situations like rescue operations or battlefield scenarios. With recent research and development its commercial applications are also getting popularity day by day. Mobile Ad hoc Networks are self-emerging and peer-level communication enabled mobile devices that accomplishes the assigned task without reliance on fixed infrastructure or centralized resources. Unstable infrastructure and limited resources associated with ad hoc networking arises many challenges with the network development like routing issues, path or packet loss, security and quality of service. newlineRouting is a phenomenon of discovering routes for transmitting information from source node to destination node. Traditional routing methods given for infrastructure based wired and wireless communication cannot be applied to mobile ad hoc network due to absence of administrator device. Ant Colony Optimization technique takes inspiration from behavior of ants for food discovery process for solving real life problems. This approach suits to ad hoc networking also as it leads to cooperative decision ability with multiple network agents. Multipath Routing is exploring multiple paths for same sender and receiver device and it is widely utilized in ad hoc networking to deliver reliable transmission. Majority of existing multipath routing methods for ad hoc networking choses the best path as primary path for communication and once the chosen path is expired alternative routes are used for transmission. newlineIn this research work a novel approach Parallel Routing Algorithm based on Ant Colony Optimization is proposed to deliver payloads in parallel to improve reliability of mobile ad hoc network communications. Proposed method considers quality of available paths at run time and accordingly data is being transmitted. As per studied literature no existing routing approach is able to take dynamic decisions based on current network state. Quantity of packets to be handled by each route in the network is based on the