Performance analysis for IRS-assisted MEC networks with unit selection

This letter studies the joint active and passive beamforming in intelligent reflecting surface (IRS)-enhanced wireless powered mobile edge computing (MEC) networks, in which a hybrid access point (HAP) is deployed to charge multiple wireless devices (WDs) and assist in computation of the offloaded tasks from the WDs. An IRS is deployed to enhance the downlink wireless power transfer (WPT) and the uplink tasks offloading (TO). To maximize the systems’ sum computation rate, an optimization problem is formulated by jointly optimizing the time assignment of WPT and TO, the active beamforming at the HAP, the transmit power and computing frequency of the WDs, and the passive beamforming at the IRS. To tackle the non-convex problem, we present an efficient algorithm by utilizing the alternating optimization (AO) and semidefinite relaxation (SDR) techniques. Simulation results show that by deploying IRS in the system, a significant computation rate gain can be achieved. Especially, when the IRS is closer to the WDs or the HAP, the much higher computation rate can be reached.

Mobile edge computing (MEC) networks have been recently adopted to accommodate the fast-growing number of mobile devices performing complicated tasks with limited hardware capability. Recently, edge nodes with communication, computation, and caching capacities are starting to be deployed in MEC networks. Due to the physical separation of these resources, efficient coordination and scheduling are important for efficient resource utilization and optimal network performance. In this paper, we study mobility load balancing for communication, computation, and caching-enabled heterogeneous MEC networks. Specifically, we propose to tackle this problem via a multi-agent deep reinforcement learning-based framework. Users served by overloaded edge nodes are handed over to less loaded ones, to minimize the load in the most loaded base station in the network. In this framework, the handover decision for each user is made based on the user’s own observation which comprises the user’s task at hand and the load status of the MEC network. Simulation results show that our proposed multi-agent deep reinforcement learning-based approach can reduce the time-average maximum load by up to 30% and the end-to-end delay by 50% compared to baseline algorithms.

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.

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.

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

Using Unmanned aerial vehicles (UAVs) to assist mobile edge computing (MEC) network is a promising solution to provide flexible and low-latency computing service for resource limited user equipments (UEs). However, the computing resources that one UAV can provide are often limited and cannot provide computing services for massive mobile users, thus limiting the application of this technology. So, a novel multi-UAV-assisted MEC network is proposed in this paper. The optimization problem is formulated with the aim to make full use of network's computing resources to reduce the number of failed tasks and energy consumption. To solve this challenging problem, a novel solution is proposed. First, we use a swarm intelligence algorithm to investigate the deployment of UAVs. Second, we offer an efficient matching algorithm to explore the tasks assignments under the given deployment of UAVs. The simulation results show that the proposed solution can effectively reduce the number of failed tasks and energy consumption.

To address the severe challenge from the rapid growth of number of downloads of contents via mobile network, it is imperative to develop efficient content caching scheme in mobile edge computing (MEC) networks, which can alleviate the heavy burden on backhaul links and reduce the delay for content delivery. However, the caching performance is highly related to the MEC server placement. In this paper, we jointly optimize the server placement problem and content caching problem in MEC networks. We propose a heuristic algorithm based on Kuhn-Munkres (KM) algorithm and greedy algorithm to minimize the average delay and average bandwidth resource usage. The simulation shows that our proposed algorithm can reduce delay and bandwidth, compared with other schemes.

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.

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.

Deploying federated learning (FL) in mobile edge computing (MEC) networks has become a prevalent approach to distributed learning. However, the inherent heterogeneity in computing, transmission and data on edge devices (EDs) brings challenges in improving training efficiency and speed. Existing approaches primarily focus on increasing batch sizes or employing adaptive batching to expedite convergence, but often overlook the generalization ability of the model. In this paper, we propose an energy-efficient adaptive batching approach for FL in MEC networks, aiming at minimizing the energy consumption by balancing training efficiency and speed. Initially, we exploit the relationship between batch size and loss improvement while determining the optimal learning rate corresponding to the batch size and understanding the correlation among loss improvement, learning rate, and gradient noise scale (GNS). Then we dynamically adjust the batch size based on the GNS and propose a low-complexity approach for measuring GNS. Finally, we fine-tune the batch size by assessing gradient similarity on each ED to ensure an optimal level of gradient noise during training, thereby enhancing the model's generalization. Experiment results demonstrate the effectiveness of our approach with an approximate 50% and 20% reduction in energy consumption and time consumption compared with existing approaches.

This letter investigates the scenario of resisting intelligent reactive jammer in mobile edge computing (MEC) networks. To solve the multi-dimensional offloading allocation problem while avoiding malicious jamming attacks, a hierarchical reinforcement learning (HRL) based hybrid hidden strategy is proposed to allocate multi-dimensional resources and reduce the probability of being perceived in the offloading process. Specifically, the HRL framework is divided into two layers for asynchronous update: the upper layer with the discrete policy network taking charge of outputting the channel access strategies to resist the dynamic jamming attack in the frequency domain, and the lower layer with the continuous policy network network mainly offering hidden offloading strategies to avoid the detection of intelligent reactive jammers. By integrating the double deep Q-Network and twin delayed deep deterministic network, and exploiting their advantages in solving the hybrid strategy problems, the mobile device (MD) is able to execute effective hidden offloading strategies to reduce the computing cost as well as to significantly avoid intelligent reactive jamming in dynamic and unknown environments.

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.

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

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.