Modeling and Analysis of Stochastic Mobile-Edge Computing Wireless Networks

Wireless networks in next generation will provide users ubiquitous computing services with low delay by devices at the network edge, namely mobile edge computing (MEC). The intensive computation tasks can be partially offloaded to the MEC server via the wireless link and then processed through the MEC computation resources to cater for the delay demand. A parallel computation process is formed in the MEC network consists of local computation at MEC users (MUs) and MEC computation at MEC servers. However, the fluctuating wireless channel environment, changeable spatial distribution of MUs and the randomness of MEC servers’ locations make it hard to characterize and guarantee the end-to-end quality of service requirements. In this work, we are devoted to analyze and optimize the overall delay bound for MEC networks under two orthogonal frequency division multiple access (OFDMA) strategies via stochastic network calculus (SNC). Specifically, Poisson cluster process is utilized to capture the randomness of MEC servers’ and users’ spatial locations and to derive the Laplace transform of interference suffered by an MU of interest. The upper bounds for the delay violation probability of two OFDMA strategies are established by exploiting SNC with the Mellin transform of signal-to-interference ratio. Furthermore, we propose an optimal task offloading scheme by minimizing the overall delay, which balances the local computation delay and MEC delay.

In this paper, we investigate a new mobile blockchain-enabled edge computing (MBEC) network, where mobile users can join the empowered process of public blockchains and meanwhile offload computation-intensive mining tasks to the mobile edge computing (MEC) server. However, the trustiness of the MEC server and the fairness of computation resources allocated by the MEC server for each user become key challenges. To tackle these challenges, we consider an untrusted MEC server and propose a nonce hash computing ordering (HCO) mechanism in MBEC networks. Then we formulate nonce hash computing demands of an individual user as a non-cooperative game that maximizes the personal revenue. Moreover, we also analyze the existence of Nash equilibrium of the non-cooperative game and design an alternating optimization algorithm to achieve the optimal nonce selection strategies for all users. With the proposed HCO mechanism, the MEC server can provide much fairer computation resources for all users, and we can achieve the optimal nonce strategies of hash computing demands by using the proposed alternating optimization algorithm. Numerical results demonstrate that the proposed HCO mechanism can provide fairer computation resource allocation than the traditional weighted round-robin mechanism, and further verify the effectiveness of this alternating optimization algorithm.

This paper considers the computation offloading and resource allocation for system sum cost minimization in a mobile edge computing (MEC)network. The computation offloading decision of the user equipments (UEs)can be made through wireless link to access the MEC server. Our intent is to minimize the weighted sum cost of the system, which takes into account the energy consumption and time delay, for both task processing and data transmissions, subject to the force delay requirement of the devices. We first formulate the problem as a mixed-integer and non-convex optimization scheme. Enlightened by the superior performance of reinforcement learning (RL)on solving resource control problems, we put forward a novel RL-based scheme for computation offloading and resource allocation in MEC network. Specifically, the MEC node is considered as an “agent”, which first makes decision on whether to offloading the computing task to the MEC server, and then utilizes convex optimization algorithms to settle the radio spectrum and computation resource scheduling problem in each decision phase. The simulation results present that the RL-based method can achieve better computation offloading and resource allocation performance compared to those of local computing and remote computing modes. It also achieves very similar or slightly better performance compared to the genetic algorithm based method.

The stochastic geometry modeling and analysis of mobile edge computing (MEC) networks contribute to the effective network configuration. Most prior works investigate the MEC network performance by spatial averaging the topological randomness, which can hide the differences among users and result in inaccurate analytical results. To address this limitation, an analytical framework is developed to study the meta distribution of the task offloading performance. We consider the Poisson MEC network where the users with dynamic task requests offload the tasks to the MEC server. Given the model, the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$b$</tex-math></inline-formula> -th moment and the meta distribution of the success task offloading probability are first analyzed. Further, the exact yet convenient approximation of the MEC computing load is derived, based on which the edge computing delay is obtained. Our results demonstrate that the proposed meta-analytical framework allows tractable yet accurate analytical results, and provides additional fine-grained information about MEC-network planning.

