Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint

被引:17
作者
Sun, Ruijin [1 ,2 ]
Yang, Tingting [3 ]
Wang, Ailing [4 ]
Qin, Meng [1 ,5 ]
Fei, Zixuan [6 ]
Wang, Ying [6 ]
机构
[1] Peng Cheng Lab, Shenzhen 518055, Peoples R China
[2] Tsinghua Univ, Dept Elect Engn, Beijing 100084, Peoples R China
[3] Dongguan Univ Technol, Sch Elect Engn & Intelligentizat, Dongguan 523000, Peoples R China
[4] China Mobile Res Inst, Beijing 100053, Peoples R China
[5] Peking Univ, Sch Elect & Comp Engn, Shenzhen 518055, Peoples R China
[6] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
基金
中国博士后科学基金;
关键词
Average file delivery delay; cache leasing cost; D2D networks; mobility-aware caching strategy;
D O I
10.1109/ACCESS.2019.2958261
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Pre-caching popular files at mobile users with the aid of device-to-device (D2D) communications can offload the data traffic to low-cost D2D links and reduce the network transmission cost. This leads to additional cache leasing cost brought by the lease of storage from mobile users. Besides, newly-emerging video-related applications also pose strict requirement on the network delay. Thus, it is of great significance to design caching strategies considering the transmission cost, the cache leasing cost and the delay. As the movement of mobile users can improve the communication opportunities among different users and increase the cache hit ratio, in this paper, mobility-aware caching strategies are designed to minimize the network cost including both the transmission cost and the cache leasing cost with the delay constraint. In specific, by characterizing the user mobility as an inter-contact model, analytical expressions of the average network cost and the average file delivery delay are derived and a cost-oriented mobility-aware caching problem is formulated. To handle this mixed integer nonlinear programming (MINLP) problem, we first relax the binary cache placement indicator as a continuous one and prove that both the average network cost and the average file delivery delay are convex. Hence, an iterative caching algorithm is proposed with the successive convex approximation method. Moreover, to lower the complexity, combinatorial optimization method is adopted. Firstly, to make the caching problem tractable, the average file delivery delay constraint is implicitly added in the cost objective function as a penalty term. Then, the reformulated objective function is proved to have the non-monotone submodular property and thus a modified low-complexity greedy caching strategy is proposed. Simulation results show that, compared with the most popular caching strategy, our proposed mobility-aware caching strategy can reduce the average cost by 46% when the user speed is high.
引用
收藏
页码:177023 / 177034
页数:12
相关论文
共 29 条
[1]  
[Anonymous], 20162021 CISCO
[2]  
[Anonymous], 2016, DGSMEC002 ETSI
[3]  
Bai W., 2018, P ICML
[4]   A sequential parametric convex approximation method with applications to nonconvex truss topology design problems [J].
Beck, Amir ;
Ben-Tal, Aharon ;
Tetruashvili, Luba .
JOURNAL OF GLOBAL OPTIMIZATION, 2010, 47 (01) :29-51
[5]  
Boyd Stephen P., 2014, Convex Optimization
[6]  
Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
[7]   Joint Optimization of Cooperative Beamforming and Relay Assignment in Multi-User Wireless Relay Networks [J].
Che, Enlong ;
Hoang Duong Tuan ;
Nguyen, Ha H. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (10) :5481-5495
[8]   Green and Mobility-Aware Caching in 5G Networks [J].
Chen, Min ;
Hao, Yixue ;
Hu, Long ;
Huang, Kaibin ;
Lau, Vincent K. N. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (12) :8347-8361
[9]   Content Pushing With Request Delay Information [J].
Chen, Wei ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (03) :1146-1161
[10]   SUBMODULAR SET-FUNCTIONS, MATROIDS AND THE GREEDY ALGORITHM - TIGHT WORST-CASE BOUNDS AND SOME GENERALIZATIONS OF THE RADO-EDMONDS THEOREM [J].
CONFORTI, M ;
CORNUEJOLS, G .
DISCRETE APPLIED MATHEMATICS, 1984, 7 (03) :251-274