MDP-Based Scheduling Design for Mobile-Edge Computing Systems with Random User Arrival

In this paper, we investigate the scheduling design of a mobile-edge computing (MEC) system, where the random arrival of mobile devices with computation tasks in both spatial and temporal domains is considered. The binary computation offloading model is adopted. Every task is indivisible and can be computed at either the mobile device or the MEC server. We formulate the optimization of task offloading decision, uplink transmission device selection and power allocation in all the frames as an infinite-horizon Markov decision process (MDP). Due to the uncertainty in device number and location, conventional approximate MDP approaches to addressing the curse of dimensionality cannot be applied. A novel low-complexity sub-optimal solution framework is then proposed. We first introduce a baseline scheduling policy, whose value function can be derived analytically. Then, one-step policy iteration is adopted to obtain a sub-optimal scheduling policy whose performance can be bounded analytically. Simulation results show that the gain of the sub-optimal policy over various benchmarks is significant.Comment: 6 pages, 3 figures; accepted by Globecom 2019; title changed to better describe the work, introduction condensed, typos correcte

Joint Computation and Communication Cooperation for Mobile Edge Computing

This paper proposes a novel joint computation and communication cooperation approach in mobile edge computing (MEC) systems, which enables user cooperation in both computation and communication for improving the MEC performance. In particular, we consider a basic three-node MEC system that consists of a user node, a helper node, and an access point (AP) node attached with an MEC server. We focus on the user's latency-constrained computation over a finite block, and develop a four-slot protocol for implementing the joint computation and communication cooperation. Under this setup, we jointly optimize the computation and communication resource allocation at both the user and the helper, so as to minimize their total energy consumption subject to the user's computation latency constraint. We provide the optimal solution to this problem. Numerical results show that the proposed joint cooperation approach significantly improves the computation capacity and the energy efficiency at the user and helper nodes, as compared to other benchmark schemes without such a joint design.Comment: 8 pages, 4 figure

Joint Computation Offloading and Prioritized Scheduling in Mobile Edge Computing

With the rapid development of smart phones, enormous amounts of data are generated and usually require intensive and real-time computation. Nevertheless, quality of service (QoS) is hardly to be met due to the tension between resourcelimited (battery, CPU power) devices and computation-intensive applications. Mobileedge computing (MEC) emerging as a promising technique can be used to copy with stringent requirements from mobile applications. By offloading computationally intensive workloads to edge server and applying efficient task scheduling, energy cost of mobiles could be significantly reduced and therefore greatly improve QoS, e.g., latency. This paper proposes a joint computation offloading and prioritized task scheduling scheme in a multi-user mobile-edge computing system. We investigate an energy minimizing task offloading strategy in mobile devices and develop an effective priority-based task scheduling algorithm with edge server. The execution time, energy consumption, execution cost, and bonus score against both the task data sizes and latency requirement is adopted as the performance metric. Performance evaluation results show that, the proposed algorithm significantly reduce task completion time, edge server VM usage cost, and improve QoS in terms of bonus score. Moreover, dynamic prioritized task scheduling is also discussed herein, results show dynamic thresholds setting realizes the optimal task scheduling. We believe that this work is significant to the emerging mobile-edge computing paradigm, and can be applied to other Internet of Things (IoT)-Edge applications

Offloading Decisions in a Mobile Edge Computing Node with Time and Energy Constraints

This article describes a simulated annealing based offloading decision with processing time, energy consumption and resource constraints in a Mobile Edge Computing Node. Edge computing mostly deals with mobile devices subject to constraints. Especially because of their limited processing capacity and the availability of their battery, these devices have to offload some of their heavy tasks, which require a lot of calculations. We consider a single mobile device with a list of heavy tasks that can be offloadable. The formulated optimization problem takes into account both the dedicated energy capacity and the total execution time. We proposed a heuristic solution schema. To evaluate our solution, we performed a set of simulation experiments. The results obtained in terms of processing time and energy consumption are very encouraging

Efficient Multi-task offloading with energy and computational resources optimization in a mobile edge computing node

With the fifth-generation (5G) networks, Mobile edge computing (MEC) is a promising paradigm to provide near computing and storage capabilities to smart mobile devices. In addition, mobile devices are most of the time battery dependent and energy constrained while they are characterized by their limited processing and storage capacities. Accordingly, these devices must offload a part of their heavy tasks that require a lot of computation and are energy consuming. This choice remains the only option in some circumstances, especially when the battery drains off. Besides, the local CPU frequency allocated to processing has a huge impact on devices energy consumption. Additionally, when mobile devices handle many tasks, the decision of the part to offload becomes critical. Actually, we must consider the wireless network state, the available processing resources at both sides, and particularly the local available battery power. In this paper, we consider a single mobile device that is energy constrained and that retains a list of heavy offloadable tasks that are delay constrained. Therefore, we formulated the corresponding optimization problem, and proposed a Simulated Annealing based heuristic solution scheme. In order to evaluate our solution, we carried out a set of simulation experiments. Finally, the obtained results in terms of energy are very encouraging. Moreover, our solution performs the offloading decisions within an acceptable and feasible timeframes