Network communication is a process that involves the technique of routing for delivering the packet by choosing an optimal
path from one network to another. One of the major challenges that require attention in network communication is the problem of finding
the optimal routing path for packets movement. The problem usually arises in a packet-switched network as the size of the network
increases, thereby making routing becomes more complex due to the number of nodes in the network. Thus there is need to develop a
better routing algorithm to provide effective traffic routing system that can update their path by finding the optimal network nodes that
will allow effective and fast access to the network within a real-time interval. This paper developed an improved routing system by
application of a natured inspired metaheuristic algorithm to reduce the routing congestion problems. Experimental results showed that the
shortest path (1-2-3-4) had the lowest average delay time of 2.03s with packet size of 56mb, while the 64mb with the shortest path (1-2-
4-5-3-6) gave the lowest path congestion ratio of 43.

Published In:IJCAT Journal Volume 7, Issue 5

Date of Publication : May 2020

Pages : 59-65

Figures :03

Tables :10

Hakeem Babalola Akande :
Department of Telecommunication Science, University of Ilorin
Ilorin, Kwara State, Nigeria.

Oluwakemi Christiana Abikoye :
Department of Computer Science, University of Ilorin
Ilorin, State Kwara State, Nigeria.

Taye Oladele Aro :
Department of Mathematical and Computing Sciences, KolaDaisi University
Ibadan, Oyo State, Nigeria.

Ayopo Abdulkarim Oloyede :
Department of Telecommunication Science, University of Ilorin
Ilorin, Kwara State, Nigeria.

Ant Colony Optimization, Metaheuristic, Network Communication, Packet-Switched Network

This study applied the Ant Colony Optimization
Algorithm to reduce the routing problem of finding the
optimal path in a switch-packet network system. The data
used was gathered from the University of Ilorin network
system platform. The collected data was used to evaluate
the performance of the developed enhanced routing
system. Experimental results were given in terms of the
shortest path generated, congestion rate and maximum
congestion values of the shortest paths.

[1] A. O. Oluwatope and G. A. Aderounmu, "Congestion
Control in Packet Switched Wide Area," Int. J. Comput.
Eng. Surv., vol. 4, no. 5, pp. 1-18, 2013.
[2] C. Fortuna and M. Mohorcic, "Trends in the
development of communication networks : Cognitive
networks," Comput. Networks, vol. 53, no. 9, pp. 1354-
1376, 2009.
[3] P. Sarao, P. Sindhu, and V. Navakishor, "Analysis of
Routing Protocols based on Network parameters in
WANET International Journal of Computer Sciences
and Engineering Open Access Analysis of Routing
Protocols based on Network parameters in Wanet," Int.
J. Comput. Sci. Eng., vol. 6, no. 6, pp. 8-13, 2018.
[4] S. Mukherjee, D & Acharyya, "Ant Colony
Optimization Technique Applied in Network Routing
Problem," Int. J. Comput. Appl., vol. 1, no. 15, pp. 66-
73, 2014.
[5] J. Yang, M. Xu, W. Zhao, and B. Xu, "A Multipath
Routing Protocol Based on Clustering and Ant Colony
Optimization for Wireless Sensor Networks," Sensors,
vol. 10, pp. 4521-4540, 2010.
[6] M. Dorigo and T. Stützle, "Ant colony optimization:
overview and recent advances," 2009.
[7] N. Anjali., & Kaur, "Routing Based Ant Colony
Optimization in Wireless Sensor Networks," Glob. J.
Comput. Scien e Technol., vol. 13, no. 4, pp. 35-40,
2013.
[8] A. Kanan, T. Eldos, and M. Al-kahtani, "Mobile Ad
Hoc Networks Routing Using Ant Colony
Optimization," World Comput. Sci. Inf. Technol. J., vol.
3, no. 6, pp. 105-109, 2013.
[9] A. K. Habboush, "Ant Colony Optimization(ACO)
Based MANET Routing Protocols: A Comprehensive
Review," Comput. Inf. Sci., vol. 12, no. 1, pp. 87-102,
2019.
[10] D. N. Ravikiran and C. G. Dethe, "Improvement in
Routing Algorithms to Enhance Lifetime of Wireless
Sensor Network," Int. J. Comput. Networks Commun.,
vol. 10, no. 2, pp. 23-32, 2018.
[11] S. Sharma and R. S. Kushwah, "Energy Saving," in
International Conference on Inventive Communication
and Computational Technologies, 2017, pp. 150-154.
[12] S. Arkadii and C. Vadym, "Improvement of EIGRP
Protocol Routing Algorithm with the Consideration of
Information Security Risk Parameters," Sch. J. Eng.
Technol., vol. 3, no. 8, pp. 707-714, 2015.
[13] R. Khoshkangini and S. Zaboli, "Efficient Routing
Protocol via Ant Colony Optimization ( ACO ) and
Breadth First Search ( BFS )," in IEEE International
Conference on Internet of Things, 2014, pp. 375-381.