Offloading Decision Algorithm Based on Distance Weighted K-Nearest Neighbor in Power Internet of Things

With the widespread popularity of power Internet of Things (PIoT), the data collected from smart meters are growing explosively, which makes the calculation task of power data more and more complex. In order to improve computing power and maximize resource utilization, an offloading decision algorithm based on weighted K-nearest neighbor (WKNN) is proposed. It first collects the training set required by the WKNN-based algorithm, including the Received Signal Strength (RSS) required for offloading, the transmission rate, and the load balance of the Access Point (AP), and then the Euclidean distance between the training set and the sample is weighted by Gaussian function. Finally, the result with the largest K similarities in the training set is the offloading result. The simulation results show that the proposed algorithm reduces the offloading delay of the computing tasks and improves the resource utilization rate effectively when the number of meters increases in the network, which ensures that the resources of the mobile edge computing (MEC) servers in the system can be effectively and evenly utilized

Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense Networks

Mobile Edge Computing (MEC) pushes computing functionalities away from the centralized cloud to the network edge, thereby meeting the latency requirements of many emerging mobile applications and saving backhaul network bandwidth. Although many existing works have studied computation offloading policies, service caching is an equally, if not more important, design topic of MEC, yet receives much less attention. Service caching refers to caching application services and their related databases/libraries in the edge server (e.g. MEC-enabled BS), thereby enabling corresponding computation tasks to be executed. Because only a small number of application services can be cached in resource-limited edge server at the same time, which services to cache has to be judiciously decided to maximize the edge computing performance. In this paper, we investigate the extremely compelling but much less studied problem of dynamic service caching in MEC-enabled dense cellular networks. We propose an efficient online algorithm, called OREO, which jointly optimizes dynamic service caching and task offloading to address a number of key challenges in MEC systems, including service heterogeneity, unknown system dynamics, spatial demand coupling and decentralized coordination. Our algorithm is developed based on Lyapunov optimization and Gibbs sampling, works online without requiring future information, and achieves provable close-to-optimal performance. Simulation results show that our algorithm can effectively reduce computation latency for end users while keeping energy consumption low

Computation Peer Offloading in Mobile Edge Computing with Energy Budgets

The dense deployment of small-cell base stations (SBSs) endowed with cloud-like computing capabilities paves the way for pervasive mobile edge computing (MEC), enabling ultra-low latency and location-awareness for emerging mobile applications. To handle spatially imbalanced computation workloads in the network, cooperation among SBSs via peer offloading is essential to avoid large latency at overloaded SBSs and provide high quality of service to end users. However, performing effective peer offloading faces many challenges due to uncertainties of the system dynamics, limited energy budget committed by SBS owners and co- provisioning of radio access and computing services. This paper develops a novel online SBS peer offloading framework, called OPEN, by leveraging the Lyapunov technique, in order to maximize the long-term system performance while keeping the energy consumption of SBSs below individual long-term energy budget. OPEN works online without requiring future information of system dynamics, yet provides provably near-optimal performance compared to the oracle solution with complete future information. Extensive simulations are carried out and show that proposed algorithm dramatically improves the performance of edge computing system