IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 14, NO.
10, OCTOBER 2018
D2D Communications in Heterogeneous
Networks With Full-Duplex Relays
and Edge Caching
Le Thanh Tan , Member, IEEE, Rose Qingyang Hu , Senior Member, IEEE,
and Yi Qian , Senior Member, IEEE
Abstract—This paper studies the joint optimal resource
allocation and probabilistic caching design for device-to-
device (D2D) communications in a wireless heterogeneous
network with full-duplex (FD) relays. In particular, popular
contents can be cached at user devices as well as at relays
that are located close to users. A user can request contents
from another user via D2D communications and also from
a nearby relay equipped with FD radios. In the case that
there is a caching miss (i.e., the requested contents are not
found at the other users/relays within the coverage range),
users can connect to the base station via a relay by using
the FD communication technology. Subsequently, we de-
velop mathematical models to analyze the throughput per-
formance with edge caching where both cochannel system
level interference and FD self-interference are considered.
Due to the high complexity of stochastic optimization, we
develop low-complexity optimization formulation by decom-
posing the original problem into three simple subproblems
that can be efficiently solved. Finally, numerical results are
presented to illustrate developed theoretical findings in the
paper and significant performance gains of the throughput
performance.
Index Terms—Caching design, device-to-device (D2D)
communications, full-duplex (FD) communications,
throughput analysis, throughput maximization.
I. INTRODUCTION
N THE future, Internet of Things (IoT) in 5G wireless net-
I works, emerging broadband, and multimedia wireless appli-
cations will demand an unprecedented capacity escalation and
stringent quality of service (QoS) in cellular networks. To tackle
these challenges, advanced technologies are needed to enhance
the capacity and QoS in cellular networks [1], [2]. Further, re-
cent studies and measurements reveal that different contents are
Manuscript received January 29, 2018; revised May 18, 2018; ac-
cepted June 22, 2018. Date of publication July 12, 2018; date of current
version October 3, 2018. This work was supported by the National Sci-
ence Foundation under Grant NeTS-1423348, Grant NeTS-1423408,
Grant EARS-1547312, and Grant EARS-1547330. Paper no. TII-17-
2865. (Corresponding author: Le Thanh Tan.)
L. T. Tan and R. Q. Hu are with the Department of Electrical and
Computer Engineering, Utah State University, Logan, UT 84322 USA
(e-mail: tan.le@usu.edu; rose.hu@usu.edu).
Y. Qian is with the Department of Electrical and Computer Engineer-
ing, University of Nebraska–Lincoln, Lincoln, NE 84322 USA (e-mail:
yqian2@unl.edu).
Color versions of one or more of the figures in this paper are available
online at http://ieeexplore.ieee.org.
Digital Object Identifier 10.1109/TII.2018.2855187
1551-3203 © 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications standards/publications/rights/index.html for more information.
Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
4557
requested and accessed at different levels [3]. Among all the
measured contents, a small percentage of total contents present
high access demands by a majority of users, whereas a large
portion of the contents present rather low access demands [3].
In particular, the information and communications tech-
nology industries is under tremendous pressure to seek new
architectures, new deployment models, and new services for
the industrial IoT ecosystem, which is an evolving enterprise
consisting of massive smart objects, intelligent devices, smart
phones, different types of sensors, machines, and instruments
[4]–[7]. The intelligent environment architecture can achieve
the goals of connecting a broad community of equipment,
sensors, and machines to serve their demands for monitoring,
control, and maintenance. However, cloud radio access network
(cloud-RAN) technology, or C-RAN, still faces the inevitable
problems, such as long latency due to the long distance from
devices to the Internet cloud, fronthaul/backhaul bandwidth
limitation, high energy consumption, etc. Recently, fog com-
puting has become a promising technology for the industrial
IoT. It puts a substantial amount of storage, communication,
control, configuration, measurement, and management at the
edge of the network, rather than establishing channels for the
centralized cloud storage and utilization as in the conventional
C-RANs [8], [9]. Hence, fog computing can overcome the
disadvantages of the C-RANs with the fronthaul/backhaul
constraints. However, we would design an advantageous
fog-computing architecture by considering the supporting
technologies, namely caching placement, device-to-device
(D2D) communications and full-duplex (FD) communications.
The combination of D2D communications and caching place-
ment in wireless heterogeneous networks (HetNets) has been
recently proposed and studied [10], [11]. In [10], Golrezaei
et al. move the data storage from the cloud to the edges that
are special nodes with a large storage capacity; and hence, this
reduces the content downloading delay significantly. Then, the
authors extend to apply both coding in the delivery phase and
spatial reuse in a D2D network [11]. Other works develop prob-
abilistic caching policies where the relays act as the friendly
helpers [12]–[14]. In particular, these works aim for optimiz-
ing the system performance in terms of latency, probability of
correct reception, and service providers’ profit. In [15], Wang
et al. conducted theoretical analysis for the push-based content
delivery methods where the most popular contents are pushed
 4558
through broadcasting to alleviate the cellular data bottleneck.
However, there have been few studies in which both relays and
terminal users can cooperatively store the multimedia contents.
To cooperatively perform caching at user and relay levels, one
must carefully select the contents to be cached at these levels
and hence enhance the probability of cache hits as well as the
overall system performance.
Furthermore, FD radio technology has been considered as a
promising 5G technology to greatly improve the capacity and
reduce the transmission delay [16], [17]. By employing the ad-
vanced FD transceiver, each user can transmit and receive data
simultaneously on the same time/frequency resource [18]. In
particular, FD technology can be integrated into next-generation
wireless networks, e.g., small cell networks and heterogeneous
wireless networks [19], to significantly enhance the network
performance. Practical FD transceivers, however, still suffer
from self-interference, which is caused by power leakage from
a transmitter to a receiver. Self-interference can indeed lead to
serious communication performance degradation. Despite re-
cent advances on self-interference cancelation techniques [16],
self-interference still exists due to the hardware limitations and
channel estimation errors. Employment of FD transceivers for
more efficient spectrum access design in wireless networks has
been extensively explored in the literature [16]–[21]. Also, re-
cent works have been focused on solutions targeting FD inter-
ference footprint reduction and the potential benefits brought by
the adoption of caching to improve the FD throughput [21], [22].
In this paper, we make a further bold step in designing, an-
alyzing, and optimizing the cooperative caching placement at
both user and relay levels and resource allocation, considering
the constraints of self-interference at relays and the interference
footprint caused by many FD links. We assume that both the BSs
and the users operate in the half-duplex (HD) mode, whereas the
relays operate in the FD mode. Specifically, the contributions
of this paper can be summarized as follows. First, we model the
HetNets with D2D communications and edge caching, where
caching placements are at both user and relay levels. Cache hit
occurs if requested content is received from a local user, or a
nearby user, via D2D communications, or a relay. In the case
of cache miss, the relay employs the FD communications to
simultaneously receive the requested content from the BS and
send it to the requesting user. We further formulate the joint
optimal caching and resource allocation problem to maximize
the system throughput under the constraints of limited storage
capacities at user and relay levels, the content popularity, the
transmit powers at both the users and the relays, and the quality
of self-interference cancelation (QSIC). Then, we analyze the
throughput and propose the suboptimal caching scheme to al-
leviate the high complexity of joint optimal caching placement
and resource allocation. Finally, we present numerical results
to illustrate performance of the proposed algorithms and the
throughput gains due to optimal parameter configuration.
The remainder of this paper is organized as follows.
Section II describes the brief background of caching-aided
HetNet with D2D communications in 5G standards and indus-
trial applications. Section III describes the system model. We
define the caching-aided throughput as the main performance
Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 14, NO. 10, OCTOBER 2018
metric and formulate the optimization problem in Section IV.
The suboptimal solution is presented in Section V. Section VI
presents performance results followed by concluding remarks
in Section VII.
II. BACKGROUND
In this section, we present the current status of caching-aided
HetNet with D2D communications in 5G standards and indus-
trial applications.
A. Network Architecture
Compared with the 4G/LTE network, 5G network is expected
to serve the rapidly growing demands for the thousandfold
growth of mobile data traffic [23]. Mobile network operators
and their suppliers are actively developing strategies, such as
increasing additional spectrum, seeking advanced and sophisti-
cated technologies, using diverse kinds of infrastructures, such
as pico/indoor femto BSs, relays, distributed antennas, WiFi, and
D2D nodes, and offloading traffic to alternative access networks.
These technologies aim to increase coverage, boost network ca-
pacity, and cost-effectively bring contents closer to users.
HetNet is a key attribute to future wireless networks. It can
bring the cell site closer to end users and shorten the radio
transmission distance. HetNet is comprised of a variety of radio
access technologies with different formats and aspects. Many
applications prefer to deploy relays, distributed antennas, and
small cellular access points (such as femtocells, picocells, metro
cells, and microcells) in residential homes, subways, enterprises,
and hotspot areas. In particular, cell sizes have been progres-
sively shrinking from the order of hundreds of square kilometers
to a fraction of 1 m2 or less. As such network capacity can be
effectively increased when the cell becomes smaller. Further-
more, the small cell can enhance spatial reuse and offload traffic
efficiently.
There exist rich research literature in HetNets (e.g., see [24]
and references therein), where various aspects including in-
terference management, cell association, stochastic network
modeling, and energy efficiency have been investigated. Up-
link and downlink imbalance in HetNets can cause various new
types of interferences [1]. Novel cell association mechanisms
and architectures shall be developed, where recent advanced
techniques, namely flexible uplink/downlink communications,
massive multiple-input multiple-output, D2D communications,
full-duplexing, etc., can be utilized [1]. Network modeling ap-
proaches based on stochastic geometric tools have recently
gained enormous attention in both academia and industry [25].
At the same time, the rapid developments and fundamental in-
sights have been corroborated by industry field trials and obser-
vations from extremely detailed simulation tools [26]. All these
provide effective mechanisms for evaluating the performance of
cellular networks.
B. Network Protocol
Caching is deemed one of the most important research top-
ics in content delivery networks [10]–[14]. It helps lower down
 TAN et al.: D2D COMMUNICATIONS IN HETEROGENEOUS NETWORKS WITH FULL-DUPLEX RELAYS AND EDGE CACHING 4559

