Hamad Almohamedh

Hamad Almohamedh


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
29 January 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
SWSharyar Wani
Sharyar Wani
VIV A Mohammed imthiyas
V A Mohammed imthiyas
HAHamad Almohamedh
Hamad Almohamedh
KAKhalid M Alhamed
Khalid M Alhamed
SASultan Almotairi
Sultan Almotairi
Yonis GulzarYonis Gulzar
Yonis Gulzar
Distributed Denial of Service (DDoS) attack is a major threat impeding service to legitimate requests on any network. Although the first DDoS attack was reported in 1996, the complexity and sophistication of these attacks has been ever increasing. A 2 TBps attack was reported in mid-August 2020 directed towards critical infrastructure, such as finance, amidst the COVID-19 pandemic. It is estimated that these attacks will double, reaching over 15 million, in the next 2 years. A number of mitigation schemes have been designed and developed since its inception but the increasing complexity demands advanced solutions based on emerging technologies. Blockchain has emerged as a promising and viable technology for DDoS mitigation. The inherent and fundamental characteristics of blockchain such as decentralization, internal and external trustless attitude, immutability, integrity, anonymity and verifiability have proven to be strong candidates, in tackling this deadly cyber threat. This survey discusses different approaches for DDoS mitigation using blockchain in varied domains to date. The paper aims at providing a comprehensive review, highlighting all necessary details, strengths, challenges and limitations of different approaches. It is intended to serve as a single platform to understand the mechanics of current approaches to enhance research and development in the DDoS mitigation domain.

21 September 2022 in BioMed Research International
Verified
Journal Article
Open access
PDF file
YMYar Muhammad
Yar Muhammad
MMmoteeb Al Moteri
moteeb Al Moteri
HMHana Mohammed Mujlid
Hana Mohammed Mujlid
AAAbdulrhman Alharbi
Abdulrhman Alharbi
FAFahad Alqurashi
Fahad Alqurashi
HAHamad Almohamedh
Hamad Almohamedh
Healthcare occupies a central role in sustainable societies and has an undeniable impact on the well‐being of individuals. However, over the years, various diseases have adversely affected the growth and sustainability of these societies. Among them, heart disease is escalating rapidly in both economically settled and undeveloped nations and leads to fatalities around the globe. To reduce the death ratio caused by this disease, there is a need for a framework to continuously monitor a patient’s heart status, essentially doing early detection and prediction of heart disease. This paper proposes a scalable Machine Learning (ML) and Internet of Things‐(IoT‐) based three‐layer architecture to store and process a large amount of clinical data continuously, which is needed for the early detection and monitoring of heart disease. Layer 1 of the proposed framework is used to collect data from IoT wearable/implanted smart sensor nodes, which includes various physiological measures that have significant impact on the deterioration of heart status. Layer 2 stores and processes the patient data on a local web server using various ML classification algorithms. Finally, Layer 3 is used to store the critical data of patients on the cloud. The doctor and other caregivers can access the patient health conditions via an android application, provide services to the patient, and inhibit him/her from further damage. Various performance evaluation measures such as accuracy, sensitivity, specificity, F1‐measure, MCC‐score, and ROC curve are used to check the efficiency of our proposed IoT‐based heart disease prediction framework. It is anticipated that this system will assist the healthcare sector and the doctors in diagnosing heart patients in the initial phases.

15 December 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
RARawad Prof. Dr. Rawad Abdulghafor
Rawad Prof. Dr. Rawad Abdulghafor
SASultan Almotairi
Sultan Almotairi
HAHamad Almohamedh
Hamad Almohamedh
Sherzod TuraevSherzod Turaev
Sherzod Turaev
BABadr Almutairi
Badr Almutairi
This article explores nonlinear convergence to limit the effects of the consensus problem that usually occurs in multi-agent systems. Most of the existing research essentially considers the outline of linear protocols, using complex mathematical equations in various orders. In this work, however, we designed and developed an alternative nonlinear protocol based on simple and effective mathematical approaches. The designed protocol in this sense was modified from the Doubly Stochastic Quadratic Operators (DSQO) and was aimed at resolving consensus problems. Therefore, we called it Modified Doubly Stochastic Quadratic Operators (MDSQO). The protocol was derived in the context of coordinated systems to overcome the consensus issue related to multi-agent systems. In the process, we proved that by using the proposed nonlinear protocol, the consensus could be reached via a common agreement among the agents (average consensus) in a fast and easy fashion without losing any initial status. Moreover, the investigated nonlinear protocol of MDSQO realized the reaching consensus always as well as DSQO in some cases, which could not reach consensus. Finally, simulation results were given to prove the validity of the theoretical analysis.

