Improving AntNet algorithm in routing protocols to find the optimal path according to time

Abstract

In this study a new algorithm called Improved AntNet has been proposed and applied to enhance the AntNet algorithm by reducing the probability of selecting the optimal path whenever its goodness had decreased and giving a chance to select other paths, as the algorithm observe the traffic dynamic on each link in the network and specify the probability of selecting it according to its goodness. In this way the proposed algorithm solve the stagnation problem. Two models of network have been implemented using OPNET Modeler software, the proposed algorithm has been implemented on these networks and simulated with different traffic patterns. The proposed algorithm performance has been compared with performance of AntNet algorithm and the protocol OSPF. Simulation results showed that the proposed algorithm performance was better in terms of End-to-end Delay, and distributing links utilizations.