Abstract
Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is formulated as an optimization problem, and we relax this problem into an efficient computable one. Consequently, the proposed scheme can be applied to various network topologies efficiently.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
