Paper Info
Title
Optimizing Retention-Aware Caching in Vehicular Networks
Abstract
Caching is an effective way to address the challenges due to explosive data traffic growth and massive device connectivity in fifth-generation (5G) networks. Currently, few works on caching pay attention to the impact of the time duration for which content is stored, called retention time, on caching optimization. The research on retention time is motivated by two practical issues, i.e., flash memory damage and storage rental cost in cloud networks, together giving rise to the storage cost. How to optimize caching contents taking the storage cost into consideration is a challenging problem, especially for the scenarios with cache-enabled mobile nodes. In this paper, a retention-aware caching problem (RACP) in vehicular networks is formulated, considering the impact of the storage cost. The problem’s complexity analysis is provided. For symmetric cases, an optimal dynamic programming (DP) algorithm with polynomial time complexity is derived. For general cases, a low complexity and effective retention aware multi-helper caching algorithm (RAMA) is proposed. Numerical results are used to verify the effectiveness of the algorithms.
Year
DOI
Venue
2019
10.1109/TCOMM.2019.2921368
IEEE Transactions on Communications
Keywords
Field
DocType
Heuristic algorithms,Optimization,Complexity theory,Analytical models,Fans,5G mobile communication,Mobile nodes
Dynamic programming,Polynomial time complexity,Flash memory,Data traffic,Computer science,Explosive material,Electronic engineering,Vehicular ad hoc network,Cloud computing,Distributed computing
Journal
Volume
Issue
ISSN
67
9
0090-6778
Citations 
PageRank 
References 
2
0.37
0
Authors
3
Name
Order
Citations
PageRank
Tao Deng1133.97
Pingzhi Fan23233265.09
Di Yuan316810.92