Princewill Chima Obuzor
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Princewill Chima Obuzor has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Sunday Adeola Ajagbe
Department of Computer Engineering, Abiola Ajimobi Technical University, Ibadan 200255, Nigeria
3 shared publications - Abidemi Emmanuel Adeniyi
Department of Information Systems, Faculty of Computer Science and Engineering, Obafemi Awolowo University, Ile-Ife 220101, Nigeria
2 shared publications - Matthew Olusegun Adigun
University of Zululand
2 shared publications - Mayowa Oyedepo Oyediran
Ajayi Crowther University
2 shared publications - Olufemi S. Ojo
Ajayi Crowther University
2 shared publications - Adedayo Wasiat Elegbede
Bells University of Technology
1 shared publication
Latest Publications
- Open Access
- 1 October 2024
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 36 (1) , 685-693
Comparative analysis of selected optimization algorithms for mobile agents’ migration pattern
Mobile agents are agents that can migrate from host-to-host to work in a heterogeneous network environment. A mobile agent can migrate from host-to-host in its plan with the statistics generated on each host through a route known as migration pattern. Migration pattern therefore is the route the agents use to travel within the plan from the first host to the last host. However, there is a need for a comparison between the commonly used optimization algorithms in developing migration patterns for mobile agents with respect to some evaluation metrics. In this paper, the three techniques firefly algorithm (FFA), honeybee optimization (HBO) and particle swarm optimization (PSO) were used for developing migration patterns for mobile agents and their comparison was done based on migration time, time complexity and network load as metrics. PSO is discovered to perform better in terms of network load with an average of 242.3905 bits per second (bps), time complexity with an average of 41.2688 number of nodes (n), and migration/transmission time with an average of 4.203462 seconds (s).
- 1 October 2024
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 36 (1) , 685-693
Open AccessComparative analysis of selected optimization algorithms for mobile agents’ migration pattern
Mobile agents are agents that can migrate from host-to-host to work in a heterogeneous network environment. A mobile agent can migrate from host-to-host in its plan with the statistics generated on each host through a route known as migration pattern. Migration pattern therefore is the route the agents use to travel within the plan from the first host to the last host. However, there is a need for a comparison between the commonly used optimization algorithms in developing migration patterns for mobile agents with respect to some evaluation metrics. In this paper, the three techniques firefly algorithm (FFA), honeybee optimization (HBO) and particle swarm optimization (PSO) were used for developing migration patterns for mobile agents and their comparison was done based on migration time, time complexity and network load as metrics. PSO is discovered to perform better in terms of network load with an average of 242.3905 bits per second (bps), time complexity with an average of 41.2688 number of nodes (n), and migration/transmission time with an average of 4.203462 seconds (s).
- Open Access
- 1 June 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 14 (3) , 3244-3255
Comprehensive review of load balancing in cloud computing system
Load balancing plays a critical role in optimizing resource utilization and enhancing performance in cloud computing systems. As cloud environments grow in scale and complexity, efficient load balancing mechanisms become increasingly vital. This paper presents a comprehensive review of load balancing techniques in cloud computing systems, with a focus on their applicability, advantages, and limitations. The review encompasses both static and dynamic load balancing approaches, evaluating their effectiveness in addressing the challenges posed by cloud infrastructure, such as heterogeneity, scalability, and variability in workload demands. Furthermore, the review examines load balancing algorithms considering factors such as resource utilization, response time, fault tolerance, and energy efficiency. Additionally, the impact of load balancing on cloud performance metrics, including throughput, latency, and scalability, is analyzed. This review aims to provide insights into the state-of-the-art load balancing strategies and serve as a valuable resource for researchers, practitioners, and system designers involved in the development and optimization of cloud computing systems.
- 1 June 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 14 (3) , 3244-3255
Open AccessComprehensive review of load balancing in cloud computing system
Load balancing plays a critical role in optimizing resource utilization and enhancing performance in cloud computing systems. As cloud environments grow in scale and complexity, efficient load balancing mechanisms become increasingly vital. This paper presents a comprehensive review of load balancing techniques in cloud computing systems, with a focus on their applicability, advantages, and limitations. The review encompasses both static and dynamic load balancing approaches, evaluating their effectiveness in addressing the challenges posed by cloud infrastructure, such as heterogeneity, scalability, and variability in workload demands. Furthermore, the review examines load balancing algorithms considering factors such as resource utilization, response time, fault tolerance, and energy efficiency. Additionally, the impact of load balancing on cloud performance metrics, including throughput, latency, and scalability, is analyzed. This review aims to provide insights into the state-of-the-art load balancing strategies and serve as a valuable resource for researchers, practitioners, and system designers involved in the development and optimization of cloud computing systems.
- Open Access
- 28 November 2022
- Published by ITI Research Group in ParadigmPlus
- Vol. 3 (3) , 1-15
Comparison of the Performance of Machine Learning Techniques in the Prediction of Employee
HR's purpose is to assign the best people to the right job at the right time, train and qualify them, and provide evaluation methods to track their performance and safeguard employees' perspective skills. These data are crucial for decision-makers, but collecting the best and most useful information from such large amounts of data is tough. HR employees no longer need to manually handle vast amounts of data with the advent of data mining. The basic purpose of data mining is to extract information from hidden patterns and trends in data to get near-optimal results. This study aims at comparing the performance of three techniques in the prediction of performance. The dataset undergoes preprocessing steps that include data cleaning, and data compression using PCA. After preprocessing, training and classification were done using Artificial Neural Network, Random Forest, and Decision tree algorithm. The result showed that Artificial Neural networks performed the best for the prediction of employee performance.
- 28 November 2022
- Published by ITI Research Group in ParadigmPlus
- Vol. 3 (3) , 1-15
Open AccessComparison of the Performance of Machine Learning Techniques in the Prediction of Employee
HR's purpose is to assign the best people to the right job at the right time, train and qualify them, and provide evaluation methods to track their performance and safeguard employees' perspective skills. These data are crucial for decision-makers, but collecting the best and most useful information from such large amounts of data is tough. HR employees no longer need to manually handle vast amounts of data with the advent of data mining. The basic purpose of data mining is to extract information from hidden patterns and trends in data to get near-optimal results. This study aims at comparing the performance of three techniques in the prediction of performance. The dataset undergoes preprocessing steps that include data cleaning, and data compression using PCA. After preprocessing, training and classification were done using Artificial Neural Network, Random Forest, and Decision tree algorithm. The result showed that Artificial Neural networks performed the best for the prediction of employee performance.