Ant based routing algorithms for resource constrained networks

Routing in resource-constrained networks is a challenging task. Due to the complexity concerning resource constraints in terms of bandwidth utilization, energy consumption and latency, typical routing algorithms work poorly in such networks. Therefore, ant-based algorithms are used to address the problem. Among them, AntNet has shown promising performance results. This paper proposes and presents two algorithms which are inspired from AntNet. We compare our proposed algorithms with the basic AntNet, measure the performance and find that our proposed algorithms outperforms the basic AntNet in terms of success rate, energy consumptions and energy efficiency. The performance evaluations are conducted using NetLogo simulation environment.