ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Comparative Study of Different Routing Algorithms for Efficient Networking

Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 12)

Publication Date:

Authors : ; ;

Page : 1139-1143

Keywords : Clustering; Dijkstras; Adaptive routing; Ant Colony algorithm; Blocking Probability; Simulation time;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

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 Dijkstras, Adaptive Routing & amp, amp, amp, 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.

Last modified: 2021-07-01 14:48:53