A game‐theoretic approach of mixing different qualities of coins

Secure and failure hybrid delay enabled a lightweight RPC and SHDS schemes in Industry 4.0 aware IIoHT enabled fog computing

These days, the Industrial Internet of Healthcare Things (IIT) enabled applications have been growing progressively in practice. These applications are ubiquitous and run onto the different computing nodes for healthcare goals. The applications have these tasks such as online healthcare monitoring, live heartbeat streaming, and blood pressure monitoring and need a lot of resources for execution. In IIoHT, remote procedure call (RPC) mechanism-based applications have been widely designed with the network and computational delay constraints to run healthcare applications. However, there are many requirements of IIoHT applications such as security, network and computation, and failure efficient RPC with optimizing the quality of services of applications. In this study, the work devised the lightweight RPC mechanism for IIoHT applications and considered the hybrid constraints in the system. The study suggests the secure hybrid delay scheme (SHDS), which schedules all healthcare workloads under their deadlines. For the scheduling problem, the study formulated this problem based on linear integer programming, where all constraints are integer, as shown in the mathematical model. Simulation results show that the proposed SHDS scheme and lightweight RPC outperformed the hybrid for IIoHT applications and minimized 50% delays compared to existing RPC and their schemes.

Dynamic Application Partitioning and Task-Scheduling Secure Schemes for Biosensor Healthcare Workload in Mobile Edge Cloud

Currently, the use of biosensor-enabled mobile healthcare workflow applications in mobile edge-cloud-enabled systems is increasing progressively. These applications are heavyweight and divided between a thin client mobile device and a thick server edge cloud for execution. Application partitioning is a mechanism in which applications are divided based on resource and energy parameters. However, existing application-partitioning schemes widely ignore security aspects for healthcare applications. This study devises a dynamic application-partitioning workload task-scheduling-secure (DAPWTS) algorithm framework that consists of different schemes, such as min-cut algorithm, searching node, energy-enabled scheduling, failure scheduling, and security schemes. The goal is to minimize the energy consumption of nodes and divide the application between local nodes and edge nodes by applying the secure min-cut algorithm. Furthermore, the study devises the secure-min-cut algorithm, which aims to migrate data between nodes in a secure form during application partitioning in the system. After partitioning the applications, the node-search algorithm searches optimally to run applications under their deadlines. The energy and failure schemes maintain the energy consumption of the nodes and the failure of the system. Simulation results show that DAPWTS outperforms existing baseline approaches by 30% in terms of energy consumption, deadline, and failure of applications in the system.