Multi-Objective Optimization for NOMA-Based Mobile Edge Computing Offloading by Maximizing System Utility

Mobile Edge Computing(MEC)is a technology for the fifth-generation(5G)wireless communications to enable User Equipment(UE)to offload tasks to servers deployed at the edge of network.However,taking both delay and energy consumption into consideration in the 5G MEC system is usually complex and contradictory.Non-orthogonal multiple access(NOMA)enable more UEs to offload their computing tasks to MEC servers using the same spectrum resources to enhance the spectrum efficiency for 5G,which makes the problem even more complex in the NOMA-MEC system.In this work,a system utility maximization model is present to NOMA-MEC system,and two optimization algorithms based on Newton method and greedy algorithm respectively are proposed to jointly optimize the computing resource allocation,SIC order,transmission time slot allocation,which can easily achieve a better trade-off between the delay and energy consumption.The simulation results prove that the proposed method is effective for NOMA-MEC systems.

UAV-assisted cooperative offloading energy efficiency system for mobile edge computing

Reliable communication and intensive computing power cannot be provided effectively by temporary hot spots in disaster areas and complex terrain ground infrastructure.Mitigating this has greatly developed the application and integration of UAV and Mobile Edge Computing(MEC)to the Internet of Things(loT).However,problems such as multi-user and huge data flow in large areas,which contradict the reality that a single UAV is constrained by limited computing power,still exist.Due to allowing UAV collaboration to accomplish complex tasks,cooperative task offloading between multiple UAVs must meet the interdependence of tasks and realize parallel processing,which reduces the computing power consumption and endurance pressure of terminals.Considering the computing requirements of the user terminal,delay constraint of a computing task,energy constraint,and safe distance of UAV,we constructed a UAV-Assisted cooperative offloading energy efficiency system for mobile edge computing to minimize user terminal energy consumption.However,the resulting optimization problem is originally nonconvex and thus,difficult to solve optimally.To tackle this problem,we developed an energy efficiency optimization algorithm using Block Coordinate Descent(BCD)that decomposes the problem into three convex subproblems.Furthermore,we jointly optimized the number of local computing tasks,number of computing offloaded tasks,trajectories of UAV,and offloading matching relationship between multi-UAVs and multiuser terminals.Simulation results show that the proposed approach is suitable for different channel conditions and significantly saves the user terminal energy consumption compared with other benchmark schemes.

A review of optimization methods for computation offloading in edge computing networks

Handling the massive amount of data generated by Smart Mobile Devices(SMDs)is a challenging computational problem.Edge Computing is an emerging computation paradigm that is employed to conquer this problem.It can bring computation power closer to the end devices to reduce their computation latency and energy consumption.Therefore,this paradigm increases the computational ability of SMDs by collaboration with edge servers.This is achieved by computation offloading from the mobile devices to the edge nodes or servers.However,not all applications benefit from computation offloading,which is only suitable for certain types of tasks.Task properties,SMD capability,wireless channel state,and other factors must be counted when making computation offloading decisions.Hence,optimization methods are important tools in scheduling computation offloading tasks in Edge Computing networks.In this paper,we review six types of optimization methods-they are Lyapunov optimization,convex optimization,heuristic techniques,game theory,machine learning,and others.For each type,we focus on the objective functions,application areas,types of offloading methods,evaluation methods,as well as the time complexity of the proposed algorithms.We discuss a few research problems that are still open.Our purpose for this review is to provide a concise summary that can help new researchers get started with their computation offloading researches for Edge Computing networks.

Adaptive delay-energy balanced partial offloading strategy in Mobile Edge Computing networks

