2015/04/14 by Milad Mahdian, Mahdian, Milad, Edmund Yeh +1
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.1504.03754
openalex publication_date 2015/04/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the throughput and delay characteristics of wireless caching\nnetworks, where users are mainly interested in retrieving content stored in the\nnetwork, rather than in maintaining source-destination communication. Nodes are\nassumed to be uniformly distributed in the network area. Each node has a\nlimited-capacity content store, which it uses to cache contents. We propose an\nachievable caching and transmission scheme whereby requesters retrieve content\nfrom the caching point which is closest in Euclidean distance. We establish the\nthroughput and delay scaling of the achievable scheme, and show that the\nthroughput and delay performance are order-optimal within a class of schemes.\nWe then solve the caching optimization problem, and evaluate the network\nperformance for a Zipf content popularity distribution, letting the number of\ncontent types and the network size both go to infinity. Finally, we extend our\nanalysis to heterogeneous wireless networks where, in addition to wireless\nnodes, there are a number of base stations uniformly distributed at random in\nthe network area. We show that in order to achieve a better performance in a\nheterogeneous network in the order sense, the number of base stations needs to\nbe greater than the ratio of the number of nodes to the number of content\ntypes. Furthermore, we show that the heterogeneous network does not yield\nperformance advantages in the order sense if the Zipf content popularity\ndistribution exponent exceeds 3/2.\n