H-CRAN网络中基于三维匹配的D2D通信资源分配

Pan Zhao, Xiaoyang Li, Lei Feng, Qinghui Zhang, Weidong Yang, Fei Zheng
{"title":"H-CRAN网络中基于三维匹配的D2D通信资源分配","authors":"Pan Zhao, Xiaoyang Li, Lei Feng, Qinghui Zhang, Weidong Yang, Fei Zheng","doi":"10.23919/cnsm46954.2019.9012712","DOIUrl":null,"url":null,"abstract":"To meet the immensely diverse service requirements, heterogeneous cloud radio access network (H-CRAN) architecture and D2D communication is embraced. Consequently, the resource allocation between D2D pairs and current users is a challenge. In this paper, a joint power control and sub-channel allocation scheme is proposed. The original mixed-integer nonlinear programming problem is decomposed into power and sub-channel allocation. Geometric Vertex Search approach and 3-dimensional (3-D) matching method are used to solve them. Finally, numerical results verify the proposed scheme has about 35% and 60% improvement in total throughput comparing with other approaches.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"3-D Matching-based Resource Allocation for D2D Communications in H-CRAN Network\",\"authors\":\"Pan Zhao, Xiaoyang Li, Lei Feng, Qinghui Zhang, Weidong Yang, Fei Zheng\",\"doi\":\"10.23919/cnsm46954.2019.9012712\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To meet the immensely diverse service requirements, heterogeneous cloud radio access network (H-CRAN) architecture and D2D communication is embraced. Consequently, the resource allocation between D2D pairs and current users is a challenge. In this paper, a joint power control and sub-channel allocation scheme is proposed. The original mixed-integer nonlinear programming problem is decomposed into power and sub-channel allocation. Geometric Vertex Search approach and 3-dimensional (3-D) matching method are used to solve them. Finally, numerical results verify the proposed scheme has about 35% and 60% improvement in total throughput comparing with other approaches.\",\"PeriodicalId\":273818,\"journal\":{\"name\":\"2019 15th International Conference on Network and Service Management (CNSM)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Conference on Network and Service Management (CNSM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/cnsm46954.2019.9012712\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Network and Service Management (CNSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/cnsm46954.2019.9012712","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了满足多样化的业务需求,异构云无线接入网(H-CRAN)架构和D2D通信被采用。因此,D2D对和当前用户之间的资源分配是一个挑战。本文提出了一种联合功率控制和子信道分配方案。将原混合整数非线性规划问题分解为功率分配和子信道分配。采用几何顶点搜索法和三维匹配法进行求解。最后,数值计算结果表明,与其他方法相比,该方案的总吞吐量提高了35%和60%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
3-D Matching-based Resource Allocation for D2D Communications in H-CRAN Network
To meet the immensely diverse service requirements, heterogeneous cloud radio access network (H-CRAN) architecture and D2D communication is embraced. Consequently, the resource allocation between D2D pairs and current users is a challenge. In this paper, a joint power control and sub-channel allocation scheme is proposed. The original mixed-integer nonlinear programming problem is decomposed into power and sub-channel allocation. Geometric Vertex Search approach and 3-dimensional (3-D) matching method are used to solve them. Finally, numerical results verify the proposed scheme has about 35% and 60% improvement in total throughput comparing with other approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信