Routing in Ad Hoc Networks Using Ant Colony Optimization

A Mobile Ad Hoc Network (MANET) is a self configuring infrastructureless network of mobile nodes connected by wireless links. Hence, routing in this kind of networks is a great challenge. Ant Colony Optimization is an algorithm to solve problems like routing in MANETs based on food searching behavior of ants. AntHocNet is based on ideas from Ant Colony Optimization. AntHocNet is a hybrid algorithm consisting of both reactive route set-up and proactive route maintenance. It does not maintain routes to all possible destinations at all times but it sets up paths when they are needed at the start of a data session. In this paper, performance evaluation of AntHocNet, AODV and DSR routing protocols is done using the simulator ns2.34. Simulation results demonstrate scalability of AntHocNet when compared to AODV and DSR i.e., AntHocNet performs better at high data rates and at large number of nodes. Its performance is low when compared to AODV and DSR at low data rates and at less number of nodes.