A Novel Cost-Efficient Framework for Critical Heartbeat Task Scheduling Using the Internet of Medical Things in a Fog Cloud System.

Recently, there has been a cloud-based Internet of Medical Things (IoMT) solution offering different healthcare services to wearable sensor devices for patients. These services are global, and can be invoked anywhere at any place. Especially, electrocardiogram (ECG) sensors, such as Lead I and Lead II, demands continuous cloud services for real-time execution. However, these services are paid and need a lower cost-efficient process for the users. In this paper, this study considered critical heartbeat cost-efficient task scheduling problems for healthcare applications in the fog cloud system. The objective was to offer omnipresent cloud services to the generated data with minimum cost. This study proposed a novel health care based fog cloud system (HCBFS) to collect, analyze, and determine the process of critical tasks of the heartbeat medical application for the purpose of minimizing the total cost. This study devised a health care awareness cost-efficient task scheduling (HCCETS) algorithm framework, which not only schedule all tasks with minimum cost, but also executes them on their deadlines. Performance evaluation shows that the proposed task scheduling algorithm framework outperformed the existing algorithm methods in terms of cost.

A hybrid algorithm for clustering of time series data based on affinity search technique.

Time series clustering is an important solution to various problems in numerous fields of research, including business, medical science, and finance. However, conventional clustering algorithms are not practical for time series data because they are essentially designed for static data. This impracticality results in poor clustering accuracy in several systems. In this paper, a new hybrid clustering algorithm is proposed based on the similarity in shape of time series data. Time series data are first grouped as subclusters based on similarity in time. The subclusters are then merged using the k-Medoids algorithm based on similarity in shape. This model has two contributions: (1) it is more accurate than other conventional and hybrid approaches and (2) it determines the similarity in shape among time series data with a low complexity. To evaluate the accuracy of the proposed model, the model is tested extensively using syntactic and real-world time series datasets.