Routing Discovering Based on Ant Colony Algorithm in Ad Hoc Networks

To satisfy the situation requirements for Routing, Routing discovering has emerged as a main issue in mobile Ad Hoc networks. The high adaptability to network topology change is of utmost importance for Routing. In this paper, we propose a novel routing discovering algorithm (RACO) based on Ant colony optimization. It is to solve the limitation of ACO by using the characteristics of Ad Hoc networks and the concept related-node. In order to evaluate and validate the performance of RACO better, we simulate RACO and RCO to AODV protocols using NS2.The studies show that RACO can reduce the convergence time effectively and iteration of algorithm.