Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content‐Centric Networks

Abstract

Content-centric networks (CCNs) have become a promising technology for relieving the increasing wireless traffic demands. In this paper, we explore the scaling performance of mobile content-centric networks based on the nonuniform spatial distribution of nodes, where each node moves around its own home point and requests the desired content according to a Zipf distribution. We assume each mobile node is equipped with a finite local cache, which is applied to cache contents following a static cache allocation scheme. According to the nonuniform spatial distribution of cache-enabled nodes, we introduce two kinds of clustered models, i.e., the clustered grid model and the clustered random model. In each clustered model, we analyze throughput and delay performance when the number of nodes goes infinity by means of the proposed cell-partition scheduling scheme and the distributed multihop routing scheme. We show that the node mobility degree and the clustering behavior play the fundamental roles in the aforementioned asymptotic performance. Finally, we study the optimal cache allocation problem in the two kinds of clustered models. Our findings provide a guidance for developing the optimal caching scheme. We further perform the numerical simulations to validate the theoretical scaling laws.

Throughput-Outage Scaling Behaviors for Wireless Single-Hop D2D Caching Networks with Physical Model -- Analysis and Derivations

“…For example, in [34], a scaling law analysis was conducted for the cache-aided hierarchical cooperation approach. Besides, the scaling law in cache-aided D2D networks considering nonuniform user distribution was investigated in [35]. Moreover, when involving coding and multicasting schemes, coded cache-aided D2D was proposed and analyzed in [36]- [40].…”