the content-access latency and backhaul traffic loading, improve

user quality of experience, and reduce network cost. The concept
of caching originally came from algorithm designs in operating
systems, which aims to improve the scalability of the world
wide web and offload the network by caching contents in the
proxy servers and/or intermediate nodes of the network [27].
Recently, information-centric networking has been proposed as
a promising solution for IoTs due to its focus on uniquely nam-
ing contents and smartly distributing these across the network,
rather than on endpoints [28]. Note that normally a few pop-
ular contents are most frequently requested by users in spite
of the substantial amount of data traffic in the network [3]. It
implies that a small portion of popular contents will actually
contribute to the majority of data traffic over a period of time.
Furthermore, caching at the edge of the network is one of the
most promising solutions in 5G wireless networks [10], [11],
[14] as it can significantly reduce latency and reduce overall
traffic load. A stochastic framework for both cache-enabled re-
lays and cache-enabled D2D communications was developed in
[10]–[14], where the authors derived the expressions for the out- Fig. 1. Caching-aided HetNet with D2D communications.
age probability and the average content delivery rate as functions
of signal-to-interference-plus-noise ratio (SINR), node inten- ing to two mutually independent homogeneous poisson point
sity, target content bit rate, cache size, and content popularity processes (PPPs) with respective densities λR and λU .
distribution.
A. Network Architecture
C. Industrial Applications A two-tier HetNet consisting of macro BSs and low-power re-
Industrial IoTs connect machines and devices in different ver- lays with underlay D2D communications is considered. Within
tical segments, such as oil and gas, transportation, power gen- this network, a relay with caching capability can transmit the
eration, and healthcare. In particular, a substantial number of cached contents to the users within its coverage radius of RR .
devices having Internet connections collect, analyze, and share It also uses the FD capability to forward the requested contents
data. A huge amount of data can be collected or analyzed in to another user while receiving the contents from the BS at the
cloud servers, which extract meaningful information and pro- same time. It is assumed that a portion of the users request
vide insights to network operations. Let us consider the scenario the contents and act as the receivers and the portion is denoted
of smart city. People drive along the street of the city and are by α, 0 ≤ α ≤ 1. So the remaining (1 − α) percentage users
connected to a possibly far-away central cloud for music or act as transmitters. All the users work in the HD mode. One
YouTube videos. Alternatively, they can get these contents di- can send the requested contents to the requesting user by using
rectly from the nearby small BSs and/or from the nearby devices D2D communications if RU < RR , where RU is the distance
that cache the corresponding contents. Moreover, the requesting between these two users. We further assume that the distribution
users can also keep the received contents and then serve other of users follows the PPP with a density of αλU .
nearby users via D2D communications. The popularity distribution vector of the contents is denoted
Another application can be found in the smart monitoring net- by q = q1 , . . . , qi , . . . , qN , where N is the total number of con-
work in the city. The monitoring devices collect road informa- tents and qi is the access probability for the ith content. Assume
tion, such as weather, wind direction and intensity, road surface that the contents are arranged in a descending order of popularity
temperatures and conditions, air quality, etc. The measured data and their distribution follows a Zipf distribution with a parame-
are transmitted to the cloud for processing and analyzing. The ter of γ [3]. So the popularity of content i can be written as [15]
extracted insights are sent back to the small BSs to serve nearby qi = 1/(iγ N j =1 1/j ). Without loss of generality, all the N
γ

devices that request this information. Again the requesting users contents are assumed to have the equal size of L and the caching
can determine whether to keep the received contents for serving capacity of LMR for all relays are the same, where MR < N .
the nearby users or not. In this paper, throughput is the key QoS PR = [pR 1 , p2 , . . . , pi , . . . , pN ] is defined as the caching place-
R R R

performance metric that we are considering. ment probabilities at relays, where pR i is the percentage of re-
lays that cache content i, 0 ≤ pR ≤ 1 for i = 1, 2, . . . , i, . . . , N
 i
and N i=1 ip R
≤ M R . The distribution of relays that have con-
III. SYSTEM MODELS tent i follows the PPP with density λR pR i . Furthermore, all
In this section, we first introduce a two-tier HetNet with un- the users are assumed to have the same caching capacity LMU .
derlay D2D communications and edge caching, as illustrated in PU = [pU1 , pU2 , . . . , pUi , . . . , pUN ] is defined as the caching place-
Fig. 1, where relays and users are spatially distributed accord- ment at the users, where pUi is the portion of users that have

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
 4560 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 14, NO. 10, OCTOBER 2018

