Mohamed-Hamed MOUSA

Dr. Mohamed-Hamed MOUSA

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
21 February 2020 in IEEE Access
Verified
Journal Article
Open access
MHMohamed Hussein
Mohamed Hussein
MMMohamed-Hamed MOUSA
Mohamed-Hamed MOUSA
The current thinking concerning computations required by Internet of Things (IoT) applications is shifting toward fog computing instead of cloud computing, thereby achieving most of the required computations at the network edge of the IoT devices. Fog computing can thus improve the quality of service of delay-sensitive applications by allowing such applications to take advantage of the low latency provided by fog computing rather than the high latency of the cloud. Therefore, tasks in various IoT applications must be effectively distributed over the fog nodes to improve the quality of service, specifically the task response time. In this paper, two nature-inspired meta-heuristic schedulers, namely ant colony optimization (ACO) and particle swarm optimization (PSO), are used to propose two different scheduling algorithms to effectively load balance IoT tasks over the fog nodes under communication cost and response time considerations. The experimental results of the proposed algorithms are compared with those of the round robin (RR) algorithm. The evaluations show that the proposed ACO-based scheduler achieves an improvement in the response times of IoT applications compared to the proposed PSO-based and RR algorithms and effectively load balances the fog nodes.

1 January 2022 in Computer Modeling in Engineering & Sciences
Verified
Journal Article
Open access
PDF file
MMMohamed-Hamed MOUSA
Mohamed-Hamed MOUSA
MHMohamed K. Hussein
Mohamed K. Hussein
Mobile-Edge Computing (MEC) displaces cloud services as closely as possible to the end user. This enables the edge servers to execute the offloaded tasks that are requested by the users, which in turn decreases the energy consumption and the turnaround time delay. However, as a result of a hostile environment or in catastrophic zones with no network, it could be difficult to deploy such edge servers. Unmanned Aerial Vehicles (UAVs) can be employed in such scenarios. The edge servers mounted on these UAVs assist with task offloading. For the majority of IoT applications, the execution times of tasks are often crucial. Therefore, UAVs tend to have a limited energy supply. This study presents an approach to offload IoT user applications based on the usage of Voronoi diagrams to determine task delays and cluster IoT devices dynamically as a first step. Second, the UAV flies over each cluster to perform the offloading process. In addition, we propose a Graphics Processing Unit (GPU)-based parallelization of particle swarm optimization to balance the cluster sizes and identify the shortest path along these clusters while minimizing the UAV flying time and energy consumption. Some evaluation results are given to demonstrate the effectiveness of the presented offloading strategy.

5 August 2021 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MMMohamed-Hamed MOUSA
Mohamed-Hamed MOUSA
MHMohamed Hussein
Mohamed Hussein
Due to advances in high-performance computing technologies, computer graphics techniques—especially those related to mesh simplification—have been noticeably improved. These techniques, which have a strong impact on many applications, such as geometric modeling and visualization, have been well studied for more than two decades. Recent advances in GPUs have led to significant improvements in terms of speed and interactivity. In this paper, we present a mesh simplification algorithm that benefits from the parallel framework provided by recent GPUs. We customize the halfedge data structure for adaption with the dynamic memory restrictions of CUDA. The proposed algorithm is fully parallelized by employing a lock-free skip priority queue and a set of disjoint regions of the mesh. The proposed technique accelerates the simplification process while preserving the topological properties of the mesh. Some results and comparisons are provided to verify the efficiency of the proposed algorithm.

1 November 2008 in Computer Aided Geometric Design
Verified
Journal Article
Closed access
MMMohamed-Hamed MOUSA
Mohamed-Hamed MOUSA
RCR. Chaine
R. Chaine
SAS. Akkouche
S. Akkouche
EGE. Galin
E. Galin

1 August 2011
Verified
Conference Paper
Closed access
MMMohamed-Hamed MOUSA
Mohamed-Hamed MOUSA
The ability to identify similarities between shapes is important for applications such as medical diagnosis, object registration and alignment, and shape retrieval. This paper focuses on handling this issue using one of the well-known features that describe the local intrinsic properties of the shape. This feature is the principle curvatures (k1, k2) of the 3D shape. We introduce a framework of stable mathematical calculations to approximate these geometric properties. Once the principle curvatures are calculated, we can construct, for each shape, a matrix that represents two dimensional distribution of these curvatures as a shape descriptor for further searching operation. This descriptor is invariant to shape orientation and reflects the geometric properties of the surface. Experimental results are presented and it proves the robustness of the descriptor.

10 February 2022 in Computers and Electrical Engineering
Verified
Journal Article
Open access
MMMohamed-Hamed MOUSA
Mohamed-Hamed MOUSA
MHMohamed K. Hussein
Mohamed K. Hussein