Modeling, Analysis, and Optimization of Caching in Multi-Antenna Small-Cell Networks

Meixia Tao; Xianzhe Xu

REVIEW 4 major objections 4 minor 42 references

Modeling, Analysis, and Optimization of Caching in Multi-Antenna Small-Cell Networks

T0 review · 4 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Multiple antennas allow collaborative caching schemes—probabilistic and coded—to clearly outperform most-popular caching in small-cell networks when beamforming is chosen to match the transmission scheme.

desk verdict A competent multi-antenna extension of the authors' caching framework, with a solid probabilistic-caching core and a coded-caching layer that needs an independent SIC simulation before its headline claim is fully trusted. read the letter →

arxiv 1908.06595 v1 pith:SOGPGJ2O submitted 2019-08-19 cs.IT cs.NImath.IT

Xianzhe Xu , Meixia Tao This is my paper · ORCID

classification cs.ITcs.NImath.IT

keywords cachingsmall-cellnetworksbeamformingstochasticgeometryprobabilisticcodedcoverageprobabilityzero-forcing

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks whether equipping small base stations with multiple antennas can make collaborative caching strategies—probabilistic caching, where each base station caches a file with a tuned probability, and coded caching, where files are split and coded across base stations—genuinely beat the simple most-popular caching rule. Using stochastic geometry on a fully loaded network tessellated into $K$-th order Voronoi cells, the authors derive exact and approximate integral expressions for the average fractional offloaded traffic and average ergodic spectral efficiency under matched-filter and zero-forcing beamforming. They prove the probabilistic caching optimization is convex with closed-form KKT solutions, show the coded caching placement problem is an NP-hard multiple-choice knapsack problem, and give a greedy algorithm that matches exhaustive search in the reported numbers. The paper's central finding is that, with the right beamforming, extra antennas enlarge the performance gap of both collaborative schemes over most-popular caching, whereas earlier single-antenna results saw these schemes converge at high decoding thresholds.

What carries the argument

The load-bearing object is a user-centric cluster of the $K$ nearest small base stations to each user, which tessellates the plane into $K$-th order Voronoi cells and bounds the interference field; within this cluster, matched-filter beamforming maximizes the desired signal's effective channel gain while zero-forcing beamforming nulls intra-cluster interference when $L \ge K$. On top of this geometry, the analysis combines the Gamma-distributed effective channel gains of the serving links, Laplace transforms of the interference field, the incomplete-Gamma bounding inequality that converts Gamma CCDFs into finite sums, and a constant approximation for a random distance-ratio integral (replacing $\delta_k$ by its mean $\sqrt{k/K}$) to produce the compact bounds used as optimization objectives. For coded caching with non-orthogonal matched-filter transmission, successive interference cancellation at the receiver makes the joint success probability a product of per-link coverage probabilities under an independence assumption; the coded placement problem is then an NP-hard multiple-choice knapsack problem whose monotonicity property (Theorem 5) drives the greedy Algorithm 1.

What would settle it

Run a Monte Carlo simulation of the non-orthogonal matched-filter coded caching scheme without imposing independence: directly simulate the joint SIRs of the $b_n$ serving base stations and count how often all $k$ successive decodings succeed. Compare this empirical $q_k(b_n, \gamma)$ against the product formula used in the paper across the SIR threshold range $\gamma = -10$ to $10$ dB; any systematic gap beyond the simulation confidence interval at high $\gamma$ would falsify the optimization's foundation. A second check is to recompute the zero-forcing bounds using the exact distribution of $\delta_k$ instead of the mean-value approximation and see whether the optimized cache vectors and the $L > K$ crossover still hold.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is a set of analytical and algorithmic results showing how beamforming changes caching performance in interference-limited small-cell networks. For a typical user served by one of its $K$ nearest base stations, the coverage probability under both matched-filter and zero-forcing beamforming admits compact upper and lower bounds (Theorems 1 and 2), and under non-orthogonal matched-filter coded transmission with successive interference cancellation it admits similar bounds (Theorem 4). With these expressions, the probabilistic caching problem becomes convex and is solved in closed form via KKT conditions (Theorem 3). The coded caching placement problem is formulated as a multiple-choice knapsack problem, shown to be NP-hard, yet its optimal solution obeys monotonicity—more popular files receive at most as many fragments as less popular ones (Theorem 5)—and a greedy algorithm solves it near-optimally. The numerical claims are that zero-forcing outperforms matched filtering when the antenna count exceeds the cluster size, matched filtering is more robust to quantized channel state information, and both probabilistic and coded caching gain more from extra antennas than most-popular caching does.

Load-bearing premise

The analysis rests on the assumption that, when a user successively cancels interfering signals during coded caching, the events of decoding each of the $k$ nearest base stations successfully are independent, so the joint success probability is the product of the individual coverage probabilities; the zero-forcing coverage bounds also replace an integral over a random distance ratio by a constant, and both approximations are justified numerically rather than proven.

