Multicast capacity of cache enabled content-centric wireless Ad Hoc networks

In this paper, we investigate the upper bound of multicast capacity for content- centric wireless ad hoc networks with content-centric hierarchical routing strategy. We consider two content-centric hierarchical routing strategies, namely, the homogeneous hierarchical routing strategy where each content is requested and cached with equal probability, and the heterogenous hierarchical routing strategy where each content is cached with different probabilities and the requested contents follow a Zipf content popularity distribution. For the two proposed hierarchical routing strategies, we establish the upper bounds on multicast capacity of content-centric wireless ad hoc networks, respectively. We then discuss how the system parameters, such as the number of nodes n, the number of users p, the cache size C, the probability of cache qm and the content popularity distribution impact on the muilticast capacity scalings.