Abdelaziz Abohamama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Abdelaziz Abohamama has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Abdulaziz Shehab
Department of Information Systems, College of Computer and Information Sciences, Jouf University, Sakaka 72388, Saudi Arabia
2 shared publications - Eslam Hamouda
Computer Science Department, Faculty of Computers & Information, Mansoura University, Mansoura 35516, Egypt
2 shared publications - Mayada Tarek
Department of Computer Science, Mansoura University, Mansoura, Egypt
2 shared publications - Abdelhady M. Naguib
Department of Computer Science, College of Computer and Information Sciences, Jouf University, Jouf, Saudi Arabia
1 shared publication - Ahmed Elashry
Faculty of Computer Studies, Arab Open University, Riyadh 13311, Saudi Arabia; Information Systems Department, computers and information Faculty, Kafr El-Sheikh University, Kafr El-Sheikh 33516, Egypt
1 shared publication - Amena Mahmoud
Kafrelsheikh University
1 shared publication
Latest Publications
- Open Access
- 6 January 2026
- Published by Qubahan in Qubahan Academic Journal
- Vol. 6 (1) , 548-569
An Extensible Intelligent Simulation System for Robot Path Planning in Wireless Sensor Networks
Optimizing robot trajectories in dynamic and complex environments remains a significant challenge, particularly within wireless sensor networks (WSNs), where many existing simulation tools rely on predefined and inflexible scenarios. This paper presents an extensible graphical user interface (GUI)–based simulation system that integrates robot animation and scenario generation within a unified framework. The proposed system adopts a modular, plugin-based architecture that enables the seamless incorporation of diverse path-planning and trajectory optimization models without modifying the core infrastructure. In addition, an intelligent path-planning approach based on a Genetic Algorithm enhanced with Bézier curve modeling is integrated to support smooth and collision-free robot navigation in dynamic environments. Experimental evaluation demonstrates that the proposed framework provides an effective, scalable, and adaptable platform for conducting reproducible robot trajectory simulations in both research-oriented and practical applications. Overall, the proposed GUI-based and modular simulation framework provides a flexible, extensible, and reproducible platform for evaluating intelligent robot trajectory planning in dynamic WSN environments.
- 6 January 2026
- Published by Qubahan in Qubahan Academic Journal
- Vol. 6 (1) , 548-569
Open AccessAn Extensible Intelligent Simulation System for Robot Path Planning in Wireless Sensor Networks
Optimizing robot trajectories in dynamic and complex environments remains a significant challenge, particularly within wireless sensor networks (WSNs), where many existing simulation tools rely on predefined and inflexible scenarios. This paper presents an extensible graphical user interface (GUI)–based simulation system that integrates robot animation and scenario generation within a unified framework. The proposed system adopts a modular, plugin-based architecture that enables the seamless incorporation of diverse path-planning and trajectory optimization models without modifying the core infrastructure. In addition, an intelligent path-planning approach based on a Genetic Algorithm enhanced with Bézier curve modeling is integrated to support smooth and collision-free robot navigation in dynamic environments. Experimental evaluation demonstrates that the proposed framework provides an effective, scalable, and adaptable platform for conducting reproducible robot trajectory simulations in both research-oriented and practical applications. Overall, the proposed GUI-based and modular simulation framework provides a flexible, extensible, and reproducible platform for evaluating intelligent robot trajectory planning in dynamic WSN environments.
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in Journal of Intelligent Systems and Internet of Things
- Vol. 16 (1) , 223-23-232
An Optimized Convolutional Neural Network for Alzheimer’s disease Detection
American scientific publishing group
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in Journal of Intelligent Systems and Internet of Things
- Vol. 16 (1) , 223-23-232
An Optimized Convolutional Neural Network for Alzheimer’s disease Detection
American scientific publishing group
- Open Access
- 1 July 2023
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 35 (7)
Compressing medical deep neural network models for edge devices using knowledge distillation
- 1 July 2023
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 35 (7)
Open AccessCompressing medical deep neural network models for edge devices using knowledge distillation
- Top Cited PapersOpen Access
- 2 July 2022
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 30 (4) , 1-35
Real-Time Task Scheduling Algorithm for IoT-Based Applications in the Cloud–Fog Environment
IoT applications have become a pillar for enhancing the quality of life. However, the increasing amount of data generated by IoT devices places pressure on the resources of traditional cloud data centers. This prevents cloud data centers from fulfilling the requirements of IoT applications, particularly delay-sensitive applications. Fog computing is a relatively recent computing paradigm that extends cloud resources to the edge of the network. However, task scheduling in this computing paradigm is still a challenge. In this study, a semidynamic real-time task scheduling algorithm is proposed for bag-of-tasks applications in the cloud–fog environment. The proposed scheduling algorithm formulates task scheduling as a permutation-based optimization problem. A modified version of the genetic algorithm is used to provide different permutations for arrived tasks at each scheduling round. Then, the tasks are assigned, in the order defined by the best permutation, to a virtual machine, which has sufficient resources and achieves the minimum expected execution time. A conducted optimality study reveals that the proposed algorithm has a comparative performance with respect to the optimal solution. Additionally, the proposed algorithm is compared with first fit, best fit, the genetic algorithm, and the bees life algorithm in terms of makespan, total execution time, failure rate, average delay time, and elapsed run time. The experimental results show the superiority of the proposed algorithm over the other algorithms. Moreover, the proposed algorithm achieves a good balance between the makespan and the total execution cost and minimizes the task failure rate compared to the other algorithms. Graphical Abstract
- 2 July 2022
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 30 (4) , 1-35
Top Cited PapersOpen AccessReal-Time Task Scheduling Algorithm for IoT-Based Applications in the Cloud–Fog Environment
IoT applications have become a pillar for enhancing the quality of life. However, the increasing amount of data generated by IoT devices places pressure on the resources of traditional cloud data centers. This prevents cloud data centers from fulfilling the requirements of IoT applications, particularly delay-sensitive applications. Fog computing is a relatively recent computing paradigm that extends cloud resources to the edge of the network. However, task scheduling in this computing paradigm is still a challenge. In this study, a semidynamic real-time task scheduling algorithm is proposed for bag-of-tasks applications in the cloud–fog environment. The proposed scheduling algorithm formulates task scheduling as a permutation-based optimization problem. A modified version of the genetic algorithm is used to provide different permutations for arrived tasks at each scheduling round. Then, the tasks are assigned, in the order defined by the best permutation, to a virtual machine, which has sufficient resources and achieves the minimum expected execution time. A conducted optimality study reveals that the proposed algorithm has a comparative performance with respect to the optimal solution. Additionally, the proposed algorithm is compared with first fit, best fit, the genetic algorithm, and the bees life algorithm in terms of makespan, total execution time, failure rate, average delay time, and elapsed run time. The experimental results show the superiority of the proposed algorithm over the other algorithms. Moreover, the proposed algorithm achieves a good balance between the makespan and the total execution cost and minimizes the task failure rate compared to the other algorithms. Graphical Abstract
- 4 May 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (1) , 501-513
Multi-instance cancellable biometrics schemes based on generative adversarial network
- 4 May 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (1) , 501-513
Multi-instance cancellable biometrics schemes based on generative adversarial network
- 11 March 2021
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 46 (9) , 8345-8353
Random Projection-Based Feature Transformation Using Metaheuristic Optimization Algorithm
- 11 March 2021
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 46 (9) , 8345-8353
Random Projection-Based Feature Transformation Using Metaheuristic Optimization Algorithm