Optimal Tradeoff Between Sum-Rate Efficiency and Jain's Fairness Index in Resource Allocation
Optimal Tradeoff Between Sum-Rate Efficiency and Jain's Fairness Index in Resource Allocation
复制标题
DOI：
10.1109/twc.2013.061413.121703
复制
发表时间：
2013-07-01
影响因子：
10.4
通讯作者：
Yanikomeroglu, Halim
中科院分区：
文献类型：
--
作者：
Bin Sediq, Akram;Gohary, Ramy H.;Yanikomeroglu, Halim
本文的重点是研究一般资源分配问题中和效率与Jain公平指数之间的权衡问题。在具有M个用户的无线通信系统中经常遇到这样的问题。在处理这些问题的常用方法中，有一种是基于阿尔法公平政策的方法。分析表明，除了M=2个用户的情况外，该策略并不一定达到最优的效率-Jain权衡(EJT)。当用户数为M>；2时，对于相同的Jain‘s指数，α-公平策略所达到的效率与最优的EJT策略所达到的效率之间的差距是无限的。找到最优的EJT对应于解决一类潜在困难的非凸优化问题。为了缓解这一困难，我们得到了在各种无线资源分配问题中被证明是尖锐的和自然满足的充分条件。这些条件为我们提供了一种方法，用于识别找到最优的EJT和实现它的速率向量可以重新表示为凸优化问题的情况。新的公式被用来设计计算高效的资源调度器，使得在准静态和遍历时变通信场景下都能实现最优的EJT。数值算例证实了分析结果的正确性。
The focus of this paper is on studying the tradeoff between the sum efficiency and Jain's fairness index in general resource allocation problems. Such problems are frequently encountered in wireless communication systems with M users. Among the commonly-used methods to approach these problems is the one based on the alpha-fair policy. Analyzing this policy, it is shown that it does not necessarily achieve the optimal Efficiency-Jain tradeoff (EJT) except for the case of M = 2 users. When the number of users M > 2, it is shown that the gap between the efficiency achieved by the alpha-fair policy and that achieved by the optimal EJT policy for the same Jain's index can be unbounded. Finding the optimal EJT corresponds to solving a family of potentially difficult non-convex optimization problems. To alleviate this difficulty, we derive sufficient conditions which are shown to be sharp and naturally satisfied in various radio resource allocation problems. These conditions provide us with a means for identifying cases in which finding the optimal EJT and the rate vectors that achieve it can be reformulated as convex optimization problems. The new formulations are used to devise computationally-efficient resource schedulers that enable the optimal EJT to be achieved for both quasi-static and ergodic time-varying communication scenarios. Analytical findings are confirmed by numerical examples.