Dynamic adaptive routing algorithm based on ant algorithm in combination with queuing network analysis

The field of Mobile Ad hoc Networks (MANETs) has expanded an important part of the interest of researchers, hence become very accepted in last few years. The main method for evaluating the performance of MANETs is simulation. This research study introduces a new adaptive and dynamic routing algorithm for MANETs based on the Ant Colony Optimization (ACO) algorithms with network delay analysis. Ant colony optimization algorithm helps in finding, if not the shortest, at least a very good path connecting the colony’s nest with a source of food. This evaluation of MANETs is based on the estimation of the mean End-to-End delay to send a packet from source to destination node through a MANET. The most important performance evaluation metrics in computer networks is evaluated as mean End-to-End delay. We scrutinize various simulation set-ups with different node density and pause times. Our new algorithm offers good results under certain conditions such as, increasing the pause time and decreasing node density.