4 June 2018 in IEEE Transactions on Industrial Informatics
Mobile-edge Computing (MEC) has aroused significant attention for its performance to accelerate application's operation and enrich user's experience. With the increasing development of green computing, energy harvesting (EH) is considered as an available technology to capture energy from circumambient environment to supply extra energy for mobile devices. In this paper, we propose an online dynamic tasks assignment scheduling to investigate the tradeoff between energy consumption and execution delay for MEC system with EH capability. We formulate it into an average weighted sum of energy consumption and execution delay minimization problem of mobile device with the stability of buffer queues and battery level as constraints. Based on Lyapunov optimization method, we obtain the optimal scheduling about the CPU-cycle frequencies of mobile device and transmit power for data transmission. Besides, the dynamic online tasks offloading strategy is developed to modify the data backlogs of queues. The performance analysis shows the stability of the battery energy level and the tradeoff between energy consumption and execution delay. Moreover, the MEC system with EH devices and task buffers implements the high energy efficient and low latency communications. The performance of the proposed online algorithm is validated with extensive trace-driven simulations.
24 March 2021 in IEEE Transactions on Wireless Communications
Mobile Edge Computing (MEC) brings abundant cloud resources to the edge of the network and provides great opportunities to improve user's quality of experience. While many recent studies have investigated the problem of computation offloading, service caching is also an important design topic of MEC. Service caching stores application-related databases or libraries in advance and enables corresponding user tasks to be offloaded. Due to the limited resources in the edge server, service caching decisions have to be made judiciously to maximize the system performance. In this paper, we study the problem of joint service caching, computation offloading, transmission and computing resource allocation in a general scenario of multiple users with multiple tasks. We aim to minimize the overall computation and delay costs for all users and formulate the optimization problem as a quadratically constrained quadratic program (QCQP) which is non-convex and NP-hard. To solve this challenging problem, we propose an efficiently approximate algorithm based on semidefinite relaxation (SDR) approach and alternating optimization which always computes a locally optimal solution. Moreover, we extend the study to the scenario where each user has a computation cost constraint. Simulation results show that our algorithm can minimize the system cost effectively by utilizing the available system resources.
14 January 2022 in IEEE Transactions on Vehicular Technology
Mobile-edge computing (MEC) has been recognized as a promising solution to provide efficient communication and computation capabilities for mobile users (MUs). However, the problem relating to parallel offloading and load balancing with multiple cooperative MEC servers and massive delay-sensitive execution workloads remains to be investigated. In this paper, we study a joint parallel offloading and load balancing policy for such an MEC system. We formulate a long-term system average-cost (i.e., weighted sum of energy consumption and execution delays) stochastic programming problem under MU battery level stability and delay constraints. Our aims include optimizing the data sizes for uplink offloading transmissions for optimized communication and computation resource allocation among multi-users, and maximizing the computation capability utilization of cooperative MEC servers by load balancing. To solve this problem, we first design a Lyapunov-based centralized cost management algorithm (LYP-CCMA) to obtain the optimal system average-cost under the battery level stability constraints. Further, we propose two algorithms based on alternating direction method of multipliers (ADMM) to implement distributed resources allocation. Simulation results verify our analysis and demonstrate the superior performance of our proposed schemes over several baseline schemes.
21 October 2020 in IEEE Transactions on Cloud Computing
For Internet and cloud computing service providers, running massive geo-distributed data centers incurs prodigious electricity cost and water consumption as well as carbon emission rooted in electricity generation. Thus, it is critical significant for providers to lower down the operation cost of data centers. In this paper, we investigate the problem of energy management for geo-distributed data centers with renewable resources and energy storages. We aim to minimize the long-term operation cost including electricity cost, water consumption and carbon emission by leveraging the spatiotemporal diversity of these system states. To this end, we first formulate the cost minimization problem as a stochastic optimization problem, then we adopt the Lyapunov optimization technique to design a close-to-optimal online algorithm which only needs the current system information and achieves a delicate tradeoff between system cost and performance of delay tolerant workloads. To reduce the computational complexity and unnecessary communication, we further propose a distributed algorithm based on the distributed computing framework alternating direction method of multipliers (ADMM), which enables each data center to make their own control decisions. Based on the real-world traces and extensive simulations, we demonstrate the effectiveness of our proposed algorithms.
18 November 2024 in IEEE Internet of Things Journal
In vehicular networks enhanced by unmanned aerial vehicles (UAVs), vehicle state information is efficiently collected, and traffic safety is assured. UAVs, serving as aerial base stations, enable vehicle network access and provide edge computing services in the absence of roadside units (RSUs). This study explores a multi-UAV-assisted vehicular network, where multiple UAVs collaboratively offer services to vehicles. The goal is to minimize task completion time by optimizing trajectory planning, spectrum resource allocation, and dynamic data offloading. An enhanced multi-agent deep deterministic policy gradient (MADDPG) algorithm is introduced to address the optimization challenge in cooperative multi-UAV scenarios. Within this framework, each UAV, acting as an agent, devises strategies for movement, data offloading, and resource allocation based on the current states of vehicles and fellow UAVs. The simulation results reveal that the proposed algorithm improves task completion efficiency and ensures vehicle quality of service (QoS) over existing benchmarks.
10 July 2024 in IEEE Transactions on Consumer Electronics
The rapid development of edge computing provides low latency for computation-intensive application in Internet of Vehicles. The unmanned aerial vehicles (UAVs) with computation capacity have been deployed to provide both relay and execution service in vehicular edge computing (VEC) system. In this paper, we investigate a heterogeneous UAV-assisted VEC system with multiple vehicular user devices (VUDs) and edge servers (ESs). We model our optimization goal as a problem of minimizing the maximum cost of system in terms of weighted sum of delay and energy consumption. As the research question involves binary optimization variables, UAV position variables, and the form of minimizing the maximum value, it is a mixed-integer nonlinear programming (MINLP) problem, making the solution of this question challenging. We propose an iterative CORAP algorithm that jointly optimizes the Computation Offloading decision, Resource Allocation, alongside the Positioning of the UAV, in order to obtain a feasible solution to the problem. Particular, the offloading decision is transformed into a quadratically constrained quadratic program (QCQP) formulation and obtained through the semidefinite relaxation (SDR) method, the computation and communiation resources allocation decision is obtained by the bisection method, and the optimal position of UAV is derived by the successive convex approximation (SCA) method. Finally, simulation experiments are conducted to evidence the effectiveness and feasibility of our proposed algorithm.