Awad Ali

Dr. Awad Ali

Computer Department; College of Science and Arts - Sharoura, Najran University; Najran; Kingdom of Saudi Arabia

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 April 2022 in Entropy
Verified
Journal Article
Open access
PDF file
RHRafik Hamza
Rafik Hamza
AHAlzubair Hassan
Alzubair Hassan
AAAwad Ali
Awad Ali
MBMohammed Bakri Bashir
Mohammed Bakri Bashir
SASamar Alqhtani
Samar Alqhtani
AAAdil Yousif Aboalgassim Alfaki
Adil Yousif Aboalgassim Alfaki
Privacy-preserving techniques allow private information to be used without compromising privacy. Most encryption algorithms, such as the Advanced Encryption Standard (AES) algorithm, cannot perform computational operations on encrypted data without first applying the decryption process. Homomorphic encryption algorithms provide innovative solutions to support computations on encrypted data while preserving the content of private information. However, these algorithms have some limitations, such as computational cost as well as the need for modifications for each case study. In this paper, we present a comprehensive overview of various homomorphic encryption tools for Big Data analysis and their applications. We also discuss a security framework for Big Data analysis while preserving privacy using homomorphic encryption algorithms. We highlight the fundamental features and tradeoffs that should be considered when choosing the right approach for Big Data applications in practice. We then present a comparison of popular current homomorphic encryption tools with respect to these identified characteristics. We examine the implementation results of various homomorphic encryption toolkits and compare their performances. Finally, we highlight some important issues and research opportunities. We aim to anticipate how homomorphic encryption technology will be useful for secure Big Data processing, especially to improve the utility and performance of privacy-preserving machine learning.

23 January 2022 in Sensors
Verified
Journal Article
Open access
PDF file
AAAdil Yousif Aboalgassim Alfaki
Adil Yousif Aboalgassim Alfaki
SASamar Alqhtani
Samar Alqhtani
MBMohammed Bakri Bashir
Mohammed Bakri Bashir
AAAwad Ali
Awad Ali
RHRafik Hamza
Rafik Hamza
TTTawfeeg Mohmmed Tawfeeg
Tawfeeg Mohmmed Tawfeeg
The Internet of Things (IoT) is defined as interconnected digital and mechanical devices with intelligent and interactive data transmission features over a defined network. The ability of the IoT to collect, analyze and mine data into information and knowledge motivates the integration of IoT with grid and cloud computing. New job scheduling techniques are crucial for the effective integration and management of IoT with grid computing as they provide optimal computational solutions. The computational grid is a modern technology that enables distributed computing to take advantage of a organization’s resources in order to handle complex computational problems. However, the scheduling process is considered an NP-hard problem due to the heterogeneity of resources and management systems in the IoT grid. This paper proposed a Greedy Firefly Algorithm (GFA) for jobs scheduling in the grid environment. In the proposed greedy firefly algorithm, a greedy method is utilized as a local search mechanism to enhance the rate of convergence and efficiency of schedules produced by the standard firefly algorithm. Several experiments were conducted using the GridSim toolkit to evaluate the proposed greedy firefly algorithm’s performance. The study measured several sizes of real grid computing workload traces, starting with lightweight traces with only 500 jobs, then typical with 3000 to 7000 jobs, and finally heavy load containing 8000 to 10,000 jobs. The experiment results revealed that the greedy firefly algorithm could insignificantly reduce the makespan makespan and execution times of the IoT grid scheduling process as compared to other evaluated scheduling methods. Furthermore, the proposed greedy firefly algorithm converges on large search spacefaster , making it suitable for large-scale IoT grid environments.

15 January 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
AAAdil Yousif Aboalgassim Alfaki
Adil Yousif Aboalgassim Alfaki
MBMohammed Bakri Bashir
Mohammed Bakri Bashir
AAAwad Ali
Awad Ali
The Internet of Things (IoT) edge is an emerging technology of sensors and devices that communicate real-time data to a network. IoT edge computing was introduced to handle the latency concerns related to cloud computing data management, as the data are processed closer to their point of origin. Clustering and scheduling tasks on IoT edge computing are considered a challenging problem due to the diverse nature of task and resource characteristics. Metaheuristics and optimization methods are widely used in IoT edge task clustering and scheduling. This paper introduced a new task clustering and scheduling mechanism using differential evolution optimization on IoT edge computing. The proposed mechanism aims to optimize task clustering and scheduling to find optimal execution times for submitted tasks. The proposed mechanism for task clustering is based on the degree of similarity of task characteristics. The proposed mechanisms use an evolutionary mechanism to distribute system tasks across suitable IoT edge resources. The clustering tasks process categorizes tasks with similar requirements and then maps them to appropriate resources. To evaluate the proposed differential evolution mechanism for IoT edge task clustering and scheduling, this study conducted several simulation experiments against two established mechanisms: the Firefly Algorithm (FA) and Particle Swarm Optimization (PSO). The simulation configuration was carefully created to mimic real-world IoT edge computing settings to ensure the proposed mechanism’s applicability and the simulation results’ relevance. In the heavyweight workload scenario, the proposed DE mechanism started with an execution time of 916.61 milliseconds, compared to FA’s 1092 milliseconds and PSO’s 1026.09 milliseconds. By the 50th iteration, the proposed DE mechanism had reduced its execution time significantly to around 821.27 milliseconds, whereas FA and PSO showed lesser improvements, with FA at approximately 1053.06 milliseconds and PSO stabilizing at 956.12 milliseconds. The simulation results revealed that the proposed differential evolution mechanism for edge task clustering and scheduling outperforms FA and PSO regarding system efficiency and stability, significantly reducing execution time and having minimal variation across simulation iterations.

