基于分支定界的多小区频谱共享网络协调调度与波束形成

Lei Yu, E. Karipidis, E. Larsson
{"title":"基于分支定界的多小区频谱共享网络协调调度与波束形成","authors":"Lei Yu, E. Karipidis, E. Larsson","doi":"10.5281/ZENODO.43261","DOIUrl":null,"url":null,"abstract":"We consider the downlink of a multicell network where neighboring multi-antenna base stations share the spectrum and coordinate their frequency and spatial resource allocation strategies to improve the overall network performance. The objective of the coordination is to maximize the number of users that can be scheduled, meeting their quality-of-service requirements with the minimum total transmit power. The coordinated scheduling and multiuser transmit beamforming problem is combinatorial; we formulate it as a mixed-integer second-order cone program and propose a branch & bound algorithm that yields the optimal solution with relatively low-complexity. The algorithm can be used to motivate or benchmark approximation methods and to numerically evaluate the gains due to spectrum sharing and coordination.","PeriodicalId":201182,"journal":{"name":"2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Coordinated scheduling and beamforming for multicell spectrum sharing networks using branch & bound\",\"authors\":\"Lei Yu, E. Karipidis, E. Larsson\",\"doi\":\"10.5281/ZENODO.43261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the downlink of a multicell network where neighboring multi-antenna base stations share the spectrum and coordinate their frequency and spatial resource allocation strategies to improve the overall network performance. The objective of the coordination is to maximize the number of users that can be scheduled, meeting their quality-of-service requirements with the minimum total transmit power. The coordinated scheduling and multiuser transmit beamforming problem is combinatorial; we formulate it as a mixed-integer second-order cone program and propose a branch & bound algorithm that yields the optimal solution with relatively low-complexity. The algorithm can be used to motivate or benchmark approximation methods and to numerically evaluate the gains due to spectrum sharing and coordination.\",\"PeriodicalId\":201182,\"journal\":{\"name\":\"2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5281/ZENODO.43261\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.43261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

我们考虑了多基站网络的下行链路,其中相邻的多天线基站共享频谱并协调其频率和空间资源分配策略,以提高整体网络性能。协调的目标是最大限度地安排用户的数量,以最小的总发射功率满足他们的服务质量要求。协调调度和多用户发射波束形成问题是组合问题;我们将其表述为一个混合整数二阶锥规划,并提出了一个分支定界算法,以较低的复杂度得到最优解。该算法可用于激励或基准逼近方法,并对频谱共享和协调所带来的增益进行数值评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Coordinated scheduling and beamforming for multicell spectrum sharing networks using branch & bound
We consider the downlink of a multicell network where neighboring multi-antenna base stations share the spectrum and coordinate their frequency and spatial resource allocation strategies to improve the overall network performance. The objective of the coordination is to maximize the number of users that can be scheduled, meeting their quality-of-service requirements with the minimum total transmit power. The coordinated scheduling and multiuser transmit beamforming problem is combinatorial; we formulate it as a mixed-integer second-order cone program and propose a branch & bound algorithm that yields the optimal solution with relatively low-complexity. The algorithm can be used to motivate or benchmark approximation methods and to numerically evaluate the gains due to spectrum sharing and coordination.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信