{'fraction_non_alphanumeric': 0.033633093525179854, 'fraction_numerical': 0.013983812949640288, 'mean_word_length': 4.390450799806108, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 6, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Modeling and Analysis of MmWave Communications in Cache-enabled HetNets

In this paper, we consider a novel cache-enabled heterogeneous network (HetNet), where macro base stations (BSs) with traditional sub-6 GHz are overlaid by dense millimeter wave (mmWave) pico BSs. These two-tier BSs, which are modeled as two independent homogeneous Poisson Point Processes, cache multimedia contents following the popularity rank. High-capacity backhauls are utilized between macro BSs and the core server. A maximum received power strategy is introduced for deducing novel algorithms of the success probability and area spectral efficiency (ASE). Moreover, Monte Carlo simulations are presented to verify the analytical conclusions and numerical results demonstrate that: 1) the proposed HetNet is an interference-limited system and it outperforms the traditional HetNets; 2) there exists an optimal pre-decided rate threshold that contributes to the maximum ASE; and 3) 73 GHz is the best mmWave carrier frequency regarding ASE due to the large antenna scale.


I. INTRODUCTION
To support the explosive data traffic of future fifthgeneration (5G) cellular networks, numerous researches [1][2][3][4] have paid attention to an innovative framework that densifies the traditional networks with massive small base stations (BSs) or exploiting power domain. However, the improvement of these heterogeneous networks (HetNets) is mainly restricted to the capacity of the backhauls [1]. A recent study [5] has relaxed the limitation by equipping caches at all BSs to store the most popular files as only the minority of multimedia contents is frequently requested by the majority of customers in the real world. Accordingly, the aforementioned cacheenabled HetNets have been studied in various papers. The primary work [6] analyzed the energy efficiency and throughput of cache-enabled cellular networks with a regular hexagonal grid. Since stochastic geometry is a useful tool to acquire the networks' randomness, modeling a tier of BSs in small cell networks or HetNets with a Poisson Point Process (PPP) is more accurate than the traditional hexagonal scenario [7]. Under this condition, the throughput of multi-tier cache-enabled HetNets was discussed in [1], where macro BSs connected to the core networks via backhauls and small cell devices cached the content through wireless broadcasting. Unfortunately, the further analysis on the impact of backhaul capacity was omitted, which is the key parameter when comparing with the conventional HetNets.
In addition to the network densification, another key capacity-increasing technology is exploiting new spectrum bands, such as millimeter wave (mmWave) [8]. Two distinctive characteristics of mmWave are small wavelength and the sensitivity to blockages [9,10]. Thanks to short wavelength, steerable antennas can be deployed at devices to enhance the directional array gain [9]. On the other side, the sensitivity gives rise to severe penetration loss for mmWave signals when passing through building exteriors [10], so it is unrealistic to expect the outdoor-to-indoor coverage from macro mmWave BSs. An ingenious hybrid network is created to solve this issue, where mmWave transmitters contribute to the ultra-fast data rate in short-range small cells, and sub-6 GHz BSs provide the universal coverage [11]. The same with cache-enabled HetNets, stochastic geometry has also been wildly utilized in mmWave networks, where the locations of transceivers were modeled following PPPs [12]. With the aid of such structure, the primary article [12] introduced a stochastic blockage model to represent the actual mmWave communication environment, but the antenna pattern was over-simplified as a flat-top model. Then the authors in [13] proposed an actual antenna pattern for increasing the accuracy. Considering the hybrid HetNets, a tractable structure combining mmWave with sub-6 GHz was analyzed in [11], which performed close to the reality.
As discussed above, although HetNets with caches have been fully analyzed under traditional sub-6 GHz networks, there is still lack of articles on a hybrid system with mmWave small cells. Since mmWave is able to provide fast data rate in shortdistance networks [14], adopting mmWave into a dense pico tier of cache-enabled HetNets is an promising way to increase the throughput of 5G cellular networks. The other benefit of such hybrid HetNets is no mutual interferences due to applying distinctive carrier frequencies between tiers. These advantages motivate us to create this paper. In contrast to [1], we introduce fiber-connections between macro BSs and the multimedia server to evaluate the impact of backhaul capacity. Then, due to the employment of mmWave, the propagation environment and antenna beamforming pattern in the small cells are replaced by Nakagami fading and actual antenna arrays, respectively. Moreover, we have compared the performance of various mmWave frequencies in this paper. On the other hand, unlike noiselimited assumption in [11], we demonstrate that in the dense mmWave networks, the system becomes an interference-limited scenario. With the aid of the content placement, we conclude that the throughput of our system is conditionally decided by the storage capacity. The main contributions are summarized as follows: 1) we discuss the Laplace transform of interference for traditional sub-6 GHz macro cells and mmWave small cells with the actual antenna pattern; 2) the novel algorithms for the success probability and area spectral efficiency (ASE) under Maximum Received Power (Max-RP) scheme are derived; 3) our model is an interference-limited system and there is an optimum value of rate requirement for obtaining the maximum ASE; and 4) 73 GHz is the best mmWave carrier frequency under the considered association strategy. In this paper, we present a two-tier cache-enabled hybrid HetNet consisting of numerous macro and pico BSs as shown in Fig. 1. The locations of BSs in i-th tier are modeled following an independent homogeneous PPP Φ i with a density λ i , where i = 1 and 2 represent the macro and pico tier, respectively. In our model, a typical user is located at the origin of a plane so that the distribution of distance from the typical user to its nearest BS in i-th tier will follow p i (r) = 2πλ i r exp(−πλ i r 2 ). Apparently, the number of pico BSs in the real HetNets is much more than that of macro BSs, so we consider λ 1 ≪ λ 2 . In order to compare the performance of our proposed networks with the traditional HetNets, we provide a server to supply the less-popular contents. This server connects to each macro BS through a high-capacity wired backhaul.

