版权说明 帮助中心
首页 > 成果 > 详情

Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches

SCI-ECPCI-SEI
WOS被引频次:4
认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Deng, Tao*;Ahani, Ghafour;Fan, Pingzhi;Yuan, Di
通讯作者:
Deng, Tao
作者机构:
[Fan, Pingzhi; Deng, Tao] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Sichuan, Peoples R China.
[Yuan, Di; Ahani, Ghafour] Uppsala Univ, Dept Informat Technol, S-75105 Uppsala, Sweden.
通讯机构:
[Deng, Tao] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Sichuan, Peoples R China.
语种:
英文
关键词:
Backhaul networks;caching;D2D;integer linear programming;user mobility
期刊:
IEEE Transactions on Wireless Communications
ISSN:
1536-1276
年:
2018
卷:
17
期:
5
页码:
3082-3094
会议名称:
IEEE Global Telecommunications Conference (GLOBECOM)
会议时间:
DEC 04-08, 2017
会议地点:
YourSingapore, Singapore, SINGAPORE
会议主办单位:
[Deng, Tao;Fan, Pingzhi] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Sichuan, Peoples R China.^[Ahani, Ghafour;Yuan, Di] Uppsala Univ, Dept Informat Technol, S-75105 Uppsala, Sweden.
会议赞助商:
IEEE, Intel, Natl Instruments, Huawei, Keysight Technologies Inc, Nanyang Technol Univ, Sch Elect & Elect Engn, Rohde & Schwarz
出版地:
445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
出版者:
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
文献类别:
WOS:Article;Proceedings Paper;EI:Journal article (JA)
所属学科:
ESI学科类别:计算机科学;WOS学科类别:Engineering, Electrical & Electronic;Telecommunications
入藏号:
WOS:000432014300019;EI:20181004860758
基金类别:
National Science Foundation of China [61731017]; 111 Project [111-2-14]; China Scholarship Council; Swedish Research Council [2013-05649]
机构署名:
本校为第一且通讯机构
院系归属:
信息科学与技术学院
摘要:
Caching popular files at the user equipments (UEs) provides an effective way to alleviate the burden of the backhaul networks. Generally, popularity-based caching is not a system-wide optimal strategy, especially for user mobility scenarios. Motivated by this observation, we consider optimal caching with the presence of mobility. A cost-optimal caching problem (COCP) for device-to-device (D2D) networks is modeled, in which the impact of user mobility, cache size, and total number of encoded segments are all taken into account. The hardness of the problem is proved via a reduction from the satisfiability problem. Next, a lower-bounding function of the objective function is derived. By the function, an approximation of COCP (ACOCP) achieving linearization is obtained, which features two advantages. First, the ACOCP approach can use an off-the-shelf integer linear programming algorithm to obtain the global optimal solution, and it can effectively deliver solutions for small-scale and medium-scale system scenarios. Second, and more importantly, based on the ACOCP approach, one can derive a lower bound of global optimum of COCP, thus enabling performance benchmarking of any sub-optimal algorithm. To tackle large scenarios with low complexity, we first prove that the optimal caching placement of one user, giving other users' caching placements, can be derived in polynomial time. Then, based on this proof, a mobility aware multi-user algorithm is developed. Simulation results verify the effectivenesses of the two approaches by comparing them to the lower bound of global optimum and conventional caching algorithms.<br/> &copy;2018 IEEE.
参考文献:
Ahlehagh H, 2014, IEEE ACM T NETWORK, V22, P1444, DOI 10.1109/TNET.2013.2294111
Andrews JG, 2014, IEEE J SEL AREA COMM, V32, P1065, DOI 10.1109/JSAC.2014.2328098
Blaszczyszyn B, 2015, IEEE ICC, P3358, DOI 10.1109/ICC.2015.7248843
Chaintreau A, 2007, IEEE T MOBILE COMPUT, V6, P606, DOI 10.1109/TMC.2007.1060
Chen Z, 2017, IEEE COMMUN LETT, V21, P584, DOI 10.1109/LCOMM.2016.2628032

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com