The Internet of Medical Things (IoMT) has paved the way for innovative approaches to collecting and managing medical data. With the large and sensitive medical data being processed hence, the need for a strong identity and privacy become necessary. The present paper suggests a comprehensive method of PriMedGuard which aims at protection of the personal medical information. The first stage will be data collection from devices and sensors, then data cleaning to transform the data into the required format. There is also a safety system in the system that registers and authenticates authorized entities as well as ETDO (Enhanced Tasmanian Devil Optimization algorithm) is used for generating asymmetric cryptographic keys. The data is encrypted using the Secure Bit-Count Transmutation (SBCT) Data Encryption Algorithm and then put in the locations provided by the InterPlanetary File System (IPFS), a decentralized and distributed storage system. A safe smart contract on the blockchain is created so that the data retrieval is secure and MedSecEnsemble Detection is proposed as an intrusion detection technique in the IoMT network. By using this method, data will stay available while at the same time integrity, confidentiality and protection against vulnerabilities are ensured. Hence, the Internet of Medical Things ecosystem will be secured from unauthorized access and possible security threats…
1 January 2024 in Fusion: Practice and Applications
The industry 4.0 revolution is empowering the manufacturing sector with several advantages from the production to consumption stage of products, or beyond that. Recently, operators in factories have been accumulating extensive data from machine sensors and other organizational and operational technologies such as company enterprise and planning systems. Notably, having access to extensive data is a double-edged sword. To the best of our knowledge, there is not any work in the literature that proposed architecture for industry 4.0 based on a context-aware system. The aim of this research is to provide the context-aware architecture to enhance decision-making in factories and reduce the exposure of operators to the necessary and related findings. The proposed system is contextually aware of three aspects, operator feedback for previous similar findings, specifications of products under production, and historical data of manufacturing machines. The proposed system is proactive which attracted operator attention only when the findings were contextually related, based on the aforementioned aspects. The contributions of this research an intelligent architecture, a case study, and a mathematical model.
21 August 2024 in Advances and Applications in Discrete Mathematics
We determine the exact value of the connected domination metric dimension of some particular classes of graphs, such as the jewel graph, tortoise graph, globe graph, triangular book graph, and open diagonal ladder graph.
Let G = (V, E) be a connected, basic, and finite graph. A subset of V(G) is said to be a resolving set if for any y ∈ V(G), the code of y with regards to T, represented by , which is defined as , is different for various y. The dimension of G is the smallest cardinality of a resolving set and is denoted by dim(G). If, for any t ∈ V – S, there exists r ∈ S such that is a resolving set, then the resolving set S is secure. The secure metric dimension of 𝐺 is the cardinal number of the minimum secure resolving set. Determining the secure metric dimension of any given graph is an NP-complete problem. In addition, there are several uses for the metric dimension in a variety of fields, including image processing, pattern recognition, network discovery and verification, geographic routing protocols, and combinatorial optimization. In this paper, we determine the secure metric dimension of special graphs such as a globe graph , flag graph , H- graph of path , a bistar graph , and tadpole graph
23 November 2024 in Advances and Applications in Discrete Mathematics
For an ordered subset of vertices and in a connected graph , the -vector is the metric representation of vertex with respect to . is a resolving set for if various vertices of have different representations with respect to . A minimum resolving set is the lowest cardinality resolving set and is the cardinality of the dimension of . A resolving set of is connected if the subgraph produced by is a nontrivial connected subgraph of . The cardinality of the minimal resolving set is the metric dimension of , while the cardinality of the lowest connected resolving set is the connected metric dimension of . A connected metric dimension of , denoted by , is the lowest cardinality of a connected resolving set. The connected resolving number of a graph can be found using the algorithm presented in this work.