关键词： Mobile edge computing   Cloud computing   Partial offloading   Computation resource allocation   Radio resource allocation   D2D communication   Multi-RAT  

摘要： Due to the exploding traffic demands and the diversity of novel applications requiring extensive computation and radio resources, research has been active to devise mechanisms for responding to these challenges. Mobile edge computing (MEC) and device-to-device (D2D) computation task offloading are expected to play a major role in serving devices with limited capabilities, and thus enhance system performance. In this work, we propose a joint computing, communication and cost-aware task offloading optimization problem aiming at maximizing the number of completed tasks, while minimizing energy consumption and monetary cost in D2D-enabled heterogeneous MEC networks. Our proposed scheme allows partial offloading where a requester mobile terminal offloads different parts of its data task simultaneously to multiple peer mobile terminals (MTs), edge servers and cloud. We formulate and solve the optimal allocation strategy then decompose the problem into two sub-problems in an attempt to reduce its complexity. Furthermore, we propose a low-complexity algorithm that generates high performance results and can be applied for large-scale networks. Compared to conventional and state-of-the-art system models, results show the effectiveness of the proposed schemes and provide useful insights into the tradeoffs between the number of completed tasks, energy consumption and monetary cost.

关键词： Mobile edge computing  

摘要： In recent years, deep learning models have become ubiquitous in industry and academia alike. Deep neural networks can solve some of the most complex pattern-recognition problems today, but come with the price of massive compute and memory requirements. This makes the problem of deploying such large-scale neural networks challenging in resource-constrained mobile edge computing platforms, specifically in mission-critical domains like surveillance and healthcare. To solve this, a promising solution is to split resource-hungry neural networks into lightweight disjoint smaller components for pipelined distributed processing. At present, there are two main approaches to do this: semantic and layer-wise splitting. The former partitions a neural network into parallel disjoint models that produce a part of the result, whereas the latter partitions into sequential models that produce intermediate results. However, there is no intelligent algorithm that decides which splitting strategy to use and places such modular splits to edge nodes for optimal performance. To combat this, this work proposes a novel AI-driven online policy, SplitPlace, that uses Multi-Armed-Bandits to intelligently decide between layer and semantic splitting strategies based on the input task's service deadline demands. SplitPlace places such neural network split fragments on mobile edge devices using decision-aware reinforcement learning for efficient and scalable computing. Moreover, SplitPlace fine-tunes its placement engine to adapt to volatile environments. Our experiments on physical mobile-edge environments with real-world workloads show that SplitPlace can significantly improve the state-of-the-art in terms of average response time, deadline violation rate, inference accuracy, and total reward by up to 46, 69, 3 and 12 percent respectively. © 2022, CC BY.

关键词： Mobile edge computing  

摘要： The cooperation between Unmanned Aerial Vehicles (UAVs) and ground Mobile Edge Computing (MEC) servers in processing tasks is becoming one of the main research trends of MEC networks. Despite the advantages of UAV-assisted MEC, it is restricted by the limited battery capacity and sensitive energy consumption of UAVs. Unlike the previous works where UAVs are allowed to either process tasks locally or offload them to ground MEC servers, in this paper, we propose a multi-hop task routing solution for Internet of Things (IoT) networks in which a UAV can also relay to another UAV with better connection to a ground MEC server. Furthermore, the UAV can make benefit of existing Intelligent Reflective Surfaces (IRSs) to further improve tasks offloading and reduce energy consumption. We show that the problem of minimizing the total energy of UAVs is NP-hard, and we propose a graph-based heuristic solution to solve it. Simulation results show that the proposed graph-based solution outperforms the traditional no-relaying scheme, especially when IRSs are deployed. Furthermore, a Convolutional Neural Network (CNN) is devised to reduce the delay of finding the decisions for the UAVs at the centralized coordinator. Simulations show that the CNN achieves very close energy consumption performance and a remarkable reduction in execution time compared to the graph-based heuristic solution. © 2022, CC BY.

关键词： computation offloading   edge server   mobile edge computing   multihop mesh communication   quality of experience  