Editorial extensions

If this is right

With KKT-optimized cache probabilities, probabilistic caching beats most-popular caching in both average fractional offloaded traffic and average ergodic spectral efficiency, and the gain widens as the number of antennas per base station grows, especially at low SIR thresholds.
Coded caching solved by the greedy algorithm, which runs in $O(KMN)$ time, performs almost identically to exhaustive search, giving operators a computationally cheap way to place coded fragments.
Zero-forcing beamforming outperforms matched filtering when the antenna count exceeds the cluster size ($L > K$), while matched filtering is more robust when base stations only have quantized channel state information.
In the multi-antenna regime with zero-forcing, coded caching considerably outperforms most-popular caching in average ergodic spectral efficiency, in contrast to single-antenna networks where the two perform nearly the same.
The monotonicity $b^*_i \le b^*_j$ for $p_i \ge p_j$ means popularity ordering is preserved in the optimal coded-cache placement, simplifying implementation and validation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper leaves implicit that the mean-value replacement for $\delta_k$ in Appendix C could itself be replaced by the exact Beta-type density of the distance ratio, which might tighten the zero-forcing bounds and shift the reported $L = K$ crossover.
As an extension, the monotonicity property $b^*_i \le b^*_j$ could support online cache updates: when popularity rankings change, a greedy swap of fragment counts that respects the ordering may re-optimize placement without a fresh exhaustive search.
If the independence approximation behind the product-form success probabilities fails at high SIR thresholds, the coded-caching gains reported here would shrink; a correlation-aware correction would be a natural next step for testing how much of the reported margin is real.
The antenna-cluster crossover suggests a deployment heuristic the authors do not state: with limited feedback or small cluster sizes, stay at $L = K$ and prefer matched filtering, while with reliable CSI and $L > K$, zero-forcing is the better use of the extra spatial dimensions.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Couple things to know before you read. This is not a radical new idea; it is a careful extension of Xu-Tao's own single-antenna caching analysis to multi-antenna SBSs with MF and ZF. The probabilistic-caching half is in good shape: Theorems 1-3 have written proofs, special cases reduce to known single-antenna results, and Figs. 1-2 show the bounds tracking simulation. That part deserves to be published.

The genuinely new technical piece is the NO-MF coded-caching analysis, where the user does SIC over K Gamma-distributed serving gains. That is not in the prior literature and is worth attention. But it is also where the paper is softest. Lemma 4 and Theorem 4, which carry that analysis, are stated without proofs. The FOT and ESE formulas for coded caching then use the independence approximation in (39b) and (42a): the joint SIC success event is replaced by a product of per-link coverage probabilities. The only justification offered is a numerical observation from the authors' single-antenna paper [24]. That is not a bound, and the correlation SIC is meant to exploit is exactly what the approximation assumes away. I agree with the stress-test that the paper needs an independent Monte Carlo of the true SIC process at multi-antenna parameters. The simulations as reported do not settle it, because it is not clear whether they simulate the actual joint decoding or the product approximation.

Two smaller complaints. The ZF bounds used as optimization objectives rely on an unquantified replacement in Appendix C, and the abstract's 'optimal caching solutions' overstates things: Theorem 3 optimizes an approximate lower-bound objective, not the true AFOT/AESE. The wrong equation numbers in figure captions are cosmetic.

Net: this is a serious paper with real derivational content. The central claim—multiple antennas boost the advantage of collaborative caching over MPC—is plausible and consistent across metrics and beamformers, but it is not yet load-bearing for the coded-caching case. A revision should supply or tighten the omitted proofs, and add one simulation of the true SIC event. I would send it to review with that expectation. If I were working in stochastic geometry for cache-enabled networks, I would cite it, with a footnote about the approximation.

Referee Report

4 major / 4 minor

Summary. The paper analyzes caching in a multi-antenna small-cell network where each user is served by a cluster of its K nearest small base stations. Two caching models are studied: probabilistic caching and coded caching, under matched-filter (MF) and zero-forcing (ZF) beamforming, with orthogonal and non-orthogonal transmissions in the coded case. The authors derive exact and approximate expressions for coverage probability, average fractional offloaded traffic (AFOT), and average ergodic spectral efficiency (AESE) using stochastic geometry. They formulate and solve the probabilistic caching optimization via convexity and KKT conditions, formulate the coded caching optimization as a multiple-choice knapsack problem with a greedy algorithm, and extend the analysis to quantized CSI. Numerical results are used to compare schemes and to support the claim that multiple antennas boost the advantage of collaborative caching over most-popular caching.