N U
content i, 0 ≤ pUi ≤ 1 for i = 1, 2, . . . , N , and i=1 pi ≤
MU . Similarly, the distribution of users that have content i also
follows the PPP with density αλU pUi .
B. Content Access Protocol
The content access protocol includes four cases, which are
presented in the following. An example including four cases is
presented in Fig. 1.
Case 1—Local cache hit: The requested content can be found
from user’s own cache.
Case 2—D2D cache hit: Local cache miss but the requested
content can be found from a nearby user within distance RU . If
there is at least one user who has the requested content, the user
will establish the D2D transmission with the nearest user with
the cached content.
Case 2—Relay cache hit: Both case 1 and case 2 fail but the
requested content can be provided by a nearby relay within a
radius RR .
Case 4—Cache miss: Cases 1–3 all fail. The requested con-
tent has to be provided by a BS via a relay. Here, at least one
relay within a distance of RR from the user performs FD com-
munications to simultaneously receive the content from the BS
and transmit it to the requesting user. This helps reduce the
access latency and also helps users to save power.
IV. CACHE-AIDED HETNET WITH D2D COMMUNICATIONS
AND FD RELAYS
by the D2D cache hits. We denote by pUhit,i and pUsucc,i the
D2D cache hit probability and the success probability of D2D
transmission for file i, respectively. The third term of (2) is the
throughput achieved by the relay cache hits. Here, we define
pR R
hit,i and psucc,i as the relay cache hit probability and the suc-
cess probability of relay-user transmission for file i, respectively.
The last term in (2) expresses the throughput achieved by cache
misses. phit,i and pFsucc D
,i , respectively, denote the total cache hit
probability and the success probability of FD communications.
We can move on to determine case 2 cache hit probability
pUhit,i , case 3 cache hit probability pR hit,i , case 1 + case 2 +
case 3 cache hit probability phit,i , case 2 content transmission
success probability pUsucc,i , case 3 content transmission success
probability pR succ,i , and case 4 content transmission success
probability pFsuccD
,i in the following.
1) Cache Hit Probabilities pU , pR , and phit, i : Based on
hit, i hit, i
[25] and [29], the distribution of file i at user level follows the
PPP with the density of (1 − α)λU pUi . The probability that file
i has D2D cache hit is given as follows:

pUhit,i = 1 − exp −π (1 − α) λU pUi RU2 . (3)
Similarly, the distribution of file i at relay level follows the PPP
with the density of λR pR i . The probability that file i has a relay
cache hit is given as follows:
 
hit,i = 1 − exp −πλR pi RR .
pR R 2
(4)

A. Problem Formulation Therefore, the probability of total cache hit is equal to

 
  
We are interested in finding the optimal caching placement phit,i = pUi + 1 − pUi 1 − 1 − pUhit,i 1 − pR hit,i (5)
and resource allocation to achieve the maximum throughput.
Specifically, let N T be the total throughput, which is a function where pUi is the case 1 local caching probability.
of caching placements at users PU and at relays PR and trans- 2) Content Transmission Success Probabilities pUsucc, i ,
mit powers at users PD and relays PR . Then, the throughput pR FD U R
succ, i , and psucc, i : We now define psucc,i , psucc,i , and
maximization problem can be formulated as follows: pFsucc
D
,i in this section and their detailed derivations are pre-
P1 : max N T (PU , PR , PD , PR ) sented in the next section. To determine pUsucc,i , let j0 denote
PU ,PR ,P D ,P R
 N N R (1) any requesting user that receives the content from the nearest
i=1 pi ≤ MU , i=1 pi ≤ MR
U
s.t. user j̄0 by using D2D communications. Define Θj as the cache
PD ≤ P̄D , PR ≤ P̄R miss event at relay j and 1Θ j as the indicator function (1Θ j = 1
where P̄D and P̄R are the maximum transmit powers at the users if cache miss event occurs at j, otherwise 1Θ j = 0). Relay j
and the relays, respectively. The total throughput N T is the uses FD communications to forward requested content from
average number of requested contents that would be successfully the BS to its requesting user once a cache miss occurs. The
received in one unit area. This quantity can be expressed as fading channel from transmitter j to receiver k, hj k , follows a
follows: Rayleigh fading distribution with CN (0, 1). So in case 2, the
success probability of D2D content transmission for file i is

N 
N
  given as follows:
NT = αλU pUi qi + αλU qi 1 − pUi pUhit,i pUsucc,i

i=1 i=1 pUsucc,i = Pr SINRUj0 > φ (6)

N
  
+ αλU qi 1 − pUi 1 − pUhit,i pR R where φ is the predetermined threshold for SINR. SINRUj0 is the
hit,i psucc,i
i=1 SINR at user j0

N   PD h2j̄ 0 j 0 d−β 1

+ αλU 1 − phit,i pFsucc

D
,i . (2) SINRUj0 =
j̄ 0 j 0
(7)
i=1
σ 2 + Ij 0
Here, the first term in (2) is the throughput achieved by local where j̄0 is the nearest user having the cached content, dj̄ 0 j 0 is
cache hits. The second term represents the throughput achieved the distance between j0 and j̄0 , β1 is the pathloss exponent for

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
 TAN et al.: D2D COMMUNICATIONS IN HETEROGENEOUS NETWORKS WITH FULL-DUPLEX RELAYS AND EDGE CACHING 4561

D2D transmission, and σ 2 is the thermal noise power. Ij 0 is the Note that the difference between Ik 0 j 0 and IkFD
0j0
comes from the
total interference, which is expressed as follows: fact that IkFD includes the interference caused by transmission
0j0
  between the BS and relay k0 .
Ij 0 = PD h2j j 0 d−β
j j0 +
1
PR h2k j 0 d−β 1
k j0 SINRFDR is the SINR at relay k0 from the BS given as
j ∈Φ Uj \{j̄ 0 j 0 } k ∈Φ R
j
0 0
 PBS h2BSk0 d−β 2

PBS h2BSl j 0 d−β

BSk0
+ B S l j 0 1Θ l . R =
SINRFD
2
(8) . (15)
σ 2 + IBSk
FD
l∈Φ R
j
0
0
FD
The first term in (8) is the interference caused by the transmis- The interference IBSk0
is calculated as
sion of user j, which is in the coverage of user j0 , i.e., j ∈ ΦUj0 
(where ΦUj0 is the set of these active users). The second term
FD
IBSk0
= PD h2j k 0 d−β
j k 0 + hk 0 k 0 ξPR
1 2

in (8) represents the interference caused by the transmission of j ∈Φ R

k
U \j
0
0

relay k ∈ ΦR j 0 , where Φj 0 is the set of active relays, which can

R  
cause interference to j0 . The third term in (8) represents the + PR h2k k 0 d−β
kk0 +
1
PBS h2BSl k 0 d−β
BSl k 0 1Θ l .
2

k ∈Φ R
k 0 \k 0 l∈Φ R
interference caused by the base station BSl (relay l is associ- k0

ated with BSl ) that user j0 is associated with. Relay l is in the (16)
user j0 coverage but performs FD communications to help other
Here the first term in (16) is the interference caused by the
users. Note that PBS is the transmit power of the BS and β2 is
transmission of user j, which is in the set ΦR U
k 0 falling in the
the pathloss exponent for transmission between the BS and the
coverage of relay k0 . The second term in (16) presents the self-
users.
interference caused by leakage power from the transmission of
Similarly, we calculate the success probability pR succ,i of a relay k0 , and ξ is the parameter of QSIC (see [20] for detailed
relay k0 content transmission in case 3 as follows:
 modeling and cancelation of self-interference). The third term
succ,i = Pr SINRj 0 > φ .
pR RU
(9) in (16) represents the interference caused by the transmission
of relay k ∈ ΦR k 0 , where Φk 0 is the set of active relays within
R
SINRRj0
U
is the SINR at user j0 from relay k0 , which can be coverage of the considered relay k0 . The fourth term in (16)
expressed as follows: represents the interference from transmission between the base
PR h2k 0 j 0 d−β 1
k 0j0
station BSl and relay l. Here, relay l is within relay k0 ’s coverage
j0 =
SINRR U
. (10) and performs FD communications to help other users.
σ 2 + Ik 0 j 0
The interference Ik 0 j 0 is calculated as follows: B. Throughput Analysis
 
