Vehicular Task Offloading via Heat-Aware MEC Cooperation Using Game-Theoretic Method

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.

To realize the vision of the Internet of Things (IoT), mobile-edge computing (MEC) has recently emerged as a promising paradigm to meet the computation demand from mobile users (MUs). In this article, we study the network performance in large-scale stochastic MEC wireless networks, where the tasks can be computed locally by the local computation capabilities (LCCs) or be offloaded to MEC servers for edge computing. To this end, a MEC network is modeled featuring random node distribution, dynamic task requests, orthogonal frequency-division multiple access, task retransmission, and parallel computing in MEC servers. Given the model, a 2-D discrete-time Markov chain is first adopted to characterize the task execution process, including local computing and task offloading. Based on the coupling between communication and computing, the average outage probability of the task transmission and the average MEC computation load are derived by integrating the stochastic geometry and queuing theory. Furthermore, by jointly analyzing the local computation latency, transmission latency, and edge computation latency, we derive the average end-to-end latency of the task execution. Our results show that the LCCs in MUs can improve the network performance, including communication and computation performance, in stochastic MEC networks. In addition, useful guidelines for MEC network provisioning and planning are provided to avoid either the local computing or the task offloading being the latency performance bottleneck.

With the emergence of increasingly computing-intensive and delay-sensitive tasks, the processing of computing tasks on cloud servers cannot meet the current needs any longer. The emergence of mobile edge computing (MEC) technology and the popularity of 5G applications can solve these demands. Offloading tasks to the MEC server reduces the energy consumption of local devices, and also has a lower latency than offloading to the cloud server. In this paper, an MEC–edge cloud server collaborative system model with energy harvesting technology is designed to minimize the processing delay of computing tasks by allocating computing resources. We propose an optimal integer linear programming (OILP) algorithm with two steps. Firstly, we propose a Lyapunov stability optimization algorithm based on task priority. With the constraints of local mobile device power stability, the divide-and-conquer idea is used for solving the target values of the processing tasks locally, and the MEC and edge cloud servers separately. Therefore, the objective problem is transformed into an integer linear programming problem, and then an integer linear programming algorithm based on CPU utilization optimization is proposed to obtain a resource allocation scheme. Simulation results show that the proposed OILP algorithm can further reduce the delay, improve the CPU’s utilization of the MEC server, and reduce the number of the tasks that cannot be processed under the condition of the energy stability of the local device.

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.

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.

Mobile edge computing (MEC) has attracted great interests as a promising approach to augment computational capabilities of mobile devices. An important issue in the MEC paradigm is computation offloading. In this paper, we propose an integrated framework for computation offloading and interference management in wireless cellular networks with mobile edge computing. In this integrated framework, the MEC server makes the offloading decision according to the local computation overhead estimated by all user equipments (UEs) and the offloading overhead estimated by the MEC server itself. Then, the MEC server performs the PRB allocation using graph coloring. The outcomes of the offloading decision and PRB allocation are then used to allocate the computation resource of the MEC server to the UEs. Simulation results are presented to show the effectiveness of the proposed scheme with different system parameters.

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.

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.

As an emerging technology, Mobile Edge Computing (MEC) is introduced to reduce network delay and provide context-aware services. MEC servers are located in close proximity to users, enabling users to seamlessly access services running on edge facilities. However, capacity and bandwidth constraints of MEC servers limit the number of services to be deployed. Therefore, an important problem is how to allocate services properly within capacity and bandwidth constraints, which is known as an NP-hard problem. In this paper, we focus on the services allocation problem in MEC and try to find trade-offs between average network delay and load balance. With temporal locality information, we allocate services by Pareto-based optimal k-Medoids and generate approximate optimal service allocation policies. In our simulation environment, compared with some traditional heuristic algorithms, our approach can reduce the variance of the load on MEC servers by 18.9% with nearly same network delay.

Mobile edge computing (MEC) mitigates terminal device computing demands by deploying cloud resources at the network's edge. In this MEC framework, unmanned aerial vehicles (UAVs) equipped with MEC servers enhance both uplink and downlink offloading due to their exceptional maneuverability and line-of-sight (LoS) connectivity. However, the wireless nature of UAV-MEC systems exposes sensitive data to potential eavesdropping. To address this concern, we formulate an optimisation challenge aimed at maximising data secrecy energy efficiency. This optimisation balances data and energy efficiency while preserving communication security. Due to the problem's time-varying and non-convex nature, we decompose it into four subproblems: terminal scheduling, local computing ratio, UAV transmit power, and UAV trajectory optimisation. Subsequently, we develop a hybrid iterative algorithm to maximise data secrecy energy efficiency during offloading. Simulations illustrate the algorithm can efficiently utilise terminal and MEC server computation capabilities, enhance system security, and improve energy efficiency while reducing energy consumption in task offloading.

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.

