The Deadline- and Energy-Aware Resource Allocation using a Combination of Multi-Criteria Greedy Approach and Decision Tree in the IoT-Edge-Cloud Environment
Subject Areas : electrical and computer engineeringshiva Razzaghzadeh 1 , Sara Hoseynpour 2
1 - Dept. of Com. Eng., Ardabil Branch, Islamic Azad University, Ardabil, Iran
2 - Dept. of Com. Eng., Ardabil Branch, Islamic Azad University, Ardabil, Iran
Keywords: Internet of things (IoT), resource allocation, scheduling, decision tree, multi-criteria greedy approach.,
Abstract :
With the rapid growth of the Internet of Things (IoT), the volume of data collected from sensors has increased significantly. As a result, there is a growing need to connect IoT devices to cloud servers to meet the demands of data storage, processing, and analysis. Furthermore, the emergence of intermediate technologies, such as fog computing, which performs initial computations on requests at the network edge, has reduced the computational load sent to the cloud. However, task scheduling in cloud resources remains a challenging problem. Resource scheduling, as an NP-Hard problem, involves the optimal and efficient allocation and distribution of resources (such as processors, memory, networks, etc.) to tasks in cloud servers. Therefore, many researchers have attempted to propose heuristic-based algorithms to find near-optimal solutions. In these approaches, the primary goal is to find the appropriate resource for task allocation, while the task’s execution deadline is not always considered. In IoT applications, the data may correspond to critical tasks that require quick responses, which has often been overlooked in previous methods. Therefore, this paper proposes a resource allocation approach using scheduling in the IoT-Fog-Cloud framework, based on a combination of decision trees for task prioritization and a multi-criteria greedy approach. Simulation results show that the proposed method, by prioritizing tasks and balancing multiple objectives using a multi-criteria greedy approach, performs near-optimally in terms of evaluation criteria such as cost and task completion time, and improves upon previous methods.