An Adaptive Routing Based on an Improved Ant Colony Optimization in Leo Satellite Networks

Ant colony optimization (ACO) has been proposed as a promising algorithm for adaptive routing in communication networks. The algorithm is being successfully applied to optimization problems in a variety of fields. The original ACO has the disadvantages of stagnation behavior and slow convergence .The paper testes and improves the variants of the original ACO in order to give better performances. The improved routing algorithm is simulated in Iridium satellite constellation. The results show that the improved ACO not only achieves fast convergence in dynamic topology networks, but also can avoid networks congestion and counterpoise the load of the network.