Resource allocation for energy harvesting-powered D2D communications underlaying cellular networks
Resource allocation for energy harvesting-powered D2D communications underlaying cellular networks
复制标题
DOI：
10.1109/icc.2017.7997132
复制
发表时间：
2017-05
期刊：
影响因子：
--
通讯作者：
Haichao Wang;Guoru Ding;Jinlong Wang;Le Wang;T. Tsiftsis;P. Sharma
中科院分区：
文献类型：
--
作者：
Haichao Wang;Guoru Ding;Jinlong Wang;Le Wang;T. Tsiftsis;P. Sharma
设备间通信和能量收集都是提高频谱和能源效率的关键技术。在本文中，我们研究了蜂窝网络下能量收集驱动的 D2D 通信的资源分配问题，其中 D2D 对首先收集能量，然后传输信息信号。目标是通过联合时间调度和功率控制来最大化总吞吐量，同时满足蜂窝用户的SINR要求并考虑能量约束。通过巧妙的重新表述，将公式化的非凸问题转化为非线性分数规划问题。结合D.C.（两个凸函数的差）编程，可以通过迭代求解一系列凸问题来获得非凸问题的接近最优解。然后，采用一阶算法来解决这些凸问题。进行数值模拟来验证所提出算法的有效性并评估系统吞吐量性能。
Device-to-device communication and energy harvesting are both key technologies to improve spectrum and energy efficiency. In this paper, we investigate the resource allocation problem for the energy harvesting-powered D2D communication underlaying cellular networks, where D2D pairs firstly harvest energy and then transmit information signals. The goal is to maximize the sum throughput via joint time scheduling and power control while satisfying the SINR requirement of cellular user and taking into account the energy constraint. The formulated non-convex problem is transformed into a nonlinear fractional programming problem with a tactful reformulation. Coupled with D.C. (difference of two convex functions) programming, a near optimal solution of the non-convex problem can be obtained by iteratively solving a sequence of convex problems. Then, a first-order algorithm is employed to solve these convex problems. Numerical simulations are conducted to validate the effectiveness of the proposed algorithm and evaluate the system throughput performance.