Computation Offloading Method Using Stochastic Games for Software-Defined-Network-Based Multiagent Mobile Edge Computing

In a mobile edge computing (MEC) system with a large number of low power mobile terminals, proper computation offloading and resource allocation is crucial to achieving desirable system performance. In this paper, we consider the joint computation offloading and resource allocation problem for an uplink MEC system under the min-max fairness criterion. The proposed optimization problem is difficult to solve due mainly to the nonconvex nondifferentialbe objective and the nonlinear coupling of design variables in the constraints. By exploiting binary relaxation and introducing auxiliary variables, we first convert this problem into a more tractable form. We then develop a novel algorithm based on the concave-convex procedure (CCCP) technique to address the problem. Furthermore, by exploiting the problem structure, an efficient algorithm based on inexact block coordinate descent (IBCD) method is proposed to reduce the computational complexity. Numerical results validate the efficiency of the proposed algorithms.

In current world, processing the data by the users, researchers, organizations, etc. through online source (ie. cloud) is increasing tremendously, where it offers various services like storing the data, allocating the resources, retrieval of data, security, etc. Since the data is stored in cloud, processing it leads to increase in latency, due to its long-distance communication. As distance increases, data transmission produces a delay between source and destination which is called as latency. To get over this problem, MEC (Mobile Edge Computing) system can be positioned between the cloud infrastructure and the user equipment(UE) in the IoT environment. Instead of sending data to the cloud directly which is collected by IoT sensors, edge computing processes those data within the network. The study of this review focuses on the various techniques such as deep learning algorithms, deep reinforcement learning approaches for offloading decisions and optimization techniques in 5G networks for minimizing the latency in the MEC systems, for producing higher processing capability to the clients. For increasing the MEC system performance, efficient offloading strategies can be used to minimize latency for various tasks.

Computationally intensive and latency sensitive applications put forward strict requirements on mobile user equipments (UEs) to provide the required computation capacity and delay. Mobile edge computing (MEC) in ultra-dense network (UDN) is considered as a promising solution that can reduce the computation limitations of UEs and extend their battery life by computation offloading. But the dense deployment of UEs, and the limited resources of small cell base stations (SBSs), which imposes more delays on computation offloading in MEC environment. In this paper, using the characteristics of UDN, we study the computation offloading management scheme based on the weighted sum of task completion time and energy consumption in MEC system. Then, we propose a computation offloading framework and formulate joint task offloading and resource allocation problem in UDNs to minimize overall cost consumption. Based on Genetic algorithm (GA) and Whale optimization algorithm (WOA), we adopt a heuristic algorithm named as GAWOA to solve this problem. Numerical results show that the algorithm has a fast convergence speed and better performance than other benchmark algorithms.

By providing spatial diversity gain, the incorporation of multiple antennas into mobile edge computing (MEC) systems can improve the transmission performance. Meanwhile, employing energy harvesting (EH) helps enhance the system sustainability. In this paper, we focus on multi-input multi-output (MIMO) MEC systems with EH and studies the computation offloading. The design objective is to minimize the time average of a weighted sum of energy consumption and execution delay, meanwhile stabilizing the battery energy queue. To this end, we formulate the problem as a statistic program and propose a dynamic computation offloading (DCO) algorithm in which the transmitter covariance matrix, CPU-cycle frequencies for local computing, and partial offloading ratio are jointly optimized. Based on Lyapunov optimization, the program is first transformed into a nonconvex per-time slot problem. Then, we solve it by the successive convex approximation (SCA) technique, where a sequence of convex problems are created and solved. Simulation results demonstrate that the proposed algorithm is asymptotically optimal and outperforms several benchmark schemes in terms of both the average system cost and task drop ratio.

