{"title":"Interference-aware distributed device-to-device caching","authors":"Ahmet Cihat Kazez, Tolga Girici","doi":"10.1109/BlackSeaCom.2017.8277676","DOIUrl":null,"url":null,"abstract":"In this paper, cache placement problem in cellular networks with device to device communications (D2D) is addressed. D2D transmission allows cellular bandwidth reuse which necessitates interference management. We propose a distributed algorithm, where the base station rewards the user terminals for caching content and helping other nearby terminals. Each user terminal distributively decides which contents to cache in a way that maximizes its reward and minimizes the interference to the base station. The base station decides the optimal reward in a way that minimizes its cost. The proposed method is compared with baseline caching schemes. Numerical results reveal that the proposed method both achieves less base station cost and interference than the benchmarks.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2017.8277676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, cache placement problem in cellular networks with device to device communications (D2D) is addressed. D2D transmission allows cellular bandwidth reuse which necessitates interference management. We propose a distributed algorithm, where the base station rewards the user terminals for caching content and helping other nearby terminals. Each user terminal distributively decides which contents to cache in a way that maximizes its reward and minimizes the interference to the base station. The base station decides the optimal reward in a way that minimizes its cost. The proposed method is compared with baseline caching schemes. Numerical results reveal that the proposed method both achieves less base station cost and interference than the benchmarks.