Multicast Capacity of Cache Enabled Content-Centric Wireless Ad Hoc Networks

Guanglin Zhang, Jian Liu, Jiajie Ren

College of Information Science and Technology, Donghua University, Shanghai, 201620, China Engineering Research Center of Digitized Textile and Apparel Technology, Ministry of Education

* The corresponding author, email： glzhang@dhu.edu.cn

I. INTRODUCTION

Caching plays an important role in the applications of wireless networks, for instance, retrieving the cached contents which are closest the requesting nodes can improve the throughput capacity due to decreasing the number of hops between the requester and desired content. Recently, the content-centric networking architectures such as Named Data Networking (NDN) [9] and Content-Centric Networking (CCN) [10] have been developed for popularity content objects distribution making use of caching. It is of great interest to characterize the performance and scaling in large-scale content-centric wireless networks.In [11], Liu et al. obtain the scaling laws of the throughout capacity for cache enabled content distribution wireless ad hoc networks by proposing a nearest caching node scheme and transparent enroute caching scheme. They show that increasing the cache size of nodes can improve the throughput capacity under certain conditions. In [12], the authors study the per-node throughput capacity of an information-centric network while the content cached in each node has limited lifetimes. In[13], Mahdian et.al. study the the throughput and delay scaling behavior of content-centric wireless networks. By assuming that all contents follow a Zipf content popularity distribution, and each node has a limited capacity content storage, they give the solution of a cache optimization problem and minimize the average network delay and maximize the network throughput simultaneously. In[14], Alfano et al. study the throughput-delay tradeoffs of content-centric mobile ad-hoc networks for Zipf content popularity distributions. In [15], Do et al. investigate the optimal throughput-delay tradeoffs in content-centric mobile heterogeneous networks. In [16], Luo et al. study the throughput and delay of the content-centric MANETs under two operations regarding content placement and content retrieval. In [17], Liu et al. show that the impact of correlated mobility on the asymptotic scaling laws of MANETs. They propose two network regimes, which contain two mobility time scales in each regime.

In this paper, we first study the multicast throughput capacity of content-centric two-level hierarchical routing strategy. We first study the upper bound on multicast capacity of content-centric wireless ad hoc networks under the homogenous content access scheme,where the content objects are equally likely cached and requested. Then, we derive the multicast capacity of under the heterogenous content access scheme where the probability that them-th content is cached in a node is

The rest of this paper is organized as follows. Section II presents the system model. In Section III and IV, we derive the upper bound on multicast capacity of content-centric wireless ad hoc networks homogeneous hierarchical routing strategy and heterogeneous hierarchical routing strategy, respectively. Finally,we conclude the paper in Section V.This paper investigates the upper bound multicast capacity of content-centric wireless ad hoc networks with content-centric hierarchical routing strategy.By investigating two routing strategies,the authors prove the upper bounds of multicast capacity, respectively.

II. SYSTEM MODEL

2.1 Interference model

For the wireless interference in content-centric ad hoc networks, we adopt the protocol model fied：

Fig. 1 Example of multicast flows in a content-centric wireless ad hoc network

2.2 Content access scheme and routing strategy

We assumepusers originate request for given content object in a request. We adopt a content-centric two-level hierarchical routing strategy. Each requesting node forwards an interest packet toward the cluster head in each cluster using multi-hop pattern. Then each cluster head transmits the same interest packet to the closest caching node. When the interest packet is received by the closest caching node, the caching node routing a Data Packet containing the desired content objects to each cluster head in the reverse direction, then each cluster head forward the Data Packet to the requesting nodes in each cluster, respectively.For the sake of simplicity but without loss of generality, the route strategy is shown in Fig.1.

III. UPPER BOUND ON MULTICAST CAPACITY OF HOMOGENOUS CONTENT ACCESS SCHEME

In this section, we derive the upper bound on multicast capacity of content-centric wireless ad hoc networks under the homogenous content access scheme with content-centric two-level hierarchical routing strategy.

Proof:Consider an arbitrary clusterk, let

Lemma 3:The total number of hops from a caching node to itsprequesting nodes under the homogenous content scheme with content-centric two-level hierarchical routing strategy is

Theorem 1:The upper bound on multicast capacity under the homogenous content access scheme with content-centric two-level hierarchical routing strategy is

Fig. 2 The multicast capacity with various values of cache size C vs. the number of nodes n

Fig. 3 The multicast capacity with various values of cache size C vs. the number of nodes n

Theorem 2:Under the homogenous content access scheme with content-centric two-level hierarchical routing strategy, each content object is requested with equal probability. Since there areMdistinct content objects and each node can hold theCunit content object, the probability that each content object is requestupper bound on multicast capacity about the number of contentMand the cache sizeCby changing equation (4).

Discussion of result:Note that capacity result as shown in equation (7), the upper bound capacity on multicast capacity just about the cache size of each node and the number of content. The multicast capacity can be improved by enhancing the cache size of nodes as shown in Fig. 3.

IV. UPPER BOUND ON MULTICAST CAPACITY OF HETEROGENOUS CONTENT ACCESS SCHEME

In this section, we consider the random caching scheme where the probability that them-th is given by [14].

Lemma 5:The total number of hops from a caching node ofm-th content object to itsprequesting nodes under the content-centric hierarchical routing strategy is

The total number of hops from the closest caching node to the requesting nodes under heterogenous content access sceheme is

Theorem 3:The upper bound on multicast capacity under the heterogenous content access scheme with content-centric two-level hierarchical routing strategy is