Ik 0 j 0 = PD h2j j 0 d−β
j j0 +
1
PR h2k j 0 d−β
k j0
1
This section presents the mathematical derivations of the fol-
j ∈Φ Uj \j 0
0
k ∈Φ R
j \k 0
0
lowing:
 1) the success probability of D2D transmission for file i in
+ PBS h2BSl j 0 d−β
BSl j 0 1Θ l .
2
(11) case 2 pUsucc,i ;
j \k 0
l∈Φ R
0
2) the success probability of relay-user transmission for file i
in case 3 pR
succ,i ; and
Furthermore, the success of the FD transmission pFD
succ,i when 3) the success probability of FD communications in case 4
a cache miss occurs (case 4) is determined as follows: pFD
 succ,i .
succ,i = Pr SINRj 0 > φ and SINRR > φ .
pFD FD FD 1) Case 2: The Success Probability of D2D Transmission
(12)
pUsucc, i : From (6)–(8), we have
Here, each transmission consists of two hops, where the first hop
 
is the communication from the BS to the relay and the second φ  2 
hop is the communication from the relay to the user. SINRFD pUsucc,i = Pr h2j¯0 j 0 dj−β 1
¯0 j 0 ≥ σ + ID + IR + IB
j 0 is PD
the SINR at user j0 from a nearby relay k0 , which is given as     
follows: φσ 2 djβ¯01j 0 φ β1
= exp − E exp − dj¯0 j 0 ID
PR h2k 0 j 0 d−β 1
k 0j0
PD PD
SINRFD
j0 = . (13)      
σ 2 + IkFD
0j0 φ β1 φ β1
E exp − d IR E exp − d IB
The interference IkFD is calculated as follows: PD j¯0 j 0 PD j¯0 j 0
0j0
  (17)
−β 1
IkFDj = P D h 2
j j d + PR h2k j 0 d−β 1
 
PD h2j j 0 d−β
j j k j0
where ID = j j 0 , IR =
0 0 0 0
j ∈Φ Uj \j 0 k ∈Φ R j ∈Φ Uj \{j̄ 0 j 0 }
1
k ∈Φ R PR h2k j 0
j \k 0
0 0  0 j0

 d−β
k j 0 , and IB =
1
l∈Φ R PBS h2B S l j 0 d−β
BSl j 0 1Θ l . E(•) is the ex-
2

+ PBS h2BSl j 0 d−β

BSl j 0 1Θ l .
2
(14) j0
pectation over dj j 0 , dj¯0 j 0 , hj j 0 , and hj¯0 j 0 . Under the condition
l∈Φ R
j 0 dj¯0 j 0 = d0 , the Laplace transform LI D (s), LI R (s), and LI B (s)

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
 4562 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 14, NO. 10, OCTOBER 2018

are written as follows: where the probability density function of d0 is

⎛ ⎛ ⎞⎞ fd 0 (r) =
 ⎧ 
⎜ ⎜ 1 ⎟⎟ ⎨2π (1 − α) λU pi r exp −π (1 − α) λU pi r
U U 2
LI D (s) = E ⎝exp ⎝−s h2j j 0 d−β
j j 0 ⎠⎠ (18a) 0 ≤ r ≤ RU
j ∈Φ Uj \{j̄ 0 j 0 } 1 − exp −π (1 − α) λU pUi RU2
0 ⎩
⎛ ⎞ 0 r > RU
   (22)
⎜ 1 ⎟
= Eh,φ ⎝ exp −sh2j j 0 d−β
j j0 ⎠ (18b)
and d0 in the expressions of LI D (s), LI R (s), and LI B (s) is re-
j ∈Φ Uj \{j̄ 0 j 0 }
0 placed by r.
⎛ ⎞ We consider the special case where the thermal noise σ 2 is
   
⎜ ⎟ ignored in an interference limited system
= Eφ ⎝ Eh exp −sh2j j 0 d−β 1
⎠
A  
j j0
j ∈Φ Uj \{j̄ 0 j 0 }
0 pUsucc,i = 1 − exp −πRU2 B (23)
B
(18c)
⎛ ⎞ where
 (1 − α) λU pUi
⎜ 1 ⎟ A=  (24)
= Eφ ⎝ −β 1 ⎠
(18d) 1 − exp −π (1 − α) λU pUi RU2
1 + sdj j 0
j ∈Φ Uj \{j̄ 0 j 0 }
0  
     αpUhit φ2/β 1
∞
1 B = λU (1 − α) pi +
U

= exp −2παλU phit U

1− rdr Sinc (2/β1 )
d0 1 + sr−β 1 ⎛  2/β 1  2/β 2 ⎞
(18e) p R φP R
⎜ hit P D (1 − p hit ) φP BS
PD ⎟
⎛ ⎞ + λR ⎝ + ⎠.
2   Sinc (2/β1 ) Sinc (2/β2 )
−2παλU pUhit d20 φ β 1 2 2 ⎠
= exp ⎝ Γ φ 1− ,
β1 φ+1 β1 β1 (25)
(18f) 2) Case 3: The Success Probability of Relay-User Transmis-
⎛ 2
⎞ sion pR
s u c c , i : Similarly, combining (9)–(11) and using some ma-
−παλU pUhit d20 φ β 1 nipulations, we can obtain the success probability of relay-user
≈ exp ⎝ ⎠, (18g) transmission pR
Sinc (2/β1 ) succ,i . The detailed intermediate derivations are
omitted due to the space limit and can be found in the technical
report [30]. When we ignore the thermal noise, the final results
where s = φdβ0 1 . Equation (18c) becomes (18d) because are given as follows:
h2j j 0 ≈ Rayleigh fading distribution with a unit mean [25], A1   
  x p−1 succ,i =
pR 1 − exp −πRR 2
B1 (26)
pUhit = N i=1 qi (1 − pi )phit,i , and Γx (p, q) = 0 y
U U
(1 − B1
y)q −1 dy is the incomplete Gamma function. As shown in [29], where
(18f) can be approximated to (18g). λ pR
We use the similar manipulations and get A1 = R i R 2 (27)
1 − exp −πλR pi RR
⎛  2/β 1 ⎞
αλU pUhit (φPD /PR )2/β 1
⎜ −πλ p R 2
d
R hit 0 φ PR
⎟ B1 =
LI R (s) = exp ⎝
PD
⎠ (19) Sinc (2/β1 )
Sinc (2/β1 )  
pR
hit φ
2/β 1
(1 − phit ) (φPBS /PR )2/β 2
⎛  2/β 2 ⎞ + λ R pi +R
+ .
Sinc (2/β1 ) Sinc (2/β2 )
⎜ −πλ R (1 − p hit ) d 2
0 φ P BS
PD ⎟
LI B (s) = exp ⎝ ⎠ (20) (28)
Sinc (2/β2 )
3) Case 4: The Success Probability of FD Communications
pFs uDc c , i : Equation (12) can be rewritten as follows:
N  
succ,i = Pr SINRj 0 > φ Pr SINRR > φ
pFD FD FD
hit =
pR i=1 qi (1 − exp(−πλR pi RR )) and phit =
R (29)
where
N
i=1 qi phit,i . So, the success probability of D2D transmission where Pr{SINRFD j 0 > φ} = psucc,i is the success probability
R
pUsucc,i can be determined by deconditioning dj¯0 j 0 = d0 , i.e.,
of communication from the relay to the user. The success
  probability of the communication from the BS to the relay
 ∞
−φσ 2 rβ 1 Pr{SINRFD R > φ} can be calculated in the similar manner. De-
pUsucc,i = fd 0 (r) exp LI D (s)LI R (s)LI B (s)dr
0 PD tailed intermediate derivations is omitted and can be found in
(21) the technical report [30].

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
 TAN et al.: D2D COMMUNICATIONS IN HETEROGENEOUS NETWORKS WITH FULL-DUPLEX RELAYS AND EDGE CACHING 4563

