Comparative Study of Different Routing Algorithms for Efficient Networking
Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 12)Publication Date: 2016-12-05
Authors : Shivangi Saxena; Shilpi Shukla;
Page : 1139-1143
Keywords : Clustering; Dijkstras; Adaptive routing; Ant Colony algorithm; Blocking Probability; Simulation time;
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.
Other Latest Articles
- Ecological Assessment and Conservation Strategies of Yele Mallappa Shetty Lake in Bengaluru, India
- The Relationship of Knowledge, Attitudes, and Oral Healthcare Behaviours of the Oral Hygiene Status of Students (Case Study of Students of Junior High/MTs Pondok Pesantren Putri Ummul
- Review of Designing Secured Data Using a Combination of LZW Compression, RSA Encryption, and DCT Steganography
- Efficacy of Some Medicinal Plant Essential Oils, Extracts and Powders Combined with Diatomaceous Earth on Cowpea Weevil, Callosobruchus maculatus F. (Coleoptera: Bruchidae)
- An Overview of Accurate Prediction Model for Web Services
Last modified: 2021-07-01 14:48:53