II. SYSTEM MODEL A. Network Architecture
Moreover, different carrier frequencies are employed in our system. The macro BSs connect to receivers with traditional sub-6 GHz, while mmWave is utilized between the pico BS and its corresponding user. As a result, there is no interference between these two tiers. However, in the same tier, other active BSs apart from the corresponding BS that serves the typical user will be the source of interferences. Additionally, the quantity of users is assumed to be large enough to ensure that all BSs are active when the corresponding BS is transmitting messages to the typical user.

B. Blockage Model
In tier 1, since macro BSs employ sub-6 GHz as its carrier frequency, the path loss law L 1 (ṙ) with a distanceṙ is same with that in traditional cellular networks as shown below where α 1 is the path loss exponent and C 1 is the intercept for the macro tier. In tier 2, the communication environment is changed due to the employment of mmWave. More specifically, the transmitting routes of pico BSs are divided into line-of-sight (LOS) group and non-line-of-sight (NLOS) group and each of them has its unique path loss law. Note that the density of the pico tier λ 2 is huge, which indicates that tier 2 can be visualized as dense mmWave networks. One blockage may obstruct all BSs behind it under this case. Therefore, we consider an LOS ball to model the blockage process. A recent study [15] has advocated that such blockage pattern fits the real-world scenarios better than other models. In terms of the NLOS links, the authors in [12] have demonstrated that the impact of NLOS signals is so weak that it can be ignored in mmWave networks, only LOS signals will be considered in this paper.
As a consequence, we define the LOS ball with a radius R L , which represents the departure from nearby obstacles. The probability of LOS links will be one inside the ball and zero outside the area. The path loss law in tier 2 L 2 (ṙ) with a distanceṙ is shown as follows where α 2 and C 2 are the path loss exponent and the intercept of LOS links in tier 2, respectively. U(x) is the unit step function.

