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}
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.