Downloads: 111 | Views: 118
M.Tech / M.E / PhD Thesis | Electronics & Communication Engineering | India | Volume 5 Issue 12, December 2016
Comparative Study of Different Routing Algorithms for Efficient Networking
Shivangi Saxena | Shilpi Shukla
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.
Keywords: Clustering, Dijkstras, Adaptive routing, Ant Colony algorithm, Blocking Probability, Simulation time
Edition: Volume 5 Issue 12, December 2016,
Pages: 1139 - 1143
Similar Articles with Keyword 'Clustering'
Informative Article, Electronics & Communication Engineering, India, Volume 4 Issue 8, August 2015Pages: 957 - 962
Nighttime Vehicle Detection and Traffic Surveillance
Jacob V. Panicker
Research Paper, Electronics & Communication Engineering, India, Volume 3 Issue 12, December 2014Pages: 2306 - 2309
First Node Die (FND) Time Enhancement in LEACH Protocol
Naveen Chawla | Ashish Jasuja