Resource Allocation in Wireless Powered Relay Networks: A Bargaining Game Approach
Resource Allocation in Wireless Powered Relay Networks: A Bargaining Game Approach
复制标题
DOI：
10.1109/tvt.2016.2641930
复制
发表时间：
2016-11
影响因子：
6.8
通讯作者：
Zijie Zheng;Lingyang Song;D. Niyato;Zhu Han
中科院分区：
文献类型：
--
作者：
Zijie Zheng;Lingyang Song;D. Niyato;Zhu Han
移动的中继网络中的信息和功率传输最近已经同时出现，其中中继可以收集射频（RF）能量，然后将该能量用于数据转发和系统操作。以前的大多数工作没有考虑中继可能有自己的目标，例如使用收集的能量用于自己的传输，而不是最大化网络的传输。因此，在本文中，我们提出了一个纳什讨价还价的方法来平衡的信息传输效率的源-目的地对和收获的能量的中继在无线供电的中继网络与多个源-目的地对和一个中继。分析并证明了将Nash讨价还价问题分解为能量传输功率优化、数据传输功率控制和能量传输与数据传输的时间划分三个子问题时，Nash讨价还价问题具有离散性和拟连续性等特性.在理论分析的基础上，我们提出了一种交替功率控制和时分算法，以找到一个次优解。仿真结果清楚地显示和证明问题的性质和我们的算法的收敛性。
Information and power transfer in mobile relay networks have recently emerged simultaneously, where the relay can harvest the radio frequency (RF) energy and then use this energy for data forwarding and system operation. Most of the previous works do not consider that the relay may have its own objectives, such as using the harvested energy for its own transmission instead of maximizing transmission of the network. Therefore, in this paper, we propose a Nash bargaining approach to balance the information transmission efficiency of source–destination pairs and the harvested energy of the relay in a wireless powered relay network with multiple source–destination pairs and one relay. We analyze and prove that the Nash bargaining problem has several desirable properties such as the discreteness and quasi-concavity, when it is decomposed into three subproblems: the energy transmission power optimization, the power control for data transmission, and the time division between energy transmission and data transmission. Based on the theoretical analysis, we propose an alternating power control and time-division algorithm to find a suboptimal solution. Simulation results clearly show and demonstrate the properties of the problem and the convergence of our algorithm.