Energy-Efficient D2D Communications With Dynamic Time-Resource Allocation

In this paper, we investigate resource allocation schemes for Device-to-Device (D2D) communications, which aim to minimize the energy consumption of cellular users (CUs) and D2D pairs. Different from existing works where the resource allocation is performed in the premise that the sizes of orthogonal channels/resource blocks are given, we consider the case that the time resource can be dynamically adjusted according to the rate requirements of CUs and D2D pairs during the resource allocation. We first formulate the resource allocation as a mixed integer non-linear programming (MINLP). We then demonstrate that, given the selections of CUs for D2D pairs, the formulated energy minimization problem is conditionally convex, and the convexity condition is derived accordingly. If the convexity condition is not satisfied, we propose an iterative algorithm to minimize the energy consumption. Based on these results, we further develop a random-switch-based iterative (RSBI) algorithm to find the solution to the MINLP by improving the CU-selection for D2D pairs. Simulation results show that, compared with the equipotent and proportional-fair time allocation schemes, our approach can achieve an energy saving ratio of 17%-81% under various network settings.