The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Optimal Cooperative Content Caching and Delivery Policy for Heterogeneous Cellular Networks
Abstract
To address the explosively growing demand for mobile data services in the 5th generation (5G) mobile communication system, it is important to develop efficient content caching and distribution techniques, aiming at significantly reducing redundant data transmissions and improving content delivery efficiency. In heterogeneous cellular network (HetNet), which has been deemed as a promising architectural technique for 5G, caching some popular content items at femto base-stations (FBSs) and even at user equipment (UE) can be exploited to alleviate the burden of backhaul and to reduce the costly transmissions from the macro base-stations to UEs. In this paper, we develop the optimal cooperative content caching and delivery policy, for which FBSs and UEs are all engaged in local content caching. We formulate the cooperative content caching problem as an integer-linear programming problem, and use hierarchical primal-dual decomposition method to decouple the problem into two level optimization problems, which are solved by using the subgradient method. Furthermore, we design the optimal content delivery policy, which is formulated as an unbalanced assignment problem and solved by using Hungarian algorithm. Numerical results have shown that the proposed cooperative content caching and delivery policy can significantly improve content delivery performance in comparison with existing caching strategies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
A tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
Cache in the air: exploiting content caching and delivery techniques for 5G systems
Wang, X., Chen, M., Taleb, T., Ksentini, A., & Leung, V. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736753 · Cited by 1,063 · cited 2×
“Numerical results have shown that the proposed cooperative content caching and delivery policy can significantly improve content delivery performance in comparison with existing caching strategies.”
Background
Cited by
A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications
Wang, S., Zhang, X., Zhang, Y., Wang, L., YANG, J., & Wang, W. (2017) · IEEE Access · doi:10.1109/access.2017.2685434 · Cited by 952
A Survey on Low Latency Towards 5G: RAN, Core Network and Caching Solutions
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841349 · Cited by 883
Ren, J., Zhang, D., He, S., Zhang, Y., & Li, T. (2020) · ACM Computing Surveys · doi:10.1145/3362031 · Cited by 615
Ning, Z., Zhang, K., Wang, X., Guo, L., Hu, X., Huang, J., Hu, B., & Kwok, R. Y. K. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.2997832 · Cited by 376
Deep Reinforcement Learning for Cooperative Content Caching in Vehicular Edge Computing and Networks
Qiao, G., Leng, S., Maharjan, S., Zhang, Y., & Ansari, N. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2945640 · Cited by 321
Metadata
- Authors
- Jiang, W., Feng, G., & Qin, S.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2017-05-01
- Volume
- 16
- Issue
- 5
- Pages
- 1382-1393
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2498604117
- Cited by
- 229
- References
- 3
- FWCI
- 25.27
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.