CoMP联合传输的HetNets资源分配方案

Yun Gao, D. Ma, Jie Sheng, Canyan Zhu, M. Ma
{"title":"CoMP联合传输的HetNets资源分配方案","authors":"Yun Gao, D. Ma, Jie Sheng, Canyan Zhu, M. Ma","doi":"10.1109/ICCT.2017.8359685","DOIUrl":null,"url":null,"abstract":"This paper proposes a joint subchannel and power allocation scheme for the downlink of orthogonal frequency division multiple access (OFDMA)-based heterogeneous networks (HetNets), where the coordinated multipoint (CoMP) joint transmission is supported. We formulate the scheme as a network throughput maximization problem subject to transmit power budgets. An iterative algorithm is first developed to find the optimal solution, which decomposes the subchannel assignment and power allocation in each iteration to reduce computational complexity. Then a greedy-based and an iterative waterfilling-based algorithm are designed, respectively, to solve the subchannel assignment and power allocation subproblems. Simulation results demonstrate that the proposed scheme outperforms other existing works and the iterative algorithms converge within a few iterations.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Resource allocation scheme for HetNets with CoMP joint transmission\",\"authors\":\"Yun Gao, D. Ma, Jie Sheng, Canyan Zhu, M. Ma\",\"doi\":\"10.1109/ICCT.2017.8359685\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a joint subchannel and power allocation scheme for the downlink of orthogonal frequency division multiple access (OFDMA)-based heterogeneous networks (HetNets), where the coordinated multipoint (CoMP) joint transmission is supported. We formulate the scheme as a network throughput maximization problem subject to transmit power budgets. An iterative algorithm is first developed to find the optimal solution, which decomposes the subchannel assignment and power allocation in each iteration to reduce computational complexity. Then a greedy-based and an iterative waterfilling-based algorithm are designed, respectively, to solve the subchannel assignment and power allocation subproblems. Simulation results demonstrate that the proposed scheme outperforms other existing works and the iterative algorithms converge within a few iterations.\",\"PeriodicalId\":199874,\"journal\":{\"name\":\"2017 IEEE 17th International Conference on Communication Technology (ICCT)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 17th International Conference on Communication Technology (ICCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2017.8359685\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2017.8359685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对基于正交频分多址(OFDMA)的异构网络(HetNets)下行链路,提出了一种支持协同多点(CoMP)联合传输的联合子信道和功率分配方案。我们将该方案描述为受传输功率预算约束的网络吞吐量最大化问题。首先提出了一种迭代算法来寻找最优解,该算法在每次迭代中分解子信道分配和功率分配,以降低计算复杂度。然后分别设计了基于贪婪的子信道分配算法和基于迭代注水的子信道分配算法来解决子信道分配和功率分配问题。仿真结果表明,该算法优于现有算法,且迭代算法在几次迭代内收敛。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource allocation scheme for HetNets with CoMP joint transmission
This paper proposes a joint subchannel and power allocation scheme for the downlink of orthogonal frequency division multiple access (OFDMA)-based heterogeneous networks (HetNets), where the coordinated multipoint (CoMP) joint transmission is supported. We formulate the scheme as a network throughput maximization problem subject to transmit power budgets. An iterative algorithm is first developed to find the optimal solution, which decomposes the subchannel assignment and power allocation in each iteration to reduce computational complexity. Then a greedy-based and an iterative waterfilling-based algorithm are designed, respectively, to solve the subchannel assignment and power allocation subproblems. Simulation results demonstrate that the proposed scheme outperforms other existing works and the iterative algorithms converge within a few iterations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Chemical substance classification using long short-term memory recurrent neural network One-way time transfer for large area through tropospheric scatter Application feature extraction by using both dynamic binary tracking and statistical learning Research on multi-target resolution process with the same beam of monopulse radar Pedestrian detection based on Visconti2 7502
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1