Mobile edge computing (MEC) enables the provision of high-reliability and low-latency applications by offering computation and storage resources in close proximity to end-users. Different from traditional computation task offloading in MEC systems, the large data volume and complex task computation of artificial intelligence involved intelligent computation task offloading have increased greatly. To address this challenge, we propose a MEC system for multiple base stations and multiple terminals, which exploits semantic transmission and early exit of inference. Based on this, we investigate a joint semantic transmission and resource allocation problem for maximizing system reward combined with analysis of semantic transmission and intelligent computation process. To solve the formulated problem, we decompose it into communication resource allocation subproblem, semantic transmission subproblem, and computation capacity allocation subproblem. Then, we use 3D matching and convex optimization method to solve subproblems based on the block coordinate descent (BCD) framework. The optimized feasible solutions are derived from an efficient BCD based joint semantic transmission and resource allocation algorithm in MEC systems. Our simulation demonstrates that: 1) The proposed algorithm significantly improves the delay performance for MEC systems compared with benchmarks; 2) The design of transmission mode and early exit of inference greatly increases system reward during offloading; and 3) Our proposed system achieves efficient utilization of resources from the perspective of system reward in the intelligent scenario.

UAV-mounted IRS assisted wireless powered mobile edge computing systems: Joint beamforming design, resource allocation and position optimization

This article establishes a new multiunmanned aerial vehicle (multi-UAV)-enabled mobile edge computing (MEC) system, where a number of unmanned aerial vehicles (UAVs) are deployed as flying edge clouds for large-scale mobile users. In this system, we need to optimize the deployment of UAVs, by considering their number and locations. At the same time, to provide good services for all mobile users, it is necessary to optimize task scheduling. Specifically, for each mobile user, we need to determine whether its task is executed locally or on a UAV (i.e., offloading decision), and how many resources should be allocated (i.e., resource allocation). This article presents a two-layer optimization method for jointly optimizing the deployment of UAVs and task scheduling, with the aim of minimizing system energy consumption. By analyzing this system, we obtain the following property: the number of UAVs should be as small as possible under the condition that all tasks can be completed. Based on this property, in the upper layer, we propose a differential evolution algorithm with an elimination operator to optimize the deployment of UAVs, in which each individual represents a UAV's location and the entire population represents an entire deployment of UAVs. During the evolution, we first determine the maximum number of UAVs. Subsequently, the elimination operator gradually reduces the number of UAVs until at least one task cannot be executed under delay constraints. This process achieves an adaptive adjustment of the number of UAVs. In the lower layer, based on the given deployment of UAVs, we transform the task scheduling into a 0-1 integer programming problem. Due to the large-scale characteristic of this 0-1 integer programming problem, we propose an efficient greedy algorithm to obtain the near-optimal solution with much less time. The effectiveness of the proposed two-layer optimization method and the established multi-UAV-enabled MEC system is demonstrated on ten instances with up to 1000 mobile users.

