一种改进的图着色算法在聚类超密集RAN中的干涉协调

Chang Ge, Sijie Xia, Qiang Chen, F. Adachi
{"title":"一种改进的图着色算法在聚类超密集RAN中的干涉协调","authors":"Chang Ge, Sijie Xia, Qiang Chen, F. Adachi","doi":"10.23919/ISAP47053.2021.9391334","DOIUrl":null,"url":null,"abstract":"In our previous study, we proposed a Restricted Color Number (RCN) algorithm based on graph coloring for interference coordination in cluster-wise distributed MU-MIMO in ultra-dense RAN. In this algorithm, we applied Delaunay Triangulation to help decide the interference relationship, which is different from the common-used threshold setting method. In this paper, we will discuss about the advantages of the Delaunay Triangulation method over the threshold method in graph coloring algorithm for interference coordination.","PeriodicalId":165901,"journal":{"name":"2020 International Symposium on Antennas and Propagation (ISAP)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improved Method in Graph Coloring Algorithm for Interference Coordination in Cluster-wise Ultra-dense RAN\",\"authors\":\"Chang Ge, Sijie Xia, Qiang Chen, F. Adachi\",\"doi\":\"10.23919/ISAP47053.2021.9391334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In our previous study, we proposed a Restricted Color Number (RCN) algorithm based on graph coloring for interference coordination in cluster-wise distributed MU-MIMO in ultra-dense RAN. In this algorithm, we applied Delaunay Triangulation to help decide the interference relationship, which is different from the common-used threshold setting method. In this paper, we will discuss about the advantages of the Delaunay Triangulation method over the threshold method in graph coloring algorithm for interference coordination.\",\"PeriodicalId\":165901,\"journal\":{\"name\":\"2020 International Symposium on Antennas and Propagation (ISAP)\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Symposium on Antennas and Propagation (ISAP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ISAP47053.2021.9391334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Symposium on Antennas and Propagation (ISAP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ISAP47053.2021.9391334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在我们之前的研究中,我们提出了一种基于图着色的限制色数(RCN)算法,用于超密集无线局域网中聚类分布式MU-MIMO的干扰协调。在该算法中,我们采用Delaunay三角剖分法来帮助确定干涉关系,这与常用的阈值设置方法不同。在本文中,我们将讨论Delaunay三角剖分法相对于阈值法在干涉协调图着色算法中的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Method in Graph Coloring Algorithm for Interference Coordination in Cluster-wise Ultra-dense RAN
In our previous study, we proposed a Restricted Color Number (RCN) algorithm based on graph coloring for interference coordination in cluster-wise distributed MU-MIMO in ultra-dense RAN. In this algorithm, we applied Delaunay Triangulation to help decide the interference relationship, which is different from the common-used threshold setting method. In this paper, we will discuss about the advantages of the Delaunay Triangulation method over the threshold method in graph coloring algorithm for interference coordination.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信