协调和非协调基站的抢占和QOS管理算法

Olga Munoz-Medina, A. Pascual-Iserte, P. Baquero, J. Vidal
{"title":"协调和非协调基站的抢占和QOS管理算法","authors":"Olga Munoz-Medina, A. Pascual-Iserte, P. Baquero, J. Vidal","doi":"10.1109/SPAWC.2011.5990461","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of resource allocation and quality of service (QoS) management in a downlink communication system where the users are allowed to be attached to and receive data from one or several cooperating base stations (BSs) under orthogonal frequency division multiple access (OFDMA). Under the assumption that only information regarding the link path loss is available at each transmitter, the problem of power and bandwidth allocation to minimize transmission power subject to minimum rate (i.e., QoS) constraints is written as a convex optimization problem. Considering that the transmission power per BS is limited, the Lagrange multipliers of the optimization problem are exploited either to efficiently identify which are the candidates to be preempted whenever unaffordable power consumption arises, or to relax the target rate constraints for the ongoing connections. In the second case, the Lagrange multipliers are used in combination with the Newton- Raphson algorithm to adjust the QoS of the users in the system according to the available BS power.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Preemption and QOS management algorithms for coordinated and uncoordinated base stations\",\"authors\":\"Olga Munoz-Medina, A. Pascual-Iserte, P. Baquero, J. Vidal\",\"doi\":\"10.1109/SPAWC.2011.5990461\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of resource allocation and quality of service (QoS) management in a downlink communication system where the users are allowed to be attached to and receive data from one or several cooperating base stations (BSs) under orthogonal frequency division multiple access (OFDMA). Under the assumption that only information regarding the link path loss is available at each transmitter, the problem of power and bandwidth allocation to minimize transmission power subject to minimum rate (i.e., QoS) constraints is written as a convex optimization problem. Considering that the transmission power per BS is limited, the Lagrange multipliers of the optimization problem are exploited either to efficiently identify which are the candidates to be preempted whenever unaffordable power consumption arises, or to relax the target rate constraints for the ongoing connections. In the second case, the Lagrange multipliers are used in combination with the Newton- Raphson algorithm to adjust the QoS of the users in the system according to the available BS power.\",\"PeriodicalId\":102244,\"journal\":{\"name\":\"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2011.5990461\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2011.5990461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了正交频分多址(OFDMA)下行通信系统中的资源分配和服务质量(QoS)管理问题,该系统允许用户连接到一个或多个合作基站(BSs)并从其接收数据。假设每个发射机只有关于链路路径损耗的信息,在最小速率(即QoS)约束下,以最小化传输功率为目标的功率和带宽分配问题被写成一个凸优化问题。考虑到每BS的传输功率是有限的,利用优化问题的拉格朗日乘数来有效地识别在出现无法承受的功耗时哪些候选节点被抢占,或者放宽正在进行的连接的目标速率约束。在第二种情况下,将拉格朗日乘法器与Newton- Raphson算法结合使用,根据可用的BS功率来调整系统中用户的QoS。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Preemption and QOS management algorithms for coordinated and uncoordinated base stations
This paper addresses the problem of resource allocation and quality of service (QoS) management in a downlink communication system where the users are allowed to be attached to and receive data from one or several cooperating base stations (BSs) under orthogonal frequency division multiple access (OFDMA). Under the assumption that only information regarding the link path loss is available at each transmitter, the problem of power and bandwidth allocation to minimize transmission power subject to minimum rate (i.e., QoS) constraints is written as a convex optimization problem. Considering that the transmission power per BS is limited, the Lagrange multipliers of the optimization problem are exploited either to efficiently identify which are the candidates to be preempted whenever unaffordable power consumption arises, or to relax the target rate constraints for the ongoing connections. In the second case, the Lagrange multipliers are used in combination with the Newton- Raphson algorithm to adjust the QoS of the users in the system according to the available BS power.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信