AntNet based routing algorithms for resource constrained networks

Abstract

Research in the area of metaheuristics and routing in telecommunication networks have been of great interest in the past several years, especially in wireless networks where routing differs greatly in than in traditional networks. Due to resource constraints, the dynamic nature of networks, and unconventional destination specification, typical routing algorithms fair poorly. Ant Colony Optimization (ACO), a common metaheuristic has inspired routing algorithms in such networks. AntNet, a popular one, has shown promising performance results. However, AntNet has shown that it may not be the most efficient. In this thesis, we will examine, AntNet, suggest two alternative algorithms based on AntNet, and introduce a fourth algorithm based on a hybrid AntNet and genetic operator algorithm. The performance data provided by the tests show that the two improved algorithms and the fourth hybrid one introduce improved performance. Finally, based on the experience with the simulated algorithms, recommendations for future work are provided.