首页> 外文会议>IEEE Vehicular Technology Conference >A Novel Scheme for Aggregate Throughput Maximization with Fairness Constraints in Cellular Networks
【24h】

A Novel Scheme for Aggregate Throughput Maximization with Fairness Constraints in Cellular Networks

机译:一种新颖的吞吐量最大化与蜂窝网络公平约束的总吞吐量最大化

获取原文

摘要

Maximizing the aggregate throughput of wireless cellular networks using link adaptation techniques (e.g. adaptive modulation and power control) has got a great deal of attention (e.g., [5]). However, the fairness of individual throughput allocation has not been well addressed yet. The fairness problem of link adaptation techniques has recently attracted some attention (e.g., [6,9]) but the problem still needs deeper analysis and more efficient solutions. This paper proposes a new scheme that finds the optimal power and modulation level that maximizes the aggregate throughput while taking the individual throughput fairness into consideration. The problem is formulated as a constrained optimization problem and then converted to an unconstrained optimization one by including the constraint as a penalty term in the objective function. The unconstrained optimization problem is solved using the steepest descent technique. Results show that the proposed scheme is always able to achieve the fairness requirements with high aggregate throughput.
机译:使用链路适应技术最大化无线蜂窝网络的聚合吞吐量(例如,自适应调制和功率控制)具有很大的注意(例如,[5])。但是,单个吞吐量分配的公平尚未得到很好的解决。链接适应技术的公平问题最近引起了一些注意(例如,[6,9]),但问题仍然需要更深入的分析和更有效的解决方案。本文提出了一种新的方案,该计划发现最佳功率和调制水平,以考虑各个吞吐量的同时最大化聚合吞吐量。该问题被制定为约束的优化问题,然后通过在目标函数中包括约束作为惩罚项转换为不受约束的优化。使用陡峭的缩减技术解决了不受约束的优化问题。结果表明,该方案始终能够实现高综合吞吐量的公平要求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号