Significance. If the derivations are correct, this is a useful extension of single-antenna stochastic-geometry caching analysis to multi-antenna small-cell networks with user-centric clustering and different beamforming structures. The probabilistic-caching results are the strongest part: Lemma 1-3 and Theorem 1-3 have written proofs in Appendices A-E, no parameters are fitted, and the approximate bounds are checked against simulation in Figs. 1-2. The coded-caching NO-MF analysis is the main new element, but it rests on omitted proofs and an independence approximation carried over from a single-antenna paper, so the quantitative coded-caching conclusions are not yet established. With complete proofs and a direct multi-antenna simulation validation of the SIC success and min-rate events, the contribution would be solid and suitable for the journal.

major comments (4)

[Section IV-A, Lemma 4 and Theorem 4] Lemma 4 (Eqs. (32)-(34)) and Theorem 4 (Eqs. (35)-(38)) are stated without proofs; the text says only that they are similar to Appendices A, B, and C. These results are load-bearing for the NO-MF coverage, AFOT, and AESE analysis, and the formulas are not obvious: Eq. (33) contains a conditional Laplace transform with a complicated integral factor, and Eq. (38) defines a nontrivial bounding function beta_4. Please include complete derivations, either in the paper or in a clearly referenced appendix/supplement.
[Section IV-B/C, Eqs. (39b) and (42)(a)] The joint SIC success probability q_k is replaced by the product of per-link coverage probabilities, and the min-rate event in Eq. (42)(a) is factored into a product of per-link events. The only justification given is numerical evidence in the authors' prior single-antenna paper [24]. In the multi-antenna MF case, successive SIRs are correlated through shared channel realizations and Gamma-distributed serving powers, so the single-antenna evidence does not transfer automatically. Moreover, the paper does not provide an independent Monte Carlo simulation of the joint SIC success event or of the min-rate event for L>1: Figs. 3, 6, 7, and 8 validate per-link coverage or use the same analytical expressions rather than simulating the true joint process. Please supply direct simulations of q_k and of E[min log2(1+SIR_k)] under the actual SIC receiver, and state whether the approximation is optimistic, pessimistic, or merely heuristic.
[Appendix C, Eqs. (67)-(72)] The approximate ZF bounds (20)-(21) are obtained by replacing a delta_k-dependent integral A((kappa*gamma*l)^(-2/alpha)*delta_k^2) with a constant factor computed from E[delta_k^2]=k/K. This moves the expectation inside a nonlinear function without an error bound, so equations (20)-(21) are not proven bounds despite being called 'approximate bounds.' Since these expressions are then used as the optimization objectives for both probabilistic and coded caching, please provide a rigorous bound or numerical evidence that the approximation error does not change the cache-placement conclusions.
[Section IV-D, Theorem 5] Theorem 5 (b_i* <= b_j* for p_i >= p_j) is stated without proof; the text says it can be proved similarly to Appendix D. This monotonicity property is used to initialize the greedy algorithm and restrict the search order in Algorithm 1. Please provide the actual proof or a precise reference to a proof in the literature.

minor comments (4)

[Figures 1-2 captions] The figure captions contain incorrect equation-number cross-references: Fig. 1 refers to 'lower bound (14)' whereas the lower bound is Eq. (13), and Fig. 2 refers to Eqs. (21) and (22) whereas the displayed equations are (20) and (21). Please correct these references.
[Section IV-D, equation numbering] The equation numbering skips (44): the text goes from Eq. (43) directly to Eq. (45). Please renumber or insert the missing equation so that all displayed equations are referenced consistently.
[Section V, around Eq. (53)] There is a typographical error 'Thus, the the coverage probability' in the text after Eq. (53); please remove the duplicated article.
[Appendix D, proof of Lemma 3] The concavity proof in Appendix D uses a chain of inequalities with several ellipses and unstated intermediate steps; spelling out the induction or referencing the exact monotonicity property of P^k_cov in k would make the argument easier to verify.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the core derivations are self-contained, and the NO-MF independence step is a disclosed approximation with prior independent support, not a reduction to input.

full rationale

