多缓存容量场景下的D2D内容缓存布设优化方案

doi:10.11772/j.issn.1001-9081.2017112710

计算机应用 ›› 2018, Vol. 38 ›› Issue (5): 1453-1457.DOI: 10.11772/j.issn.1001-9081.2017112710

多缓存容量场景下的D2D内容缓存布设优化方案

龙彦汕, 吴丹, 蔡跃明, 王萌, 郭继斌

中国人民解放军陆军工程大学通信工程学院, 南京 210007

收稿日期:2017-11-16 修回日期:2017-12-27 出版日期:2018-05-10 发布日期:2018-05-24
通讯作者: 吴丹
作者简介:龙彦汕(1989-),女,山东荣成人,博士研究生,主要研究方向:D2D缓存网络、随机几何、资源管理;吴丹(1983-),女,四川成都人,副教授,博士,主要研究方向:D2D通信、博弈论、资源管理;蔡跃明(1961-),男,福建永泰人,教授,博士,主要研究方向:协同无线网络、无线物理层安全、信号处理;王萌(1983-),男,山东临沂人,讲师,硕士,主要研究方向:D2D通信;郭继斌(1973-),男,河北唐山人,讲师,硕士,主要研究方向:协同通信、资源分配。
基金资助:
国家自然科学基金资助项目（61671474）；江苏省优秀青年基金资助项目（BK20170089）。

Cache placement optimization scheme in D2D networks with heterogeneous cache capacity

LONG Yanshan, WU Dan, CAI Yueming, WANG Meng, GUO Jibin

College of Communications Engineering, Army Engineering University of PLA, Nanjing Jiangsu 210007, China

Received:2017-11-16 Revised:2017-12-27 Online:2018-05-10 Published:2018-05-24
Contact: 吴丹
Supported by:
This work is partially supported by the National Natural Science Foundation of China (61671474), the Jiangsu Provincial Science Fund for Excellent Young Scholars (BK20170089).

摘要/Abstract

摘要： 在终端直传（D2D）缓存网络中，用户有限且各异的缓存能力是制约缓存效率的一个关键参数，然而现有文献大多考虑不同用户具有相同的缓存能力，针对这一不足有必要进行用户具有不同缓存容量下的D2D内容缓存布设方案优化。首先，鉴于用户终端的移动性和随机分布特性，利用随机几何理论将网络中不同缓存容量的用户节点建模为相互独立的齐次泊松点过程；其次，考虑本地卸载和邻近D2D链路卸载两种内容卸载方式，推导得到网络缓存命中率；最后，将最大化缓存命中率作为优化目标函数，提出了基于坐标梯度的联合缓存布设（JCP）算法，从而得到多用户多缓存容量场景下的内容缓存布设方案。仿真结果表明，与现有的缓存布设方案相比，由JCP得到的缓存布设方案可以有效提高缓存命中率。

关键词: 终端直传缓存网络, 多缓存容量, 随机几何, 缓存命中率, 缓存布设优化

Abstract: Limited and heterogeneous cache capacity is one of the key parameters which affect the cache efficiency in Device-to-Device (D2D) caching networks. However, most of existing literatures assume all users have homogeneous cache capability. In this regard, cache placement optimization is necessary for practical scenarios with heterogeneous cache capacities. Considering the mobility and random distribution of terminal users, users with different cache capacities were modeled as mutually independent homogeneous Poisson point processes with stochastic geometry. Moreover, the average cache hit ratio was derived with considering both self-offloading and D2D-offloading cases. Finally, a Joint Cache Placement (JCP) algorithm based on coordinate gradient optimization was proposed to obtain the optimal cache placement scheme which can maximize the cache hit ratio. Simulation results show that the proposed JCP can achieve larger cache hit ratio than the existing cache placement schemes.

Key words: Device-to-Device (D2D) caching network, heterogeneous cache capacity, stochastic geometry, cache hit ratio, cache placement optimization

中图分类号:

TN929.5

龙彦汕, 吴丹, 蔡跃明, 王萌, 郭继斌. 多缓存容量场景下的D2D内容缓存布设优化方案[J]. 计算机应用, 2018, 38(5): 1453-1457.