Energy-efficient communication is one of the most pertaining issues in realizing mobile edge computing (MEC) networks. How to effectively use non-orthogonal multiple access (NOMA) to realize energy efficient MEC networks has been of high interest and calls for in-depth study. In particular, there has been yet no work to study the energy efficient communication scheme from system perspective in this area. In this work, we focus on the design of a system-centric computation energy efficiency (EE) scheme in a NOMA-based MEC network. The system computation EE is maximized by jointly optimizing the computing frequencies of the MEC server and the local users, the offloading time, the transmit powers of local users, as well as the execution time for the local users and the MEC server. Employing the fractional programming theory and introducing auxiliary variables, we develop an efficient Dinkelbach-based iterative scheme to tackle the formulated non-linear fractional programming problem. For obtaining instrumental insights, we further derive closed-form expressions for the partial solutions based on Karush-Kuhn-Tucker conditions. Simulation results are provided to verify the quick convergence of the proposed iterative algorithm, to obtain insights, as well as to demonstrate the superiority of the proposed resource allocation scheme in terms of the system computation EE by comparing it with benchmark schemes.

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system is a prominent strategy where a UAV equipped with an MEC server is deployed to serve terminal devices. This paper considers a multi-UAV assisted network in which multiple UAVs and a terrestrial base station (BS) are deployed to provide MEC services to mobile users. The objective is to minimize an energy and latency-based cost function by jointly optimizing task offloading and MEC server selection decision, transmission power, UAV trajectory, and CPU frequency allocation. An alternating iterative approach based on the block descent method is proposed to solve this problem. In the first layer, task offloading and server selection decision subproblem is solved using a game theoretic approach. The second layer handles offloading and downloading transmission power allocations by utilizing a simplistic geometric waterfilling (GWF) technique, and the UAV trajectory by successive convex approximation (SCA). Whereas, the third layer solves the computation resource subproblem by performing CPU frequency allocation using a gradient descent method. The proposed method uses a segment-by-segment approach, which divides the entire UAV flight trajectory into shorter timeframe segments to reduce the computation time. Simulation results are presented to show that the proposed approach outperforms various benchmark schemes.

Collaborative computation offloading and wireless charging scheduling in multi-UAV-assisted MEC networks: A TD3-based approach

This chapter studies mobile edge computing (MEC) networks assisted by unmanned aerial vehicles (UAVs). According to the application scenarios, we consider three roles for UAVs in MEC networks: exploiting MEC computing capabilities, serving as a computing server, and serving as a relay for computation offloading. Furthermore, the details for resource allocation and optimization are presented in the three scenarios of UAV-assisted MEC networks. In addition, we focus on the situation in which a UAV not only functions as an MEC server to inspect turbines on a wind farm, but also performs task computation. To facilitate wide applications of UAV-assisted MEC in practice, this chapter highlights the main implementation issues of UAV-assisted MEC, including optimal UAV deployment, wind models, and joint trajectory–computation performance optimization.

Mobile edge computing (MEC) is an emerging paradigm that provides radio access networks with augmented resources to meet the requirements of Internet of Things (IoT) services. MEC allows IoT devices to offload delay sensitive and computation intensive tasks to edge clouds deployed at base stations (BSs). Offloading tasks to edge clouds can alleviate the computing and battery limitations of IoT devices. However, task offloading in MEC for IoT may face serious transmission latency and computation latency problems with massive number of IoT devices. Moreover, some edge clouds can be overloaded due to the spatially inhomogeneous distributions of IoT tasks. To solve these problems, we investigate the workload balancing problems to minimize the transmission latency and computation latency in task offloading process while considering the limited bandwidth resources of BSs and computation resources in edge clouds. We formulate the workload balancing problem as a population game in order to analyze the aggregate offloading decisions. We analyze the aggregate offloading decisions of mobile users through evolutionary game dynamics and show that the game always achieves a Nash equilibrium (NE). We further propose two workload balancing algorithms based on evolutionary dynamics and revision protocols. Simulation results show that our proposed workload balancing algorithms can achieve better performance than existing solutions.

Resource allocation in RISs-assisted UAV-enabled MEC network with computation capacity improvement

Mobile edge computing (MEC) can extend the computing capability of mobile users (MUs), by offloading computational tasks from MUs to proximal MEC servers. Specifically, offloaded tasks are firstly transmitted to access points (APs) via wireless channels, and then relayed to MEC servers through backhauls. Due to differentiated wireless channels and input data sizes, offloaded tasks from different MUs arrive at the AP and MEC server in an asynchronous manner. Considering such asynchrony, we design sequential execution model for backhaul transmission and task processing in the MEC server and present its merits in terms of maximum task completion time for different backhaul configurations: 1) With ideal backhaul, the optimal task scheduling order in the MEC server follows the first coming and first scheduling rule; 2) With limited backhaul, an effective two-stage task scheduling order on the backhaul and MEC server is determined by the Johnson's rule. Further, we make suboptimal decisions on wireless resource provisioning and task offloading, with respect to the attained task scheduling order and derived necessary and sufficient conditions under which full local processing and full offloading are optimal. Finally, simulation results demonstrate the superiority of our devised sequential execution model and computation offloading mechanisms.

