{"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}
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.