C. Directional Beamforming
In i-th tier, we employ antenna arrays composed of N i elements at all cache-enabled BSs and the transmit power is assumed to be a constant with P i . The uniform linear array formed by N 2 antenna elements is utilized at all pico BSs. However, we only consider an omnidirectional antenna pattern at macro BSs (N 1 = 1) and the typical user for tractability of the analysis [11].
Directional antenna arrays deployed at the pico BSs will supply substantial beamforming gains to compensate the path loss, so the received signal for i-th tier at the typical user can be expressed as follows where interfering BSs are located at x when the typical user is receiving the message from the serving BS at x 0 . The channel vector from the BS to the typical user and the beamforming vector of the BS in i-th tier are denoted by h x i and w x i , respectively. n 0 represents the thermal noise with power σ 2 i . Combining with the aforementioned assumptions, the product of the fading gain and beamforming gain of the BS located at x in i-th tier is shown as below [16] where h i is the small fading term for i-th tier. ϕ x is the spatial angle of departure (AoD) from the interfering BS to the typical user, and θ x is the spatial AoD between the BS at location x and its corresponding receiver. G i (.) is the array gain function. More specifically, an actual array pattern is employed at pico BSs so that G 2 (ω) . d and λ are the antenna spacing and wavelength, respectively [16]. On the other hand, the array gain function for macro BSs is G 1 (ω) ∆ = 1 due to the omnidirectional antenna pattern.

D. Channel Model
Assuming that all active BSs have the full knowledge of the AoD from itself to the typical user, the serving BS will align the antenna beam towards the typical user for achieving maximum directivity gain G 0 = 1. In our model, since the corresponding BS is only interfered by the active BSs located in the same tier, the interference for i-th tier can be expressed as follows Therefore, the signal-to-interference-plus-noise-ratio (SINR) of i-th tier Υ i at the typical user is given by where h 2 follows independent Nakagami fading due to utilizing mmWave and the parameter N p 2 of Nakagami fading is considered to be a positive integer for simplifying the analysis [12]. Therefore, |h 2 | 2 is a normalized Gamma random variable. On the other side, we assume a Rayleigh fading model for the macro tier so that the fading parameter N p 1 ∆ = 1.

E. Cache-enabled Content Access Protocol
In this paper, we assume that a static multimedia content catalog containing N c files is stored at the server. Every macro BSs has a restricted storage with M 1 files, and each of pico BSs has a weaker ability to cache M 2 files, namely, M 2 < M 1 < N c . High-speed backhauls are employed for connecting the core server to macro BSs like traditional HetNets, and the backhaul capacity is denoted by C bh . When the data traffic load of our proposed networks becomes low, the content will be cached in a sequence of its popularity rank at all BSs via broadcasting until the storage is fully occupied. The content with f -th popularity rank can be represented by the Zipf distribution as shown below where δ ≥ 0 is the skew parameter of the probability distribution.
With the aid of Max-RP scheme, the access protocol in our paper is defined as follows.
Access Protocol: When the typical user demands a multimedia file, it communicates with the proximate macro or pico BS with maximum received power. However, if the demanded content is absent from the corresponding BS due to limited storage capacity, the typical user will request that file from the server via the nearest macro BS.

III. LAPLACE TRANSFORM OF INTERFERENCE
The expected value of interference can be derived by Laplace Transform of Interference, using which the success probability and ASE for the considered HetNets will be deduced.

A. Laplace Transform of Interference Analysis in Tier 1
In the macro tier, we utilize sub-6 GHz as the carrier frequency, and the fading channel is assumed to be Rayleigh fading. Therefore, the exact expression for Laplace transform of interference can be expressed as below.
Lemma 1: The Laplace transform of interference in the macro tier is given by where 2 F 1 (.) is the Gauss hypergeometric function. Proof: The proof procedure is similar as Appendix B in [1], but fading parameter equals to 1 in our case due to Rayleigh fading assumption.