Mobile edge computing (MEC), as a new distributed computing model, satisfies the low energy consumption and low latency requirements of computation-intensive services. The task offloading of MEC has become an important research hotspot, as it solves the problems of insufficient computing capability and battery capacity of Internet of things (IoT) devices. This study investigates task offloading scheduling in a dynamic MEC system. By integrating energy harvesting technology into IoT devices, we propose a hybrid energy supply model. We jointly optimize local computing, offloading duration, and edge computing decisions to minimize system cost. On the basis of stochastic optimization theory, we design an online dynamic task offloading algorithm for MEC with a hybrid energy supply called DTOME. DTOME can make task offloading decisions by weighing system cost and queue stability. We quote dynamic programming theory to obtain the optimal task offloading strategy. Simulation results verify the effectiveness of DTOME, and show that DTOME entails lower system cost than two baseline task offloading strategies.

<p>The vehicular ad hoc network (VANET) has emerged as a heterogeneous network with no fixed infrastructure. In VANET, vehicles are the mobile nodes that communicate with one another and with the infrastructure. One of the major challenges in VANET is to allocate resources efficiently due to environmental characteristics such as highly mobile vehicles, latency-sensitive and short connection times. The conventional resource management mechanisms are not very effective in such an environment. The data-driven Artificial Intelligence (AI) based techniques are a very efficient alternative to traditional statistical techniques. This project proposes an AI-empowered task offloading and computing resource allocation model which can dynamically organize the computing resources in VANET. The model is divided into two layers. First, the task offloading layer, where the Random Forest (RF) algorithm is used to determine whether the vehicle’s computing tasks should be offloaded to the cloud computing (CC) server or mobile edge computing (MEC) server or to be processed locally (in-vehicle computing). Second, the resource allocation layer, where the deep deterministic policy gradient (DDPG) algorithm is used to determine the computing platform again when the task is determined to be offloaded to either MEC servers or the cloud servers. To evaluate the performance of the RF classifier, we applied the model to a real-world driving trajectory dataset then compared the results with a different set of machine learning algorithms namely, K-nearest neighbour (KNN), Multilayer Perceptron (MLP) and Support Vector Machine (SVM). The results show the RF model outperformed other models in classification accuracy score of 99.83% for task offloading decision, where the KNN, MLP and SVM achieved 98%, 94.81% and 90.94%, respectively. Moreover, the DDPG based resource allocation scheme converges within 150 episodes. Thus, the proposed model can find the optimal offload decision and the computational resource allocation simultaneously and achieves a high delay to quality-of-service (QoS) satisfaction ratio.</p>

Mobile edge computing (MEC), which sinks the functions of cloud servers, has become an emerging paradigm to solve the contradiction between delay-sensitive tasks and resource-constrained terminals. Task offloading assisted by service caching in a collaborative manner can reduce delay and balance the edge load in MEC. Due to the limited storage resources of edge servers, it is a significant issue to develop a dynamical service caching strategy according to the actual variable user demands in task offloading. Therefore, this paper investigates the collaborative task offloading problem assisted by a dynamical caching strategy in MEC. Furthermore, a two-level computing strategy called joint task offloading and service caching (JTOSC) is proposed to solve the optimized problem. The outer layer in JTOSC iteratively updates the service caching decisions based on the Gibbs sampling. The inner layer in JTOSC adopts the fairness-aware allocation algorithm and the offloading revenue preference-based bilateral matching algorithm to get a great computing resource allocation and task offloading scheme. The simulation results indicate that the proposed strategy outperforms the other four comparison strategies in terms of maximum offloading delay, service cache hit rate, and edge load balance.

With the ongoing advancement of electric power Internet of Things (IoT), traditional power inspection methods face challenges such as low efficiency and high risk. Unmanned aerial vehicles (UAVs) have emerged as a more efficient solution for inspecting power facilities due to their high maneuverability, excellent line-of-sight communication capabilities, and strong adaptability. However, UAVs typically grapple with limited computational power and energy resources, which constrain their effectiveness in handling computationally intensive and latency-sensitive inspection tasks. In response to this issue, we propose a UAV task offloading strategy based on deep reinforcement learning (DRL), which is designed for power inspection scenarios consisting of mobile edge computing (MEC) servers and multiple UAVs. Firstly, we propose an innovative UAV-Edge server collaborative computing architecture to fully exploit the mobility of UAVs and the high-performance computing capabilities of MEC servers. Secondly, we established a computational model concerning energy consumption and task processing latency in the UAV power inspection system, enhancing our understanding of the trade-offs involved in UAV offloading strategies. Finally, we formalize the task offloading problem as a multi-objective optimization issue and simultaneously model it as a Markov Decision Process (MDP). Subsequently, we proposed a task offloading algorithm based on a Deep Deterministic Policy Gradient (OTDDPG) to obtain the optimal task offloading strategy for UAVs. The simulation results demonstrated that this approach outperforms baseline methods with significant improvements in task processing latency and energy consumption.