In the future mobile edge networks, the Internet of things (IoT) applications will be latency-sensitive and computationally intensive. Given the resource limitation of IoT devices, mobile edge computing (MEC) servers are critical to support the efficient processing of IoT tasks. Since MEC servers attached to the ground base stations are generally deployed in fixed locations and vulnerable to physical damage, the unmanned aerial vehicle (UAV) and satellite-assisted MEC framework has been proposed to leverage the flexibility of UAVs and the broad coverage of satellites. However, efficient utilization of the UAV/satellite resources is challenging for the static ground IoT devices because of the dynamic in terms of aerial and space network topology and IoT task arrival rates. To adapt to the changing environment and utilize the interaction among multiple UAVs, we propose a multi-agent deep deterministic policy gradient (MADDPG) framework to jointly optimize the traveling routes of multi-UAVs and the offloading decision of IoT devices. To minimize the processing cost in terms of task processing latency and energy consumption of IoT devices, cooperative UAVs can help find the optimal task offloading location for each IoT device. Simulation results show the proposed algorithm based on MADDPG can averagely decrease 20% of the above processing cost compared with the benchmark approach.

In a mobile edge computing (MEC) network, mobile devices could selectively offload tasks to the edge server(s) to save time and energy. However, we should consider many dynamic factors in task offloading optimization, which increases the complexity of this problem. Instead of executing the traditional optimization algorithm repeatedly, a well-trained empirical model such as an artificial neural network could be more efficient in decision making. In this research, considering the potential uneven spatial distribution of mobile devices in an MEC network with multiple wireless edge gateways, we allow an edge gateway to offload tasks to a nearby edge gateway further. We propose a deep reinforcement learning-based joint optimization approach for both device-level and edge-level task offloading. Experimental results show that the proposed approach achieves a near-optimal task delay performance and a better trade-off between the task delay and the energy consumption on tasks.

The real-time communication requirement of the Internet of Things (IoT) applications promotes the convergence of IoT and Mobile Edge Computing (MEC). The MEC paradigm greatly shortens the IoT service delay by leveraging cloudlets (edge servers) of MEC in the proximity of IoT devices. Considering limited computing and storage resources in an MEC network, it is challenging to provide efficient IoT-enabled service provisioning in such a network. In this article, we study the service home identification problem of service provisioning for multi-source IoT applications in an MEC network, by identifying a service home (cloudlet) of each multi-source IoT application for its data processing, querying and storage. Each multi-source IoT application consists of multiple sources located at different geographical locations and each source uploads its data stream via a gateway (its nearby access point) to the MEC network and the uploaded data then is aggregated with the stream data of the other sources of the IoT application at the service home. We here focus on two novel service home identification problems: the service operational cost minimization problem with the aim to minimize the total service operational cost by admitting as many multi-source IoT applications as possible, and the online throughput maximization problem with the aim to maximize the number of multi-source IoT application requests admitted. We first show that both the problems are NP-hard. We then formulate an Integer Linear Programming (ILP) solution to the service operational cost minimization problem, and propose a randomized algorithm with high probability and a deterministic approximation algorithm respectively, at moderate resource capacity violations. We third develop an efficient heuristic algorithm for the problem without any resource violation. Furthermore, we deal with the online throughput maximization problem under an assumption that multi-source IoT application requests arrive one by one without the knowledge of future arrivals, for which we formulate an Integer Linear Programming (ILP) solution to its offline version, followed by devising an online algorithm with competitive ratio. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results demonstrate that the proposed algorithms are promising, and outperform their comparison counterparts.

For mobile devices (MDs) and Internet of Things (IoT) devices with limited computing capacity and battery, offloading part of tasks to the mobile edge computing (MEC) server is attractive. In this paper, we propose a joint partial computation offloading and pricing scheme in a multi-user MEC system. Firstly, we establish MD’s cost model and MEC server’s revenue model in terms of money. Secondly, we investigate MD’s cost minimization partial offloading strategy to jointly control MD’s task allocation, local CPU frequency and the amount of computational resource blocks (CRBs) requested. Finally, we formulate the revenue maximization problem for MEC server with limited computing capacity, a heuristic algorithm is proposed for MEC server to find the optimal service price. Numerical results verify the effectiveness of our proposed scheme in cost saving and pricing.