摘要： Due to the rapid development of smart phone utilization, the use of fast response with delay sensitive applications leads to high traffic demands. These issues are not yet fulfill by current researchers. When there is a massive crowd of users gathering in hot spot areas such as, railway stations, corporate centers, and malls requires service accessing social networks, then there cause uncertain traffic with congestion and network delay. In this article, an efficient offloading mechanism (EOM) is proposed to transfer the user's intensive computations to picocells, where each picocell (PE) isintegratedwith the functionalities of edge. Moreover, a novel distributed multihop mesh middle layer (DMMM) framework is proposed for seamless communication, where the self-healing network provides high resilience, immediate response, and multiuser content sharing and saves battery power. Generally, a picocell is a distributed antenna system that is an alternative to the repeater utilized to extend wireless services to 100 users. An adaptive ant optimization (AAO) algorithm is developed for backhaul routing conflicts. Simulation outcomes of edge cloud sim prove that the offloading tiny devices incorporated to considerable additional computational capacities can fulfill all the demands within 15 ms delay from each network.

关键词： Mobile edge computing  

摘要： Aiming at the problem that computing power and resources of Mobile Edge Computing (MEC) servers are difficult to process long-period intensive task data, this study proposes a 5G converged network resource allocation strategy based on reinforcement learning in edge cloud computing environment. n order to solve the problem of insufficient local computing power, the proposed strategy offloads some tasks to the edge of network. Firstly, we build a multi-MEC server and multi-user mobile edge system, and design optimization objectives to minimize the average response time of system tasks and total energy consumption. Then, task offloading and resource allocation process is modeled as Markov decision process. Furthermore, the deep Q-network is used to find the optimal resource allocation scheme. Finally, the proposed strategy is analyzed experimentally based on TensorFlow learning framework. Experimental results show that when the number of users is 110, final energy consumption is about 2500 J, which effectively reduces task delay and improves the utilization of resources.

关键词： Mobile edge computing  

摘要： With the development of 5G technology, mobile edge computing (MEC) is becoming a useful architecture, which is envisioned as a cloud computing extension version. Users within MEC system could deal with data processing at edge terminals, which can reduce time for communication or data transmission. Multi-armed bandits (MAB) algorithms are powerful tools helping users offloading tasks to their best servers in MEC. However, as the number of users and tasks growing, the frequency of selecting servers and the cost of making decision is growing rapidly under traditional MAB algorithms. Inspired by this, in this paper, we propose a Batch-based Multi-user Server Elimination (BMSE) algorithm to solve such problem, which includes two sub-algorithms. We firstly propose a sub-algorithm in user level (BMSE-UL) to reduce the time cost. In BMSE-UL, users can simplify its own available server groups and offload tasks collectively. Then another sub-algorithm in system level (BMSE-SL) is proposed to reduce the frequency of making decision. In BMSE-SL, the system can cut down all the suboptimal task offloading actions and make the choosing option unique. Furthermore, we establish the optimality of the proposed algorithms by proving the sub-linearity convergence of their regrets and demonstrate the effectiveness of BMSE by extensive experiments. © 2022, CC0.

关键词： Mobile edge computing   Big data   Business public opinion   Resource allocation  

摘要： Big data will cause the system for business public opinion to be overburdened, and dynamic changes in computing resources will cause tasks to be delayed. To end the situation, this study assigns non-fixed execution time to each task node based on the task soft deadline and task constraints and solves the problem of difficult task scheduling caused by task dependency constraints. Aiming at the problem of task delay caused by dynamic changes of computing resources, this paper proposes an adaptive offloading and scheduling algorithm for dependent tasks in the mobile edge computing environment. This study takes the economic efficiency analysis system as an example and uses the resource allocation management algorithm based on linked lists and edge servers to study the communication resource allocation management of the economic efficiency analysis system. In addition, this study designs experiments to perform performance analysis of the algorithm proposed by this study. The research results show that the proposed algorithm has an obvious effect. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Mobile edge computing  

