Context-Based Adaptive Fog Computing Trust Solution for Time-Critical Smart Healthcare Systems

2023

Closed access Metadata (CSL-JSON)
DOI 10.1109/jiot.2023.3242126
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Fog’s inherent decentralized nature and ability to process data in transit, i.e., the ability to draw conclusions in real-time, are quite suitable for scenarios where an enormous number of decentralized devices need to communicate and provide live analysis of data and storage tasks. Fog computing’s ability to work close to the end user and non-reliance on centralized architecture provides the dependability that time-critical smart healthcare systems need. Because of the critical nature of healthcare data, better security and privacy solutions for fog computing are required, with trust being of the utmost importance. Context-dependent trust solution for fogs is still an open research area, so the aim of this research is to propose a context-based adaptive trust solution for smart healthcare environments using a Bayesian approach and similarity measures. The proposed trust model has been simulated in Contiki, Cooja, and a Java-based application has been developed to analyze our results. Adaptive weights assigned to direct and indirect trust using entropy values ensure the minimization of trust bias as opposed to static weighting. Context-based similarity calculations filter out recommender nodes with malicious intent using server, social contact, and service similarity. This model is efficient and has a low-trust computation overhead because it has a linear complexity of$O(n)$.