Xingwang Mao, Biling Zhang, Yuyang Chen, Jung-Lang Yu, Zhu Han
{"title":"基于匹配博弈的设备对设备通信5G H-CRAN网络资源分配","authors":"Xingwang Mao, Biling Zhang, Yuyang Chen, Jung-Lang Yu, Zhu Han","doi":"10.1109/PIMRC.2017.8292250","DOIUrl":null,"url":null,"abstract":"Device-to-Device (D2D) communication is a promising technology component towards the fifth generation mobile communication. However, when D2D communication is incorporated into heterogeneous cloud radio access network (H-CRAN), the interference management between the D2D users and current users is a challenge. In this paper, we study how to assign the sub-channels of different bandwidth to multiple D2D pairs and the RRH users (RUEs). In such a case, the sub-channel that has been pre-allocated to a macrocell user (MUE) can be reused, the system performance that accounts for both the overall throughput and the number of admitted users can be maximized and all the users quality of service (QoS) can be guaranteed. Such a resource allocation problem is formulated as a mixed integer nonlinear programming (MINLP) problem which is NP-hard. To obtain the optimal solution, the proposed problem is transformed into a many-to-one matching game with externalizes, and a constrained-DA algorithm is proposed. We prove theoretically that with the constrained-DA algorithm, the matching game can reach the stable matching with a low computational complexity. Numerical results demonstrate that our proposed scheme can significantly improve the system performance in terms of overall throughput and the total number of admitted users compared with existing resource allocation schemes.","PeriodicalId":397107,"journal":{"name":"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Matching game based resource allocation for 5G H-CRAN networks with device-to-device communication\",\"authors\":\"Xingwang Mao, Biling Zhang, Yuyang Chen, Jung-Lang Yu, Zhu Han\",\"doi\":\"10.1109/PIMRC.2017.8292250\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Device-to-Device (D2D) communication is a promising technology component towards the fifth generation mobile communication. However, when D2D communication is incorporated into heterogeneous cloud radio access network (H-CRAN), the interference management between the D2D users and current users is a challenge. In this paper, we study how to assign the sub-channels of different bandwidth to multiple D2D pairs and the RRH users (RUEs). In such a case, the sub-channel that has been pre-allocated to a macrocell user (MUE) can be reused, the system performance that accounts for both the overall throughput and the number of admitted users can be maximized and all the users quality of service (QoS) can be guaranteed. Such a resource allocation problem is formulated as a mixed integer nonlinear programming (MINLP) problem which is NP-hard. To obtain the optimal solution, the proposed problem is transformed into a many-to-one matching game with externalizes, and a constrained-DA algorithm is proposed. We prove theoretically that with the constrained-DA algorithm, the matching game can reach the stable matching with a low computational complexity. Numerical results demonstrate that our proposed scheme can significantly improve the system performance in terms of overall throughput and the total number of admitted users compared with existing resource allocation schemes.\",\"PeriodicalId\":397107,\"journal\":{\"name\":\"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2017.8292250\",\"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 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2017.8292250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
摘要
设备到设备(D2D)通信是第五代移动通信中一个很有前途的技术组成部分。然而,当D2D通信被纳入异构云无线接入网(H-CRAN)时,D2D用户与现有用户之间的干扰管理是一个挑战。本文研究了如何将不同带宽的子信道分配给多个D2D对和RRH用户。在这种情况下,预先分配给MUE (macrocell user)用户的子信道可以被重用,可以最大限度地提高系统性能,同时兼顾整体吞吐量和允许的用户数,并保证所有用户的QoS (quality of service)。将资源分配问题表述为np困难的混合整数非线性规划问题。为了获得最优解,将该问题转化为具有外部性的多对一匹配博弈,并提出了一种约束数据挖掘算法。从理论上证明了约束数据挖掘算法可以在较低的计算复杂度下达到稳定的匹配。数值结果表明,与现有的资源分配方案相比,我们提出的方案在总体吞吐量和允许用户总数方面都能显著提高系统性能。
Matching game based resource allocation for 5G H-CRAN networks with device-to-device communication
Device-to-Device (D2D) communication is a promising technology component towards the fifth generation mobile communication. However, when D2D communication is incorporated into heterogeneous cloud radio access network (H-CRAN), the interference management between the D2D users and current users is a challenge. In this paper, we study how to assign the sub-channels of different bandwidth to multiple D2D pairs and the RRH users (RUEs). In such a case, the sub-channel that has been pre-allocated to a macrocell user (MUE) can be reused, the system performance that accounts for both the overall throughput and the number of admitted users can be maximized and all the users quality of service (QoS) can be guaranteed. Such a resource allocation problem is formulated as a mixed integer nonlinear programming (MINLP) problem which is NP-hard. To obtain the optimal solution, the proposed problem is transformed into a many-to-one matching game with externalizes, and a constrained-DA algorithm is proposed. We prove theoretically that with the constrained-DA algorithm, the matching game can reach the stable matching with a low computational complexity. Numerical results demonstrate that our proposed scheme can significantly improve the system performance in terms of overall throughput and the total number of admitted users compared with existing resource allocation schemes.