2022
DOI: 10.1109/access.2022.3206813
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Caching Policy for D2D Assisted Cellular Networks With Different Cache Size Devices

Abstract: This paper studies the problem of optimal cache placement to maximize the offloading probability in a device-to-device (D2D) enabled cellular network with small base stations (SBSs). Different from most existing works, we consider unequal users' equipment (UE) cache memory sizes and all wireless links are modeled as Nakagami-m fading. User preference for each UE and global popularity for SBS, as well as the higher priority of content request from neighboring UEs vs. SBS, are the main factors that make the prob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
1
0
Order By: Relevance
“…Taking advantage of the broadcast characteristics of the base stations, Lee et al 24 propose a practical and feasible wireless D2D cache network replacement architecture to cope with dynamic time‐varying networks. Nadia Abdolkhani et al 25 propose a close to optimal low complexity heuristic cache placement policy To solve the users' equipment (UE) cache memory sizes inconsistency problem. Zhang et al 26 model the dynamic network in a D2D caching cellular network with content popularity distribution and user terminal location time‐varying characteristics as a stochastic game to design a cooperative cache placement strategy.…”
Section: Related Workmentioning
confidence: 99%
“…Taking advantage of the broadcast characteristics of the base stations, Lee et al 24 propose a practical and feasible wireless D2D cache network replacement architecture to cope with dynamic time‐varying networks. Nadia Abdolkhani et al 25 propose a close to optimal low complexity heuristic cache placement policy To solve the users' equipment (UE) cache memory sizes inconsistency problem. Zhang et al 26 model the dynamic network in a D2D caching cellular network with content popularity distribution and user terminal location time‐varying characteristics as a stochastic game to design a cooperative cache placement strategy.…”
Section: Related Workmentioning
confidence: 99%
“…The obtained results demonstrate a significant advance in successful data delivery. In [9], the authors focused on maximizing data offloading via D2D communications. The authors proposed an efficient low complexity heuristic data caching mechanism.…”
Section: Introductionmentioning
confidence: 99%