摘要 : In this letter, we aim to maximize the minimum data volume for the energy harvest (EH)-based D2D communication underlaying cellular network. The formulated problem is a mixed integer nonlinear programming (MINLP), which we split i... 展开 In this letter, we aim to maximize the minimum data volume for the energy harvest (EH)-based D2D communication underlaying cellular network. The formulated problem is a mixed integer nonlinear programming (MINLP), which we split into two sub-problems to solve separately. We first employ the Successive Convex Approximation (SCA) method to solve the time and power allocation, while putting the spectrum multiplexed pairs as fixed. Then, we develop a fair allocation mechanism to allocate spectrum resources. Numerical results show that our developed algorithm outperforms other benchmark schemes in terms of the minimum and overall data volumes. 收起