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

A Cooperative Caching Scheme for VCCN With Mobility Prediction and Consistent Hashing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 41 publications
0
4
0
Order By: Relevance
“…The cooperation between DDQN and Fog access Point (F-AP) is applied to formulate the global optimal caching strategy. Yao et al [ 27 ] proposed the problem of cooperative caching in vehicle content centers, which comprehensively considered the future location of edge nodes and the cache redundancy between cooperative nodes to formulate a replacement strategy. Yang et al [ 28 ] studied the multi-hop cooperative caching of wireless sensor networks on ICN and made a trade-off between saving energy and reducing delay.…”
Section: Related Workmentioning
confidence: 99%
“…The cooperation between DDQN and Fog access Point (F-AP) is applied to formulate the global optimal caching strategy. Yao et al [ 27 ] proposed the problem of cooperative caching in vehicle content centers, which comprehensively considered the future location of edge nodes and the cache redundancy between cooperative nodes to formulate a replacement strategy. Yang et al [ 28 ] studied the multi-hop cooperative caching of wireless sensor networks on ICN and made a trade-off between saving energy and reducing delay.…”
Section: Related Workmentioning
confidence: 99%
“…In [19], Chen et al proposed a cooperative edge caching scheme in VEC which considered the location-based contents and the popular contents, while designing an optimal scheme for cooperative content placement based on an ant colony algorithm to minimize the total transmission delay and cost. In [20], Yao et al designed a cooperative edge caching scheme with consistent hash and mobility prediction in VEC to predict the path of each vehicle, and also proposed a cache replacement policy based on the content popularity to decide the priorities of collaborative contents. In [21], Wang et al proposed a cooperative edge caching scheme in VEC based on the long short-term memory (LSTM) networks, which caches the predicted contents in RSUs or other vehicles and thus reduces the content transmission delay.…”
Section: Related Workmentioning
confidence: 99%
“…The local RSU calculates the reward r(t) according to Eqs. ( 16) - (20) and state s(t) transits to the next state s(t+1), then the local RSU observes s(t+1). Next, the neighboring RSU randomly samples c popular contents that are not cached in s(t+1) as its cached contents, which is denoted as s n (t + 1).…”
Section: System Modelmentioning
confidence: 99%
See 1 more Smart Citation