Joint Fronthaul Multicast and Cooperative Beamforming for Cache-Enabled Cloud-Based Small Cell Networks: An MDS Codes-Aided Approach

P. C. Ching; Qiang Li; Victor C. M. Leung; Xiongwei Wu

arxiv: 1907.08756 · v1 · pith:ZQSCHLYAnew · submitted 2019-07-20 · 💻 cs.IT · eess.SP· math.IT

Joint Fronthaul Multicast and Cooperative Beamforming for Cache-Enabled Cloud-Based Small Cell Networks: An MDS Codes-Aided Approach

Xiongwei Wu , Qiang Li , Victor C. M. Leung , P. C. Ching This is my paper

Pith reviewed 2026-05-24 19:01 UTC · model grok-4.3

classification 💻 cs.IT eess.SPmath.IT

keywords MDS codescoded cachingcloud-based small cell networksfronthaul multicastcooperative beamformingcontent delivery latencypenalty-based optimizationSBS clustering

0 comments

The pith

MDS codes-aided scheme jointly optimizes fronthaul multicast and beamforming to minimize latency in cache-enabled C-SCNs.

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

The paper develops an MDS codes-aided transmission scheme for cache-enabled cloud-based small cell networks where small-cell base stations prefetch popular contents using maximum distance separable codes. The scheme jointly optimizes fronthaul bandwidth allocation, SBS clustering, and beamforming to minimize content delivery latency. A penalty-based design leverages variational reformulations of binary constraints to solve the nonlinear integer program, supplemented by a greedy clustering method. Closed-form characterization of the optimal solution quantifies the latency benefits of MDS codes, with simulations showing significant improvements over conventional schemes.

Core claim

By applying MDS codes for content prefetching at the SBSs, the transmission scheme enables fronthaul multicast opportunities and cooperative beamforming. The latency minimization problem is addressed through a penalty-based algorithm that converts the mixed-integer program into a solvable form, with additional closed-form expressions that directly measure how MDS coding reduces the required transmission resources compared to uncoded approaches.

What carries the argument

The MDS codes-aided transmission scheme together with penalty-based joint optimization of bandwidth allocation, SBS clustering, and beamforming, supported by variational reformulation and closed-form solution analysis.

If this is right

Closed-form expressions directly quantify the reduction in content delivery latency attributable to MDS coding.
The penalty-based approach converts the original integer program into a tractable continuous optimization.
A greedy SBS clustering step can be added to refine the penalty solution further.
The scheme demonstrates that coded caching alleviates saturation on capacity-limited fronthaul links.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The closed-form latency expressions could support parameter tuning in networks with time-varying content popularity.
Similar variational penalty techniques might apply to clustering problems in other cooperative wireless systems.
The quantified MDS benefits suggest comparisons with other coded caching families such as random linear codes.
The framework may extend to multi-tier networks by incorporating additional fronthaul tiers.

Load-bearing premise

The variational reformulation of binary clustering constraints combined with the penalty method yields a solution whose performance is close to the global optimum of the original nonlinear integer program.

What would settle it

For small network instances where exhaustive enumeration of all SBS clusterings is feasible, if the latency achieved by the penalty-based solution exceeds the true minimum by a large margin, the near-optimality claim would be falsified.

Figures

Figures reproduced from arXiv: 1907.08756 by P. C. Ching, Qiang Li, Victor C. M. Leung, Xiongwei Wu.

