Comparative Study of Different Routing Algorithms for Efficient Networking

In every network the main aim of designing protocols is to have more efficient and less energy consumption. Many different ideas have been developed and presented for the Dynamic Routing, out of which some are comparatively more efficient. In this project we are trying to implement three different shortest path routing algorithms like: Dijkstra’s, Adaptive Routing & ACO (Ant Colony Optimization), by keeping some significant condition and analyze the properties of each in different topologies. Also, to present and report about the most efficient protocol for a desired network topology.