B. Laplace Transform of Interference Analysis in Tier 2
Since the path loss exponent of LOS links α 2 is no less than 2 for the practical mmWave networks, we will divide the analysis into two conditions (α 2 > 2 and α 2 = 2) in order to achieve several closed-form equations.
Numerous actual channel measures [19,20] have indicated that the path loss exponent of LOS link is 2 under various carrier frequencies, e.g. 28 GHz, 38 GHz and 73 GHz, so we are more interested in the Laplace transform of interference under the condition of α 2 = 2. The equation (10) will be changed into where F y (y) =N p 2 ln 1 + 1 y − 1 Proof: See Appendix A.
IV. SUCCESS PROBABILITY AND AREA SPECTRAL EFFICIENCY ANALYSIS Before discussing the success probability, we define our Content Placement as follows: All BSs in different tiers will choose the most popular contents to store. As a result, the probability p i,f of the condition that i-th tier BSs cache the same copy of f -th ranked file can be expressed as below Therefore, a set of i-th tier BSs containing the f -th ranked file Φ i,f will form an independent non-homogeneous PPP with the density p i,f λ i From the costumer's perspective, the success probability is an important parameter to appraise the quality of service. In our cache-enabled HetNets, the instantaneous data rate at the typical user exceeding the pre-decided rate threshold R th will contribute to the success probability [1]. As discussed in the previous sections, we conclude that the proposed system has two different processes in sending the multimedia contents: 1) User Association Mode; and 2) Server Mode. We will discuss these two modes in details as below.

A. User Association Mode
The typical user will choose the macro or pico BS with maximum received power as its serving BS. We define the Max-RP association probability when the typical user connects with i-th tier as follows where j = i and j ∈ [1, 2] Therefore, the probability density function (PDF) of the distance r between the typical user and its serving BS with f -th ranked file in i-th tier is changed into [21] f whereP j =

B. Server Mode
In server mode, the nearest Macro BS will act as the relay to retransmit the multimedia file from the server to the typical user. Under this condition, the backhaul capacity will restrict the performance of our system. To simplify the notation, we first derive the coverage probability of tier 1 without considering the cache capacity.
Lemma 3: Since in various articles [1,11], the noise can be ignored in the traditional cellular networks with sub-6 GHz, we only consider the signal-to-interference-ratio (SIR) instead of SINR for analyzing the performance of tier 1, namely, σ 2 1 = 0. Under this condition, the coverage probability for no-caching tier 1 is given by Proof: Note that the SIR coverage probability P Υ1 (τ ) = P |h 1 | 2 > τ I1r α 1 N1C1P1 |r = ||x 0 || where |h 1 | 2 ∼ exp(1) due to Rayleigh fading assumption. Thus such coverage probability can be expressed as P Υ1 (τ ) = ∞ 0 L 1 (r α1 )p 1 (r)dr. Note that ∞ 0 r exp(−ar 2 )dr = 1 2a , a > 0, the coverage probability will be simplified as above. Corollary 1: The success probability P S (R th ) in server mode is given by Proof: In server mode, if C bh is smaller than R th , the P S (R th ) will be zero as the system rate is not large enough for transmitting the content. Moreover, if C bh is larger than R th , the success probability for f -th ranked file under this mode will be P f P Υ1 (2 R th B 1 − 1). We sum up the (M 1 + 1)-th to N c -th elements to calculate P S (R th ) as shown above.

C. Success Probability
Based on the Laplace transform of the interference, we are able to calculate the content-related coverage probabilities of two tiers, which is the basement for analyzing the success probability.
Lemma 4: For f -th ranked content, the coverage probability for i-th tier Θ i,f (τ ) under Max-RP scheme is shown below where Proof: Note that the probability of distance under this user association is shown in equation (15), with the similar calculation process with Appendix A from [12] and Lemma 3, coverage probability for two tier can be expressed as above.
As mentioned in the beginning of this section, the universal success probability can be defined as below Theorem 1: With the aid of Corollary 1 and Lemma 4, the success probability of Max-RP will be as follows Proof: When the required rate is R th , the pre-decided SINR threshold is (2 R th B i − 1), so the success probability for f -th ranked content in the first M 1 popularity rank is . Considering the whole multimedia contents, the success probability will be calculated as above.

