Improving the Performance of Routing Protocol using Genetic Algorithm

Full Text (PDF, 459KB), PP.10-16

Views: 0 Downloads: 0


Meenakshi Moza 1,* Suresh Kumar 1

1. Manav Rachna International University / F.E.T/ECE, Faridabad,Haryana

* Corresponding author.


Received: 6 Nov. 2015 / Revised: 22 Feb. 2016 / Accepted: 1 May 2016 / Published: 8 Jul. 2016

Index Terms

Routing Optimization, Quality of Service (QOS), Shortest path, Fitness, Genetic Algorithm (GA), Crossover, Mutation, Open Shortest Path First (OSPF)


Internet reliability and performance is based mostly on the underlying routing protocols. The current traffic load has to be taken into account for computation of paths in routing protocols. Addressing the selection of path, from a known source to destination is the basic aim of this paper. Making use of multipoint crossover and mutation is done for optimum and when required alternate path determination. Network scenario which consists of nodes that are fixed and limited to the known size of topology, comprises the population size. This paper proposes a simple method of calculating the shortest path for a network using Genetic Algorithm (GA), which is capable of giving an efficient, dynamic and consistent solution in spite of, what topology, changes in link and node happen and volume of the network. GA is used in this paper for optimization of routing. It helps us in enhancing the performance of the routers.

Cite This Paper

Meenakshi Moza, Suresh Kumar, "Improving the Performance of Routing Protocol using Genetic Algorithm", International Journal of Computer Network and Information Security(IJCNIS), Vol.8, No.7, pp.10-16, 2016. DOI:10.5815/ijcnis.2016.07.02


[1]Al-Ghazal, M., El-Sayed, A., & Kelash, H. (2007, December). Routing Optimlzation using Genetic Algorithm in Ad Hoc Networks. In Signal Processing and Information Technology, 2007 IEEE International Symposium on (pp. 497-503). IEEE.
[2]Baboo, Ramakrishna S. S., & Narasimhan, B. (2012). Genetic Algorithm Based Congestion Aware Routing Protocol (GA-CARP) for Mobile Ad Hoc Networks. Procedia Technology, 4, 177-181.
[3]Bellur, B., Ogier, R. G., & Temlin, F. L. (2003). Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). IETF Internet Draft, draft-ietf-manet-tbrpf-08. txt.
[4]Clausen, T., & Jacquet, P. (2003). Optimized link state routing protocol. http ietf. org/internet-drafts/draft-ietf-manet-olsr-11. txt.
[5]Gonen, B. (2006). Genetic Algorithm finding the shortest path in Networks. Reno: University of Nevada.
[6]Haas, Z. J., Pearlman, M. R., & Samar, P. (2002). The zone routing protocol (ZRP) for ad hoc networks. draft-ietf-manet-zone-zrp-04. txt.
[7]Hamdan, M., Shehadeh, H. A., & Obeidat, Q. Y. (2015). Multi-Objective Optimization of Electrocardiogram Monitoring Network for Elderly Patient in Home. Int. J. Open Problems Compt. Math, 8(1).
[8]Holland, J. H. (1989). Genetic Algorithms in Search, Optimization and Machine Learning.
[9]Johnson, D. B. (2003). The dynamic source routing protocol for mobile ad hoc networks. draft-ietf-manet-dsr-09. txt.
[10]Leung, R., Liu, J., Poon, E., Chan, A. L. C., & Li, B. (2001). MP-DSR: a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks. In Local Computer Networks, 2001. Proceedings. LCN 2001. 26th Annual IEEE Conference on (pp. 132-141). IEEE.
[11]Maltz, D. B. J. D. A., & Broch, J. (2001). DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. Computer Science Department Carnegie Mellon University Pittsburgh, PA, 15213-3891.
[12]Marina, M. K., & 5.Das, S. R. (2001, November). On-demand multipath distance vector routing in ad hoc networks. In Network Protocols, 2001. Ninth International Conference on (pp. 14-23). IEEE.
[13]Pearlman, M. R., Haas, Z. J., Sholander, P., & Tabrizi, S. S. (2000). On the impact of alternate path routing for load balancing in mobile ad hoc networks. In Mobile and Ad Hoc Networking and Computing, 2000. MobiHOC. 2000 First Annual Workshop on (pp. 3-10). IEEE.
[14]Perkins, C., Belding-Royer, E., & Das, S. (2003). Ad hoc on-demand distance vector (AODV) routing (No. RFC 3561).
[15]Suresh Kumar, Shelja Sharma, July 2015, International Journal of Computer Network and Information Security (IJCNIS), Vol. 7, No. 8, pp: 21-29, Experimental Analysis of OLSR and DSDV Protocols on NS-2.35 in Mobile Ad-Hoc Networks.
[16]Yousra ahmed fadil .(2010, December ) Routing using genetic algorithm for large networks. Diyala Journal of Engineering Sciences, Vol. 03, No. 02 , pp. 53 -70.