Some New Coded Caching Schemes With Smaller Subpacketization via Some Known Results
Coded caching is widely regarded as an important tool to reduce pressure on the data transmission during the peak traffic times in heterogeneous wireless networks. In this paper, we will provide two concatenating constructions of coded caching schemes based on the schemes derived by Shangguan et al....
Saved in:
Published in | IEEE access Vol. 8; pp. 86305 - 86315 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Piscataway
IEEE
2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Coded caching is widely regarded as an important tool to reduce pressure on the data transmission during the peak traffic times in heterogeneous wireless networks. In this paper, we will provide two concatenating constructions of coded caching schemes based on the schemes derived by Shangguan et al. in 2018 and Yan et al. in 2017, respectively. Then we show that our new schemes have good performance in reducing packet number. Furthermore, in some case, we present that our schemes have better performances on user number, memory ratio, packet number and transmission rate than the schemes obtained by Chittoor et al. in 2019 and Krishnan in 2018. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2020.2992091 |