Comparison of Ant Colony and Fastest Path Algorithms for Fixed and Variable Number of Nodes in Multi-Hop Networks

Abstract

In this study, the fastest path algorithm which is known as a routing method from source to destination and Ant colony method which is known to be adaptable to the dynamic changes in the network are compared for average hop counts, power consumption and packet arrival delays by implementing a mobile network simulation. Even the average hop counts for both algorithms reach to almost same value at the simulation results, since it is seen that the fastest path algorithm provides less packet delay and less power consumption with respect to Ant colony algorithm , it is thought that fastest path algorithm may be more useful than Ant colony algorithm for real time voice or video packet transmissions. ©2010 IEEE.