Search

In this paper, the problem of joint user scheduling and computing resource allocation in asynchronous mobile edge computing (MEC) networks is studied. In such networks, edge devices will offload their computational tasks to an MEC server, using the energy they harvest from this server. To get their tasks processed on time using the harvested energy, edge devices will strategically schedule their task offloading, and compete for the computational resource at the MEC server. Then, the MEC server will execute these tasks asynchronously based on the arrival of the tasks. This joint user scheduling, time and computation resource allocation problem is posed as an optimization framework whose goal is to find the optimal scheduling and allocation strategy that minimizes the energy consumption of these mobile computing tasks. To solve this mixed-integer non-linear programming problem, the general benders decomposition method is adopted which decomposes the original problem into a primal problem and a master problem. Specifically, the primal problem is related to computation resource and time slot allocation, of which the optimal closed-form solution is obtained. The master problem regarding discrete user scheduling variables is constructed by adding optimality cuts or feasibility cuts according to whether the primal problem is feasible, which is a standard mixed-integer linear programming problem and can be efficiently solved. By iteratively solving the primal problem and master problem, the optimal scheduling and resource allocation scheme is obtained. Simulation results demonstrate that the proposed asynchronous computing framework reduces 87.17% energy consumption compared with conventional synchronous computing counterpart.

Densely deployed light emitting diodes (LEDs) typically lead to high spatial correlation in multiple-input multiple-output (MIMO) visible light communication (VLC) systems. Although precoding can effectively alleviate the spatial correlation issue, most existing precoding algorithms require a dedicated baseband chain for each LED, leading to high energy consumption and hardware complexity when a large number of LEDs are used. In this paper, a successive interference cancellation (SIC)-based precoding scheme with sub-connected architecture (SIC-SA) is proposed. In the considered model, each baseband chain is connected to an LED sub-array containing multiple LEDs to reduce the complexity. Since, in this case, SIC-based precoding can only determine the signal of each baseband chain for an LED sub-array, while its target is to mitigate the spatial correlation between individual LEDs, the electrical/optical power of each LED must also be jointly optimized to accomplish the target. This joint SIC-based precoding, power allocation, and direct current offset design problem is formulated as an achievable sum rate maximization problem under dimming control and electrical power constraints. A two-step iterative algorithm is proposed to solve this problem. In the first step, the SIC-based precoding is designed to alleviate the multi-user interference. In the second step, the power allocation of LEDs is optimized by matrix decomposition and convex optimization, and a closed-form solution of DC offset is derived. Furthermore, considering the dynamic scenarios, a SIC-based precoding scheme with dynamic sub-connected architecture (SIC-DSA) is proposed, in which a switch network is used to adaptively adjust the LED sub-array structure based on the channel state information. Simulation results show that the proposed SIC-SA and SIC-DSA respectively achieve 0.1340 bps/Hz/W and 0.1305 bps/Hz/W energy efficiency gains over the zero-forcing precoding scheme with SA, when the signal-to-noise ratio is 30 dB.