Network Routing Protocol using Genetic Algorithms

 Abstract— This paper aims to develop a genetic algorithm to solve a network routing protocol problem. The algorithm has to find the shortest path between the source and destination nodes. In the literature, the routing problem is solved using search graph techniques to find the shortest path. Dijkstra's algorithm is one of popular techniques to solve this problem. The developed genetic algorithm is compared with Dijkstra's algorithm to solve routing problem. S imulation results are carried out for both algorithms using MATLAB. The results affirmed the potential of the proposed genetic algorithm. The obtained performance is similar as Dijkstra's algorithm.