We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. In the most general form, this can be analyzed by considering the 2 n × n-dimensional caching capacity region of the wireless network. We provide an inner bound on this caching capacity region, and, in the high path-loss regime, a matching (in the scaling sense) outer bound. For large path-loss exponent, this provides an information-theoretic scaling characterization of the entire caching capacity region. Moreover, the proposed communication scheme achieving the inner bound shows that the problem of cache selection and channel coding can be solved separately without loss of order-optimality.
REF considers a general problem of delivering content cached in a wireless network and provides some bounds on the caching capacity region from an information-theoretic point of view.
Caching in Wireless Networks
IEEE Transactions on Information Theory, vol. 58, pp. 6524 - 6540, October 2012
Mathematics Computer Science Engineering