Content caching scheme for D2D communication underlaying cellular networks with capacoty restriction

Jinchao Lu, Heli Zhang, Hong Ji, Victor C. M. Leung
{"title":"Content caching scheme for D2D communication underlaying cellular networks with capacoty restriction","authors":"Jinchao Lu, Heli Zhang, Hong Ji, Victor C. M. Leung","doi":"10.1109/ICNIDC.2016.7974617","DOIUrl":null,"url":null,"abstract":"With the rapid growth of Internet services and the popularity of social media, mobile network operators are facing a serious challenge to delivery multimedia content to multiple users. In this paper, we consider device-to-device (D2D) communication supported mobile content delivery networks (mCDNs) which enables controllable and direct delivery of multimedia contents. With this network, we regard mobile device as caching server device (CSD) which can store popular multimedia contents and provide these for other devices in proximity to it via D2D link. Besides, we propose an optimization problem to determine the caching probability for the individual content in each CSD. In this problem, we intend to maximize system utility with the consideration of cache capacity restriction in each CSD. Further, we present a low-complexity search algorithm, namely discrete binary searching algorithm (DBSA), for solving the proposed optimization problem. Simulation results show that proposed optimal solution can obtain the best performance on system utility.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"88 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNIDC.2016.7974617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With the rapid growth of Internet services and the popularity of social media, mobile network operators are facing a serious challenge to delivery multimedia content to multiple users. In this paper, we consider device-to-device (D2D) communication supported mobile content delivery networks (mCDNs) which enables controllable and direct delivery of multimedia contents. With this network, we regard mobile device as caching server device (CSD) which can store popular multimedia contents and provide these for other devices in proximity to it via D2D link. Besides, we propose an optimization problem to determine the caching probability for the individual content in each CSD. In this problem, we intend to maximize system utility with the consideration of cache capacity restriction in each CSD. Further, we present a low-complexity search algorithm, namely discrete binary searching algorithm (DBSA), for solving the proposed optimization problem. Simulation results show that proposed optimal solution can obtain the best performance on system utility.
基于容量限制蜂窝网络的D2D通信内容缓存方案
随着互联网业务的快速增长和社交媒体的普及,移动网络运营商面临着向多用户提供多媒体内容的严峻挑战。在本文中,我们考虑了设备到设备(D2D)通信支持的移动内容交付网络(mcdn),它可以实现多媒体内容的可控和直接交付。在这个网络中,我们将移动设备视为缓存服务器设备(CSD),它可以存储流行的多媒体内容,并通过D2D链路将这些内容提供给邻近的其他设备。此外,我们提出了一个优化问题来确定每个CSD中单个内容的缓存概率。在这个问题中,我们打算在考虑每个CSD中的缓存容量限制的情况下最大化系统效用。此外,我们提出了一种低复杂度的搜索算法,即离散二进制搜索算法(DBSA)来解决所提出的优化问题。仿真结果表明,所提出的最优解能获得最佳的系统效用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信