Open Access
Beamforming design based on energy harvesting proportional fairness in a simultaneous wireless information and power transfer system
Author(s) -
Haiyang Zhang,
Huang Yong-ming,
Yang L-Xi
Publication year - 2015
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.64.028402
Subject(s) - beamforming , computer science , transmitter , mathematical optimization , channel state information , relaxation (psychology) , bisection method , energy (signal processing) , iterative method , energy harvesting , wireless , channel (broadcasting) , maximum power transfer theorem , transmitter power output , power (physics) , algorithm , telecommunications , mathematics , statistics , physics , quantum mechanics , psychology , social psychology
In this paper, we propose a beamforming design based on energy harvesting proportional fairness to overcome the unbalance of energy harvesting in a simultaneous wireless information and power transfer system. We aim at achieving the energy harvesting proportional fairness while guaranteeing the signal to interference plus noise ratio constraints at the information receivers and total power constraint at the transmitter by optimizing the beamforming vectors. This optimization problem is of non-convex and hence difficult to solve. In order to solve it, in this paper, we first use the semi-definite relaxation technique as a tool to transform it into a semi-definite program problem, and then propose an iterative algorithm based on bisection method to obtain the optimal beamforming vectors. Besides, we also extend our result to a robust case where the transmitter only knows a part of the channel state information and the bound of channel errors, and propose an iterative algorithm based on worst-case method to obtain the corresponding beamforming vectors. Finally, the simulation results show that the proposed algorithms can achieve both the energy harvesting proportional fairness and global optimum.