Zaid I. Rasool

Dr. Zaid I. Rasool

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
2 April 2021 in Sensors
Verified
Journal Article
Open access
PDF file
HAITHAM AL SATAIHAITHAM AL SATAI
HAITHAM AL SATAI
Musaddak AbdulzahraMusaddak Abdulzahra
Musaddak Abdulzahra
ZRZaid I. Rasool
Zaid I. Rasool
Ridhab Sami Abd-AliRidhab Sami Abd-Ali
Ridhab Sami Abd-Ali
Catalin PruncuCatalin Pruncu
Catalin Pruncu
Multirotor Unmanned Aerial Vehicles (UAVs) play an imperative role in many real-world applications in a variety of scenarios characterized by a high density of obstacles with different heights. Due to the complicated operation areas of UAVs and complex constraints associated with the assigned mission, there should be a suitable path to fly. Therefore, the most relevant challenge is how to plan a flyable path for a UAV without collisions with obstacles. This paper demonstrates how a flyable and continuous trajectory was constructed by using any-angle pathfinding algorithms, which are Basic Theta*, Lazy Theta*, and Phi* algorithms for a multirotor UAV in a cluttered environment. The three algorithms were modified by adopting a modified cost function during their implementation that considers the elevation of nodes. First, suitable paths are generated by using a modified version of the three algorithms. After that, four Bézier curves-based approaches are proposed to smooth the generated paths to be converted to flyable paths (trajectories). To determine the most suitable approach, particularly when searching for an optimal and collision-free trajectory design, an innovative evaluation process is proposed and applied in a variety of different size environments. The evaluation process results show high success rates of the four approaches; however, the approach with the highest success rate is adopted. Finally, based on the results of the evaluation process, a novel algorithm is proposed to increase the efficiency of the selected approach to the optimality in the construction process of the trajectory.

1 July 2022 in Indonesian Journal of Electrical Engineering and Computer Science
Verified
Journal Article
Open access
PDF file
ASAli Hussein Shamman
Ali Hussein Shamman
HAHussein Ali Alasadi
Hussein Ali Alasadi
ZRZaid I. Rasool
Zaid I. Rasool
hasan muwafaq ghenihasan muwafaq gheni
hasan muwafaq gheni
Cloud services are the cutting edge technology, however the growing demand for the internet of things has certain limitations which are high latency expectation and high cost of cloud resources, and this is caused by long-distance between application and cloud. Fog computing is a distributed extension of the cloud, which provide storage and computation at the network level. It consists of an internet of things (IoT) application, a fog control node, and a fog access node. This research works towards minimizing the cloud cost in scheduling. For this purpose, a cost-effective task and user scheduling algorithm are performed. The first task scheduling model is composed based on composers' roles after that task scheduling algorithm is performed to handle the various task at the fog access node in an optimized manner. Finally, the reallocation mechanism reduces the time and service delay. For the analysis purpose extensive simulation is carried out and performance statistics were compared with other existing algorithms. It was observed that the proposed algorithm provides highly cost-optimized user and task scheduling with better performance statistics and reduces the delay in the task by providing optimization in the concurrent task at the fog node.

22 July 2025 in Statistics, Optimization & Information Computing
Verified
Journal Article
Open access
PDF file
MAMayas Aljibawi
Mayas Aljibawi
HAHayder Kareem Algabri
Hayder Kareem Algabri
ZRZaid I. Rasool
Zaid I. Rasool
Clustering is a critical unsupervised learning technique for identifying patterns and structures in data. Traditional algorithms, such as density-based clustering non-parametric algorithm (DBSCAN), struggle with datasets characterized by varying densities, overlapping features, and noise, leading to suboptimal clustering quality. To address these limitations, this study introduces an Enhanced Adaptive DBSCAN (ADBSCAN) algorithm that dynamically adjusts the epsilon parameter and leverages silhouette score validation to improve cluster quality. The algorithm was tested on three benchmark datasets representing varying complexities. Findings showed that Enhanced ADBSCAN could find significant clusters, especially in datasets with modest feature overlap. However, datasets with substantial overlap and high-density variations presented difficulties. The findings demonstrate how important parameter selection is and how adaptive techniques that dynamically modify these parameters in response to data properties can greatly improve clustering performance on a variety of data sets. Future studies should concentrate on enhancing adaption mechanisms to better manage overlapping features and varying data density, enhancing the algorithm's resilience and practicality.

31 December 2025 in CyberSystem Journal
Verified
Journal Article
Open access
ZRZaid I. Rasool
Zaid I. Rasool
NHNisreen Hadi
Nisreen Hadi
Privacy-preserving data-sharing mechanisms traditionally rely on data anonymization techniques, which aim to dissociate individual records from their corresponding data subjects in order to transform sensitive information into a form that minimizes the risk of re-identification. In parallel, trust-broker models have emerged as an additional layer of protection, whereby authorized data providers disclose controlled contact information that enables potential data users to request access under predefined conditions determined by the data owner. In contemporary data-sharing environments, cryptography remains a fundamental pillar for ensuring confidentiality and integrity during data exchange. Cryptographic protection typically involves two operations: an encryption process, in which the sender transforms plaintext into ciphertext that is unintelligible to unauthorized entities, and a decryption process, in which only the intended recipient restores the ciphertext to its original form. Both operations rely on a cryptographic algorithm paired with one or more secret keys. Symmetric-key cryptography employs a single shared key for both encryption and decryption. In contrast, asymmetric cryptography uses a mathematically linked pair of keys, where one key is used for encryption and the other for decryption. When the encryption key is publicly available while the corresponding decryption key remains private, only the legitimate recipient holding the private key is capable of recovering the plaintext. This cryptographic structure forms the basis for securing data confidentiality against unauthorized access in both classical and quantum-aware communication systems.