pith. sign in

arxiv: 1512.06938 · v2 · pith:KXL3QZJSnew · submitted 2015-12-22 · 💻 cs.IT · math.IT

Content-Centric Sparse Multicast Beamforming for Cache-Enabled Cloud RAN

classification 💻 cs.IT math.IT
keywords multicastcachingcontent-centricbeamformingcloudcontentproblembackhaul
0
0 comments X p. Extension
pith:KXL3QZJS Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{KXL3QZJS}

Prints a linked pith:KXL3QZJS badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

This paper presents a content-centric transmission design in a cloud radio access network (cloud RAN) by incorporating multicasting and caching. Users requesting a same content form a multicast group and are served by a same cluster of base stations (BSs) cooperatively. Each BS has a local cache and it acquires the requested contents either from its local cache or from the central processor (CP) via backhaul links. We investigate the dynamic content-centric BS clustering and multicast beamforming with respect to both channel condition and caching status. We first formulate a mixed-integer nonlinear programming problem of minimizing the weighted sum of backhaul cost and transmit power under the quality-of-service constraint for each multicast group. Theoretical analysis reveals that all the BSs caching a requested content can be included in the BS cluster of this content, regardless of the channel conditions. Then we reformulate an equivalent sparse multicast beamforming (SBF) problem. By adopting smoothed $\ell_0$-norm approximation and other techniques, the SBF problem is transformed into the difference of convex (DC) programs and effectively solved using the convex-concave procedure algorithms. Simulation results demonstrate significant advantage of the proposed content-centric transmission. The effects of three heuristic caching strategies are also evaluated.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.