Mobile Edge Computing(MEC)-based computation offloading is a promising application paradigm for serving large numbers of users with various delay and energy requirements.In this paper,we propose a flexible MECbased requirement-adaptive partial offloading model to accommodate each user's specific preference regarding delay and energy consumption.To address the dimensional differences between time and energy,we introduce two normalized parameters and then derive the computational overhead of processing tasks.Different from existing works,this paper considers practical variations in the user request patterns,and exploits a flexible partial offloading mode to minimize computation overheads subject to tolerable delay,task workload and power constraints.Since the resulting problem is non-convex,we decouple it into two convex subproblems and present an iterative algorithm to obtain a feasible offloading solution.Numerical experiments show that our proposed scheme achieves a significant improvement in computation overheads compared with existing schemes.

Multi-Agent Deep Reinforcement Learning for Efficient Computation Offloading in Mobile Edge Computing

Mobile-edge computing(MEC)is a promising technology for the fifth-generation(5G)and sixth-generation(6G)architectures,which provides resourceful computing capabilities for Internet of Things(IoT)devices,such as virtual reality,mobile devices,and smart cities.In general,these IoT applications always bring higher energy consumption than traditional applications,which are usually energy-constrained.To provide persistent energy,many references have studied the offloading problem to save energy consumption.However,the dynamic environment dramatically increases the optimization difficulty of the offloading decision.In this paper,we aim to minimize the energy consumption of the entireMECsystemunder the latency constraint by fully considering the dynamic environment.UnderMarkov games,we propose amulti-agent deep reinforcement learning approach based on the bi-level actorcritic learning structure to jointly optimize the offloading decision and resource allocation,which can solve the combinatorial optimization problem using an asymmetric method and compute the Stackelberg equilibrium as a better convergence point than Nash equilibrium in terms of Pareto superiority.Our method can better adapt to a dynamic environment during the data transmission than the single-agent strategy and can effectively tackle the coordination problem in the multi-agent environment.The simulation results show that the proposed method could decrease the total computational overhead by 17.8%compared to the actor-critic-based method and reduce the total computational overhead by 31.3%,36.5%,and 44.7%compared with randomoffloading,all local execution,and all offloading execution,respectively.

Auction-based profit maximization offloading in mobile edge computing

Offloading Mobile Devices(MDs)computation tasks to Edge Nodes(ENs)is a promising solution to overcome computation and energy resources limitations of MDs.However,there exists an unreasonable profit allocation problem between MDs and ENs caused by the excessive concern on MD profit.In this paper,we propose an auction-based computation offloading algorithm,inspiring ENs to provide high-quality service by maximizing the profit of ENs.Firstly,a novel cooperation auction framework is designed to avoid overall profit damage of ENs,which is derived from the high computation delay at the overloaded ENs.Thereafter,the bidding willingness of each MD in every round of auction is determined to ensure MD rationality.Furthermore,we put forward a payment rule for the pre-selected winner to effectively guarantee auction truthfulness.Finally,the auction-based profit maximization offloading algorithm is proposed,and the MD is allowed to occupy the computation and spectrum resources of the EN for offloading if it wins the auction.Numerical results verify the performance of the proposed algorithm.Compared with the VA algorithm,the ENs profit is increased by 23.8%,and the task discard ratio is decreased by 7.5%.

Joint computation offloading and parallel scheduling to maximize delay-guarantee in cooperative MEC systems

