2021 13th International Conference on Communication Software and Networks (ICCSN) 2021
DOI: 10.1109/iccsn52437.2021.9463666
|View full text |Cite
|
Sign up to set email alerts
|

Deep Reinforcement Learning for Cooperative Edge Caching in Vehicular Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…Vehicles construct clusters and receive requested content from either their CHs or RSUs; part of the mathematical model is solvable as a knapsack problem [6] Collaborative caching Vehicles broadcast the names of cached content [17] Collaborative caching Cache policy is determined with deep reinforcement learning [18] Collaborative caching The problem of which content to store and where to store it is determined by machine learning [19] Collaborative caching Data carrier node is selected by reinforcement learning [20] Cache place determination Cache placement is treated as an MWVCP problem [21] Cache place determination Node n (n < k) only stores content c, where c mod k = n [22] Relay vehicle determination Vehicles that lie in the common communication area are preferentially selected…”
Section: Referencementioning
confidence: 99%
See 1 more Smart Citation
“…Vehicles construct clusters and receive requested content from either their CHs or RSUs; part of the mathematical model is solvable as a knapsack problem [6] Collaborative caching Vehicles broadcast the names of cached content [17] Collaborative caching Cache policy is determined with deep reinforcement learning [18] Collaborative caching The problem of which content to store and where to store it is determined by machine learning [19] Collaborative caching Data carrier node is selected by reinforcement learning [20] Cache place determination Cache placement is treated as an MWVCP problem [21] Cache place determination Node n (n < k) only stores content c, where c mod k = n [22] Relay vehicle determination Vehicles that lie in the common communication area are preferentially selected…”
Section: Referencementioning
confidence: 99%
“…With the emergence of AI, some studies suggest combining AI and vehicular networks: Ref. [17] calculates the cache policy with deep reinforcement learning, Ref. [18] uses machine learning to decide which content to store and where to store it, and Ref.…”
Section: Collaborative Cachingmentioning
confidence: 99%
“…Vehicles travel at a uniform speed, and the distance d n between adjacent CAVPs in the same lane follows a uniform distribution U. The frame length is T. We consider the spatial location and environment around the vehicle to be semi-static, i.e., not changing significantly within frame T but changing dynamically over multiple frames [33]. The detailed scenario parameters are set as shown in Table 1.…”
Section: Simulation Setupmentioning
confidence: 99%
“…The installation of a mobile edge computing (MEC) server in the RSU creates space for the caching content, further enabling the delivery of the content from a location closer than that of the remote server. Caching to the RSUs decreases the latency and relieves the backhaul burden [ 4 ]. However, because the vehicle is constantly moving, the residence time in the RSU range is relatively shorter and the network topology continues to vary [ 5 ].…”
Section: Introductionmentioning
confidence: 99%