A New Design of an Ant Colony Optimization (ACO) Algorithm for Optimization of Ad Hoc Network

In this paper we have used a new approach of the ACO algorithm to solve the problem of routing data between two nodes, the source to the destination in the AD HOC network, specifically, we have improved a new variable GlobalACO to decrease the cost between the ants (cities), and to better manage the memory management where the ants stored the pheromones. Indeed, we used the BENCHMARK instances to evaluate our new approach and compared them with the other article after we applied this new approach to an AD HOC Network topology. The simulation results of our new approach show convergence and speed with a smaller error rate.