Caching in Wireless Networks

Details Caching in Wireless Networks Caching in Wireless Networks

2009-08-13

arxiv.org/abs/0908.1916v3

Computer Science

Information Theory

28 pages, to appear in IEEE Transactions on Information Theory

Scientific paper

We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^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. The proposed communication scheme achieving the inner bound shows that the problems of cache selection and channel coding can be solved separately without loss of order-optimality. On the other hand, our results show that the common architecture of nearest-neighbor cache selection can be arbitrarily bad, implying that cache selection and load balancing need to be performed jointly.

Affiliated with

Also associated with

No associations

Rating

Caching in Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Caching in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Caching in Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701469