With the increasing demands for large-scale computing in Internet of Things (IoT) network, fog computing emerges as a potential solution. However, the time and energy costs are the bottlenecks for developing fog computing. In this paper, we investigate the green fog computing by maximizing the network utility function considering energy efficiency with the constraints of power and interference. The proposed problem is a large-scale mixed integer nonlinear programming. To deal with such kind of problems, we design an algorithm framework to solve the problem in a distributed and parallel manner. The outer loop of the problem is based on the Benders decomposition to divide the integer variables and continuous variables into the master problems and subproblems, respectively. In the subproblem, we use the Dinkelbach algorithm to transform the fractional programming into an equivalent solvable form. In the inner loop, the large-scale problem with only continuous variables is handled by the alternating direction method of multipliers (ADMM) algorithm. For the master problem, we propose a centralized branch-and-bound algorithm to deal with the complexity. We also discuss the properties and performances of our algorithm. Finally, the simulation results indicate that our proposed algorithm is energy-efficient and time-saving.
9 April 2021 in IEEE Transactions on Vehicular Technology
As an emerging technique, unmanned aerial vehicle (UAV) aided multi-access edge computing (MEC) network has been improving the performance of the communication network. The novel architecture is beneficial for coverage, flexibility, and reliability. However, reducing network latency is a critical issue. In this paper, we design a UAV-aided network with a millimeter wave (mmWave) backhaul to achieve the multi-access edge computing. The routing problem is formulated and solved first to obtain the optimal routes through the ad hoc link for all users. Then, we formulate the joint trajectory design and resource allocation problem, which is a mixed-integer nonconvex programming, to minimize the network latency. Furthermore, we design a novel iterative algorithm framework to handle this challenging problem. In the outer loop, the proposed problem is separated into the primal problems and master problems by adopting generalized benders decomposition (GBD). In the inner loop, we design the algorithm to solve the continuous nonconvex primal problem by combining the alternating direction method of multipliers (ADMM), Dinkelbach algorithm, and successive convex approximation (SCA) algorithm. The simulation results demonstrate that our proposed algorithm framework is effective and feasible.
18 March 2019 in IEEE Transactions on Communications
To satisfy the rapidly growing demands of wireless communications, new structures have been proposed for the fifth-generation (5G) mobile communication networks, such as cloud radio access networks (C-RANs), which have advantages including high energy efficiency, large network capacity, and high flexibility. This paper concentrates on the problem of remote radio head (RRH) activation, user association, and power allocation in C-RANs. To tackle the problem with l 0 norm, we transform it into a mixed-integer nonlinear programming (MINLP) problem. Instead of solving it by centralized solvers, we propose a novel algorithm based on Benders decomposition, which can obtain the optimal solution of the MINLP problem. To solve the primal problem in Benders decomposition efficiently, we adopt the alternating direction method of multipliers (ADMM) to achieve a parallel implementation. To further reduce the complexity of solving the MINLP problem, a distributed two-stage iterative algorithm combining the ADMM and the max-sum algorithm is also proposed. The simulation results demonstrate that the first proposed algorithm can obtain the optimal solution, and the second proposed algorithm outperforms conventional algorithms significantly.