Research Article
A Novel Cooperative Cache Policy for Wireless Networks
Table 1
The comparison of the related work policies.
| Policy category | Weakness | The improvement by CPP-CC policy |
| (1) Zhao et al. [19] (2) Cheng et al. [20] | These policies do not include BS cooperation, which results in duplicate content being cached and further wasting limited cache capacity. | The SBSs in the CPP-CC policy can exchange information with each other. In particular, the SBSs in the same cluster can share their cached content. |
| (1) Xu et al. [21] (2) Zhou et al. [22] (3) Ye et al. [23] (4) Poularakis and Tassiulas [7] (5) Somesula et al. [24] | These policies assume that content popularity is static, and therefore they cannot be used for the dynamic cache scenario. | CPP-CC policy utilises LSTM neural network to predict the dynamic content popularity. |
| (1) Thar et al. [25] (2) Yan et al. [27] | These policies do not consider user mobility. | The MBS should only serve fast-moving users in this work, and the SBS serves slow-moving users. | (1) Mou et al. [26] (2) Rathore et al. [28] | These policies do not consider the relationship between HetNet layer properties and user mobility. |
|
|