The derivation chain is self-contained, and no load-bearing step reduces to its own inputs. Coverage probabilities in Lemmas 1, 2 and 4 are derived from first principles: Gamma-distributed effective channel gains, HPPP probability generating functionals, and Laplace transforms (Eqs. (58)-(59), (65)); no parameters are fitted to simulation data, and AFOT/AESE are not assumed as inputs to these derivations. The probabilistic-caching optimization (Theorem 3) follows by KKT analysis from the convexity proved in Appendix D, and the coded-caching monotonicity (Theorem 5) follows from the non-increasing property of the derived coverage probabilities. Algorithm 1 is checked against exhaustive search on the same objective, which is an internal-consistency check, not circularity. The one passage worth flagging is Eq. (39b) and step (a) of Eq. (42), where the joint SIC decoding event for NO-MF is approximated as a product of per-link coverage probabilities: "(39b) is obtained by assuming the independence of the events SIR_i >= gamma, for i = 1, 2, . . . , k, as in [24] and [39]. Note that the numerical results in [24] show that ignoring the dependency among the events SIR_i >= gamma has negligible impact on the actual AFOT performance." This independence assumption is load-bearing for the NO-MF AFOT/AESE comparisons, and a direct multi-antenna validation of the joint event is not provided; however, it is a disclosed modeling approximation supported by an independent reference [39] and by the authors' own single-antenna numerical study, not a fitted parameter renamed as a prediction and not a quantity that is true by definition or by self-citation alone. Moreover, the central multi-antenna conclusion is also supported by the O-ZF and probabilistic-caching analyses, which do not rely on this independence approximation. No uniqueness theorem is imported from the authors' prior work, and no known result is merely renamed. The omitted proofs (e.g., Theorem 4 states its proof is similar to Appendix B and C and is omitted) are completeness gaps, not circular reductions.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The central claims rest on standard stochastic-geometry machinery (HPPP, PGFL, Laplace transforms) and on the modeling assumptions of a fully loaded, interference-limited network with Rayleigh fading and L >= K for ZF. Two paper-specific approximations are load-bearing: the independence of SIC success events in coded caching and the constant-replacement of a delta_k-dependent integral in the ZF bounds. No free parameters are fitted to data (all inputs, including Zipf skewness delta = 0.5, are stated model parameters), and no new physical entities are postulated.

assumptions (7)