We consider the efficient resource allocation task in the blockchain-based mobile edge computing (MEC) system that requires decentralized transaction management to validate transactions between edge servers (ESs) and mobile devices (MDs). In such task allocation process (where MDs' resources are limited and privacy-sensitive), it is a significant challenge to guarantee individual rationality with satisfactory system stability while enabling flexible task offloading under various locality constraints (e.g., communication distance, bandwidth and delay). In this paper, we formulate the target problem as a blockchain-assisted task-resource matching model, and then propose a near optimal locality-aware resource allocation mechanism over smart contract to enable automatic and efficient transactions in MEC system. More specifically, for the service agents selection, we design the preference-based selection strategy to get highest estimated profit. For the flexible task offloading, we develop the minimum delay task graph partitioning algorithm to determine the optimal task offloading solution for MD under different resource bundles. For the task-resource matching, we propose a task-resource matching game (based on potential game) with the second lowest cost strategy to determine the matching of task-resource and decide the price of resource bundle. For the transaction verification and block allocation, we propose a social welfare-driven consensus mechanism to enable verified transaction and fair block allocation in a reward-free way. Strict theoretical analysis and extensive simulations demonstrate that our mechanism guarantees individual rationality, Nash Equilibrium, and stable near optimal solution.

Given the proliferation of wireless sensors and smart mobile devices, an explosive escalation of the volume of data is anticipated. However, restricted by their limited physical sizes and low manufacturing costs, these wireless devices tend to have limited computational capabilities and battery lives. To overcome this limitation, wireless devices may offload their computational tasks to the nearby computing nodes at the network edge in mobile edge computing (MEC). At the time of writing, the benefits of MEC systems have not been fully exploited, predominantly because the computation offloading link is still far from perfect. In this article, we propose to enhance MEC systems by exploiting the emerging technique of reconfigurable intelligent surfaces (RISs), which are capable of “reconfiguring” the wireless propagation environments, hence enhancing the offloading links. The benefits of RISs can be maximized by jointly optimizing both the RISs as well as the communications and computing resource allocations of MEC systems. Unfortunately, this joint optimization imposes new research challenges on the system design. Against this background, this article provides an overview of RIS-assisted MEC systems and highlights their four use cases as well as their design challenges and solutions. Finally, their performance is characterized with the aid of a specific case study, followed by a range of future research ideas.

Mobile edge computing (MEC) systems provide mobile devices (MDs) with low-latency cloud services by deploying edge servers (ESs) in the vicinity. In fact, various mobile applications may generate cotasks, each of which is completed only if all its constituent tasks are finished. Existing works have been devoted to the design of MEC offloading and scheduling, but none of them exploits the cotask feature to better utilize the networked computing resources. In this paper, we investigate the problem of joint cotask-aware offloading and scheduling in MEC systems (Cool-Edge), and we formulate it as a mixed integer non-linear program (MINLP), the objective of which is to minimize average cotask completion time (ACCT). To cope with the Cool-Edge problem, we propose two low-complexity algorithms to offload cotasks based on an LP rounding technique and schedule them according to an earliest-cotask-arrival-first rule, respectively, and we further prove the approximation factor jointly achieved by the two algorithms. Finally, we conduct testbed experiments and simulations to demonstrate the effectiveness of our proposed solution, and we also show how ACCT varies with the network environment.

To cope with the low latency requirements and security issues of the emerging applications such as Internet of Vehicles (IoV) and Industrial Internet of Things (IIoT), the blockchain-enabled Mobile Edge Computing (MEC) system has received extensive attention. However, blockchain is a computing and communication intensive technology due to the complex consensus mechanisms. To facilitate the implementation of blockchain in the MEC system, this paper adopts the committee-based Practical Byzantine Fault Tolerance (PBFT) consensus algorithm and focuses on the committee selection problem. Vehicles and IIoT devices generate the transactions which are records of the application tasks. Base Stations (BSs) with MEC servers, which serve the transactions according to the wireless channel quality and the available computing resources, are blockchain nodes and candidates for committee members. The income of transaction service fees, the penalty of service delay, the decentralization of the blockchain and the communication complexity of the consensus process constitute the performance index. The committee selection problem is modeled as a Markov decision process, and the Proximal Policy Optimization (PPO) algorithm is adopted in the solution. Simulation results show that the proposed PPO-based committee selection algorithm can adapt to the system design requirements with different emphases and outperforms other comparison methods.

Mobile edge computing (MEC) brings a breakthrough for Internet of Things (IoT) for its ability of offloading tasks from user equipments (UEs) to nearby servers which have rich computation resource. 5G network brings a huge breakthrough on transmission rate. Together with MEC and 5G, both execution delay of tasks and time delay from downloading would be shorter and the quality of experience (QoE) of UEs can be improved. Considering practical conditions, the computation resource of an MEC server is finite to some extent. Therefore, how to prevent the abuse of MEC resource and further allocate the resource reasonably becomes a key point for an MEC system. In this paper, an MEC system with multi-user is considered where a base station (BS) with an MEC server, which can not only provide computation offloading service but also data cache service. Especially, we take the charge for both data transmission and task computation as one part of total cost of UEs, and then explore a joint optimization for downlink resource allocation, offloading decision and computation resource allocation to minimize the total cost in terms of the time delay and the charge to UEs. The proposed problem is formulated as a mixed integer programming (MIP) one which is NP-hard. Therefore, we decouple the original problem into two subproblems which are downlink resource allocation problem and joint offloading decision and computation resource allocation problem. Then we address these two subproblems by using convex and nonconvex optimization techniques, respectively. An iterative algorithm is proposed to obtain a suboptimal solution in polynomial time. Simulation results show that our proposed algorithm performs better than benchmark algorithms.

In recent years, the need for computation-intensive applications in mobile networks requiring more storage, powerful processors, and real-time responses has risen substantially. Vehicular networks play an important role in this ecosystem, as they must support multiple services, such as traffic monitoring or sharing of data involving different aspects of the vehicular traffic. Moreover, new resource-hungry applications have been envisaged, such as autonomous driving or in-cruise entertainment, hence making the demand for computation and storage resources one of the most important challenges in vehicular networks. In this context, Mobile Edge Computing (MEC) has become the key technology to handle these problems by providing cloud-like capabilities at the edge of mobile networks to support delay-sensitive and computation-intensive tasks. In the meantime, researchers have envisaged use of onboard vehicle resources to extend the computing capabilities of MEC systems. This paper presents a comprehensive review of the most recent works related to MEC-assisted vehicular networks, as well as vehicle-assisted MEC systems. We illustrate the MEC system architecture and discuss its deployment in vehicular environments, as well as the key technologies to realize this integration. After that, we review the recent literature by identifying three different areas, i.e.: (i) MEC providing additional resources to vehicles (e.g., for task offloading); (ii) MEC enabling innovative vehicular applications (e.g., platooning), and (iii) vehicular networks providing additional resources to MEC systems. Finally, we discuss open challenges and future research directions, addressing the possible interplays between MEC systems and vehicular networks.

Energy-efficient computation is important in mobile edge computing (MEC) systems. However, the computation efficiency problem in the unmanned aerial vehicle (UAV)-enabled MEC systems has been rarely researched. In this paper, a UAV-enabled MEC system under partial computation offloading mode is investigated. The computation efficiency is maximized by jointly optimizing the offloading times, the central processing unit frequencies, the transmit powers of the user and the trajectory of the UAV. For the non-convex computation efficiency problem, a two-stage iterative algorithm is proposed. Moreover, we derive the closed-form expressions for the local computation frequency and the transmit power of the user, which facilitates our algorithm implementation. Simulation results demonstrate that the computation efficiency of our proposed joint optimization scheme is better than those of other benchmark schemes.

As more and more compute-intensive and delay-sensitive applications are deployed on smart mobile devices, mobile edge computing is considered an effective way to solve the limited computing ability of smart mobile devices (SMDs). At present, latency has become the most critical indicator of the quality of service (QoS), and more and more studies focus on this aspect. Unlike previous work, our work fully takes into account the limited storage and computing ability of edge servers. To effectively reduce the delay of SMDs and improve QoS, we propose a Delay Control Strategy Joint Service Caching and Task Offloading (DCS-OCTO) in a three-tier mobile edge computing (MEC) system consist of multi-user, multi-edge server and remote cloud servers. Some of the key challenges include service heterogeneity, unknown system dynamics, spatial demand coupling, and decentralized coordination. In particular, a very compelling but rarely studied issue is the dynamic service caching in the three-tier MEC system. The DCS-OCTO strategy is proposed based on Lyapunov optimization and Gibbs sampling. It works online without requiring prior information and achieves provable near-optimal performance. Finally, simulation results show that the strategy effectively reduces the overall system delay while ensuring low energy consumption.