11,148 research outputs found
On Fundamental Trade-offs of Device-to-Device Communications in Large Wireless Networks
This paper studies the gains, in terms of served requests, attainable through
out-of-band device-to-device (D2D) video exchanges in large cellular networks.
A stochastic framework, in which users are clustered to exchange videos, is
introduced, considering several aspects of this problem: the video-caching
policy, user matching for exchanges, aspects regarding scheduling and
transmissions. A family of \emph{admissible protocols} is introduced: in each
protocol the users are clustered by means of a hard-core point process and,
within the clusters, video exchanges take place. Two metrics, quantifying the
"local" and "global" fraction of video requests served through D2D are defined,
and relevant trade-off regions involving these metrics, as well as
quality-of-service constraints, are identified. A simple communication strategy
is proposed and analyzed, to obtain inner bounds to the trade-off regions, and
draw conclusions on the performance attainable through D2D. To this end, an
analysis of the time-varying interference that the nodes experience, and tight
approximations of its Laplace transform are derived.Comment: 33 pages, 9 figures. Updated version, to appear in IEEE Transactions
on Wireless Communication
Cooperative Local Caching under Heterogeneous File Preferences
Local caching is an effective scheme for leveraging the memory of the mobile
terminal (MT) and short range communications to save the bandwidth usage and
reduce the download delay in the cellular communication system. Specifically,
the MTs first cache in their local memories in off-peak hours and then exchange
the requested files with each other in the vicinity during peak hours. However,
prior works largely overlook MTs' heterogeneity in file preferences and their
selfish behaviours. In this paper, we practically categorize the MTs into
different interest groups according to the MTs' preferences. Each group of MTs
aims to increase the probability of successful file discovery from the
neighbouring MTs (from the same or different groups). Hence, we define the
groups' utilities as the probability of successfully discovering the file in
the neighbouring MTs, which should be maximized by deciding the caching
strategies of different groups. By modelling MTs' mobilities as homogeneous
Poisson point processes (HPPPs), we analytically characterize MTs' utilities in
closed-form. We first consider the fully cooperative case where a centralizer
helps all groups to make caching decisions. We formulate the problem as a
weighted-sum utility maximization problem, through which the maximum utility
trade-offs of different groups are characterized. Next, we study two benchmark
cases under selfish caching, namely, partial and no cooperation, with and
without inter-group file sharing, respectively. The optimal caching
distributions for these two cases are derived. Finally, numerical examples are
presented to compare the utilities under different cases and show the
effectiveness of the fully cooperative local caching compared to the two
benchmark cases
5G Wireless Network Slicing for eMBB, URLLC, and mMTC: A Communication-Theoretic View
The grand objective of 5G wireless technology is to support three generic
services with vastly heterogeneous requirements: enhanced mobile broadband
(eMBB), massive machine-type communications (mMTC), and ultra-reliable
low-latency communications (URLLC). Service heterogeneity can be accommodated
by network slicing, through which each service is allocated resources to
provide performance guarantees and isolation from the other services. Slicing
of the Radio Access Network (RAN) is typically done by means of orthogonal
resource allocation among the services. This work studies the potential
advantages of allowing for non-orthogonal sharing of RAN resources in uplink
communications from a set of eMBB, mMTC and URLLC devices to a common base
station. The approach is referred to as Heterogeneous Non-Orthogonal Multiple
Access (H-NOMA), in contrast to the conventional NOMA techniques that involve
users with homogeneous requirements and hence can be investigated through a
standard multiple access channel. The study devises a communication-theoretic
model that accounts for the heterogeneous requirements and characteristics of
the three services. The concept of reliability diversity is introduced as a
design principle that leverages the different reliability requirements across
the services in order to ensure performance guarantees with non-orthogonal RAN
slicing. This study reveals that H-NOMA can lead, in some regimes, to
significant gains in terms of performance trade-offs among the three generic
services as compared to orthogonal slicing.Comment: Submitted to IEE
- …