domain assumption SBS locations form a homogeneous Poisson point process and the typical user can be placed at the origin (Slivnyak's theorem).
Section II: Phi_b is an HPPP of intensity lambda_b; the entire analysis conditions on the typical user at the origin.
domain assumption The network is fully loaded (lambda_u >> lambda_b), every SBS is active, and the system is interference-limited so noise is ignored.
Section II-B: 'fully loaded system so that all the SBSs in the network are active at any time' and 'interference-limited network where the noise can be neglected'.
domain assumption ZF feasibility requires L >= K, and every K-th order Voronoi cell contains K users so that all K SBSs in a cluster are simultaneously serving someone.
Section II-B1: 'We assume that L >= K to ensure the feasibility of ZF beamforming'; 'there will always exist K users in the Voronoi cell'.
standard math The k-1 SBSs closer than the serving SBS are independently and uniformly distributed in the disk B(0, r_k).
Appendix A, Eq. (58), step (b): 'the locations of K-1 SBSs are independently and uniformly distributed in the circle area B(0, r_k)'; a standard thinned-HPPP conditioning result.
standard math Alzer's inequality, the PGFL of the HPPP, and Laplace-transform properties of Gamma and exponential interference are valid for bounding and evaluating the coverage probabilities.
Appendix A Eq. (59) (PGFL) and Appendix B ('From the Alzer's Inequality [41], [42]') anchor the exact and bound expressions.
ad hoc to paper The SIC success events SIR_i >= gamma are independent across serving SBSs, and the minimum-rate event in NO-MF ESE factors into a product of per-link events.
Eq. (39b) 'obtained by assuming the independence of the events SIR_i >= gamma'; Eq. (42) step (a); validity is claimed via the authors' own [24] and [39].
ad hoc to paper In the ZF coverage bound, the delta_k-dependent integral A((kappa gamma l)^(-2/alpha) delta_k^2) can be replaced by a constant computed from E[delta_k^2] = k/K.
Appendix C, Eqs. (67)-(72): 'we approximate the integral in it as a constant value according to randomness of delta_k', following [33, Eqn. (28)]; no error bound is given.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Modeling, Analysis, and Optimization of Caching in Multi-Antenna Small-Cell Networks." pith.science (2026). https://pith.science/paper/SOGPGJ2O

@misc{pith2026190806595,
  author       = {Pith},
  title        = {Pith review of: Modeling, Analysis, and Optimization of Caching in Multi-Antenna Small-Cell Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SOGPGJ2O}},
  note         = {Machine review of arXiv:1908.06595}
}

read the original abstract

In traditional cache-enabled small-cell networks (SCNs), a user can suffer strong interference due to contentcentric base station association. This may degenerate the advantage of collaborative content caching among multiple small base stations (SBSs), including probabilistic caching and coded caching. In this work, we tackle this issue by deploying multiple antennas at each SBS for interference management. Two types of beamforming are considered. One is matched-filter (MF) to strengthen the effective channel gain of the desired signal, and the other is zero-forcing (ZF) to cancel interference within a selected SBS cooperation group. We apply these two beamforming techniques in both probabilistic caching and coded caching, and conduct performance analysis using stochastic geometry. We obtain exact and approximate compact integral expressions of system performances measured by average fractional offloaded traffic (AFOT) and average ergodic spectral efficiency (AESE). Based on these expressions, we then optimize the caching parameters for AFOT or AESE maximization. For probabilistic caching, optimal caching solutions are obtained. For coded caching, an efficient greedy-based algorithm is proposed. Numerical results show that multiple antennas can boost the advantage of probabilistic caching and coded caching over the traditional most popular caching with the proper use of beamforming.

Figures

Figures reproduced from arXiv: 1908.06595 by the authors.

**Figure 1.** Coverage probability in MF. SIR Target (dB) -15 -10 -5 0 5 10 15 20 Coverage Probability 0 0.2 0.4 0.6 0.8 1 K=L=2 analytical results (18) approximate upper bound (21) approximate lower bound (22) simulation results k=1 k=2 [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗

**Figure 3.** Coverage probability in NO-MF. Number of Antennas L 1 2 3 4 5 6 7 8 AFOT 0 0.1 0.2 0.3 0.4 0.5 0.6 ZF-OPC MF-OPC ZF-MPC MF-MPC K=3 K=6 SIR Target: -10 dB SIR Target: 10 dB [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗

**Figure 5.** AESE for different L in probabilistic caching. SIR Target (dB) -15 -10 -5 0 5 10 15 20 AFOT 0 0.1 0.2 0.3 0.4 0.5 0.6 K=3 O-ZF Algorithm 1 O-ZF Exhaustive Search NO-MF Algorithm 1 NO-MF Exhaustive Search L=5 L=3 [PITH_FULL_IMAGE:figures/full_fig_p011_5.png] view at source ↗

Figures from the paper (2 more)

**Figure 7.** Figure 7: AFOT for different L in coded caching. Number of Antennas L 1 2 3 4 5 6 AESE (bps/Hz) 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 K=3 O-ZF-CC NO-MF-CC ZF-MPC MF-MPC [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]

**Figure 9.** Figure 9: AFOT for different L in probabilistic caching with imperfect CSI (γ = −10 dB). Number of Antennas L 2 3 4 5 AFOT 0.08 0.09 0.1 0.11 0.12 0.13 0.14 0.15 0.16 0.17 0.18 K=3 ZF-OPC-Perfect CSI ZF-OPC-Imperfect CSI with B=8 ZF-OPC-Imperfect CSI with B=20 MF-OPC-Perfect CSI…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 39 canonical work pages

[24]

Modeling, analysis, and optimization of coded caching in small-cell networks,

X. Xu and M. Tao, “Modeling, analysis, and optimization of coded caching in small-cell networks,” IEEE Trans. Commun. , vol. 65, no. 8, pp. 3415–3428, Aug. 2017

work page 2017
[1]

Analysis and optimization of probabili stic caching in multi-antenna small-cell networks,

X. Xu and M. Tao, “Analysis and optimization of probabili stic caching in multi-antenna small-cell networks,” in IEEE Proc. Global Commun. Conf. (GLOBECOM) , Dec. 2017, pp. 1–6

work page 2017
[2]

Living on the edge: T he role of proactive caching in 5g wireless networks,

E. Bastug, M. Bennis, and M. Debbah, “Living on the edge: T he role of proactive caching in 5g wireless networks,” IEEE Commun. Mag. , vol. 52, no. 8, pp. 82–89, Aug. 2014

work page 2014
[3]

Femtocaching: Wireless content delivery throug h distributed caching helpers,

K. Shanmugam, N. Golrezaei, A. G. Dimakis, A. F. Molisch, and G. Caire, “Femtocaching: Wireless content delivery throug h distributed caching helpers,” IEEE Trans. Inf. Theory , vol. 59, no. 12, pp. 8402– 8413, Dec. 2013

work page 2013
[4]

C ache in the air: exploiting content caching and delivery techniq ues for 5g systems,

X. Wang, M. Chen, T. Taleb, A. Ksentini, and V . C. Leung, “C ache in the air: exploiting content caching and delivery techniq ues for 5g systems,” IEEE Commun. Mag. , vol. 52, no. 2, pp. 131–139, Feb. 2014

work page 2014
[5]

Fem- tocaching and device-to-device collaboration: A new archi tecture for wireless video distribution,

N. Golrezaei, A. F. Molisch, A. G. Dimakis, and G. Caire, “ Fem- tocaching and device-to-device collaboration: A new archi tecture for wireless video distribution,” IEEE Commun. Mag. , vol. 51, no. 4, pp. 142–149, Apr. 2013

work page 2013
[6]

World wide web caching: Trend s and techniques,

G. Barish and K. Obraczke, “World wide web caching: Trend s and techniques,” IEEE Commun. mag. , vol. 38, no. 5, pp. 178–184, May. 2000

work page 2000
[7]

Joint ca ching, routing, and channel assignment for collaborative small-cell cellu lar networks,

A. Khreishah, J. Chakareski, and A. Gharaibeh, “Joint ca ching, routing, and channel assignment for collaborative small-cell cellu lar networks,” IEEE J. Sel. Areas Commun. , vol. 34, no. 8, pp. 2275–2284, Aug. 2016

work page 2016

Show all 42 references

[8]

W ireless caching: technical misconceptions and business barriers,

G. Paschos, E. Bastug, I. Land, G. Caire, and M. Debbah, “W ireless caching: technical misconceptions and business barriers, ” IEEE Com- mun. Mag. , vol. 54, no. 8, pp. 16–22, Aug. 2016

2016
[9]

Cach e-enabled small cell networks: Modeling and tradeoffs,

E. Bastug, M. Bennis, M. Kountouris, and M. Debbah, “Cach e-enabled small cell networks: Modeling and tradeoffs,” EURASIP J. on Wireless Commun. and Netw. , vol. 2015, no. 1, pp. 1–11, Feb. 2015

2015
[10]

Analysis on cache-e nabled wire- less heterogeneous networks,

C. Y ang, Y . Y ao, Z. Chen, and B. Xia, “Analysis on cache-e nabled wire- less heterogeneous networks,” IEEE Trans. Wireless Commun , vol. 15, no. 1, pp. 131–145, Jan. 2016

2016
[11]

Backha ul-aware caching placement for wireless networks,

X. Peng, J.-C. Shen, J. Zhang, and K. B. Letaief, “Backha ul-aware caching placement for wireless networks,” in IEEE Proc.Global Com- mun. Conf. (GLOBECOM) , Dec. 2015, pp. 1–6

2015
[12]

Optimal geographi c caching in cellular networks,

B. Blaszczyszyn and A. Giovanidis, “Optimal geographi c caching in cellular networks,” in IEEE Proc. Int. Conf. Commun (ICC) , Jun. 2015, pp. 3358–3363

2015
[13]

Caching placement in stochastic wireless caching helper networks: Channel selection diversity via c aching,

S. H. Chae and W. Choi, “Caching placement in stochastic wireless caching helper networks: Channel selection diversity via c aching,” IEEE Trans. Wireless Commun. , vol. 15, no. 10, pp. 6626–6637, Oct. 2016

2016
[14]

Analysis and optimization of cachi ng and multi- casting in large-scale cache-enabled heterogeneous wirel ess networks,

Y . Cui and D. Jiang, “Analysis and optimization of cachi ng and multi- casting in large-scale cache-enabled heterogeneous wirel ess networks,” IEEE Trans. Wireless Commun , vol. 16, no. 1, pp. 250–264, Jan. 2017

2017
[15]

Prob abilistic small-cell caching: Performance analysis and optimizatio n,

Y . Chen, M. Ding, J. Li, Z. Lin, G. Mao, and L. Hanzo, “Prob abilistic small-cell caching: Performance analysis and optimizatio n,” IEEE Trans. V eh. Technol., vol. 66, no. 5, pp. 4341–4354, May. 2017

2017
[16]

Efﬁcient vide o pricing and caching in heterogeneous networks,

J. Li, W. Chen, M. Xiao, F. Shu, and X. Liu, “Efﬁcient vide o pricing and caching in heterogeneous networks,” IEEE Trans. V eh. Techno., vol. 65, no. 10, pp. 8744–8751, Oct. 2016

2016
[17]

Caching in wireless small cell networks: A storage-bandwidth trade off,

S. T. ul Hassan, M. Bennis, P . H. J. Nardelli, and M. Latva -aho, “Caching in wireless small cell networks: A storage-bandwidth trade off,” IEEE Commun. Lett. , vol. 20, no. 6, pp. 1175–1178, Jun. 2016

2016
[18]

A learning-ba sed approach to caching in heterogenous small cell networks,

B. Bharath, K. Nagananda, and H. V . Poor, “A learning-ba sed approach to caching in heterogenous small cell networks,” IEEE Trans. Commun., vol. 64, no. 4, pp. 1674–1686, Apr. 2016

2016
[19]

Optimization and ana lysis of probabilistic caching in n -tier heterogeneous networks,

K. Li, C. Y ang, Z. Chen, and M. Tao, “Optimization and ana lysis of probabilistic caching in n -tier heterogeneous networks,” IEEE Trans. Wireless Commun., vol. 17, no. 2, pp. 1283–1297, Feb. 2018

2018
[20]

Optimizing MDS codes for caching at the edge,

V . Bioglio, F. Gabry, and I. Land, “Optimizing MDS codes for caching at the edge,” in IEEE Proc. Global Commun. Conf. (GLOBECOM) , Dec. 2015, pp. 1–6

2015
[21]

Opt imizing cache placement for heterogeneous small cell networks,

J. Liao, K. K. Wong, M. R. A. Khandaker, and Z. Zheng, “Opt imizing cache placement for heterogeneous small cell networks,” IEEE Commun. Lett., vol. 21, no. 1, pp. 120–123, Jan. 2017

2017
[22]

Coding for caches in the plane,

E. Altman, K. Avrachenkov, and J. Goseling, “Coding for caches in the plane,” arXiv preprint arXiv:1309.0604 , 2013

2013 arXiv
[23]

Cooper ative caching and transmission design in cluster-centric small cell netw orks,

Z. Chen, J. Lee, T. Q. S. Quek, and M. Kountouris, “Cooper ative caching and transmission design in cluster-centric small cell netw orks,” IEEE Trans. Wireless Commun. , vol. 16, no. 5, pp. 3401–3415, May. 2017

2017
[25]

Coded caching for wireless backhaul networks with unequal link rates,

A. Tang, S. Roy, and X. Wang, “Coded caching for wireless backhaul networks with unequal link rates,” IEEE Trans. Commun., vol. 66, no. 1, pp. 1–13, Jan. 2018

2018
[26]

Joint da ta assignment and beamforming for backhaul limited caching networks,

X. Peng, J. C. Shen, J. Zhang, and K. B. Letaief, “Joint da ta assignment and beamforming for backhaul limited caching networks,” in IEEE Proc. Int. Symp. Pers., Indoor , Mobile Radio Commun. (PIMRC) , Sep. 2014, pp. 1370–1374

2014
[27]

Content-centric spa rse multi- cast beamforming for cache-enabled cloud ran,

M. Tao, E. Chen, H. Zhou, and W. Y u, “Content-centric spa rse multi- cast beamforming for cache-enabled cloud ran,” IEEE Trans. Wireless Commun., vol. 15, no. 9, pp. 6118–6131, Sep. 2016

2016
[28]

Fundamental storage-l atency trade- off in cache-aided mimo interference networks,

Y . Cao, M. Tao, F. Xu, and K. Liu, “Fundamental storage-l atency trade- off in cache-aided mimo interference networks,” IEEE Trans. Wireless Commun., vol. 16, no. 8, pp. 5061–5076, Aug. 2017

2017
[29]

Treating content delivery in multi-a ntenna coded caching as general message sets transmission: A dof region p erspective,

Y . Cao and M. Tao, “Treating content delivery in multi-a ntenna coded caching as general message sets transmission: A dof region p erspective,” arXiv preprint arXiv:1807.01432 , 2018

2018 arXiv
[30]

Caching policy toward maximal succe ss probabil- ity and area spectral efﬁciency of cache-enabled HetNets,

D. Liu and C. Y ang, “Caching policy toward maximal succe ss probabil- ity and area spectral efﬁciency of cache-enabled HetNets,” IEEE Trans. Commun., vol. 65, no. 6, pp. 2699–2714, Jun. 2017

2017
[31]

Multi-antenna c ommunication in ad hoc networks: Achieving MIMO gains with SIMO transmiss ion,

N. Jindal, J. G. Andrews, and S. Weber, “Multi-antenna c ommunication in ad hoc networks: Achieving MIMO gains with SIMO transmiss ion,” IEEE Trans. Commun. , vol. 59, no. 2, pp. 529–540, Feb. 2011

2011
[32]

User-cen tric intercell interference nulling for downlink small cell networks,

C. Li, J. Zhang, M. Haenggi, and K. B. Letaief, “User-cen tric intercell interference nulling for downlink small cell networks,” IEEE Trans. Commun., vol. 63, no. 4, pp. 1419–1431, Apr. 2015

2015
[33]

Spectral efﬁciency of dynamic coordinated beamforming: A stochasti c geometry approach,

N. Lee, D. Morales-Jimenez, A. Lozano, and R. W. Heath, “ Spectral efﬁciency of dynamic coordinated beamforming: A stochasti c geometry approach,” IEEE Trans. Wireless Commun. , vol. 14, no. 1, pp. 230–241, Jan. 2015

2015
[34]

A tractable approach to coverage and rate in cellular networks,

J. G. Andrews, F. Baccelli, and R. K. Ganti, “A tractable approach to coverage and rate in cellular networks,” IEEE Trans. Commun. , vol. 59, no. 11, pp. 3122–3134, Nov. 2011

2011
[35]

Fundamental limits of c aching,

M. A. Maddah-Ali and U. Niesen, “Fundamental limits of c aching,” IEEE Trans. Inf. Theory , vol. 60, no. 5, pp. 2856–2867, May. 2014

2014
[36]

Performance of p zf and mmse receivers in cellular networks with multi-user spatial mul tiplexing,

S. T. V eetil, K. Kuchi, and R. K. Ganti, “Performance of p zf and mmse receivers in cellular networks with multi-user spatial mul tiplexing,” IEEE Trans. Wireless Commun. , vol. 14, no. 9, pp. 4867–4878, Sep. 2015

2015
[37]

On distances in uniformly random networks ,

M. Haenggi, “On distances in uniformly random networks ,” IEEE Trans. Inf. Theory , vol. 51, no. 10, pp. 3584–3586, Oct. 2005

2005
[38]

Distance distributions i n ﬁnite uniformly random networks: Theory and applications,

S. Srinivasa and M. Haenggi, “Distance distributions i n ﬁnite uniformly random networks: Theory and applications,” IEEE Trans. V eh. Technol., vol. 59, no. 2, pp. 940–949, Feb. 2010

2010
[39]

Successive interference cancellation in hete rogeneous networks,

M. Wildemeersch, T. Q. Quek, M. Kountouris, A. Rabbachi n, and C. H. Slump, “Successive interference cancellation in hete rogeneous networks,” IEEE Trans. Commun. , vol. 62, no. 12, pp. 4440–4453, Dec. 2014

2014
[40]

An overview of limited feedback in wireless com mu- nication systems,

D. J. Love, R. W. Heath, V . K. N. Lau, D. Gesbert, B. D. Rao, and M. Andrews, “An overview of limited feedback in wireless com mu- nication systems,” IEEE J. Sel. Areas Commun. , vol. 26, no. 8, pp. 1341–1365, Oct. 2008

2008
[41]

On some inequalities for the incomplete gamm a function,

H. Alzer, “On some inequalities for the incomplete gamm a function,” Math. Comput. , vol. 66, no. 218, pp. 771–778, Apr. 1997

1997
[42]

Space division multiple access with a sum feedback rate constraint,

K. Huang, R. W. Heath, and J. G. Andrews, “Space division multiple access with a sum feedback rate constraint,” IEEE Trans. Signal Pro- cessing, vol. 55, no. 7, pp. 3879–3891, Jul. 2007

2007

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [24]

Modeling, analysis, and optimization of coded caching in small-cell networks,

X. Xu and M. Tao, “Modeling, analysis, and optimization of coded caching in small-cell networks,” IEEE Trans. Commun. , vol. 65, no. 8, pp. 3415–3428, Aug. 2017

work page 2017

[2] [1]

Analysis and optimization of probabili stic caching in multi-antenna small-cell networks,

X. Xu and M. Tao, “Analysis and optimization of probabili stic caching in multi-antenna small-cell networks,” in IEEE Proc. Global Commun. Conf. (GLOBECOM) , Dec. 2017, pp. 1–6

work page 2017

[3] [2]

Living on the edge: T he role of proactive caching in 5g wireless networks,

E. Bastug, M. Bennis, and M. Debbah, “Living on the edge: T he role of proactive caching in 5g wireless networks,” IEEE Commun. Mag. , vol. 52, no. 8, pp. 82–89, Aug. 2014

work page 2014

[4] [3]

Femtocaching: Wireless content delivery throug h distributed caching helpers,

K. Shanmugam, N. Golrezaei, A. G. Dimakis, A. F. Molisch, and G. Caire, “Femtocaching: Wireless content delivery throug h distributed caching helpers,” IEEE Trans. Inf. Theory , vol. 59, no. 12, pp. 8402– 8413, Dec. 2013

work page 2013

[5] [4]

C ache in the air: exploiting content caching and delivery techniq ues for 5g systems,

X. Wang, M. Chen, T. Taleb, A. Ksentini, and V . C. Leung, “C ache in the air: exploiting content caching and delivery techniq ues for 5g systems,” IEEE Commun. Mag. , vol. 52, no. 2, pp. 131–139, Feb. 2014

work page 2014

[6] [5]

Fem- tocaching and device-to-device collaboration: A new archi tecture for wireless video distribution,

N. Golrezaei, A. F. Molisch, A. G. Dimakis, and G. Caire, “ Fem- tocaching and device-to-device collaboration: A new archi tecture for wireless video distribution,” IEEE Commun. Mag. , vol. 51, no. 4, pp. 142–149, Apr. 2013

work page 2013

[7] [6]

World wide web caching: Trend s and techniques,

G. Barish and K. Obraczke, “World wide web caching: Trend s and techniques,” IEEE Commun. mag. , vol. 38, no. 5, pp. 178–184, May. 2000

work page 2000

[8] [7]

Joint ca ching, routing, and channel assignment for collaborative small-cell cellu lar networks,

A. Khreishah, J. Chakareski, and A. Gharaibeh, “Joint ca ching, routing, and channel assignment for collaborative small-cell cellu lar networks,” IEEE J. Sel. Areas Commun. , vol. 34, no. 8, pp. 2275–2284, Aug. 2016

work page 2016