The growing development of the Internet of Things(IoT)is accelerating the emergence and growth of new IoT services and applications,which will result in massive amounts of data being generated,transmitted and pro-cessed in wireless communication networks.Mobile Edge Computing(MEC)is a desired paradigm to timely process the data from IoT for value maximization.In MEC,a number of computing-capable devices are deployed at the network edge near data sources to support edge computing,such that the long network transmission delay in cloud computing paradigm could be avoided.Since an edge device might not always have sufficient resources to process the massive amount of data,computation offloading is significantly important considering the coop-eration among edge devices.However,the dynamic traffic characteristics and heterogeneous computing capa-bilities of edge devices challenge the offloading.In addition,different scheduling schemes might provide different computation delays to the offloaded tasks.Thus,offloading in mobile nodes and scheduling in the MEC server are coupled to determine service delay.This paper seeks to guarantee low delay for computation intensive applica-tions by jointly optimizing the offloading and scheduling in such an MEC system.We propose a Delay-Greedy Computation Offloading(DGCO)algorithm to make offloading decisions for new tasks in distributed computing-enabled mobile devices.A Reinforcement Learning-based Parallel Scheduling(RLPS)algorithm is further designed to schedule offloaded tasks in the multi-core MEC server.With an offloading delay broadcast mechanism,the DGCO and RLPS cooperate to achieve the goal of delay-guarantee-ratio maximization.Finally,the simulation results show that our proposal can bound the end-to-end delay of various tasks.Even under slightly heavy task load,the delay-guarantee-ratio given by DGCO-RLPS can still approximate 95%,while that given by benchmarked algorithms is reduced to intolerable value.The simulation results are demonstrated the effective-ness of DGCO-RLPS for delay guarantee in MEC.

Outage Analysis of Optimal UAV Cooperation with IRS via Energy Harvesting Enhancement Assisted Computational Offloading

The utilization of mobile edge computing(MEC)for unmanned aerial vehicle(UAV)communication presents a viable solution for achieving high reliability and low latency communication.This study explores the potential of employing intelligent reflective surfaces(IRS)andUAVs as relay nodes to efficiently offload user computing tasks to theMEC server system model.Specifically,the user node accesses the primary user spectrum,while adhering to the constraint of satisfying the primary user peak interference power.Furthermore,the UAV acquires energy without interrupting the primary user’s regular communication by employing two energy harvesting schemes,namely time switching(TS)and power splitting(PS).The selection of the optimal UAV is based on the maximization of the instantaneous signal-to-noise ratio.Subsequently,the analytical expression for the outage probability of the system in Rayleigh channels is derived and analyzed.The study investigates the impact of various system parameters,including the number of UAVs,peak interference power,TS,and PS factors,on the system’s outage performance through simulation.The proposed system is also compared to two conventional benchmark schemes:the optimal UAV link transmission and the IRS link transmission.The simulation results validate the theoretical derivation and demonstrate the superiority of the proposed scheme over the benchmark schemes.

Delay-optimal multi-satellite collaborative computation offloading supported by OISL in LEO satellite network

By deploying the ubiquitous and reliable coverage of low Earth orbit(LEO)satellite networks using optical inter satel-lite link(OISL),computation offloading services can be provided for any users without proximal servers,while the resource limita-tion of both computation and storage on satellites is the impor-tant factor affecting the maximum task completion time.In this paper,we study a delay-optimal multi-satellite collaborative computation offloading scheme that allows satellites to actively migrate tasks among themselves by employing the high-speed OISLs,such that tasks with long queuing delay will be served as quickly as possible by utilizing idle computation resources in the neighborhood.To satisfy the delay requirement of delay-sensi-tive task,we first propose a deadline-aware task scheduling scheme in which a priority model is constructed to sort the order of tasks being served based on its deadline,and then a delay-optimal collaborative offloading scheme is derived such that the tasks which cannot be completed locally can be migrated to other idle satellites.Simulation results demonstrate the effective-ness of our multi-satellite collaborative computation offloading strategy in reducing task complement time and improving resource utilization of the LEO satellite network.

Review on Offloading of Vehicle Edge Computing

Vehicle Edge Computing(VEC)is a new technology that can extend computing and storage functions to the edge of the Internet of Things systems.For limited computing power and delay-sensitive mobile applications on the Internet of Vehicles(IoV),it is important to offload computing tasks to the end of the VEC network.Still,high mobility data security and privacy resource management and the randomness of IoV brought about new problems to the offloading of VEC.To this end,this study focuses on the offloading of computing tasks in VEC.We survey principal offloading schemes and methods in the VEC field and classify the current offloading of computing tasks into different categories.We also discuss the prospect of VEC.This survey could give a reference for researchers to find and understand the essential characteristics of VEC,which helps choose the optimal solutions for the offloading of computing tasks in VEC.

