1. $\alpha$-Fair Power Allocation in Spectrum-Sharing Networks.
- Author
-
Guo, Chongtao, Zhang, Yan, Sheng, Min, Wang, Xijun, and Li, Yuzhou
- Subjects
- *
TELECOMMUNICATION spectrum , *SPECTRUM allocation , *CHANNEL spacing (Telecommunication) , *COGNITIVE radio , *ALGORITHMS - Abstract
To efficiently trade off system sum-rate and link fairness, this paper is dedicated to maximizing the sum of \alpha-fair utility in spectrum-sharing networks, where multiple interfering links share one channel. In the literature, three special cases, including \alpha=\mbox{0} (sum-rate maximization), \alpha=\mbox{1} (proportional fairness), and \alpha=\infty (max-min fairness), have been investigated; the complexity for cases \mbox{1} < \alpha < \infty and \mbox{0} < \alpha < \mbox{1} is still unknown. In this paper, we prove that the problem is convex when \mbox1 < \alpha < \infty and is NP-hard when \mbox0 < \alpha < \mbox1. To deal with the latter case, we transform the objective function and represent it by the difference of two concave functions (D.C.). Then, a power allocation algorithm is proposed with fast convergence to a local optimal point. Simulation results show that the proposed algorithm can obtain global optimality in two-link cases when \mbox0 < \alpha < \mbox1. In addition, we can get a flexible tradeoff between sum-rate and fairness in terms of Jain's index by adjusting $\alpha$. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF