2020
DOI: 10.1109/twc.2020.3022895
|View full text |Cite
|
Sign up to set email alerts
|

Age of Information Driven Cache Content Update Scheduling for Dynamic Contents in Heterogeneous Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(21 citation statements)
references
References 31 publications
0
21
0
Order By: Relevance
“…The authors in [60], [61] focus on cache update scheduling for age of information (AoI) minimization, in a two-tier HetNet where small cells act as content servers for dynamic content delivery, as shown in Fig. 5.…”
Section: ) Age Of Information Reductionmentioning
confidence: 99%
“…The authors in [60], [61] focus on cache update scheduling for age of information (AoI) minimization, in a two-tier HetNet where small cells act as content servers for dynamic content delivery, as shown in Fig. 5.…”
Section: ) Age Of Information Reductionmentioning
confidence: 99%
“…Content caching involves static content (such as popular videos) and dynamic content (such as environmental parameters of temperature, humidity, and illuminance). The former is typically not changed in a long period for delay-tolerant applications, and in contrast, the latter is updated in a relatively short period for mission-critical or time-sensitive tasks [56]. Upon storing the reusable contents in the cache resources at the edge networks, the same content for multiple mobile users can be quickly delivered.…”
Section: B Network Uncertaintymentioning
confidence: 99%
“…As terrestrial users in general submit their content requests earlier than the expected time that content files are received, their content requests may be known in advance [25]. For any user i ∈ I, denote by Pr i the probability of content requests of user i received by the content server with…”
Section: Uav Caching Modelmentioning
confidence: 99%
“…• At each time slot t, observe Q i (t), Z i (t), H j (t) for any user i ∈ I, and UAV j ∈ J . • AUxiliary-Tier (AUT) optimization: Choose γ i (t) for each user i to mitigate (25) Minimize…”
Section: B Lyapunov Drift-plus-penaltymentioning
confidence: 99%