Computation offloading tends to be an effective way for mitigating computing pressure of user equipments (UEs). By computation offloading, the task can be handled in network edge and/or cloud center to compensate insufficient resources and capabilities of UEs. In this study, we construct a three-tier cloud-edge integration network, where user tasks are offloaded to satellite based edge server and further to the remote ground cloud server via backhaul links. The optimization problem is modeled for minimizing system energy consumption and considers user association, power allocation, task scheduling, and bandwidth assignment jointly. By the proposed schemes based on relaxation transformation and fractional programming, four subproblems are transformed into corresponding convex optimization problems and solved respectively. In order to find the global optimal solutions, a joint iterative algorithm for three-tier computation offloading problem is designed. In numerical simulations, we compare different communication schemes and computation offloading schemes to present the rationality and superiority of the designed algorithm for reducing system energy consumption.
4 December 2023 in IEEE Transactions on Vehicular Technology
Compared with centralized cloud computing, mobile edge computing (MEC) enables Internet of Things (IoT) devices to offload computation-intensive tasks to the edge of the network closer to them for processing, which can effectively save energy consumption of IoT devices and alleviate network congestion and high latency problems. However, the traditional terrestrial MEC system cannot adapt to scenarios such as rapid network recovery after disasters and emergency rescue due to its poor flexibility and high deployment cost, and assembling edge servers to unmanned aerial vehicles (UAVs) to assist in rapidly building mobile edge networks is a feasible solution. Therefore, this paper considers a multi-UAV-enabled MEC network with the optimization objectives of maximizing the processing success rate of computational tasks and fairness of system, while minimizing the processing delay of computational tasks. We investigate the computation offloading problem and the trajectory planning problem from the perspectives of IoT devices and UAVs, respectively. Then model them as Markov decision processes (MDPs) and propose a joint optimization scheme based on expert knowledge-assisted multi-agent reinforcement learning algorithms. Simulation results show that the proposed algorithm has significant advantages over baseline algorithms in terms of processing success rate and delay of computational tasks as well as fairness of the system.
With the blossom of Internet of Things (IoT) technology, the big data volumes raised by the large number of IoT devices have posed great burden on the communication and computing network. Considering the advantages of reflecting intelligent surface (RIS), mobile edge computing (MEC), and unmanned aerial vehicle (UAV), this article proposes a flying-RIS-assisted MEC system to assist offloading services to alleviate the ground computation burden in IoT. The UAV equipped with RIS is dispatched to fly over a specific area to assist in offloading the ground’s computing mission to MEC server situated nearby access point (AP) in IoT. The cost of the IoT device is introduced as the weighted sum of the device’s energy consumption and the time consumed to accomplish all computation tasks. To prolong the lifetime and guarantee the communication quality of the IoT devices, this article minimizes the sum cost of all IoT devices by collaboratively planning UAV’s trajectory, scheduling the IoT devices’ association with flying-RIS, and optimizing the phase shift value of each reflecting components. To address the posed nonconvex optimization challenge, a deep deterministic policy gradient (DDPG)-based algorithm is brought forward. Besides, the state and action normalization mechanism is used to ease up on the training difficulty. Finally, the numerical simulation results prove the superiority of the proposed algorithm compared with other benchmark schemes.
6 August 2024 in IEEE Transactions on Mobile Computing
Mobile edge computing (MEC) has attracted widespread attention due to its ability to effectively alleviate the cloud computing load and significantly reduce latency. However, the potential eavesdroppers challenge the security of the MEC systems and the rapid development of artificial intelligence (AI) has made this security situation more severe. In most existing studies, the eavesdroppers are non-intelligent and it is assumed that they are fixed or move in a simple manner. Obviously, there is a gap from such an assumption to the real conditions that the eavesdropping unmanned aerial vehicles (UAVs) may adjust their flight paths intelligently. To better reflect real-world scenarios, we consider a multi-UAV-assisted MEC system in the presence of intelligent eavesdroppers and propose an adversarial multi-agent reinforcement learning (MARL)-based scheme for secure computational offloading and resource allocation. With this scheme, we aim to solve the zero-sum game between the legitimate UAVs and the eavesdropping UAVs, in which the two types of UAVs take turns acting as the agents of MARL to alternately optimize their respective opposing objectives. The simulation experimental results indicate that the proposed scheme significantly outperforms the existing baseline methods in dealing with the intelligent eavesdropping UAVs, and ensures high energy efficiency of Internet of Things (IoT) devices even in the worst-case scenario when dealing with potential eavesdropping threats.
Mobile edge computing (MEC) as a promising technology enables it to satisfy ever-increasing demands for low-latency and ultra-reliable services. However, due to the limitations of computing capability and the dynamic network environment, it is challenging to process massive data with low latency. In this paper, we consider a dynamic MEC network with a high-performance edge server, multiple time-varying channels, and multiple mobile devices. We aim to find a policy that can maximize the processing success rate of computational tasks and the fairness index of the system while minimizing the process delays. To this end, we propose a heuristic-assisted multiagent reinforcement learning (RL) based framework to realize the joint optimization of computation offloading and resource allocation. On one hand, heuristic search is introduced in this framework to find a better resource allocation policy in edge servers and further assist the multiagent RL algorithm to determine offloading policy in mobile devices. On the other hand, a novel parametrized multiagent RL algorithm based on soft actor-critic (SAC) is also proposed to broaden the effectiveness and availability of the proposed framework. Simulation results of the average cumulative reward, success rate, processing delay, and fairness index fully verify the superiority of the proposed framework and algorithm for supporting this problem.
17 June 2024 in IEEE Transactions on Vehicular Technology
Vehicular ad hoc networks (VANETs) are characterized by dynamic behavior and unique characteristics that contribute to the complexity of network connectivity and reachability, thereby posing substantial challenges to achieving efficient data transmission. While one avenue for understanding these network properties involves the application of time-varying graphs, comprehending such methods may be hindered by absence of well-defined analogies to established properties of static graphs. Thereby, this study addresses this gap by exploring the properties of time-varying graphs as a means to depict network characteristics, aiming to enhance data dissemination efficiency within vehicular networks assisted by unmanned aerial vehicles (UAVs). Considering delay-sensitive data dissemination, we integrate dissemination delay into the time-varying graph, introducing the concept of a delay-constrained time-varying graph (DTVG). In this context, a data dissemination problem is formulated to optimize data transmission utility. To address this problem, we propose a novel data dissemination algorithm leveraging insights from $k$ -token dissemination problem. Theoretical analysis is employed to derive both upper and lower bounds of our proposed algorithm. Simulations are conducted for validating the feasibility of characterizing dynamic networks based on time-varying graphs. Finally, the effectiveness of our proposed approach is demonstrated through the evaluation of metrics such as dissemination delay, delivery ratio, and network throughput.