Proof:Since the number of simultaneous transmission in the network is at most assume each node can generate traffic at a rate ity with content-centric two-level hierarchical routing strategy is (13) shown in the bottom at this page.

Recall that the number of cluster in the

(14) shown in the top at next page.

Fig. 4 The upper-bound of multicast capacity for various values of p, vs. the probability of random caching qm

Fig. 5 The multicast capacity for wireless ad hoc networks for various values of ,vs. cache probability qm

Theorem 4:Under the heterogenous content access scheme with content-centric two-level hierarchical routing strategy, the equation (12).

V. CONCLUSION

ACKNOWLEDGEMENT

This work is supported by the NSF of China under Grant No. 61301118 and No. 71171045;the International S&T Cooperation Program of Shanghai Science and Technology Commission under Grant No.15220710600; the Innovation Program of Shanghai Municipal Education Commission under Grant No.14YZ130;and the Fundamental Research Funds for the Central Universities.

[1] P. Gupta and P. Kumar, “The capacity of wireless networks,”IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, March, 2000.

[2] L. Fu and X. Wang, “Multicast Scaling Law in Multichannel Multiradio Wireless Networks,”IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 12, pp. 2418-2428, December, 2013.

[3] H. Gong, L. Fu, X. Fu, L. Zhao, K. Wang, and X.Wang, “Distributed Multicast Tree Construction in Wireless Sensor Networks,”IEEE Transactions on Information Theory, vol. 63, no: 1, January,2017.

[4] J. Zhang, Y. Li, Z. Liu, F. Wu, F. Yang, and X.Wang, “On Multicast Capacity and Delay in Cognitive Radio Mobile Ad Hoc Networks,”IEEE Transaction on Wireless Communications, vol.14, no. 10, pp. 5274-5286, October, 2015.

[5] X. Li, S. Tang, and O. Frieder, “Multicast capacity for large scale wireless ad hoc networks,” in Proc.13th annual ACM international conference on Mobile computing and networking, pp. 266-277, Canada, September, 2007.

[6] X. Li, Y. Liu, S. Li, and S. Tang, “Multicast capacity of wireless ad hoc networks under gaussian channel model,”IEEE/ACM Transation on Networking, vol. 18, no. 4, pp. 1145-1157, August,2010.

[7] O. Chaker, and J. Conan, “Multicast capacity of wireless ad hoc networks with hierarchical routing,”IEEE Vehicular Technology Conference,Sydney, Australia, pp.95-99, May, 2007.

[8] G. Zhang, Y. Xu, and X. Wang, “Multicast Capacity for Hybrid MANETs with Direction Antenna and Delay Constraint,” in Proc.IEEE Global Telecommunications Conference, Houston, Texas,USA, pp.1-5, January, 2011.

[9] L. Zhang, D. Estrin, J. Burke, V. Jacobson, J.Thornton, D. Smetters, B. Zhang, G. Tsudik, K.claffy, D. Krioukov, D. Massey, C. Papadopoulos, T. Abdelzaher, L. Wang, P. Crowley, and E.Yeh, “Named data networking (ndn) project,”Relatório Técnico NDN-0001, Xerox Palo Alto Research Center-PARC, 2010.

[10] V. Jacobson, D. Smetters, J. Thornton, M. Plass,N. Briggs, and R. Braynard, “Networking named content,” in Proc.International Conference on Emerging Networking Experiments and Technologies, Rome, Italy, pp. 1-12, December, 2009.

[11] B. Liu, V. Firoiu, J. Kurose. M. Leung and S. Nanda “Capacity of Cache Enabled Content Distribution Wireless Ad Hoc Networks,” in Proc.IEEE Mobile Ad Hoc and Sensor Systems, Pennsylvania, USA, pp. 309-317, February, 2014.

[12] B. Azimdoost, C. Westphal, and H. R. Sadjadpour, “On the throughput capacity if information-centric networks,” in Proc.25th International Teletraきc Congress, Shanghai, China, pp. 1-9,November, 2013.

[13] M. Mahdian, and E. Yeh, “Throughput-Delay Tradeoffs in Content-Centric Wireless Networks,” arXiv preprint arXiv:1504.03754, 2015.

[14] G. Alfano, M. Garetto, and E. Leonardi, “Content-centric wireless networks with limited buffers: When mobility hurts,” in Proc.IEEE/ACM Transactions on Networking, vol. 21, no. 1 pp.299-311, February, 2016.

[15] T. Do, S. Jeon, and W. Shin. “Caching in mobile HetNets: A throughput-delay trade-off perspective.” in Proc.IEEE International Symposium on Information Theory, Barcelona, Spain, pp.1247-1251, August, 2016.

[16] J. Luo, J. Zhang, Y. Cui, and X. Wang, “Asymptotic Analysis on Content Placement and Retrieval in MANETs,”IEEE/ACM Transactions on Networking, vol. 25, no. 2, April, 2017.

[17] X. Liu, K. Zheng, J Zhao, X. Liu, X. Wang and X.Di, “Information-Centric Networks with Correlated Mobility,”IEEE Transactions on Vehicular Technology, vol. 66, no. 5, May, 2017.

[18] P. Gupta and P. Kumar, “Critical power for asymptotic connectivity in wireless networks,”in Proc.37th IEEE Conference on Stochasticanalysis, control, optimization and application,Birkhuser Boston, pp. 547-566, August, 1999.

[19] S. Gitzenis, G. Paschos, and L. Tassiulas, “Asymptotic laws for joint content replication and delivery in wireless networks,”IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2760-2776, May, 2013.