18,997 research outputs found
Cellular-Broadcast Service Convergence through Caching for CoMP Cloud RANs
Cellular and Broadcast services have been traditionally treated independently
due to the different market requirements, thus resulting in different business
models and orthogonal frequency allocations. However, with the advent of cheap
memory and smart caching, this traditional paradigm can converge into a single
system which can provide both services in an efficient manner. This paper
focuses on multimedia delivery through an integrated network, including both a
cellular (also known as unicast or broadband) and a broadcast last mile
operating over shared spectrum. The subscribers of the network are equipped
with a cache which can effectively create zero perceived latency for multimedia
delivery, assuming that the content has been proactively and intelligently
cached. The main objective of this work is to establish analytically the
optimal content popularity threshold, based on a intuitive cost function. In
other words, the aim is to derive which content should be broadcasted and which
content should be unicasted. To facilitate this, Cooperative Multi- Point
(CoMP) joint processing algorithms are employed for the uni and broad-cast PHY
transmissions. To practically implement this, the integrated network controller
is assumed to have access to traffic statistics in terms of content popularity.
Simulation results are provided to assess the gain in terms of total spectral
efficiency. A conventional system, where the two networks operate
independently, is used as benchmark.Comment: Submitted to IEEE PIMRC 201
Hybrid Scheduling/Signal-Level Coordination in the Downlink of Multi-Cloud Radio-Access Networks
In the context of resource allocation in cloud-radio access networks, recent
studies assume either signal-level or scheduling-level coordination. This
paper, instead, considers a hybrid level of coordination for the scheduling
problem in the downlink of a multi-cloud radio-access network, as a means to
benefit from both scheduling policies. Consider a multi-cloud radio access
network, where each cloud is connected to several base-stations (BSs) via high
capacity links, and therefore allows joint signal processing between them.
Across the multiple clouds, however, only scheduling-level coordination is
permitted, as it requires a lower level of backhaul communication. The frame
structure of every BS is composed of various time/frequency blocks, called
power-zones (PZs), and kept at fixed power level. The paper addresses the
problem of maximizing a network-wide utility by associating users to clouds and
scheduling them to the PZs, under the practical constraints that each user is
scheduled, at most, to a single cloud, but possibly to many BSs within the
cloud, and can be served by one or more distinct PZs within the BSs' frame. The
paper solves the problem using graph theory techniques by constructing the
conflict graph. The scheduling problem is, then, shown to be equivalent to a
maximum-weight independent set problem in the constructed graph, in which each
vertex symbolizes an association of cloud, user, BS and PZ, with a weight
representing the utility of that association. Simulation results suggest that
the proposed hybrid scheduling strategy provides appreciable gain as compared
to the scheduling-level coordinated networks, with a negligible degradation to
signal-level coordination
- …