V. THROUGHPUT MAXIMIZATION
Algorithm 1: THROUGHPUT OPTIMIZATION IN HETNET
In order to maximize the overall throughput defined in P1, WITH EDGE CACHING AND FULL-DUPLEX RADIO.
simulated annealing method is used to approximate the global 1: Initialization of PU = {pUi }, PR = {pR i }, PD and PR .
optimal solutions to the original nonconvex stochastic problem 2: For given PR = {pR i }, P D and P R , find the optimal
P1. However, this method has a very high complexity. Hence, U,∗
PU,∗ = {pi } by solving P2.
we propose the suboptimal scheme to solve this problem. In 3: For given PD , PR , and PU,∗ = {pU,∗ i } (obtained at step
particular, P1 is decomposed into three subproblems, i.e., P2,
2), determine the optimal PR ,∗ = {pR ,∗
i } by solving P3.
P3, and P4 as follows.
Given PR = {pR 4: For obtained PU,∗ = {pU,∗ i } (at step 2) and PR ,∗ =
i }, PD , and PR , we formulate the optimiza-
tion problem for caching placement at user level as follows. {pRi
,∗
} (at step 3), determine the optimal (PD ,∗ , PR ,∗ )
P2: Caching Placement Optimization at User Level by solving P4.
5: If ΔN T ≤ , return step 2. Otherwise, stop and return
the solutions.

N  
max N T 1 = αλU pUi qi + qi 1 − pUi pUhit,i pUsucc,i
PU i=1

N
scenario, we account the interferences caused by D2D commu-
s.t. pUi ≤ MU .
i=1 nications, BS-relay communications, and the self-interference
Here, we aim to maximize the throughput achieved by caching at the relay caused by the FD communications of BS-relay user.
placement policies at the users under the assumption that the We give a characterization of optimal solutions for P2 and
requesting users can obtain the requested contents at their own P3 based on the following lemmas.
cache storage or from other users via D2D communications. Lemma 1: The optimal caching placement at user level is
For the given PD , PR , and PU,∗ = {pU,∗  + !
i }, we formulate the pU,∗ = min p̂Ui , 1 , i = [1, . . . , N ] (31)
i
optimization problem for caching placement at relay level in the
following. where p̂Ui is the root of equation
P3: Caching Placement Optimization at Relay Level      ϕ
K1i −1 + 1 − pUi ρ + 1 exp −ρpUi +1− =0
αλU qi

N 
N (32)
max N T 2 = αλU pU,∗
i qi + αλU qi ρ = π(1 − α)λU RU2 , [x]+ = max(x, 0), ϕ is the Lagrangian
PR 
i=1
 
i=1
multiplier that satisfies the condition that N i=1 pi = MU , and
U
i
× 1 − pU,∗ pU,∗ U K1 is the constant. We note that ϕ can be efficiently solved by
i hit,i psucc,i using the bisection method.

N   Lemma 2: The optimal caching placement at relay level is
+ αλU qi 1 − pU,∗
i  R + !
i=1 pR
i
,∗
= min p̂i , 1 , i = [1, . . . , N ] (33)
 
× 1 − pU,∗ R R
hit,i phit,i psucc,i
where

  

N ln αλU qi ϑK2i 1 − pU,∗
i 1 − pU,∗
hit,i − ln (η)
i =
p̂R
s.t. i ≤ MR .
pR ϑ
i=1 (34)
The solution of P3 will give caching placement strategies at re- ϑ = πλR RR 2
, [x]+ = max(x, 0), η is the Lagrangian multiplier

lays to maximize the throughput under the assumption that the that satisfies the condition that N i=1 pi = MR , and K2 is the
R i

requested contents will be provided by a nearby relay. More- constant. Again η can be obtained by using the bisection search
over, the cache placement probability at users is replaced by the mechanism.
probability of cache hit at the users and the results of P2 are The proofs of these lemmas are omitted due to space limit
used in this subproblem, i.e., pUi and pUhit,i become pU,∗
i and and can be found in the technical report [30].
Then, we use the exhaustive search mechanism to solve P4.
pU,∗
hit,i . Because we have only two parameters of PD and PR . We it-
Finally, for obtained PU,∗ = {pU,∗ R ,∗
i } and PR ,∗ = {pi }, the eratively solve three subproblems until ΔN T ≤ , where is
power optimization is formulated as follows: the predetermined small value. The procedure for parameter
P4: Power Control configuration can be described in Algorithm 1.
The intuition of this proposed method in solving optimization
max N T (PU∗ , PR∗ , PD , PR )
P D ,P R problem P1 can be translated as follows. First, we aim to maxi-
mize the offloading by using the caching placement mechanism
s.t. PD ≤ P̄D , PR ≤ P̄R . (30)
at both the users and the relays (P2 and P3) when PD and PR
In this subproblem, we aim to optimize the original through- are given. Thus, we can mitigate the heavy burden at the down-
put with respect to the parameters of PD and PR . For this link between users and the macro BSs as well as the number of

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
 4564 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 14, NO. 10, OCTOBER 2018

transmission links. We first optimize the achieved throughput

