Khalid M. Alhamed

Khalid M. Alhamed

Auto-generated profile, based on publicly available information

Khalid M. Alhamed

IT Programs Center, Faculty of IT Department, Institute of Public Administration, Riyadh 11141, Saudi Arabia

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
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.

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.

12 May 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
Muhammad AsifMuhammad Asif
Muhammad Asif
MHMuhammad Hussain
Muhammad Hussain
HAHamad Almohamedh
Hamad Almohamedh
KAKhalid Alhamed
Khalid Alhamed
Rana AlabdanRana Alabdan
Rana Alabdan
SASultan Almotairi
Sultan Almotairi
Topology of fullerenes, carbon nanotubes, and nanocones has considerable worth due to their effective applications in nanotechnology. These are emerging materials of practical application in gas storage devises, nanoelectronics devices, energy storage, biosensor, and chemical probes. The topological indices are graph invariant used to investigate the physical and chemical properties of the compounds such as boiling point, stability, and strain energy through associated chemical graph of the underlying compound. We computed recently modified Zagreb connection indices of nanocones , and and generalized our findings up to a large class of . Topological characterization of nanocones via these indices is mathematically novel and assists to enable its emerging use in nanotechnology. For computation and verification of results, we use Mathematica software.

28 February 2021 in Journal of Chemistry
Verified
Journal Article
Open access
PDF file
Muhammad AsifMuhammad Asif
Muhammad Asif
MHMuhammad Hussain
Muhammad Hussain
HAHamad Almohamedh
Hamad Almohamedh
KAKhalid M. Alhamed
Khalid M. Alhamed
SASultan Almotairi
Sultan Almotairi
The inverse degree index is a topological index first appeared as a conjuncture made by computer program Graffiti in 1988. In this work, we use transformations over graphs and characterize the inverse degree index for these transformed families of graphs. We established bonds for different families of -vertex connected graph with pendent paths of fixed length attached with fully connected vertices under the effect of transformations applied on these paths. Moreover, we computed exact values of the inverse degree index for regular graph specifically unicyclic graph.