基于聚类和拓扑感知的D2D网络干扰管理

Salam Doumiati, H. Artail, M. Assaad
{"title":"基于聚类和拓扑感知的D2D网络干扰管理","authors":"Salam Doumiati, H. Artail, M. Assaad","doi":"10.1109/CAMAD.2018.8514978","DOIUrl":null,"url":null,"abstract":"In this paper, we address the application of topological interference management (TIM) on a clustered network of Device-to-Device (D2D) devices which are not aware of the surrounding channel state information (CSI), but only of the connectivity pattern. Our main objective is to develop a proper clustering algorithm that leads to increasing the total system degrees-of-freedom (DoF). For this, we model the interference network as a connected graph, transforming the clustering problem into a graph partitioning problem. To solve it, we base our method on the semidefinite problem (SDP) relaxation of the maximum-k-cut algorithm, while accounting for the maximum number of devices allowed inside the multiple-input multiple-output (MIMO) cluster environment. Simulation results show that proper clustering combined with TIM design renders TIM more scalable, and able to increase the system DoF.","PeriodicalId":173858,"journal":{"name":"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Managing Interference in D2D Networks via Clustering and Topological Awareness\",\"authors\":\"Salam Doumiati, H. Artail, M. Assaad\",\"doi\":\"10.1109/CAMAD.2018.8514978\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the application of topological interference management (TIM) on a clustered network of Device-to-Device (D2D) devices which are not aware of the surrounding channel state information (CSI), but only of the connectivity pattern. Our main objective is to develop a proper clustering algorithm that leads to increasing the total system degrees-of-freedom (DoF). For this, we model the interference network as a connected graph, transforming the clustering problem into a graph partitioning problem. To solve it, we base our method on the semidefinite problem (SDP) relaxation of the maximum-k-cut algorithm, while accounting for the maximum number of devices allowed inside the multiple-input multiple-output (MIMO) cluster environment. Simulation results show that proper clustering combined with TIM design renders TIM more scalable, and able to increase the system DoF.\",\"PeriodicalId\":173858,\"journal\":{\"name\":\"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMAD.2018.8514978\",\"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 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMAD.2018.8514978","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在本文中,我们讨论了拓扑干扰管理(TIM)在设备到设备(D2D)设备集群网络中的应用,这些设备不知道周围的信道状态信息(CSI),而只知道连接模式。我们的主要目标是开发一种适当的聚类算法,从而提高系统的总自由度。为此,我们将干扰网络建模为连通图,将聚类问题转化为图划分问题。为了解决这个问题,我们的方法基于最大k-cut算法的半确定问题(SDP)松弛,同时考虑了多输入多输出(MIMO)集群环境中允许的最大设备数量。仿真结果表明,适当的聚类与TIM设计相结合,使TIM更具可扩展性,能够提高系统的自由度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Managing Interference in D2D Networks via Clustering and Topological Awareness
In this paper, we address the application of topological interference management (TIM) on a clustered network of Device-to-Device (D2D) devices which are not aware of the surrounding channel state information (CSI), but only of the connectivity pattern. Our main objective is to develop a proper clustering algorithm that leads to increasing the total system degrees-of-freedom (DoF). For this, we model the interference network as a connected graph, transforming the clustering problem into a graph partitioning problem. To solve it, we base our method on the semidefinite problem (SDP) relaxation of the maximum-k-cut algorithm, while accounting for the maximum number of devices allowed inside the multiple-input multiple-output (MIMO) cluster environment. Simulation results show that proper clustering combined with TIM design renders TIM more scalable, and able to increase the system DoF.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信