首页> 外文期刊>IEEE transactions on mobile computing >Max-Min Fairness Rate Control in Wireless Networks: Optimality and Algorithms by Perron-Frobenius Theory
【24h】

Max-Min Fairness Rate Control in Wireless Networks: Optimality and Algorithms by Perron-Frobenius Theory

机译:无线网络中的最大-最小公平速率控制:最优性和Perron-Frobenius理论的算法

获取原文
获取原文并翻译 | 示例

摘要

Rate adaptation and power control are two key resource allocation mechanisms in multiuser wireless networks. In the presence of interference, how do we jointly optimize end-to-end source rates and link powers to achieve weighted max-min rate fairness for all sources in the network? This optimization problem is hard to solve as physical layer link rate functions are nonlinear, nonconvex, and coupled in the transmit powers. We show that the weighted max-min rate fairness problem can, in fact, be decoupled into separate fairness problems for flow rate and power control. For a large class of physical layer link rate functions, we characterize the optimal solution analytically by a nonlinear Perron-Frobenius theory through solving a conditional eigenvalue problem that captures the interaction of multiuser interference. We propose an iterative algorithm to compute the optimal flow rate that converges geometrically fast without any parameter configuration. Numerical results demonstrate that our iterative algorithm is computationally fast for the Shannon capacity, CDMA, and piecewise link rate functions.
机译:速率自适应和功率控制是多用户无线网络中的两个关键资源分配机制。在存在干扰的情况下,我们如何共同优化端到端源速率和链路功率,以实现网络中所有源的加权最大-最小速率公平性?由于物理层链路速率函数是非线性的,非凸的并且耦合在发射功率中,因此很难解决此优化问题。我们表明,加权的最大-最小速率公平性问题实际上可以分解为流量和功率控制的单独公平性问题。对于一大类物理层链路速率函数,我们通过解决捕获多用户干扰相互作用的条件特征值问题,通过非线性Perron-Frobenius理论解析地描述了最优解。我们提出了一种迭代算法来计算最佳流速,该流速无需任何参数配置即可在几何上快速收敛。数值结果表明,对于香农容量,CDMA和分段链路速率函数,我们的迭代算法计算速度较快。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号