18 October 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
DADoaa Abdulmoniem Abdulgader
Doaa Abdulmoniem Abdulgader
AAAdil Yousif Aboalgassim Alfaki
Adil Yousif Aboalgassim Alfaki
AAAwad Ali
Awad Ali
Cloud computing is considered a key Internet technology. Cloud providers offer services through the Internet, such as infrastructure, platforms, and software. The scheduling process of cloud providers’ tasks concerns allocating clients’ tasks to providers’ resources. Several mechanisms have been developed for task scheduling in cloud computing. Still, these mechanisms need to be optimized for execution time and makespan. This paper presents a new task-scheduling mechanism based on Discrete Prey–Predator to optimize the task-scheduling process in the cloud environment. The proposed Discrete Prey–Predator mechanism assigns each scheduling solution survival values. The proposed mechanism denotes the prey’s maximum surviving value and the predator’s minimum surviving value. The proposed Discrete Prey–Predator mechanism aims to minimize the execution time of tasks in cloud computing. This paper makes a significant contribution to the field of cloud task scheduling by introducing a new mechanism based on the Discrete Prey–Predator algorithm. The Discrete Prey–Predator mechanism presents distinct advantages, including optimized task execution, as the mechanism is purpose-built to optimize task execution times in cloud computing, improving overall system efficiency and resource utilization. Moreover, the proposed mechanism introduces a survival-value-based approach, as the mechanism introduces a unique approach for assigning survival values to scheduling solutions, differentiating between the prey’s maximum surviving value and the predator’s minimum surviving value. This improvement enhances decision-making precision in task allocation. To evaluate the proposed mechanism, simulations using the CloudSim simulator were conducted. The experiment phase considered different scenarios for testing the proposed mechanism in different states. The simulation results revealed that the proposed Discrete Prey–Predator mechanism has shorter execution times than the firefly algorithm. The average of the five execution times of the Discrete Prey–Predator mechanism was 270.97 s, while the average of the five execution times of the firefly algorithm was 315.10 s.

1 January 2022 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
AAAwad Ali
Awad Ali
RIReyazur Rashid Irshad
Reyazur Rashid Irshad
AAAhmed Abdu Alattaab
Ahmed Abdu Alattaab
AFAamir Fatahayab
Aamir Fatahayab
The Wireless Sensor Network (WSN) is regarded as the fastest expanding technological trend in recent years due its application in a variety of sectors. In the monitoring region, several sensor nodes with various sensing capabilities are installed to gather appropriate data and communicate it to the gateway. The proposed system of the heterogeneous WSN employing LoRaWAN-Zigbee based hybrid communication is explored in this research study. To communicate in a network, two Long–Range Wide Area Network (LoRaWAN) sensor clusters and two Zigbee sensor clusters are employed, together with two Zigbee and LoRaWAN converters. The suggested Golden eagle shepherd optimization (GESO) method then forms Zigbee as well as LoRaWAN networking clusters. Furthermore, depending on energy usage and data packet size, the fitness of each sensor node is assessed using the Dynamic Intelligent Reasoning Based Neural (DIRN) approach. MATLAB software is used to implement and execute this study. When the Zigbee network’s transmission distance is 650 m and the LoRaWAN network’s transmission range is 3.5 km, the system can function with a packet loss rate of less than 0.04 percent. This study shows significant gains in the performance of the system when compared to traditional approaches based on digital findings obtained on software solutions.

6 April 2022 in Sensors
Verified
Journal Article
Open access
PDF file
AAAwad Ali
Awad Ali
MBMohammed Bakri Bashir
Mohammed Bakri Bashir
AHAlzubair Hassan
Alzubair Hassan
RHRafik Hamza
Rafik Hamza
SASamar Alqhtani
Samar Alqhtani
AAAdil Yousif Aboalgassim Alfaki
Adil Yousif Aboalgassim Alfaki
Software reliability is prioritised as the most critical quality attribute. Reliability prediction models participate in the prevention of software failures which can cause vital events and disastrous consequences in safety-critical applications or even in businesses. Predicting reliability during design allows software developers to avoid potential design problems, which can otherwise result in reconstructing an entire system when discovered at later stages of the software development life-cycle. Several reliability models have been built to predict reliability during software development. However, several issues still exist in these models. Current models suffer from a scalability issue referred to as the modeling of large systems. The scalability solutions usually come at a high computational cost, requiring solutions. Secondly, consideration of the nature of concurrent applications in reliability prediction is another issue. We propose a reliability prediction model that enhances scalability by introducing a system-level scenario synthesis mechanism that mitigates complexity. Additionally, the proposed model supports modeling of the nature of concurrent applications through adaption of formal statistical distribution toward scenario combination. The proposed model was evaluated using sensors-based case studies. The experimental results show the effectiveness of the proposed model from the view of computational cost reduction compared to similar models. This reduction is the main parameter for scalability enhancement. In addition, the presented work can enable system developers to know up to which load their system will be reliable via observation of the reliability value in several running scenarios.