基于匹配博弈的设备对设备通信5G H-CRAN网络资源分配

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困难的混合整数非线性规划问题。为了获得最优解,将该问题转化为具有外部性的多对一匹配博弈,并提出了一种约束数据挖掘算法。从理论上证明了约束数据挖掘算法可以在较低的计算复杂度下达到稳定的匹配。数值结果表明,与现有的资源分配方案相比,我们提出的方案在总体吞吐量和允许用户总数方面都能显著提高系统性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RSSI-based self-localization with perturbed anchor positions Bit precision study of a non-orthogonal iterative detector with FPGA modelling verification Analytical approach to base station sleep mode power consumption and sleep depth Experimental over-the-air testing for coexistence of 4G and a spectrally efficient non-orthogonal signal Secrecy analysis of random wireless networks with multiple eavesdroppers
×
引用
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