for the user-level (problem P2) where PR is additionally prede-
termined. Then, problem P3 is solved to configure PR when we
have the solutions PU,∗ = {pU,∗i } of problem P2. The resulted
set of contents for relays (problem P3) may be overlapping or
separate with the set of contents for users. It means that con-
figuration for caching placement at the relays would cooperate
with the caching solution at the users to complement the local
and D2D cache misses and hence it can improve the throughput
gain. Second, we focus on throughput improvement when the
cache miss occurs (i.e., problem P4). In fact, we return to con- Fig. 2. For M d = 2, M R = 8, and γ = 1.2, throughput versus (a) user
sider the original problem P1 where PU,∗ and PR ,∗ are obtained density with λR = 10−4 (per m2 ) and (b) relay density with λU = 10−4
(per m2 ).
in problems P2 and P3. Our target is configuring transmit pow-
ers PD and PR to reduce self-interference at the FD link and
interference in the system. Finally, we return to solve problem caching placement. A typical application can be the Internet of
P2 with updated PD ,∗ and PR ,∗ and the iterative method stops, vehicles for information exchange and content sharing among
whenever ΔN T ≤ . vehicles. The key parameters for the proposed scheme are cho-
sen as follows, unless stated otherwise. The number of users re-
A. Complexity Analysis questing content is α = 50%, λU is in the range of [10−4 , 10−3 ]
(per m2 ), λR is in the range of [10−5 , 10−6 ] (per m2 ), λBS = 10−7
Due to the nonlinear and combinatorial properties of the for-
(per m2 ) (assume that BSs are spatially distributed according to
mulated problem, it would be prohibitively difficult to explicitly
PPPs with densities λBS ), MU = 2, MR = 7, N = 20, γ = 1,
derive its optimal closed-form solution. However, we can em-
RU = 15 m, RR = 150 m, RBS = 500 m (RBS is a radius of the
ploy the brute-force search (i.e., exhaustive search) to determine
BS’s transmission coverage), P̄D = 0.15 mW, P̄R = 1.5 mW,
the best caching placement and resource allocation. Specifically,
σ 2 = −110 dB, φ = 0 dB, β1 = 3, β2 = 4, and ξ = 0.01.
this solution requires the analytical model in Section IV that cal-
In Fig. 2(a), we show the throughput N T versus user device
culates the throughput for each caching placement and resource
density λU for Md = 2, MR = 8, γ = 1.2, and λR = 10−5
allocation.
(per m2 ). Here, we compare our proposal to two schemes: first,
We now quantify the complexity of the optimal brute-force
equal caching scheme, where each user/relay caches every file
search algorithm, which is involved in determining all poten-
with an equal probability, i.e., pUi = MU /N (pR i = MR /N ),
tial caching placement and resource allocation options. Let us
and second, the most popular caching scheme, where every
define the variable vector X = {PU , PR , PD , PR }, where the
user/relay caches the first MU /MR files with probability 1, and
length of vector X is K = 2N + 2. Note that Xi ∈ [0, πi ],
the remaining files with probability 0. To get the final results,
where πi = 1 for 1 ≤ i ≤ 2N , πi = P̄D for i = 2N + 1, and
we run Algorithm 1 for only five iterations. It means that our
πi = P̄R for i = 2N + 2. The exhaustive search method divides
proposed decomposition for the original optimization problem
the K-dimensional space (or the K-dimensional rectangular
reduces the complexity (i.e., the running time). One can ob-
cuboid) into an array of smaller cuboids. Let hi , i ∈ [1, Kt],
serve that the proposed scheme achieves the highest throughput
be the length of the ith side of the smaller cuboid. We have
performance. This is expected because we carefully design the
hi = πi /ki , where ki is the number of equispaced divisions of
" content-caching assignment at users and relays. Besides, the
the ith side of the original cuboid. So, there are K i = 1 ki points, power control techniques at the relays and users help to reduce
at which we compute " the value of the function N T . Thus, it
the footprints of interference caused by several FD links and
needs to perform K i=1 ki steps to get the final optimal solution.
self-interference (SI) caused by the power leakage at the FD re-
In the simple case, we assume ki = k̄, ∀i, and the number of
lays. Furthermore, we show that all the simulation results match
steps is k̄ K = k̄ 2N +2 , which is an exponential function of the
very closely with the analytical results. Thus, only analytical
number of contents.
results are presented in the following. Similarly, Fig. 2(b) illus-
We now move on to analyze the complexity of Algo-
trates the throughput N T versus relay density λR for Md = 2,
rithm 1. We first calculate the steps taken in each iteration in
MR = 8, γ = 1.2, and λU = 10−4 (per m2 ). Again, we can ob-
Algorithm 1. To determine the best caching placement for user
serve that the proposed scheme achieves the highest throughput
and relay levels, we directly use (31) and (33). Then, we use
performance.
the exhaustive search method to determine the best (PD , PR ),
As demonstrated in Fig. 3(a), the impact of γ on the through-
where the number of steps is k̄ 2 . Let Kiter be the number of iter-
put performance is shown, where γ is denoted as the skewness
ations of Algorithm 1, which is observed to have a typical value
of content popularity. We consider the scenario with the fol-
of 5 from numerical results. So the complexity of our proposed
lowing parameters: Md = 2, MR = 8, λU = 10−3 (per m2 ),
scheme is Kiter k̄ 2 , which shows a very low complexity.
and λR = 10−5 (per m2 ). One can see that the system through-
put performance obtained from the local caching space, D2D
VI. NUMERICAL RESULTS
communications, and the FD communications becomes higher
This section presents the numerical results to illustrate the with the increase in the popularity parameter γ. The increase
throughput performance of the proposed resource allocation and in γ makes the popularity more concentrated, yielding a higher

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
 TAN et al.: D2D COMMUNICATIONS IN HETEROGENEOUS NETWORKS WITH FULL-DUPLEX RELAYS AND EDGE CACHING
Fig. 3. For λU = 10−3 (per m2 ) and λR = 10−5 (per m2 ), throughput
versus (a) Zipf parameter γ with M d = 2, M R = 8 and (b) user caching
storage M d with N = 50, M R = M d + 6, and γ = 1.2.
Fig. 4. (a) Throughput versus transmit powers P R and P D for our
proposed scheme, λU = 10−3 (per m2 ), λR = 10−4 (per m2 ), N = 40,
M R = 4 M d = 2, (R U , R R , R B S ) = (15, 50, 200) m, ξ = 0.2, and γ =
1.2. (b) Throughput versus relay density for γ = 0.75 and λU = 10−3
(per m2 ), N = 50, (R U , R R , R B S ) = (15, 50, 200) m, ξ = 0.2 and two
cases of (M d , M R ) = (2, 8), and (M d , M R ) = (8, 16).
cache hit rate. Also the caching ability has a similar effect with
the popularity parameter. Hence, the D2D users can respond
to more received requests, reducing the cell load and the con-
gestion of the BS tier. Similarly, the relays also respond to
more content demands in the case of local cache miss and D2D
cache miss. Furthermore, we realize that the content assignment
scheme helps to significantly improve the performance. For ex-
ample, there is no performance gain in the case of equal caching
scheme, however the throughput increases for the most popu-
lar caching scheme and throughout gain is the largest with the
proposed scheme. Moreover, when γ < 0.3, the throughput of
the most popular caching scheme is lower than that of the equal
caching scheme. When the content is less popular, i.e., in the
low skewness range, the users and the relays in the most popu-
lar caching scheme may choose not to store the content. Hence,
the cache miss occurs more frequently and the throughput de-
grades. However, our proposed scheme always outperforms the
equal caching scheme even in the low skewness range. Next,
throughput performance versus the cache storage is illustrated
in Fig. 3(b) with the parameters N = 50, MR = Md + 6, and
γ = 1.2. Assume that the gap between the caching capacities at
the users and the relays is six contents for simplicity. It can be
seen that the performance of the proposed scheme outperforms
that of the equal caching and most popular caching schemes.
To illustrate the joint optimization of resource allocation
(i.e., power controls of transmit powers PD and PR ) and op-
timal caching placement, we show the throughput N T versus
PD and PR in Fig. 4(a). The parameter setting is presented as
λU = 10−3 (per m2 ), λR = 10−4 (per m2 ), N = 40, MR = 4,
Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
4565
Fig. 5. (a) Throughput versus ξ for our proposed scheme, λU = 10−3
(per m2 ), N = 50, (R U , R R , R B S ) = (15, 50, 200) m, ξ = 0.2, and
(M d , M R ) = (8, 16). (b) Throughput gap versus relay density for γ =
1.2 and λU = 10−4 (per m2 ), N = 10, (R U , R R , R B S ) = (15, 50, 200) m,
ξ = 0.2, and (M d , M R ) = (2, 8).
Md = 2, (RU , RR , RB S ) = (15, 50, 200) m, ξ = 0.2, P̄D =
7.5 mW, P̄R = 50 mW, and γ = 1.2. The dense network with
high values of λU and λR is considered and the low QSIC
with high value of ξ is used. The globally optimal parameters
(PR∗ , PD∗ ) = (0.026, 0.0049) W that maximize the normalized
throughput N T of our proposed scheme is marked by a star
symbol. Specifically, while the throughput N T tends to be less
sensitive to the PD , it decreases significantly when PR deviates
from the optimal value PR∗ . Therefore, the proposed optimiza-
tion approach would be very useful in achieving the largest
throughput performance for the cellular network. Furthermore,
we omit the throughput versus the transmit powers PR and PD
for the most popular caching scheme and equal caching scheme,
which can be found in the technical report [30].
To clearly see the benefit of FD technology, we compare the
throughput of our proposed caching scheme using FD commu-
nications and that of the caching scheme using HD communica-
tions in Fig. 4(b) for two cases of cache storage at the users and
the relays, i.e. (Md , MR ) = (2, 8) and (Md , MR ) = (8, 16).
For brevity, our proposed caching scheme using FD communi-
cations and HD communications are, respectively, referred to
as FD and HD. In fact, the caching scheme with HD commu-
nications uses the same mechanism as our proposed scheme
except that it allows the users to directly receive requested con-
tents from the macro BSs by using HD communications in the
case of cache miss. We can easily observe that our proposed
scheme outperforms the caching scheme with HD communica-
tions. Furthermore, in the largest density of relay, the throughput
performance of caching scheme with HD communications ap-
proaches that of our proposed scheme especially for the low
cache storage, (Md , MR ) = (2, 8). Due to the low cache stor-
age at relays and users, requesting users must connect to the
macro BSs to obtain the requested contents. So, the number of
active FD links in our proposed scheme is very high, and that
causes the bad impact on the throughput performance. We can
see that the curve representing the throughput performance for
our proposed scheme changes its slope when the relay density
is larger than λR = 0.12 ∗ 10−3 (per m2 ). The caching scheme
with HD communications is not affected by the increase in relay
density because relays communicate with BSs directly.
In Fig. 5(a), we investigate the impact of self-interference
on the throughput performance. The parameter settings are:
 4566 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 14, NO. 10, OCTOBER 2018
