70 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
Fronthaul-Constrained Cloud Radio Access Networks: Insights and Challenges
As a promising paradigm for fifth generation (5G) wireless communication
systems, cloud radio access networks (C-RANs) have been shown to reduce both
capital and operating expenditures, as well as to provide high spectral
efficiency (SE) and energy efficiency (EE). The fronthaul in such networks,
defined as the transmission link between a baseband unit (BBU) and a remote
radio head (RRH), requires high capacity, but is often constrained. This
article comprehensively surveys recent advances in fronthaul-constrained
C-RANs, including system architectures and key techniques. In particular, key
techniques for alleviating the impact of constrained fronthaul on SE/EE and
quality of service for users, including compression and quantization,
large-scale coordinated processing and clustering, and resource allocation
optimization, are discussed. Open issues in terms of software-defined
networking, network function virtualization, and partial centralization are
also identified.Comment: 5 Figures, accepted by IEEE Wireless Communications. arXiv admin
note: text overlap with arXiv:1407.3855 by other author
Edge Cache-assisted Secure Low-Latency Millimeter Wave Transmission
In this paper, we consider an edge cache-assisted millimeter wave cloud radio
access network (C-RAN). Each remote radio head (RRH) in the C-RAN has a local
cache, which can pre-fetch and store the files requested by the actuators.
Multiple RRHs form a cluster to cooperatively serve the actuators, which
acquire their required files either from the local caches or from the central
processor via multicast fronthaul links. For such a scenario, we formulate a
beamforming design problem to minimize the secure transmission delay under
transmit power constraint of each RRH. Due to the difficulty of directly
solving the formulated problem, we divide it into two independent ones:
{\textit{i)}} minimizing the fronthaul transmission delay by jointly optimizing
the transmit and receive beamforming; {\textit{ii)}} minimizing the maximum
access transmission delay by jointly designing cooperative beamforming among
RRHs. An alternatively iterative algorithm is proposed to solve the first
optimization problem. For the latter, we first design the analog beamforming
based on the channel state information of the actuators. Then, with the aid of
successive convex approximation and -procedure techniques, a semidefinite
program (SDP) is formulated, and an iterative algorithm is proposed through SDP
relaxation. Finally, simulation results are provided to verify the performance
of the proposed schemes.Comment: IEEE_IoT, Accep
Resource Allocation in Multi-user MIMO Networks: Interference Management and Cooperative Communications
Nowadays, wireless communications are becoming so tightly integrated in our daily lives, especially with the global spread of laptops, tablets and smartphones. This has paved the way to dramatically increasing wireless network dimensions in terms of subscribers and amount of flowing data. Therefore, the two important fundamental requirements for the future 5G wireless networks are abilities to support high data traffic and exceedingly low latency. A likely candidate to fulfill these requirements is multicell multi-user multi-input multiple-output (MU-MIMO); also termed as coordinated multi-point (CoMP) transmission and reception. To achieve the highest possible performance in MU-MIMO networks, a properly designed resource allocation algorithm is needed. Moreover, with the rapidly growing data traffic, interference has become a major limitation in wireless networks. Interference alignment (IA) has been shown to significantly manage the interference and improve the network performance. However, how practically use IA to mitigate interference in a downlink MU-MIMO network still remains an open problem. In this dissertation, we improve the performance of MU-MIMO networks in terms of spectral efficiency, by designing and developing new beamforming algorithms that can efficiently mitigate the interference and allocate the resources. Then we mathematically analyze the performance improvement of MUMIMO networks employing proposed techniques. Fundamental relationships between network parameters and the network performance is revealed, which provide guidance on the wireless networks design. Finally, system level simulations are conducted to investigate the performance of the proposed strategies
Edge-Caching Wireless Networks: Performance Analysis and Optimization
Edge-caching has received much attention as an efficient technique to reduce
delivery latency and network congestion during peak-traffic times by bringing
data closer to end users. Existing works usually design caching algorithms
separately from physical layer design. In this paper, we analyse edge-caching
wireless networks by taking into account the caching capability when designing
the signal transmission. Particularly, we investigate multi-layer caching where
both base station (BS) and users are capable of storing content data in their
local cache and analyse the performance of edge-caching wireless networks under
two notable uncoded and coded caching strategies. Firstly, we propose a coded
caching strategy that is applied to arbitrary values of cache size. The
required backhaul and access rates are derived as a function of the BS and user
cache size. Secondly, closed-form expressions for the system energy efficiency
(EE) corresponding to the two caching methods are derived. Based on the derived
formulas, the system EE is maximized via precoding vectors design and
optimization while satisfying a predefined user request rate. Thirdly, two
optimization problems are proposed to minimize the content delivery time for
the two caching strategies. Finally, numerical results are presented to verify
the effectiveness of the two caching methods.Comment: to appear in IEEE Trans. Wireless Commu
- …