Deep Reinforcement Learning-Based Computation Offloading for 5G Vehicle-Aware Multi-Access Edge Computing Network

Multi-access Edge Computing(MEC)is one of the key technologies of the future 5G network.By deploying edge computing centers at the edge of wireless access network,the computation tasks can be offloaded to edge servers rather than the remote cloud server to meet the requirements of 5G low-latency and high-reliability application scenarios.Meanwhile,with the development of IOV(Internet of Vehicles)technology,various delay-sensitive and compute-intensive in-vehicle applications continue to appear.Compared with traditional Internet business,these computation tasks have higher processing priority and lower delay requirements.In this paper,we design a 5G-based vehicle-aware Multi-access Edge Computing network(VAMECN)and propose a joint optimization problem of minimizing total system cost.In view of the problem,a deep reinforcement learningbased joint computation offloading and task migration optimization(JCOTM)algorithm is proposed,considering the influences of multiple factors such as concurrent multiple computation tasks,system computing resources distribution,and network communication bandwidth.And,the mixed integer nonlinear programming problem is described as a Markov Decision Process.Experiments show that our proposed algorithm can effectively reduce task processing delay and equipment energy consumption,optimize computing offloading and resource allocation schemes,and improve system resource utilization,compared with other computing offloading policies.

Deep Q-Learning Based Computation Offloading Strategy for Mobile Edge Computing

To reduce the transmission latency and mitigate the backhaul burden of the centralized cloud-based network services,the mobile edge computing(MEC)has been drawing increased attention from both industry and academia recently.This paper focuses on mobile users’computation offloading problem in wireless cellular networks with mobile edge computing for the purpose of optimizing the computation offloading decision making policy.Since wireless network states and computing requests have stochastic properties and the environment’s dynamics are unknown,we use the modelfree reinforcement learning(RL)framework to formulate and tackle the computation offloading problem.Each mobile user learns through interactions with the environment and the estimate of its performance in the form of value function,then it chooses the overhead-aware optimal computation offloading action(local computing or edge computing)based on its state.The state spaces are high-dimensional in our work and value function is unrealistic to estimate.Consequently,we use deep reinforcement learning algorithm,which combines RL method Q-learning with the deep neural network(DNN)to approximate the value functions for complicated control applications,and the optimal policy will be obtained when the value function reaches convergence.Simulation results showed that the effectiveness of the proposed method in comparison with baseline methods in terms of total overheads of all mobile users.

Stochastic Learning for Opportunistic Peer-to-Peer Computation Offloading in IoT Edge Computing

Peer-to-peer computation offloading has been a promising approach that enables resourcelimited Internet of Things(IoT)devices to offload their computation-intensive tasks to idle peer devices in proximity.Different from dedicated servers,the spare computation resources offered by peer devices are random and intermittent,which affects the offloading performance.The mutual interference caused by multiple simultaneous offloading requestors that share the same wireless channel further complicates the offloading decisions.In this work,we investigate the opportunistic peer-to-peer task offloading problem by jointly considering the stochastic task arrivals,dynamic interuser interference,and opportunistic availability of peer devices.Each requestor makes decisions on both local computation frequency and offloading transmission power to minimize its own expected long-term cost on tasks completion,which takes into consideration its energy consumption,task delay,and task loss due to buffer overflow.The dynamic decision process among multiple requestors is formulated as a stochastic game.By constructing the post-decision states,a decentralized online offloading algorithm is proposed,where each requestor as an independent learning agent learns to approach the optimal strategies with its local observations.Simulation results under different system parameter configurations demonstrate the proposed online algorithm achieves a better performance compared with some existing algorithms,especially in the scenarios with large task arrival probability or small helper availability probability.

Efficient Computation Offloading in Mobile Cloud Computing for Video Streaming Over 5G

