干扰感知分布式设备到设备缓存

Ahmet Cihat Kazez, Tolga Girici
{"title":"干扰感知分布式设备到设备缓存","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":"{\"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}","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

摘要

本文讨论了蜂窝网络中设备对设备通信(D2D)中的缓存放置问题。D2D传输允许蜂窝带宽重用,这就需要进行干扰管理。我们提出了一种分布式算法,其中基站奖励用户终端缓存内容并帮助附近的其他终端。每个用户终端以最大化其回报和最小化对基站的干扰的方式分布式地决定缓存哪些内容。基站以最小化成本的方式决定最佳奖励。将该方法与基准缓存方案进行了比较。数值计算结果表明,该方法比基准方法具有更低的基站成本和干扰。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interference-aware distributed device-to-device caching
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信