ABSTRACT Collaboration spaces formed from edge servers can efficiently improve the quality of experience of service subscribers. In this paper, we first utilize a strategy based on the density of Internet of Things (IoT) devices and k-means algorithm to partition network of edge servers, then an algorithm for IoT devices' computation offloading decisions is proposed, i.e., whether we need to offload IoT devices' workload to edge servers, and which edge server to choose if migration is needed. The combination of locations of edge servers and the geographic distribution of various IoT devices can significantly improve the scheduling of network resources and satisfy requirements of service subscribers. We analyze and build mathematical models about whether/how to offload tasks from various IoT devices to edge servers. In order to better simulate operations of the mobile edge servers in more realistic scenarios, the input size of each IoT device is uncertain and regarded as a random variable following some probability distribution based on long-term observations. On the basis of that, an algorithm utilizing sample average approximation method is proposed to discuss whether the tasks to be executed locally or offloaded. Besides, the algorithm proposed can also help decide whether service relocation/migration is needed or not. Finally, simulation results show that our algorithm can achieve 20% of global cost less than the benchmark on a true base station dataset of Hangzhou. INDEX TERMS Cooperative networks, edge computing, IoT devices, sample average approximation, service relocation.
Zhang et al. REF utilize a strategy based on the density of internet of things (IoT) devices and k-means algorithm to partition network of edge servers and proposed an algorithm for IoT devices' computation offloading decisions.
A Density-Based Offloading Strategy for IoT Devices in Edge Computing Systems
IEEE Access
IEEE Access
Computer Science