In this paper,we investigate video quality enhancement using computation offloading to the mobile cloud computing(MCC)environment.Our objective is to reduce the computational complexity required to covert a low-resolution video to high-resolution video while minimizing computation at the mobile client and additional communication costs.To do so,we propose an energy-efficient computation offloading framework for video streaming services in a MCC over the fifth generation(5G)cellular networks.In the proposed framework,the mobile client offloads the computational burden for the video enhancement to the cloud,which renders the side information needed to enhance video without requiring much computation by the client.The cloud detects edges from the upsampled ultra-high-resolution video(UHD)and then compresses and transmits them as side information with the original low-resolution video(e.g.,full HD).Finally,the mobile client decodes the received content and integrates the SI and original content,which produces a high-quality video.In our extensive simulation experiments,we observed that the amount of computation needed to construct a UHD video in the client is 50%-60% lower than that required to decode UHD video compressed by legacy video encoding algorithms.Moreover,the bandwidth required to transmit a full HD video and its side information is around 70% lower than that required for a normal UHD video.The subjective quality of the enhanced UHD is similar to that of the original UHD video even though the client pays lower communication costs with reduced computing power.

Adaptive Application Offloading Decision and Transmission Scheduling for Mobile Cloud Computing

Offloading application to cloud can augment mobile devices' computation capabilities for the emerging resource-hungry mobile application, however it can also consume both much time and energy for mobile device offloading application remotely to cloud. In this paper, we develop a newly adaptive application offloading decision-transmission scheduling scheme which can solve above problem efficiently. Specifically, we first propose an adaptive application offloading model which allows multiple target clouds coexisting. Second, based on Lyapunov optimization theory, a low complexity adaptive offloading decision-transmission scheduling scheme has been proposed. And the performance analysis is also given. Finally, simulation results show that,compared with that all applications are executed locally, mobile device can save 68.557% average execution time and 67.095% average energy consumption under situations.

Joint Optimization of Task Caching,Computation Offloading and Resource Allocation for Mobile Edge Computing

Applications with sensitive delay and sizeable data volumes,such as interactive gaming and augmented reality,have become popular in recent years.These applications pose a huge challenge for mobile users with limited resources.Computation offloading is a mainstream technique to reduce execution delay and save energy for mobile users.However,computation offloading requires communication between mobile users and mobile edge computing(MEC) servers.Such a mechanism would difficultly meet users’ demand in some data-hungry and computation-intensive applications because the energy consumption and delay caused by transmissions are considerable expenses for users.Caching task data can effectively reduce the data transmissions when users offload their tasks to the MEC server.The limited caching space at the MEC server calls for judiciously decide which tasks should be cached.Motivated by this,we consider the joint optimization of computation offloading and task caching in a cellular network.In particular,it allows users to proactively cache or offload their tasks at the MEC server.The objective of this paper is to minimize the system cost,which is defined as the weighted sum of task execution delay and energy consumption for all users.Aiming at establishing optimal performance bound for the system design,we formulate an optimization problem by jointly optimizing the task caching,computation offloading,and resource allocation.The problem is a challenging mixed-integer non-linear programming problem and is NP-hard in general.To solve it efficiently,by using convex optimization,Karmarkar ’s algorithm and the proposed fast search algorithm,we obtain an optimal solution of the formulated problem with manageable computational complexity.Extensive simulation results show that in comparison to some representative benchmark methods,the proposed solution can effectively reduce the system cost.

Joint offloading strategy based on quantum particle swarm optimization for MEC-enabled vehicular networks

