全双工蜂窝网络中D2D通信的两步资源分配算法

Luming Ren, Ming Zhao, Xinyu Gu, Lin Zhang
{"title":"全双工蜂窝网络中D2D通信的两步资源分配算法","authors":"Luming Ren, Ming Zhao, Xinyu Gu, Lin Zhang","doi":"10.1109/PIMRC.2016.7794790","DOIUrl":null,"url":null,"abstract":"In this paper, a scenario was considered that cellular user equipments (UEs) and device to device (D2D) communication pairs exist in a full duplex cell. Limited frequency resources are shared by a large number of UEs, and complex interference is introduced due to resource sharing between uplink, downlink UEs and D2D links. To manage the resource and achieve the maximum total system capacity, a non-deterministic polynomial (NP) hard optimization problem is formulated. To efficiently solve the problem, a Graph based Two-step Resource Allocation (GTRA) algorithm is proposed. In the first step, a full duplex base station (BS) allocates resources to half duplex uplink and downlink UEs by a graph coloring based algorithm. The second step is a bipartite graph based Multi-Stage Matching (MSM) algorithm to allocate resources to D2D pairs. The GTRA algorithm can effectively allocate the spectrum resources with low complexity while guaranteeing the Quality of Service (QoS) of cellular UEs as well. Simulation results show that our proposed algorithm performs better than the reference algorithms.","PeriodicalId":137845,"journal":{"name":"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A two-step resource allocation algorithm for D2D communication in full duplex cellular network\",\"authors\":\"Luming Ren, Ming Zhao, Xinyu Gu, Lin Zhang\",\"doi\":\"10.1109/PIMRC.2016.7794790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a scenario was considered that cellular user equipments (UEs) and device to device (D2D) communication pairs exist in a full duplex cell. Limited frequency resources are shared by a large number of UEs, and complex interference is introduced due to resource sharing between uplink, downlink UEs and D2D links. To manage the resource and achieve the maximum total system capacity, a non-deterministic polynomial (NP) hard optimization problem is formulated. To efficiently solve the problem, a Graph based Two-step Resource Allocation (GTRA) algorithm is proposed. In the first step, a full duplex base station (BS) allocates resources to half duplex uplink and downlink UEs by a graph coloring based algorithm. The second step is a bipartite graph based Multi-Stage Matching (MSM) algorithm to allocate resources to D2D pairs. The GTRA algorithm can effectively allocate the spectrum resources with low complexity while guaranteeing the Quality of Service (QoS) of cellular UEs as well. Simulation results show that our proposed algorithm performs better than the reference algorithms.\",\"PeriodicalId\":137845,\"journal\":{\"name\":\"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2016.7794790\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2016.7794790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文考虑了在全双工小区中存在蜂窝用户设备(ue)和设备对设备(D2D)通信对的情况。有限的频率资源被大量终端共享,上行、下行终端和D2D链路之间的资源共享带来了复杂的干扰。为了实现资源管理和系统总容量的最大化,提出了一个非确定性多项式(NP)硬优化问题。为了有效地解决这一问题,提出了一种基于图的两步资源分配(GTRA)算法。第一步,全双工基站通过图形着色算法将资源分配给半双工上行终端和下行终端。第二步是基于二部图的多阶段匹配算法,将资源分配给D2D对。GTRA算法在保证蜂窝终端服务质量(QoS)的同时,可以有效地分配低复杂度的频谱资源。仿真结果表明,该算法的性能优于参考算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A two-step resource allocation algorithm for D2D communication in full duplex cellular network
In this paper, a scenario was considered that cellular user equipments (UEs) and device to device (D2D) communication pairs exist in a full duplex cell. Limited frequency resources are shared by a large number of UEs, and complex interference is introduced due to resource sharing between uplink, downlink UEs and D2D links. To manage the resource and achieve the maximum total system capacity, a non-deterministic polynomial (NP) hard optimization problem is formulated. To efficiently solve the problem, a Graph based Two-step Resource Allocation (GTRA) algorithm is proposed. In the first step, a full duplex base station (BS) allocates resources to half duplex uplink and downlink UEs by a graph coloring based algorithm. The second step is a bipartite graph based Multi-Stage Matching (MSM) algorithm to allocate resources to D2D pairs. The GTRA algorithm can effectively allocate the spectrum resources with low complexity while guaranteeing the Quality of Service (QoS) of cellular UEs as well. Simulation results show that our proposed algorithm performs better than the reference algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信