λU = 10−3 (per m2 ), N = 50, (RU , RR , RB S ) = (15, 50, 200)
m, ξ = 0.2, and (Md , MR ) = (8, 16). In particular, we con-
sider ξ = 0.001, 0.01, and 0.4, which represent high, medium,
and low QSIC, respectively. It is observed that the throughput
decreases when QSIC value increases due to the increase in
self-interference at the FD relay. There is a noticeable gap be-
tween high and low QSICs when the relay density increases.
This observation can be explained as follows. Note that in the
network setting, the user density of this considered scenario is
high. So, the number of requested contents is large. Due to the
limit of the user and relay storage, some users’ requests cannot
be accommodated locally and hence the BS has to serve them
via the relays using FD communications. For the high relay
density, the requesting user can be beneficial from the FD trans-
mission in the case of high QSIC, whereas in the case of low
QSIC, it cannot exploit the FD transmission due to the excessive
self-interference. Therefore, the throughput achieved in the case
of high QSIC is significantly improved when compared to the
throughput achieved in the case of low QSIC. For the low relay
density, the number of relays is not enough to sever the huge
number of users. Therefore, the throughput performances are
low and the throughput gap between the cases of high and low
QSICs is small.
Finally, we demonstrate the efficacy of the proposed algo-
rithm by comparing its throughput performance with that ob-
tained using the optimal brute-force search algorithm for small
N . In particular, we demonstrate the throughput gap between
our proposed scheme and the optimal mechanism in Fig. 5(b).
The network setting is presented as γ = 1.2 and λU = 10−4
(per m2 ), N = 5, (RU , RR , RB S ) = (15, 50, 200) m, ξ = 0.2,
and (Md , MR ) = (2, 8). Fig. 5(b) confirms that our proposed
scheme achieves throughput very close to the throughput at-
tained by the optimal solution where the throughput gap is al-
ways below 2%. We also compare the equal caching scheme
and most popular caching scheme to the optimal solution, where
their throughput gaps are very high.
VII. CONCLUSION
In this paper, we proposed a joint optimal resource allocation
and probabilistic caching placement design scheme for Het-
Net with D2D communications and edge caching. In order to
achieve a high throughput, full-duplex relays are used in the
HetNet. Throughput is analyzed by using stochastic geometry
tools and is then further optimized through caching placements.
Numerical results provide insights to the important theoretical
findings in the paper and show significant performance gains
achieved by the configuration for the proposed scheme.
REFERENCES
[1] R. Q. Hu and Y. Qian, “An energy efficient and spectrum efficient wireless
heterogeneous network framework for 5G systems,” IEEE Commun. Mag.,
vol. 52, no. 5, pp. 94–101, May 2014.
[2] L. Wei, R. Q. Hu, Y. Qian, and G. Wu, “Enable device-to-device communi-
cations underlaying cellular networks: Challenges and research aspects,”
IEEE Commun. Mag., vol. 52, no. 6, pp. 90–96, Jun. 2014.
[3] M. Cha, H. Kwak, P. Rodriguez, Y. Ahn, and S. Moon, “I tube,
you tube, everybody tubes: Analyzing the world’s largest user gener-
ated content video system,” in Proc. ACM SIGCOMM Internet Meas.,
2007, pp. 1–14.
Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.
[4] L. D. Xu, W. He, and S. Li, “Internet of things in industries: A survey,”
IEEE Trans. Ind. Inform., vol. 10, no. 4, pp. 2233–2243, Nov. 2014.
[5] Q. Chi, H. Yan, C. Zhang, Z. Pang, and L. D. Xu, “A reconfigurable smart
sensor interface for industrial WSN in IoT environment,” IEEE Trans. Ind.
Inform., vol. 10, no. 2, pp. 1417–1425, May 2014.
[6] L. T. Tan and L. B. Le, “Compressed sensing based data processing and
mac protocol design for smartgrids,” Proc. IEEE Wireless Commun. Netw.
Conf., 2015, pp. 2138–2143.
[7] L. T. Tan and L. B. Le, “Joint data compression and MAC protocol de-
sign for smartgrids with renewable energy,” Wireless Commun. Mobile
Comput., vol. 16, no. 16, pp. 2590–2604, Jul. 2016.
[8] R. Tandon and O. Simeone, “Harnessing cloud and edge synergies: Toward
an information theory of fog radio access networks,” IEEE Commun. Mag.,
vol. 54, no. 8, pp. 44–50, Aug. 2016.
[9] The Network, “Cisco delivers vision of fog computing to accelerate
value from billions of connected devices,” Jan. 2014. [Online]. Available:
http://newsroom.cisco.com/press-release-content?articleId=1334100
[10] N. Golrezaei, A. F. Molisch, A. G. Dimakis, and G. Caire, “Femtocaching
and device-to-device collaboration: A new architecture for wireless video
distribution,” IEEE Commun. Mag., vol. 51, no. 4, pp. 142–149, Apr. 2013.
[11] M. Ji, G. Caire, and A. F. Molisch, “Fundamental limits of caching in
wireless D2D networks,” IEEE Trans. Inf. Theory, vol. 62, no. 2, pp. 849–
869, Feb. 2016.
[12] J. Li, H. Chen, Y. Chen, Z. Lin, B. Vucetic, and L. Hanzo, “Pricing and
resource allocation via game theory for a small-cell video caching system,”
IEEE J. Sel. Areas Commun., vol. 34, no. 8, pp. 2115–2129, Aug. 2016.
[13] J. Li, Y. Chen, Z. Lin, W. Chen, B. Vucetic, and L. Hanzo, “Distributed
caching for data dissemination in the downlink of heterogeneous net-
works,” IEEE Trans. Commun., vol. 63, no. 10, pp. 3553–3568, Oct. 2015.
[14] Y. Chen, M. Ding, J. Li, Z. Lin, G. Mao, and L. Hanzo, “Probabilistic
small-cell caching: Performance analysis and optimization,” IEEE Trans.
Veh. Technol., vol. 66, no. 5, pp. 4341–4354, May 2017.
[15] K. Wang, Z. Chen, and H. Liu, “Push-based wireless converged networks
for massive multimedia content delivery,” IEEE Trans. Wireless Commun.,
vol. 13, no. 5, pp. 2894–2905, May 2014.
[16] A. Sabharwal, P. Schniter, D. Guo, D. W. Bliss, S. Rangarajan, and R.
Wichman, “In-band full-duplex wireless: Challenges and opportunities,”
IEEE J. Sel. Areas Commun., vol. 32, no. 9, pp. 1637–1652, Sep. 2014.
[17] Z. Zhang, K. Long, A. V. Vasilakos, and L. Hanzo, “Full-duplex wireless
communications: Challenges, solutions, and future research directions,”
Proc. IEEE, vol. 104, no. 7, pp. 1369–1409, Jul. 2016.
[18] M. Duarte, C. Dick, and A. Sabharwal, “Experiment-driven characteri-
zation of fullduplex wireless systems,” IEEE Trans. Wireless Commun.,
vol. 11, no. 12, pp. 4296–4307, Dec. 2012.
[19] L. B. Le et al., “Enabling 5G mobile wireless technologies,” EURASIP J.
Wireless Commun. Netw., vol. 2015, Dec. 2015, Art. no. 218.
[20] L. T. Tan, L. Ying, and D. W. Bliss, “Power control and relay selection
in full-duplex cognitive relay networks: Coherent versus non-coherent
scenarios,” in Proc. 51st Annu. Conf. Inf. Sci. Syst., 2017, pp. 1–6.
[21] M. Maso, I. Atzeni, I. Ghamnia, E. Batu, and M. Debbah, “Cache-aided
full-duplex small cells,” in Proc. 15th Int. Symp. Model. Optim. Mobile,
Ad Hoc, and Wireless Netw., 2017, pp. 1–6.
[22] M. Naslcheraghi, S. A. Ghorashi, and M. Shikh-Bahaei, “FD device-to-
device communication for wireless video distribution,” IET Commun.,
vol. 11, no. 7, pp. 1074–1081, 2017.
[23] E. Bastug, M. Bennis, and M. Debbah, “Living on the edge: The role of
proactive caching in 5G wireless networks,” IEEE Commun. Mag., vol. 52,
no. 8, pp. 82–89, Aug. 2014.
[24] J. G. Andrews, H. Claussen, M. Dohler, S. Rangan, and M. C. Reed,
“Femtocells: Past, present, and future,” IEEE J. Sel. Areas Commun.,
vol. 30, no. 3, pp. 497–508, Apr. 2012.
[25] J. G. Andrews, F. Baccelli, and R. K. Ganti, “A tractable approach to
coverage and rate in cellular networks,” IEEE Trans. Commun., vol. 59,
no. 11, pp. 3122–3134, Nov. 2011.
[26] H. S. Dhillon, R. K. Ganti, F. Baccelli, and J. G. Andrews, “Modeling and
analysis of k-tier downlink heterogeneous cellular networks,” IEEE J. Sel.
Areas Commun., vol. 30, no. 3, pp. 550–560, Apr. 2012.
[27] J. Wang, “A survey of web caching schemes for the internet,” ACM SIG-
COMM Comput. Commun. Rev., vol. 29, no. 5, pp. 36–46, Oct. 1999.
[28] B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, “A
survey of information-centric networking,” IEEE Commun. Mag., vol. 50,
no. 7, pp. 26–36, Jul. 2012.
[29] M. Haenggi and R. K. Ganti, “Interference in large wireless networks,”
Foundations Trends Netw., vol. 3, no. 2, pp. 127–248, 2009.
[30] “D2D communications in heterogeneous networks with full-duplex relays
and edge caching,” Tech. Rep., 2018. [Online]. Available: https://www.
dropbox.com/s/oc9ud0sm3igljke/TIISSTechreport.pdf?dl=0
 TAN et al.: D2D COMMUNICATIONS IN HETEROGENEOUS NETWORKS WITH FULL-DUPLEX RELAYS AND EDGE CACHING 4567