D. Area Spectral Efficiency
The ASE is the average instantaneous data rate transmitted in unit bandwidth and unit area. Assuming that Gaussian Codebooks are utilized for all transmissions, we are able to define ASE with the aid of Shannon's Capacity Formula. It is expressed as follows ASE = λlog 2 (1 + τ ) P τ , where P τ is the SINR coverage probability of the considered networks and λ denotes the active BSs' density [22].
Proposition 1: The ASE A for Max-RP user association strategy is given by V. NUMERICAL RESULTS The general network settings for our system are shown in Table. I [1,11,12] and the reference distance for the intercept is one meter.   Fig. 2 illustrates the impact of R th and N 2 on success probability. Comparing the analytical results of the success probability with the simulation results, we note that they match each other ideally, thereby certifying the analysis. It is obvious that our cache-enabled HetNets outperform the traditional HetNets where the macro BSs have no caching capacity, especially in the area R th ≥ C bh . Moreover, the SIR scenario fits the analytical results perfectly so that our model can be regarded as an interference-limited system. Lastly, with the rise of antenna scales N 2 , the success probability will correspondingly increase. Fig. 3 shows the success probability versus cache capacity with different P 1 . The success probability has a negative correlation with the transmit power P 1 . Massive P 1 contributes to large received power, when P 1 increases to 100 dBm, the success probability becomes independent on M 1 . In this case, the typical use will associate with tier 1 all the time. In terms of the cache capacity, the success probability is a monotonic increasing function with pico BSs' storage capacity M 2 . For the cache capacity of macro BSs M 1 , when C bh > R th , the success probability has no relationship with M 1 since the less-popular content that only contained in the server can be transmitted freely through the backhaul. Under this condition, the proposed HetNet is same with the traditional one. On the other side, when   C bh ≤ R th , the server will be blocked so that the success probability will be benefited by the large M 1 , which represents that more multimedia files can be stored at macro BSs. Fig 4 plots the ASE versus R th with different λ 2 and carrier frequencies. The optimum pre-decided rate threshold R th for achieving the maximum ASE can be easily figured out due to the convex property. When the density of pico tier λ 2 increases from 10/(250 2 π) m −2 to 30/(250 2 π) m −2 , the optimal number decreases. Then, we compare the carrier frequencies at 28 GHz, 38 GHz, 60 GHz and 73GHz with antenna scales N 2 =10, 20, 40 and 80 [14], respectively. All of them has the same LOS path loss exponents (α 2 = 2), except that the path loss exponent for 60 GHz is 2.25 [19,20]. Fig. 4 illustrates that 73 GHz is the best choice thanks to the largest antenna scales. The simulation of 60 GHz matches the analytical results with an insignificant difference, thereby verifying all analytical expressions under the condition α 2 > 2. VI. CONCLUSION In this treatise, we utilize the stochastic geometry to analyze the performance of our cache-enabled hybrid HetNet. More specifically, the proposed network, which performs better than the traditional HetNet, can be regarded as an interferencelimited system due to the high density of mmWave tier and the nature of sub-6 GHz tier. As discussed in the previous sections, our system has a positive correlation with pico BSs' antenna scales and the cache capacity of both tiers. Additionally, there exists an optimum value of pre-decided rate threshold contributing to the maximum ASE. Lastly, for Max-RP association strategy, 73 GHz is the best carrier frequency of mmWave tier. where (a) follows the Gamma random variable's moment generating function [12]; (b) is computing the expectation of tier 2 antenna gain G 2 . When α 2 > 2, (A.1) can be simplified as follows L n 2 (s) (c) follows Gauss hypergeometric function. When α 2 = 2, (A.1) can be simplified as below L n 2 (s) 3) (d) follows (2.117-1), (2.117-3) and (2.118-1) in [23]. With the aid of Gauss-Chebyshev Quadrature, we obtain Lemma 1.