首页> 外文OA文献 >Preemption and QoS management algorithms for coordinated and uncoordinated base stations
【2h】

Preemption and QoS management algorithms for coordinated and uncoordinated base stations

机译:用于协调和非协调基站的抢占和Qos管理算法

摘要

This paper addresses the problem of resource allocation and qualityudof service (QoS) management in a downlink communication systemudwhere the users are allowed to be attached to and receive dataudfrom one or several cooperating base stations (BSs) under orthogonaludfrequency division multiple access (OFDMA). Under the assumptionudthat only information regarding the link path loss is availableudat each transmitter, the problem of power and bandwidth allocationudto minimize transmission power subject to minimum rate (i.e., QoS)udconstraints is written as a convex optimization problem. Consideringudthat the transmission power per BS is limited, the Lagrangeudmultipliers of the optimization problem are exploited either to ef-udficiently identify which are the candidates to be preempted wheneverudunaffordable power consumption arises, or to relax the targetudrate constraints for the ongoing connections. In the second case,udthe Lagrange multipliers are used in combination with the NewtonRaphsonudalgorithm to adjust the QoS of the users in the system accordingudto the available BS power.
机译:本文解决了在下行通信系统中的资源分配和质量 udof服务(QoS)管理的问题 ud,其中允许用户在正交 udfrequency下附加到一个或几个协作基站(BS)并从中接收数据 ud划分多址(OFDMA)。在假设 ud关于每个发射机仅可获得关于链路路径损耗的信息 udad的情况下,将功率和带宽分配的问题 ud以最小速率(即,QoS)最小化传输功率的问题 ud约束约束写为凸优化问题。考虑到每基站的传输功率受到限制,优化问题的拉格朗日 ud乘数被用来有效地识别足够的 ududfable功耗时优先抢占的候选者,或放宽目标 udrate约束。进行中的连接。在第二种情况下,拉格朗日乘法器与NewtonRaphson udalgorithm结合使用,根据可用的BS功率来调整系统中用户的QoS。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号