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.
Highlights
During recent years, wireless traffic is undergoing explosively increase due to the subscribers’ enormous data demands
As the number of users continually grows, the scaling performance of content-centric networks has attracted research interests, which is important to help us understand the scalability of CCNs
In a static unit network consisting of n randomly distributed nodes, Gupta and Kumar [2] sphoffiffiwffiffiffisffiffiffitffiffihffiffieffi asymptotic throughput of each node scales as Θð1/ n log nÞ(Given two nonnegative functions f ðnÞ and gðnÞ: f ðnÞ = OðgðnÞÞ means there exists a constant c such that f ðnÞ ≤ cgðnÞ for n large enough; f ðnÞ = ΩðgðnÞÞ if gðnÞ = Oðf ðnÞÞ; f ðnÞ = ΘðgðnÞÞ means both f ðnÞ = OðgðnÞÞ and f ðnÞ = ΩðgðnÞÞ; f ðnÞ = oðg ðnÞÞ means limn⟶∞ f ðnÞ/gðnÞ = 0; and f ðnÞ = ωðgðnÞÞ means limn⟶∞gðnÞ/f ðnÞ = 0.), which indicates the poor scalability of wireless networks as the number of nodes increases
Summary
Wireless traffic is undergoing explosively increase due to the subscribers’ enormous data demands (such as video streaming). In [29], Alfano et al investigate the throughput and delay performance of mobile content-centric networks with limited cache space They find that the stronger mobility degree of nodes results in poor network performance. Based on the deployment of home point, we formalize the spatial distribution of nodes into the two clustered model (ii) Secondly, we devise a cell-partition-based TDMA scheduling scheme to maximize the concurrent transmissions and develop a distributed multihop routing scheme On this basis, we derive the asymptotic performance of the two kinds of clustered models and further establish the closed form of the throughput-delay tradeoff (iii) Thirdly, we design the optimal cache allocation and investigate optimal throughput and delay performance by utilizing Lagrangian relaxation method under the assumption of a Zipf content popularity distribution.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
