基于关联规则的超密集网络冲突图构建方法

Jiaqi Cao, Tao Peng, Weiguo Dong, Xin Liu, Wenbo Wang
{"title":"基于关联规则的超密集网络冲突图构建方法","authors":"Jiaqi Cao, Tao Peng, Weiguo Dong, Xin Liu, Wenbo Wang","doi":"10.1109/GLOCOMW.2018.8644375","DOIUrl":null,"url":null,"abstract":"Ultra-dense networks (UDNs) have been widely recognized as a promising technology in meeting the higher throughput requirement of the fifth generation (5G) network. However, the dense deployment of femtocells brings an unprecedented challenge of introducing severe co-channel interference (CCI), which puts a great limitation on the network performance. Therefore, the interference mitigation problem in UDNs is of great importance. The conflict-graph is the representation of underlying interference constraints of the network and the basis of interference mitigation. Most prior studies construct conflict-graphs based on accurate geographical distance information although it is usually unavailable by the network operators in actual. A more practical association rules based down-link conflict-graph construction approach, which utilizes negative acknowledgement (NACK) data, new data indicator (NDI) data and resource block (RB) allocation data, is proposed in this paper. The relative interference intensities of different interfering sources are determined by the calculated confidence degrees and taken as the edge weights of the constructed conflict-graph. Furthermore, the proposed conflict-graph construction approach is extremely accurate especially for severe interference, which has been verified by simulation results.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"351 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Association Rules Based Conflict-Graph Construction Approach for Ultra-Dense Networks\",\"authors\":\"Jiaqi Cao, Tao Peng, Weiguo Dong, Xin Liu, Wenbo Wang\",\"doi\":\"10.1109/GLOCOMW.2018.8644375\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ultra-dense networks (UDNs) have been widely recognized as a promising technology in meeting the higher throughput requirement of the fifth generation (5G) network. However, the dense deployment of femtocells brings an unprecedented challenge of introducing severe co-channel interference (CCI), which puts a great limitation on the network performance. Therefore, the interference mitigation problem in UDNs is of great importance. The conflict-graph is the representation of underlying interference constraints of the network and the basis of interference mitigation. Most prior studies construct conflict-graphs based on accurate geographical distance information although it is usually unavailable by the network operators in actual. A more practical association rules based down-link conflict-graph construction approach, which utilizes negative acknowledgement (NACK) data, new data indicator (NDI) data and resource block (RB) allocation data, is proposed in this paper. The relative interference intensities of different interfering sources are determined by the calculated confidence degrees and taken as the edge weights of the constructed conflict-graph. Furthermore, the proposed conflict-graph construction approach is extremely accurate especially for severe interference, which has been verified by simulation results.\",\"PeriodicalId\":348924,\"journal\":{\"name\":\"2018 IEEE Globecom Workshops (GC Wkshps)\",\"volume\":\"351 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Globecom Workshops (GC Wkshps)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2018.8644375\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2018.8644375","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

超密集网络(udn)已被广泛认为是满足第五代(5G)网络更高吞吐量要求的一种有前途的技术。然而,飞基站的密集部署带来了前所未有的挑战,即引入严重的同信道干扰(CCI),这对网络性能造成了很大的限制。因此,udn中的干扰抑制问题显得尤为重要。冲突图是网络潜在干扰约束的表征,是干扰缓解的基础。以往的研究大多是基于准确的地理距离信息来构建冲突图,而网络运营商在实际中往往无法获得准确的地理距离信息。本文提出了一种更实用的基于关联规则的下行链路冲突图构建方法,该方法利用了负确认(NACK)数据、新数据指示(NDI)数据和资源块(RB)分配数据。不同干扰源的相对干扰强度由计算的置信度确定,并作为构建的冲突图的边权。此外,本文提出的冲突图构建方法具有极高的准确性,特别是在严重干扰情况下,仿真结果验证了这一点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Association Rules Based Conflict-Graph Construction Approach for Ultra-Dense Networks
Ultra-dense networks (UDNs) have been widely recognized as a promising technology in meeting the higher throughput requirement of the fifth generation (5G) network. However, the dense deployment of femtocells brings an unprecedented challenge of introducing severe co-channel interference (CCI), which puts a great limitation on the network performance. Therefore, the interference mitigation problem in UDNs is of great importance. The conflict-graph is the representation of underlying interference constraints of the network and the basis of interference mitigation. Most prior studies construct conflict-graphs based on accurate geographical distance information although it is usually unavailable by the network operators in actual. A more practical association rules based down-link conflict-graph construction approach, which utilizes negative acknowledgement (NACK) data, new data indicator (NDI) data and resource block (RB) allocation data, is proposed in this paper. The relative interference intensities of different interfering sources are determined by the calculated confidence degrees and taken as the edge weights of the constructed conflict-graph. Furthermore, the proposed conflict-graph construction approach is extremely accurate especially for severe interference, which has been verified by simulation results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信