With the development of the mobile communication technology,a wide variety of envisioned intelligent transportation systems have emerged and put forward more stringent requirements for vehicular communications.Most of computation-intensive and power-hungry applications result in a large amount of energy consumption and computation costs,which bring great challenges to the on-board system.It is necessary to exploit traffic offloading and scheduling in vehicular networks to ensure the Quality of Experience(QoE).In this paper,a joint offloading strategy based on quantum particle swarm optimization for the Mobile Edge Computing(MEC)enabled vehicular networks is presented.To minimize the delay cost and energy consumption,a task execution optimization model is formulated to assign the task to the available service nodes,which includes the service vehicles and the nearby Road Side Units(RSUs).For the task offloading process via Vehicle to Vehicle(V2V)communication,a vehicle selection algorithm is introduced to obtain an optimal offloading decision sequence.Next,an improved quantum particle swarm optimization algorithm for joint offloading is proposed to optimize the task delay and energy consumption.To maintain the diversity of the population,the crossover operator is introduced to exchange information among individuals.Besides,the crossover probability is defined to improve the search ability and convergence speed of the algorithm.Meanwhile,an adaptive shrinkage expansion factor is designed to improve the local search accuracy in the later iterations.Simulation results show that the proposed joint offloading strategy can effectively reduce the system overhead and the task completion delay under different system parameters.

Energy-Delay Tradeoff for Online Offloading Based on Deep Reinforcement Learning in Wireless Powered Mobile-Edge Computing Networks

Benefited from wireless power transfer(WPT)and mobile-edge computing(MEC),wireless powered MEC systems have attracted widespread attention.Specifically,we design an online offloading scheme based on deep reinforcement learning that maximizes the computation rate and minimizes the energy consumption of all wireless devices(WDs).Extensive results validate that the proposed scheme can achieve better tradeoff between energy consumption and computation delay.

Twin delayed deep deterministic policy gradient-based intelligent computation offloading for IoT

In view of the randomness distribution of multiple users in the dynamic large-scale Internet of Things(IoT)scenario,comprehensively formulating available resources for fog nodes in the area and achieving computation services at low cost have become great challenges.As a result,this paper studies an efficient and intelligent computation offloading mechanism with resource allocation.Specifically,an optimization problem is formulated to minimize the total energy consumption of all tasks under the joint optimization of computation offloading decisions,bandwidth resources and transmission power.Meanwhile,a Twin Delayed Deep Deterministic Policy Gradient-based Intelligent Computation Offloading(TD3PG-ICO)algorithm is proposed to solve this optimization problem.By combining the concept of the actor critic algorithm,the proposed algorithm designs two independent critic networks that can avoid the subjective prediction of a single critic network and better guide the policy network to generate the global optimal computation offloading policy.Additionally,this algorithm introduces a continuous variable discretization operation to select the target offloading node with random probability.The available resources of the target node are dynamically allocated to improve the model decision-making effect.Finally,the simulation results show that this proposed algorithm has faster convergence speed and good robustness.It can always approach the greedy algorithm with respect to the lowest total energy consumption.Furthermore,compared with full local and Deep Q-learning Network(DQN)-based computation offloading schemes,the total energy consumption can be reduced by an average of 15.53%and 6.41%,respectively.

Energy and Latency Optimization in Edge-Fog-Cloud Computing for the Internet of Medical Things

In this paper,the Internet ofMedical Things(IoMT)is identified as a promising solution,which integrates with the cloud computing environment to provide remote health monitoring solutions and improve the quality of service(QoS)in the healthcare sector.However,problems with the present architectural models such as those related to energy consumption,service latency,execution cost,and resource usage,remain a major concern for adopting IoMT applications.To address these problems,this work presents a four-tier IoMT-edge-fog-cloud architecture along with an optimization model formulated using Mixed Integer Linear Programming(MILP),with the objective of efficiently processing and placing IoMT applications in the edge-fog-cloud computing environment,while maintaining certain quality standards(e.g.,energy consumption,service latency,network utilization).A modeling environment is used to assess and validate the proposed model by considering different traffic loads and processing requirements.In comparison to the other existing models,the performance analysis of the proposed approach shows a maximum saving of 38%in energy consumption and a 73%reduction in service latency.The results also highlight that offloading the IoMT application to the edge and fog nodes compared to the cloud is highly dependent on the tradeoff between the network journey time saved vs.the extra power consumed by edge or fog resources.