Mobility-aware caching in energy-harvesting-powered small-cell networks

被引:0
作者
Wenyan Yue
Su Zhao
Qi Zhu
机构
[1] Nanjing University of Posts and Telecommunications,
来源
Wireless Networks | 2022年 / 28卷
关键词
Caching; D2D communication; Energy harvesting; User mobility;
D O I
暂无
中图分类号
学科分类号
摘要
The rapid increase of mobile devices has made user mobility one of the important factors affecting the cache. With the development of energy harvesting technology, the cache must consider not only the quality of service but also the energy consumption, so the classic popular cache-based strategy is not the optimal strategy. For the above problems, this article proposes an optimization algorithm for user and small base station (SBS) caching strategies based on energy harvesting and mobility in cellular networks and device-to-device (D2D) scenarios. Considering the mobility of users and their social relationship, the cost function of users and SBS are respectively defined in combination with the cost of file transmission. The user's cost function includes its own cost and the cost of its "friends", while the SBS cost function is the cost of the entire system, and then the two caching problems are constructed as integer programming problems with cost minimization as the optimization goal. It is proved that the optimization objective function has the monotone submodular property and combined with the cache space and energy constraint, a greedy algorithm is proposed to optimize the caching strategy of users and SBS in turn. The simulation results show that the algorithm proposed in this paper can reduce the cost of transmission and make better use of cache and energy resources.
引用
收藏
页码:1097 / 1111
页数:14
相关论文
共 55 条
[11]  
Yang T(2017)Traffic off-loading with energy-harvesting small cells and coded content caching IEEE Transactions on Communications 65 906-917
[12]  
Wang A(1998)Jaccard similarity leads to the marczewski-steinhaus topology for information retrieval Information Processing and Management 34 87-94
[13]  
Qin M(2016)Energy effificiency of downlink networks with caching at base stations IEEE Journal on Selected Areas in Communications 34 907-922
[14]  
Fei Z(1984)Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the rado-edmonds theorem Discrete Appl. Math. 7 251-274
[15]  
Wang Y(2014)Video-aware scheduling and caching in the radio access network IEEE/ACM Transactions on Networking 22 1444-1462
[16]  
Yang Y(undefined)undefined undefined undefined undefined-undefined
[17]  
Wu Y(undefined)undefined undefined undefined undefined-undefined
[18]  
Chen N(undefined)undefined undefined undefined undefined-undefined
[19]  
Wang K(undefined)undefined undefined undefined undefined-undefined
[20]  
Chen S(undefined)undefined undefined undefined undefined-undefined