LONG Yanshan, WU Dan, CAI Yueming, WANG Meng, GUO Jibin. Cache placement optimization scheme in D2D networks with heterogeneous cache capacity[J]. Journal of Computer Applications, 2018, 38(5): 1453-1457.

参考文献

[1] 钱志鸿,王雪.面向5G通信网的D2D技术综述[J].通信学报,2016, 37(7):1-14.(QIAN Z H, WANG X. Reviews of device-to-device technology for 5G communication networks[J]. Journal on Communications, 2016, 37(7):1-14.)
[2] 黄小柠. 面向无线缓存的D2D技术研究[D]. 成都:电子科技大学,2016.(HUANG X N. Research on device-to-device technology for wireless caching[D]. Chengdu:University of Electronic Science and Technology of China, 2016.)
[3] 蓝瑞宁. 终端直通蜂窝系统中的边缘缓存技术[D]. 杭州:浙江大学,2016. (LAN R N. Edge caching for cellular systems with device-to-device communications[D]. Hangzhou:Zhejiang University, 2016.)
[4] KANG H J, PARK K Y, KUMIN C, et al. Mobile caching policies for Device-to-Device (D2D) content delivery networking[C]//INCOFOM 2014:Proceedings of the 2014 IEEE Conference on Computer Communications Workshops. Piscataway, NJ:IEEE, 2014:299-304.
[5] MALAK D, AL-SHALASH M. Device-to-Device content distribution:optimal caching strategies and performance bounds[C]//ICCW 2015:Proceedings of the 2015 IEEE International Conference on Communications Workshop. Piscataway, NJ:IEEE, 2015:664-669.
[6] CHEN Z, PAPPAS N, KOUNTOURIS M. Probabilistic caching in wireless D2D networks:cache hit optimal versus throughput optimal[J]. IEEE Communications Letters, 2017, 21(3):584-587.
[7] GUO Y, DUAN L, ZHANG R. Cooperative local caching under heterogeneous file preferences[J]. IEEE Transactions on Communications, 2017, 65(1):444-457.
[8] PAN Y, PAN C, ZHU H, et al. On consideration of content preference and sharing willingness in D2D assisted offloading[J]. IEEE Journal on Selected Areas in Communications, 2017, 35(4):978-993.
[9] LIAO J, WONG K K, KHANDAKER M R A, et al. Optimizing cache placement for heterogeneous small cell networks[J]. IEEE Communications Letters, 2017, 21(1):120-123.
[10] BRESLAU L, CAO P, FAN L, et al. Web caching and Zipf-like distributions:evidence and implications[C]//INFOCOM 1999:Proceedings of the 1999 IEEE Conference on Computer Communications. Piscataway, NJ:IEEE, 1999:126-134.
[11] CHA M, KWAK H, PODRIGUEZ, et al. Analyzing the video popularity characteristics of large-scale user generated content systems[J]. IEEE/ACM Transactions on Networking, 2009, 17(5):1357-1370.
[12] CHEN Y, DING M, LI J, et al. Probabilistic small-cell caching:performance analysis and optimization[J]. IEEE Transactions on Vehicular Technology, 2017, 66(5):4341-4354.
[13] STOYAN D, KENDALL W, MECKE J. Stochastic Geometry and Its Applications[M]. 3rd ed. New York:Wiley, 1999:35-63.
[14] CORLESS R, GONNET G, HARE D, et al. On the Lambert W function[J]. Advances in Computational Mathematics, 1996, 5(1):329-359.
[15] SONG X. GENG Y, MENG X, et al. Cache-enabled device-to-device networks with contention-based multimedia delivery[J]. IEEE Access, 2017, 5:3228-3239.
[16] LONG Y, WU D, CAI Y, et al. Joint cache policy and transmit power for cache-enabled D2D networks[J]. IET Communications, 2017, 11(16):2498-2506.

多缓存容量场景下的D2D内容缓存布设优化方案

Cache placement optimization scheme in D2D networks with heterogeneous cache capacity

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

[1]	龙彦汕, 富勤学, 郭继斌, 张孟其, 蔡跃明. D2D缓存网络中基于随机几何的成功卸载概率分析[J]. 计算机应用, 2019, 39(8): 2346-2353.
[2]	李智超;何丕廉;雷鸣. 移动计算中一种基于预定义区域的语义圆缓存模型[J]. 计算机应用, 2005, 25(12): 2865-2867.