**Figure 2.** Figure 2: Convergence behavior of inexact BCU-SCA design [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗

**Figure 3.** Figure 3: Average network latency versus the number of BSs. [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗

**Figure 5.** Figure 5: Effects of the caching capacity of each BS. 0 10 20 30 40 50 60 70 80 90 Tatol fronthaul capacity (Mbps) 102 103 104 Average network latency (channel use) FCD-MDS FCD-Uncoded I FCD-Uncoded II ProbC-MDS ProbC-Uncoded I ProbC-Uncoded II [PITH_FULL_IMAGE:figures/full_fig_p011_5.png] view at source ↗

read the original abstract

The performance of cloud-based small cell networks (C-SCNs) relies highly on a capacity-limited fronthaul, which degrade quality of service when it is saturated. Coded caching is a promising approach to addressing these challenges, as it provides abundant opportunities for fronthaul multicast and cooperative transmissions. This paper investigates a cache-enabled C-SCNs, in which small-cell base stations (SBSs) are connected to the central processor via fronthaul, and can prefetch popular contents by applying maximum distance separable (MDS) codes. To fully capture the benefits of fronthaul multicast and cooperative transmissions, an MDS codes-aided transmission scheme is first proposed. We formulate the problem to minimize the content delivery latency by jointly optimizing fronthaul bandwidth allocation, SBS clustering, and beamforming. To efficiently solve the resulting nonlinear integer programming problem, we propose a penalty-based design by leveraging variational reformulations of binary constraints. To improve the solution of the penalty-based design, a greedy SBS clustering design is also developed. Furthermore, closed-form characterization of the optimal solution is obtained, through which the benefits of MDS codes can be quantified. Simulation results are given to demonstrate the significant benefits of the proposed MDS codes-aided transmission scheme.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The penalty method for binary clustering has no supporting analysis that it approximates the global optimum, so the latency and MDS-gain claims rest on an unverified heuristic.

read the letter

The main thing here is that the paper proposes an MDS-coded caching scheme for cloud small-cell networks and then solves the joint fronthaul allocation, clustering, and beamforming problem with a penalty reformulation of the binary variables. They also claim a closed-form characterization that quantifies the MDS benefits. That combination is the concrete new piece they are offering for this setting. The problem setup itself makes sense for fronthaul-limited networks where multicast and cooperation can be exploited through coded prefetching. The greedy clustering alternative they add is a practical touch. The closed-form part could be the most reusable element if the derivation is clean. The soft spot is the optimization step. The abstract says the penalty method is used because the original problem is a hard nonlinear integer program, yet it supplies no duality-gap bound, no convergence result for the original objective, and no comparison against exact solvers on small instances. Without that, it is unclear how much of the reported latency reduction comes from the MDS scheme versus how much is an artifact of the heuristic. The simulations are described only as demonstrating benefits, with no baselines or quantitative details visible in the abstract. This is the kind of work that wireless caching researchers might want to see, especially if they are looking for concrete joint-design examples. A reader who already works in this subfield could extract the formulation and the closed-form result even if the numerical claims need checking. It is worth sending to referees so the authors can either supply the missing validation or clarify the scope of the heuristic.

Referee Report

1 major / 2 minor

Summary. The paper proposes an MDS codes-aided transmission scheme for cache-enabled cloud-based small cell networks (C-SCNs) to minimize content delivery latency. It jointly optimizes fronthaul bandwidth allocation, SBS clustering, and beamforming under an MDS-coded caching setup that enables fronthaul multicast and cooperative transmissions. The resulting nonlinear integer program is addressed via a penalty-based design that applies variational reformulations to the binary clustering constraints, augmented by a greedy SBS clustering heuristic; closed-form characterizations of the optimal solution are derived to quantify MDS-code gains, with simulations claimed to demonstrate benefits.

Significance. If the penalty-based heuristic reliably approximates the global optimum, the closed-form latency expressions could provide analytical insight into the latency reductions achievable by MDS coding in fronthaul-limited C-SCNs. The joint multicast-cooperation formulation addresses a practically relevant tension between fronthaul capacity and content delivery.

major comments (1)

[Abstract and penalty-based design description] Abstract (paragraph on penalty-based design): the claim that the variational reformulation of binary clustering constraints plus the penalty term produces a solution whose latency is close to the global minimum of the original nonlinear integer program lacks supporting analysis. No duality-gap bound, convergence guarantee to a stationary point of the original problem, or comparison against exact solvers on small instances is supplied. Because the reported latency reductions and the quantified MDS-code benefit rest directly on this unverified heuristic, the central performance claims cannot be assessed without such verification.

minor comments (2)

[Abstract] Abstract: the statement that 'simulation results are given to demonstrate the significant benefits' supplies no baselines, numerical gain values, convergence information, or error-bar details, which weakens the ability to interpret the empirical support.
[Optimization formulation] Notation: ensure that the penalty parameter, the auxiliary variables introduced by the variational reformulation, and the mapping from the relaxed solution back to feasible binary clusters are defined with explicit symbols before they appear in the optimization problem.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive comment on the validation of the penalty-based design. We address it point by point below.

read point-by-point responses

Referee: [Abstract and penalty-based design description] Abstract (paragraph on penalty-based design): the claim that the variational reformulation of binary clustering constraints plus the penalty term produces a solution whose latency is close to the global minimum of the original nonlinear integer program lacks supporting analysis. No duality-gap bound, convergence guarantee to a stationary point of the original problem, or comparison against exact solvers on small instances is supplied. Because the reported latency reductions and the quantified MDS-code benefit rest directly on this unverified heuristic, the central performance claims cannot be assessed without such verification.

Authors: We acknowledge that the manuscript provides no duality-gap bound, convergence guarantee to a stationary point of the original integer program, or numerical comparison against exact solvers on small instances. The penalty-based approach with variational reformulation of the binary constraints is adopted as a standard technique to obtain a tractable non-convex program, with the greedy SBS clustering heuristic added to improve solution quality. To address the concern directly, we will revise the manuscript by adding a dedicated numerical study that compares the proposed method against exhaustive search (or branch-and-bound) on small instances with few SBSs; this will empirically quantify the gap to the global minimum and thereby support the reported latency reductions and MDS-code benefits. The closed-form characterizations remain independent of the solver and quantify MDS gains under the jointly optimized parameters. revision: yes

Circularity Check

0 steps flagged

No circularity: optimization formulation and heuristic solution are independent of claimed outputs

full rationale

The paper poses a standard joint optimization problem over fronthaul allocation, clustering and beamforming to minimize an external latency metric, then applies a penalty-based variational reformulation (a conventional technique for integer constraints) followed by a greedy heuristic and closed-form solution extraction. None of these steps reduce by construction to the latency values or MDS-code benefits they report; the closed-form simply solves the formulated problem under the chosen relaxation, and simulations compare against that external metric. No self-citation chains, self-definitional quantities, or fitted inputs renamed as predictions appear in the derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated. Standard wireless channel and cache-popularity models are implicitly assumed but not enumerated.

pith-pipeline@v0.9.0 · 5772 in / 1082 out tokens · 23569 ms · 2026-05-24T19:01:30.393940+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

35 extracted references · 35 canonical work pages · 1 internal anchor

[1]

Fronthauling for 5G LTE-U ultra dense cloud small cell netw orks,

H. Zhang, Y . Dong, J. Cheng, M. J. Hossain, and V . C. Leung, “Fronthauling for 5G LTE-U ultra dense cloud small cell netw orks,” IEEE Wireless Commun. , vol. 23, no. 6, pp. 48–53, Dec. 2016. 12

work page 2016
[2]

Parallel optimization framework for cloud-based small cell networks,

W. Hardjawana, N. I. A. Apandi, and B. Vucetic, “Parallel optimization framework for cloud-based small cell networks,” IEEE Trans. Wireless Commun., vol. 15, no. 11, pp. 7286–7298, Nov. 2016

work page 2016
[3]

Cloud-ba sed wireless network: Virtualized, reconﬁgurable, smart wire less network to enable 5G technologies,

M. Chen, Y . Zhang, L. Hu, T. Taleb, and Z. Sheng, “Cloud-ba sed wireless network: Virtualized, reconﬁgurable, smart wire less network to enable 5G technologies,” Mobile Networks and Applications , vol. 20, no. 6, pp. 704–712, Feb. 2015

work page 2015
[4]

Femtocaching: Wireless video content delivery t hrough distributed caching helpers,

N. Golrezaei, K. Shanmugam, A. G. Dimakis, A. F. Molisch, and G. Caire, “Femtocaching: Wireless video content delivery t hrough distributed caching helpers,” in INFOCOM, 2012 Proceedings IEEE . IEEE, Sept. 2012, pp. 1107–1115

work page 2012
[5]

Content-centric spar se multicast beamforming for cache-enabled cloud RAN,

M. Tao, E. Chen, H. Zhou, and W. Y u, “Content-centric spar se multicast beamforming for cache-enabled cloud RAN,” IEEE Trans. Wireless Commun., vol. 15, no. 9, pp. 6118–6131, Sept. 2016

work page 2016
[6]

Layered grou p sparse beamforming for cache-enabled green wireless networks,

X. Peng, Y . Shi, J. Zhang, and K. B. Letaief, “Layered grou p sparse beamforming for cache-enabled green wireless networks,” IEEE Trans. Commun., vol. 65, no. 12, pp. 5589–5603, Aug. 2017

work page 2017
[7]

Hierarc hical edge caching in device-to-device aided mobile networks: Mo deling, optimization, and design,

X. Li, X. Wang, P .-J. Wan, Z. Han, and V . C. Leung, “Hierarc hical edge caching in device-to-device aided mobile networks: Mo deling, optimization, and design,” IEEE J. Sel. Areas Commun. , June 2018

work page 2018
[8]

Codi ng, multicast, and cooperation for cache-enabled heterogeneo us small cell networks,

J. Liao, K.-K. Wong, Y . Zhang, Z. Zheng, and K. Y ang, “Codi ng, multicast, and cooperation for cache-enabled heterogeneo us small cell networks,” IEEE Trans. Wireless Commun. , vol. 16, no. 10, pp. 6838– 6853, Oct. 2017

work page 2017
[9]

Opti- mizing MDS coded caching in wireless networks with device-t o-device communication,

J. Pedersen, A. G. i Amat, I. Andriyanova, and F. Brännstr öm, “Opti- mizing MDS coded caching in wireless networks with device-t o-device communication,” IEEE Trans. Wireless Commun. , vol. 18, no. 1, pp. 286–295, Jan. 2019

work page 2019
[10]

On energy-efﬁcient e dge caching in heterogeneous networks,

F. Gabry, V . Bioglio, and I. Land, “On energy-efﬁcient e dge caching in heterogeneous networks,” IEEE J. Sel. Areas Commun. , vol. 34, no. 12, pp. 3288–3298, Dec. 2016

work page 2016
[11]

Caching and coded mul- ticasting: Multiple groupcast index coding,

M. Ji, A. M. Tulino, J. Llorca, and G. Caire, “Caching and coded mul- ticasting: Multiple groupcast index coding,” in Proc. IEEE GlobalSIP , Dec. 2014, pp. 881–885

work page 2014
[12]

Opti mizing cache placement for heterogeneous small cell networks,

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

work page 2017
[13]

Optimizing MDS codes for caching at the edge,

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

work page 2015
[14]

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

work page 2014
[15]

Fog-aided wire less networks for content delivery: Fundamental latency tradeoffs,

A. Sengupta, R. Tandon, and O. Simeone, “Fog-aided wire less networks for content delivery: Fundamental latency tradeoffs,” IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6650–6678, Oct. 2017

work page 2017
[16]

Delivery time minimization in edge caching: Synergistic beneﬁts of s ubspace alignment and zero forcing,

J. Kakar, A. Alameer, A. Chaaban, A. Sezgin, and A. Paulr aj, “Delivery time minimization in edge caching: Synergistic beneﬁts of s ubspace alignment and zero forcing,” in Proc. IEEE ICC , May 2018, pp. 1–6

work page 2018
[17]

Joint cloud and e dge processing for latency minimization in Fog radio access networks,

S.-H. Park, O. Simeone, and S. Shamai, “Joint cloud and e dge processing for latency minimization in Fog radio access networks,” in Proc. IEEE SPAWC. IEEE, July 2016, pp. 1–5

work page 2016
[18]

Content delivery design for cache-a ided cloud radio access network to achieve low latency,

X. Wu and P . Ching, “Content delivery design for cache-a ided cloud radio access network to achieve low latency,” in Proc. IEEE ICASSP , Apr. 2018, pp. 3749–3753

work page 2018
[19]

Joint optimization of user association, data delivery rate and pr ecoding for cache-enabled F-RANs,

T. T. Vu, D. T. Ngo, L. Ong, S. Durrani, and R. H. Middleton , “Joint optimization of user association, data delivery rate and pr ecoding for cache-enabled F-RANs,” in Proc. IEEE GLOBECOM , Dec. 2017, pp. 1–6

work page 2017
[20]

Mixed-timescale precoding and cac he control in cached MIMO interference network,

A. Liu and V . K. Lau, “Mixed-timescale precoding and cac he control in cached MIMO interference network,” IEEE Trans. Signal Process. , vol. 61, no. 24, pp. 6320–6332, Dec. 2013

work page 2013
[21]

Coded mul ticast fronthauling and edge caching for multi-connectivity tran smission in Fog radio access networks,

S.-H. Park, O. Simeone, W. Lee, and S. Shamai, “Coded mul ticast fronthauling and edge caching for multi-connectivity tran smission in Fog radio access networks,” in Proc. IEEE SPAWC, 2017, pp. 1–5

work page 2017
[22]

Cloud radio access ne tworks with coded caching,

Y . Ugur, Z. H. Awan, and A. Sezgin, “Cloud radio access ne tworks with coded caching,” in WSA 2016; 20th International ITG W orkshop on Smart Antennas . VDE, Mar. 2016, pp. 1–5

work page 2016
[23]

Joint front haul mul- ticast beamforming and user-centric clustering in downlin k C-RANs,

B. Hu, C. Hua, J. Zhang, C. Chen, and X. Guan, “Joint front haul mul- ticast beamforming and user-centric clustering in downlin k C-RANs,” IEEE Trans. Wireless Commun. , vol. 16, no. 8, pp. 5395–5409, Aug. 2017

work page 2017
[24]

QoE drive n BS clustering and multicast beamforming in cache-enabled C-R ANs,

R. Sun, Y . Wang, N. Cheng, H. Zhou, and X. Shen, “QoE drive n BS clustering and multicast beamforming in cache-enabled C-R ANs,” in Proc. IEEE ICC , May 2018, pp. 1–6

work page 2018
[25]

Joint beamformer des ign for wireless fronthaul and access links in C-RANs,

B. Hu, C. Hua, C. Chen, and X. Guan, “Joint beamformer des ign for wireless fronthaul and access links in C-RANs,” IEEE Trans. Wireless Commun., vol. 17, no. 5, pp. 2869–2881, 2018

work page 2018
[26]

Joint optimiza tion of cloud and edge processing for Fog radio access networks,

S.-H. Park, O. Simeone, and S. S. Shitz, “Joint optimiza tion of cloud and edge processing for Fog radio access networks,” IEEE Trans. Wireless Commun., vol. 15, no. 11, pp. 7621–7632, Sept. 2016

work page 2016
[27]

Coll aborative multicast beamforming for content delivery by cache-enabl ed ultra dense networks,

H. Nguyen, H. Tuan, T. Duong, H. Poor, and W. Hwang, “Coll aborative multicast beamforming for content delivery by cache-enabl ed ultra dense networks,” IEEE Trans. Commun. , Jan. 2019

work page 2019
[28]

Cloud-aided edge caching with wireless multicast fronthauling in Fog radio access ne tworks,

J. Koh, O. Simeone, R. Tandon, and J. Kang, “Cloud-aided edge caching with wireless multicast fronthauling in Fog radio access ne tworks,” in Proc. IEEE WCNC , Mar. 2017, pp. 1–6

work page 2017
[29]

Distributed caching for data dissemination in the downlink of heterogen eous net- works,

J. Li, Y . Chen, Z. Lin, W. Chen, B. Vucetic, and L. Hanzo, “ Distributed caching for data dissemination in the downlink of heterogen eous net- works,” IEEE Trans. Commun. , vol. 63, no. 10, pp. 3553–3568, Oct. 2015

work page 2015
[30]

Quali ty of service and max-min fair transmit beamforming to multiple cochanne l multicast groups,

E. Karipidis, N. D. Sidiropoulos, and Z.-Q. Luo, “Quali ty of service and max-min fair transmit beamforming to multiple cochanne l multicast groups,” IEEE Trans. Signal Process. , vol. 56, no. 3, pp. 1268–1279, Mar. 2008

work page 2008
[31]

Binary Optimization via Mathematical Programming with Equilibrium Constraints

G. Y uan and B. Ghanem, “Binary optimization via mathema t- ical programming with equilibrium constraints,” arXiv preprint arXiv:1608.04425, 2016

work page internal anchor Pith review Pith/arXiv arXiv 2016
[32]

Successive convex quadratic programming for quality-of-service management in full-du plex MU- MIMO multicell networks,

H. H. M. Tam, H. D. Tuan, and D. T. Ngo, “Successive convex quadratic programming for quality-of-service management in full-du plex MU- MIMO multicell networks,” IEEE Trans. Commun. , vol. 64, no. 6, pp. 2340–2353, June 2016

work page 2016
[33]

CVX: Matlab software for di sciplined convex programming,

M. Grant, S. Boyd, and Y . Y e, “CVX: Matlab software for di sciplined convex programming,” 2008

work page 2008
[34]

Joint long- term cache allocation and short-term content delivery in green c loud small cell networks,

X. Wu, Q. Li, X. Li, V . C. Leung, and P . Ching, “Joint long- term cache allocation and short-term content delivery in green c loud small cell networks,” in Proc. IEEE ICC , May, 2019, pp. 1–6

work page 2019
[35]

A distribute d numerical approach to interference alignment and applications to wir eless interfer- ence networks,

K. Gomadam, V . R. Cadambe, and S. A. Jafar, “A distribute d numerical approach to interference alignment and applications to wir eless interfer- ence networks,” IEEE Trans. Inf. Theory , vol. 57, no. 6, pp. 3309–3322, Jane 2011. Xiongwei Wu (S’18) received the B.Eng. in Elec- tronic Information Engineering from University of Electronic Science and Techno...

work page 2011

[1] [1]

Fronthauling for 5G LTE-U ultra dense cloud small cell netw orks,

H. Zhang, Y . Dong, J. Cheng, M. J. Hossain, and V . C. Leung, “Fronthauling for 5G LTE-U ultra dense cloud small cell netw orks,” IEEE Wireless Commun. , vol. 23, no. 6, pp. 48–53, Dec. 2016. 12

work page 2016

[2] [2]

Parallel optimization framework for cloud-based small cell networks,

W. Hardjawana, N. I. A. Apandi, and B. Vucetic, “Parallel optimization framework for cloud-based small cell networks,” IEEE Trans. Wireless Commun., vol. 15, no. 11, pp. 7286–7298, Nov. 2016

work page 2016

[3] [3]

Cloud-ba sed wireless network: Virtualized, reconﬁgurable, smart wire less network to enable 5G technologies,

M. Chen, Y . Zhang, L. Hu, T. Taleb, and Z. Sheng, “Cloud-ba sed wireless network: Virtualized, reconﬁgurable, smart wire less network to enable 5G technologies,” Mobile Networks and Applications , vol. 20, no. 6, pp. 704–712, Feb. 2015

work page 2015

[4] [4]

Femtocaching: Wireless video content delivery t hrough distributed caching helpers,

N. Golrezaei, K. Shanmugam, A. G. Dimakis, A. F. Molisch, and G. Caire, “Femtocaching: Wireless video content delivery t hrough distributed caching helpers,” in INFOCOM, 2012 Proceedings IEEE . IEEE, Sept. 2012, pp. 1107–1115

work page 2012

[5] [5]

Content-centric spar se multicast beamforming for cache-enabled cloud RAN,

M. Tao, E. Chen, H. Zhou, and W. Y u, “Content-centric spar se multicast beamforming for cache-enabled cloud RAN,” IEEE Trans. Wireless Commun., vol. 15, no. 9, pp. 6118–6131, Sept. 2016

work page 2016

[6] [6]

Layered grou p sparse beamforming for cache-enabled green wireless networks,

X. Peng, Y . Shi, J. Zhang, and K. B. Letaief, “Layered grou p sparse beamforming for cache-enabled green wireless networks,” IEEE Trans. Commun., vol. 65, no. 12, pp. 5589–5603, Aug. 2017

work page 2017

[7] [7]

Hierarc hical edge caching in device-to-device aided mobile networks: Mo deling, optimization, and design,

X. Li, X. Wang, P .-J. Wan, Z. Han, and V . C. Leung, “Hierarc hical edge caching in device-to-device aided mobile networks: Mo deling, optimization, and design,” IEEE J. Sel. Areas Commun. , June 2018

work page 2018

[8] [8]

Codi ng, multicast, and cooperation for cache-enabled heterogeneo us small cell networks,

J. Liao, K.-K. Wong, Y . Zhang, Z. Zheng, and K. Y ang, “Codi ng, multicast, and cooperation for cache-enabled heterogeneo us small cell networks,” IEEE Trans. Wireless Commun. , vol. 16, no. 10, pp. 6838– 6853, Oct. 2017

work page 2017

[9] [9]

Opti- mizing MDS coded caching in wireless networks with device-t o-device communication,

J. Pedersen, A. G. i Amat, I. Andriyanova, and F. Brännstr öm, “Opti- mizing MDS coded caching in wireless networks with device-t o-device communication,” IEEE Trans. Wireless Commun. , vol. 18, no. 1, pp. 286–295, Jan. 2019

work page 2019

[10] [10]

On energy-efﬁcient e dge caching in heterogeneous networks,

F. Gabry, V . Bioglio, and I. Land, “On energy-efﬁcient e dge caching in heterogeneous networks,” IEEE J. Sel. Areas Commun. , vol. 34, no. 12, pp. 3288–3298, Dec. 2016

work page 2016

[11] [11]

Caching and coded mul- ticasting: Multiple groupcast index coding,

M. Ji, A. M. Tulino, J. Llorca, and G. Caire, “Caching and coded mul- ticasting: Multiple groupcast index coding,” in Proc. IEEE GlobalSIP , Dec. 2014, pp. 881–885

work page 2014

[12] [12]

Opti mizing cache placement for heterogeneous small cell networks,

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

work page 2017

[13] [13]

Optimizing MDS codes for caching at the edge,

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

work page 2015

[14] [14]

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

work page 2014

[15] [15]

Fog-aided wire less networks for content delivery: Fundamental latency tradeoffs,

A. Sengupta, R. Tandon, and O. Simeone, “Fog-aided wire less networks for content delivery: Fundamental latency tradeoffs,” IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6650–6678, Oct. 2017

work page 2017

[16] [16]

Delivery time minimization in edge caching: Synergistic beneﬁts of s ubspace alignment and zero forcing,

J. Kakar, A. Alameer, A. Chaaban, A. Sezgin, and A. Paulr aj, “Delivery time minimization in edge caching: Synergistic beneﬁts of s ubspace alignment and zero forcing,” in Proc. IEEE ICC , May 2018, pp. 1–6

work page 2018

[17] [17]

Joint cloud and e dge processing for latency minimization in Fog radio access networks,

S.-H. Park, O. Simeone, and S. Shamai, “Joint cloud and e dge processing for latency minimization in Fog radio access networks,” in Proc. IEEE SPAWC. IEEE, July 2016, pp. 1–5

work page 2016

[18] [18]

Content delivery design for cache-a ided cloud radio access network to achieve low latency,

X. Wu and P . Ching, “Content delivery design for cache-a ided cloud radio access network to achieve low latency,” in Proc. IEEE ICASSP , Apr. 2018, pp. 3749–3753

work page 2018

[19] [19]

Joint optimization of user association, data delivery rate and pr ecoding for cache-enabled F-RANs,

T. T. Vu, D. T. Ngo, L. Ong, S. Durrani, and R. H. Middleton , “Joint optimization of user association, data delivery rate and pr ecoding for cache-enabled F-RANs,” in Proc. IEEE GLOBECOM , Dec. 2017, pp. 1–6

work page 2017

[20] [20]

Mixed-timescale precoding and cac he control in cached MIMO interference network,

A. Liu and V . K. Lau, “Mixed-timescale precoding and cac he control in cached MIMO interference network,” IEEE Trans. Signal Process. , vol. 61, no. 24, pp. 6320–6332, Dec. 2013

work page 2013

[21] [21]

Coded mul ticast fronthauling and edge caching for multi-connectivity tran smission in Fog radio access networks,

S.-H. Park, O. Simeone, W. Lee, and S. Shamai, “Coded mul ticast fronthauling and edge caching for multi-connectivity tran smission in Fog radio access networks,” in Proc. IEEE SPAWC, 2017, pp. 1–5

work page 2017

[22] [22]

Cloud radio access ne tworks with coded caching,

Y . Ugur, Z. H. Awan, and A. Sezgin, “Cloud radio access ne tworks with coded caching,” in WSA 2016; 20th International ITG W orkshop on Smart Antennas . VDE, Mar. 2016, pp. 1–5

work page 2016

[23] [23]

Joint front haul mul- ticast beamforming and user-centric clustering in downlin k C-RANs,

B. Hu, C. Hua, J. Zhang, C. Chen, and X. Guan, “Joint front haul mul- ticast beamforming and user-centric clustering in downlin k C-RANs,” IEEE Trans. Wireless Commun. , vol. 16, no. 8, pp. 5395–5409, Aug. 2017

work page 2017

[24] [24]

QoE drive n BS clustering and multicast beamforming in cache-enabled C-R ANs,

R. Sun, Y . Wang, N. Cheng, H. Zhou, and X. Shen, “QoE drive n BS clustering and multicast beamforming in cache-enabled C-R ANs,” in Proc. IEEE ICC , May 2018, pp. 1–6

work page 2018

[25] [25]

Joint beamformer des ign for wireless fronthaul and access links in C-RANs,

B. Hu, C. Hua, C. Chen, and X. Guan, “Joint beamformer des ign for wireless fronthaul and access links in C-RANs,” IEEE Trans. Wireless Commun., vol. 17, no. 5, pp. 2869–2881, 2018

work page 2018

[26] [26]

Joint optimiza tion of cloud and edge processing for Fog radio access networks,

S.-H. Park, O. Simeone, and S. S. Shitz, “Joint optimiza tion of cloud and edge processing for Fog radio access networks,” IEEE Trans. Wireless Commun., vol. 15, no. 11, pp. 7621–7632, Sept. 2016

work page 2016

[27] [27]

Coll aborative multicast beamforming for content delivery by cache-enabl ed ultra dense networks,

H. Nguyen, H. Tuan, T. Duong, H. Poor, and W. Hwang, “Coll aborative multicast beamforming for content delivery by cache-enabl ed ultra dense networks,” IEEE Trans. Commun. , Jan. 2019

work page 2019

[28] [28]

Cloud-aided edge caching with wireless multicast fronthauling in Fog radio access ne tworks,

J. Koh, O. Simeone, R. Tandon, and J. Kang, “Cloud-aided edge caching with wireless multicast fronthauling in Fog radio access ne tworks,” in Proc. IEEE WCNC , Mar. 2017, pp. 1–6

work page 2017

[29] [29]

Distributed caching for data dissemination in the downlink of heterogen eous net- works,

J. Li, Y . Chen, Z. Lin, W. Chen, B. Vucetic, and L. Hanzo, “ Distributed caching for data dissemination in the downlink of heterogen eous net- works,” IEEE Trans. Commun. , vol. 63, no. 10, pp. 3553–3568, Oct. 2015

work page 2015

[30] [30]

Quali ty of service and max-min fair transmit beamforming to multiple cochanne l multicast groups,

E. Karipidis, N. D. Sidiropoulos, and Z.-Q. Luo, “Quali ty of service and max-min fair transmit beamforming to multiple cochanne l multicast groups,” IEEE Trans. Signal Process. , vol. 56, no. 3, pp. 1268–1279, Mar. 2008

work page 2008

[31] [31]

Binary Optimization via Mathematical Programming with Equilibrium Constraints

G. Y uan and B. Ghanem, “Binary optimization via mathema t- ical programming with equilibrium constraints,” arXiv preprint arXiv:1608.04425, 2016

work page internal anchor Pith review Pith/arXiv arXiv 2016

[32] [32]

Successive convex quadratic programming for quality-of-service management in full-du plex MU- MIMO multicell networks,

H. H. M. Tam, H. D. Tuan, and D. T. Ngo, “Successive convex quadratic programming for quality-of-service management in full-du plex MU- MIMO multicell networks,” IEEE Trans. Commun. , vol. 64, no. 6, pp. 2340–2353, June 2016

work page 2016

[33] [33]

CVX: Matlab software for di sciplined convex programming,

M. Grant, S. Boyd, and Y . Y e, “CVX: Matlab software for di sciplined convex programming,” 2008

work page 2008

[34] [34]

Joint long- term cache allocation and short-term content delivery in green c loud small cell networks,

X. Wu, Q. Li, X. Li, V . C. Leung, and P . Ching, “Joint long- term cache allocation and short-term content delivery in green c loud small cell networks,” in Proc. IEEE ICC , May, 2019, pp. 1–6

work page 2019

[35] [35]

A distribute d numerical approach to interference alignment and applications to wir eless interfer- ence networks,

K. Gomadam, V . R. Cadambe, and S. A. Jafar, “A distribute d numerical approach to interference alignment and applications to wir eless interfer- ence networks,” IEEE Trans. Inf. Theory , vol. 57, no. 6, pp. 3309–3322, Jane 2011. Xiongwei Wu (S’18) received the B.Eng. in Elec- tronic Information Engineering from University of Electronic Science and Techno...

work page 2011