摘要： In recent years, edge computing, as an important pillar for future networks, has been developed rapidly. Task offloading is a key part of edge computing that can provide computing resources for resource-constrained devices to run computing-intensive applications, accelerate computing speed and save energy. An efficient and feasible task offloading scheme can not only greatly improve the quality of experience (QoE) but also provide strong support and assistance for 5G/B5G networks, the industrial Internet of Things (IIoT), computing networks and so on. To achieve these goals, this paper proposes an adaptive edge task offloading scheme assisted by service deployment (SD-AETO) focusing on the optimization of the energy utilization ratio (EUR) and the processing latency. In the pre-implementation stage of the SD-AETO scheme, a service deployment scheme is invoked to assist with task offloading considering each service's popularity. The optimal service deployment scheme is obtained by using the approximate deployment graph (AD-graph). Furthermore, a task scheduling and queue offloading design procedure is proposed to complete the SD-AETO scheme based on the task priority. The task priority is generated by the corresponding service popularity and task offloading direction. Finally, we analyze our SD-AETO scheme and compare it with related approaches, and the results show that our scheme has a higher edge offloading rate and lower resource consumption for massive task scenarios in the edge network. Copyright © 2022, The Authors. All rights reserved.

关键词： 5G   mobile edge computing   bandit learning   task offloading   resource allocation  

摘要： Due to the rapid development of 5G and Internet-of-Things (IoT), various emerging applications have been catalyzed, ranging from face recognition, virtual reality to autonomous driving, demanding ubiquitous computation services beyond the capacity of mobile users (MUs). Mobile cloud computing (MCC) enables MUs to offload their tasks to the remote central cloud with substantial computation and storage, at the expense of long propagation latency. To solve the latency issue, mobile edge computing (MEC) pushes its servers to the edge of the network much closer to the MUs. It jointly considers the communication and computation to optimize network performance by satisfying quality-of-service (QoS) and quality-of-experience (QoE) requirements. However, MEC usually faces a complex combinatorial optimization problem with the complexity of exponential scale. Moreover, many important parameters might be unknown a-priori due to the dynamic nature of the offloading environment and network topology. In this paper, to deal with the above issues, we introduce bandit learning (BL), which enables each agent (MU/server) to make a sequential selection from a set of arms (servers/MUs) and then receive some numerical rewards. BL brings extra benefits to the joint consideration of offloading decision and resource allocation in MEC, including the matched mechanism, situation awareness through learning, and adaptability. We present a brief tutorial on BL of different variations, covering the mathematical formulations and corresponding solutions. Furthermore, we provide several applications of BL in MEC, including system models, problem formulations, proposed algorithms and simulation results. At last, we introduce several challenges and directions in the future research of BL in 5G MEC.

关键词： Task analysis   Cloud computing   Approximation algorithms   Wireless communication   Software   Resource management   Optimization   Mobile edge computing   primal-dual technique   online computation offloading   revenue-optimal  

摘要： Mobile Edge Computing (MEC) has become an attractive solution to enhance the computing and storage capacity of mobile devices by leveraging available resources on edge nodes. In MEC, the arrivals of tasks are highly dynamic and are hard to predict precisely. It is of great importance yet very challenging to assign the tasks to edge nodes with guaranteed system performance. In this article, we aim to optimize the revenue earned by each edge node by optimally offloading tasks to the edge nodes. We formulate the revenue-driven online task offloading (ROTO) problem, which is proved to be NP-hard. We first relax ROTO to a linear fractional programming problem, for which we propose the Level Balanced Allocation (LBA) algorithm. We then show the performance guarantee of LBA through rigorous theoretical analysis, and present the LB-Rounding algorithm for ROTO using the primal-dual technique. The algorithm achieves an approximation ratio of 2(1+xi)ln(d+1) with a considerable probability, where d is the maximum number of process slots of an edge node and xi is a small constant. The performance of the proposed algorithm is validated through both trace-driven simulations and testbed experiments. Results show that our proposed scheme is more efficient compared to baseline algorithms.