Le Thanh Tan (S’11–M’15) received the B.Eng. Yi Qian (M’95–SM’07) received the Ph.D. de-
and M.Eng. degrees from Ho Chi Minh Univer- gree in electrical engineering from Clemson Uni-
sity of Technology, Ho Chi Minh City, Vietnam, versity, Clemson, SC, USA, in 1996.
in 2002 and 2004, respectively, and the Ph.D. He was a Senior Member of the Scientific
degree from Institut National de la Recherche Staff and a Technical Advisor with Nortel Net-
Scientifique, Quebec City, QC, Canada, in 2015, works, a Senior Systems Engineer and a Techni-
all in telecommunications. cal Advisor with several start-up companies, an
He is currently with the Department of Elec- Assistant Professor with the University of Puerto
trical & Computer Engineering, Utah State Uni- Rico at Mayaguez, and a Senior Researcher with
versity, Logan, UT, USA. From 2002 to 2010, he the National Institute of Standards and Technol-
was a Lecturer with Ho Chi Minh University of ogy. He is currently a Professor with the Depart-
Technical Education. In 2015, he was a Postdoctoral Research Asso- ment of Electrical and Computer Engineering, University of Nebraska–
ciate with the Ecole Polytechnique de Montreal, Montreal, QC, Canada. Lincoln (UNL), Lincoln, NE, USA. He has a successful track record in
From 2016 to 2017, he was a Postdoctoral Research Associate with leading research teams and publishing research results in leading sci-
Arizona State University, Tempe AZ, USA. His research interests include entific journals and conferences. Several of his recent journal articles on
artificial intelligence, machine learning, Internet of Things, vehicular net- wireless network design and wireless network security are among the
works, 5G wireless communications, edge computing, fog computing most accessed papers in the IEEE Digital Library. His research interests
and cloud computing, information centric networking, software defined include information assurance and network security, network design, net-
networking, and network function virtualization. work modeling, simulation and performance analysis for next-generation
Dr. Tan was on TPCs of different international conferences including wireless networks, wireless ad hoc and sensor networks, vehicular net-
IEEE CROWNCOM, VTC, PIMRC, etc. works, broadband satellite networks, optical networks, high-speed net-
works, and the Internet.
Prof. Qian is a member of the ACM. He is the Chair for the IEEE
Communications Society Technical Committee for Communications and
Rose Qingyang Hu (S’95–M’98–SM’06) re- Information Security. He is a Distinguished Lecturer of the IEEE Vehicu-
ceived the B.S. degree in electrical engineering lar Technology Society. He is the Associate Editor-in-Chief of the IEEE
from the University of Science and Technology WIRELESS COMMUNICATIONS. He received the Henry Y. Kleinkauf Family
of China, Hefei, China, in 1992, the M.S. degree
Distinguished New Faculty Teaching Award in 2011 and the Holling Fam-
in mechanical engineering from the Polytechnic ily Distinguished Teaching Award in 2012 from the College of Engineer-
Institute of New York University, Brooklyn, NY,
ing, UNL. He is currently on the editorial board for several international
USA, in 1995, and the Ph.D. degree in electri-
journals and magazines.
cal engineering from The University of Kansas,
Lawrence, KS, USA, in 1998.
She has more than ten years of research and
development experience in the telecommunica-
tions industry as a Technical Manager, a Senior Wireless System Ar-
chitect, and a Senior Research Scientist. From 2002 to 2004, she was
an Assistant Professor with the Department of Electrical and Computer
Engineering, Mississippi State University. She is currently an Associate
Professor with the Department of Electrical and Computer Engineering,
Utah State University, Logan, UT, USA. Her research interests include
next-generation wireless communications and networks, network design
and optimization, multimedia QoS/QoE, wireless system modeling and
performance analysis, and network security. She has published exten-
sively and holds a number of patents in these areas.
Dr. Hu is currently on the Editorial Boards of the Security and Com-
munication Networks and Wireless Communications and Mobile Com-
puting. She was a Guest Editor of the IEEE COMMUNICATIONS, the IEEE
WIRELESS COMMUNICATIONS, and the IEEE NETWORK. She is a member
of Phi Kappa Phi and Epsilon Pi Epsilon Honor Societies.

Authorized licensed use limited to: Indian Institute of Technology - BHUBANESWAR. Downloaded on October 06,2021 at 05:25:05 UTC from IEEE Xplore. Restrictions apply.