Adaptive Trust Calculation in Fog Computing / (Record no. 594916)

000 -LEADER
fixed length control field 01838nam a22001577a 4500
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1,NAW
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Nawaz, Alishba
245 ## - TITLE STATEMENT
Title Adaptive Trust Calculation in Fog Computing /
Statement of responsibility, etc. Alishba Nawaz
264 ## - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Rawalpindi
Name of producer, publisher, distributor, manufacturer MCS, NUST
Date of production, publication, distribution, manufacture, or copyright notice 2023
300 ## - PHYSICAL DESCRIPTION
Extent x, 52 p
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Fog is well suited for situations where a huge number of decentralized devices must communicate, provide live analysis of data, and perform storage jobs because of its inherent decentralized nature and capacity to process data in transit, i.e., ability to draw conclusions in real-time. Fog computing offers the dependability that time-sensitive smart healthcare systems require because of its ability to operate near the end user and independence from centralized architecture. Because healthcare data is so vital, there is a need for stronger security and privacy solutions for fog computing, where trust is crucial The goal of this research is to provide a context-based adaptive trust solution for the smart healthcare environment using Bayesian technique and similarity measures against bad mouthing and ballot stuffing since context dependent trust solution for fogs is still an open research topic. To assess our findings, the proposed trust model has been simulated in Contiki and Cooja. In contrast to static weighting, adaptive weights assigned to direct and indirect trust using entropy values assure the least amount of trust bias, and calculations of context similarity remove recommender nodes with malevolent intent utilizing server, coworker, and service similarity. Due to its minimal trust computation overhead and linear complexity O(n), this model is effective.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element MSCSE / MSSE-27
690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN)
Topical term or geographic name as entry element MSCSE / MSSE
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Supervisor Dr. Mian Muhammad Waseem Iqbal
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Thesis
Holdings
Withdrawn status Permanent Location Current Location Shelving location Date acquired Full call number Barcode Koha item type
  Military College of Signals (MCS) Military College of Signals (MCS) Thesis 06/06/2023 005.1,NAW MCSTCS-546 Thesis
© 2023 Central Library, National University of Sciences and Technology. All Rights Reserved.