Download Now Free registration required
The authors consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. They 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.
- Format: PDF
- Size: 284.27 KB