3 April 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
RARawad Prof. Dr. Rawad Abdulghafor
Rawad Prof. Dr. Rawad Abdulghafor
SASultan Almotairi
Sultan Almotairi
HAHamad Almohamedh
Hamad Almohamedh
BABadr Almutairi
Badr Almutairi
ABAbdullah Bajahzar
Abdullah Bajahzar
SASulaiman Almutairi
Sulaiman Almutairi
We investigate a novel nonlinear consensus from the extreme points of doubly stochastic quadratic operators (EDSQO), based on majorization theory and Markov chains for time-varying multi-agent distributed systems. We describe a dynamic system that has a local interaction network among agents. EDSQO has been applied for distributed agent systems, on a finite dimensional stochastic matrix. We prove that multi-agent systems converge at a center (common value) via the extreme waited value of doubly stochastic quadratic operators (DSQO), which are only 1 or 0 or 1/2 1 2 if the exchanges of each agent member has no selfish communication. Applying this rule means that the consensus is nonlinear and low-complexity computational for fast time convergence. The investigated nonlinear model of EDSQO follows the structure of the DeGroot linear (DGL) consensus model. However, EDSQO is nonlinear and faster convergent than the DGL model and is of lower complexity than DSQO and cubic stochastic quadratic operators (CSQO). The simulation result and theoretical proof are illustrated.

1 January 2021 in Complexity
Verified
Journal Article
Open access
PDF file
Muhammad AsifMuhammad Asif
Muhammad Asif
HAHamad Almohamedh
Hamad Almohamedh
MHMuhammad Hussain
Muhammad Hussain
KAKhalid M Alhamed
Khalid M Alhamed
AAAbdulrazaq A. Almutairi
Abdulrazaq A. Almutairi
SASultan Almotairi
Sultan Almotairi
Graph theory is a dynamic tool for designing and modeling of an interconnection system by a graph. The vertices of such graph are processor nodes and edges are the connections between these processors nodes. The topology of a system decides its best use. Geometric‐arithmetic index is one of the most studied graph invariant to characterize the topological aspects of underlying interconnection networks or graphs. Transformation over graph is also an important tool to define new network of their own choice in computer science. In this work, we discuss transformed family of graphs. Let be the connected graph comprises by k number of pendent path attached with fully connected vertices of the n‐vertex connected graph Γ. Let and be the transformed graphs under the fact of transformations Aα and , 0 ≤ α ≤ l, 0 ≤ β ≤ k − 1, respectively. In this work, we obtained new inequalities for the graph family and transformed graphs and which involve GA(Γ). The presence of GA(Γ) makes the inequalities more general than all those which were previously defined for the GA index. Furthermore, we characterize extremal graphs which make the inequalities tight.

16 April 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
FEFarukh Ejaz
Farukh Ejaz
MHMuhammad Hussain
Muhammad Hussain
HAHamad Almohamedh
Hamad Almohamedh
KAKhalid M. Alhamed
Khalid M. Alhamed
Rana AlabdanRana Alabdan
Rana Alabdan
SASultan Almotairi
Sultan Almotairi
Graph theory is a discrete branch of mathematics for designing and predicting a network. Some topological invariants are mathematical tools for the analysis of connection properties of a particular network. The Cellular Neural Network (CNN) is a computer paradigm in the field of machine learning and computer science. In this article we have given a close expression to dominating invariants computed by the dominating degree for a cellular neural network. Moreover, we have also presented a 3D comparison between dominating invariants and classical degree-based indices to show that, in some cases, dominating invariants give a better correlation on the cellular neural network as compared to classical indices.