algorithms

Article
Power Control and Channel Allocation Algorithm for
Energy Harvesting D2D Communications
Na Su 1,2 and Qi Zhu 1,2, *
1 Jiangsu Key Laboratory of Wireless Communications, Nanjing University of Posts and Telecommunications,
Nanjing 210003, China; su_nasu@163.com
2 Engineering Research Center of Health Service System Based on Ubiquitous Wireless Networks,
Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing 210003, China
* Correspondence: zhuqi@njupt.edu.cn




Received: 16 February 2019; Accepted: 25 April 2019; Published: 3 May 2019


Abstract: This paper assumes that multiple device-to-device (D2D) users can reuse the same
uplink channel and base station (BS) supplies power to D2D transmitters by means of wireless
energy transmission; the optimization problem aims at maximizing the total capacity of D2D users,
and proposes a power control and channel allocation algorithm for the energy harvesting D2D
communications underlaying the cellular network. This algorithm firstly uses a heuristic dynamic
clustering method to cluster D2D users and those in the same cluster can share the same channel.
Then, D2D users in the same cluster are modeled as a non-cooperative game, the expressions of D2D
users’ transmission power and energy harvesting time are derived by using the Karush–Kuhn–Tucker
(KKT) condition, and the optimal transmission power and energy harvesting time are allocated to
D2D users by the joint iteration optimization method. Finally, we use the Kuhn–Munkres (KM)
algorithm to achieve the optimal matching between D2D clusters and cellular channel to maximize
the total capacity of D2D users. Simulation results show that the proposed algorithm can effectively
improve the system performance.

Keywords: device-to-device communication; energy harvest; power control; channel allocation;

non-cooperative game

1. Introduction
Device-to-device (D2D) communication is one of the key technologies in the next generation
mobile communication network [1]. It can reduce the power consumption of users’ equipment and
end-to-end transmission delay by allowing two users in close proximity to communicate directly
without traversing the base station (BS) or other core networks. D2D communication allows more
users to connect to the network by reusing spectrum of the cellular network, which can improve the
spectrum utilization rate and system capacity [2].
However, there is inter-layer interference between D2D users and cellular users when D2D users
reuse the channel of cellular users. In addition, there will be intra-layer interference between D2D users
if one cellular user’s channel is reused by multiple D2D users. Therefore, interference management is
an important issue in the heterogeneous network where cellular users and D2D users coexist. In [3],
the authors consider the scenario of multiple D2D users reusing the same channel, model the D2D users’
power allocation problem as a Nash bargaining solution and Nash competition game respectively, and
obtain the optimal transmission power to maximize the utility of D2D users. In [4], the authors aim
at maximizing the energy efficiency of D2D users, derive the expression of optimal power by using
the property of fractional programming, and complete the channel allocation by using the Hungarian
algorithm. A Stackelberg game is used in [5] to maximize the utility function of cellular users and

Algorithms 2019, 12, 93; doi:10.3390/a12050093 www.mdpi.com/journal/algorithms

Algorithms 2019, 12, 93 2 of 12

D2D users by optimizing the D2D users’ transmission power and the BS’s interference price. In [6],
a sub-carrier allocation algorithm is proposed and a geometric water-filling method is used to allocate
the optimal transmission power to D2D users. The above papers implicitly assume that the energy of
the D2D transmitter is infinite, which does not always conform with reality because the energy of the
D2D device is finite or a device needs to be charged.
One solution to solve the energy supply of equipment is to adopt-energy harvesting technology
in a D2D communication network, where D2D equipment can harvest energy from the surrounding
environment. In [7], the authors assume that energy arrives at the beginning of a time slot and
is stored for later use, and use a Pareto-optimal boundary to allocate power for D2D users under
the constraint of the harvested energy on transmission power. In [8], the harvested energy of D2D
transmitters is considered to be independent of each other with uniform distribution, and the authors
use a Lagrange multiplier method and binary search method to obtain the optimal transmission power.
In [9], the arrival of energy is also modeled as a Poisson process, and the energy harvesting time slot
allocation, power and resource block allocation are jointly optimized to maximize the average energy
efficiency of D2D users. However, due to the uncertainty of the environment, it is difficult to predict
the energy that will arrive.
Some scholars have studied the resource allocation when D2D users harvest energy by wireless
power transfer, the energy that broadcast by power station is controllable. In [10], D2D links harvest
energy from the wireless power transmitter located at the BS, D2D users communicate when the
energy is above a lower threshold, and an iterative joint resource block and power resource allocation
algorithm is proposed to maximize the sum throughput of D2D users. However, the authors in [10]
assume that the channel of a cellular user is only reused by one D2D user; when multiple D2D users
reuse a same channel to transmit information, the spectrum utilization can be improved through
appropriate interference management. In [11], D2D transmitters adopt time-switching mode for energy
harvesting and data transmission, the expression for coverage probability of D2D link and cellular
uplink are derived, and the optimal energy harvesting time is optimized by maximizing the average
coverage probability of the D2D link. In [12], energy harvesting enabled D2D users to act as relays
operating in a half-duplex mode to enhance the data transmissions of other D2D users, and D2D
relays were unable to harvest energy and transmit data simultaneously; the energy harvesting time
and transmission power of relays are optimized to maximize the D2D users’ throughput. In [13],
D2D users harvest energy from a power station and transmit information signals simultaneously, and
the sum throughput is maximized via joint time scheduling and power control. Literature [11–13]
assumes that the energy harvesting time of different D2D user is same, but in fact the energy harvesting
time of multiple D2D transmitters is different because the distance between D2D transmitter and BS,
the distance between D2D user pair are different.
In this paper, we consider that D2D transmitter can harvest energy by wireless power transfer,
while the energy harvesting time of the different D2D users is different, multiple D2D users can reuse
the same channel. The contributions of this paper are summarized as follows:

(1) The optimization problem of joint power control and channel allocation is constructed by
considering the constraints of harvesting energy on transmission power, QoS (Quality of Service)
of cellular users and channel multiplexing, so as to maximize the total capacity of D2D users.
The original mixed integer nonlinear problem is transformed into a convex optimization problem
by variable substitution and fractional programming.
(2) The optimal joint power control and channel allocation algorithm is proposed. The optimal
transmission power and energy harvesting time of D2D users are determined by the joint iterative
method. The KM algorithm is used to complete the optimal matching between D2D users and
cellular users’ channel.
(3) The simulation results of the proposed algorithm are provided to verify the effectiveness of the
proposed resource allocation algorithm. The system performance of the proposed algorithm in
terms of D2D users’ total capacity is compared with the algorithm in [13] and equal time allocation
Algorithms 2019, 12, 93 3 of 12

Algorithms 2019, 12, x FOR PEER REVIEW 3 of 13

(ETA) methods. The simulation results show that the proposed algorithm can effectively improve
effectively
the system improve the system performance.
performance.
The rest of this paper is organized as follows. We describe the system model of D2D
The rest of this paper is organized as follows. We describe the system model of D2D communication
communication based on energy harvesting in Section 2. Then, in Section 3, the proposed optimal
based on energy harvesting in Section 2. Then, in Section 3, the proposed optimal joint power control
joint power control and channel allocation algorithm is investigated. Simulation results are provided
and channel allocation algorithm is investigated. Simulation results are provided and analyzed in
and analyzed in Section 4 to show the performance of the proposed algorithm. Finally, conclusions
Section 4 to show the performance of the proposed algorithm. Finally, conclusions are drawn in
are drawn in Section 5.
Section 5.
2. System Model
2. System Model
As shown in Figure 1, we consider a single cell scenario, where a BS locates in the center of the
As shown in Figure 1, we consider a single cell scenario, where a BS locates in the center
cell and M cellular users coexist with N D2D pairs, we use CU  {1, 2,..., i,..., M } and
of the cell and M cellular users coexist with N D2D pairs, we use CU = {1, 2, . . . , i, . . . , M} and
D = D1,2,
 {1, 2,..., j,..., N } to indicate the sets of cellular users and D2D users, each pair of D2D user
. . . , j, . . . , N to indicate the sets of cellular users and D2D users, each pair of D2D user
includes
includes one D2D one transmitter
D2D transmitter
and one and
D2D one D2DEach
receiver. receiver. Each
cellular user cellular
occupiesuser occupies
one uplink one uplink
orthogonal
orthogonal channel to communicate with the BS; D2D users reuse the channels
channel to communicate with the BS; D2D users reuse the channels assigned to the cellular users, and assigned to the
eachcellular
channelusers,
can beand each channel
occupied by morecan beone
than occupied by more
D2D users than
but one D2Doneuser
D2D users
just but one
can reuse oneD2D user just
channel
can reuse one channel of cellular user. Therefore, interference exists in cellular
of cellular user. Therefore, interference exists in cellular user and D2D users, D2D users also impose user and D2D users,
D2D users
interference also other
to each impose interference
that sharing thetosame
each channel.
other that sharing the same channel.

CU m
DT1
DR j DRN

...
BS

DT j DTN
DR1
... CU M
CU1
Date link Interference of DT to BS
Interference of CU to DR Interference between Ds

Figure 1. System
Figure model
1. System of device-to-device
model (D2D)
of device-to-device communication
(D2D) underlaying
communication cellular
underlaying network.
cellular network.

Assuming that BS
Assuming supplies
that power topower
BS supplies D2D transmitters by means of wireless
to D2D transmitters by meansenergy
of transmission,
wireless energy
the D2D user completes the energy harvesting and information transmission during
transmission, the D2D user completes the energy harvesting and information transmission the T.
time periodduring
In the
thetime periodof TθT,
timeperiod . Inthe
theD2D period of harvests
timetransmitter energy
T , the D2D broadcast
transmitter by the energy
harvests BS, andbroadcast
in the later
by the
(1 − θ
BS, and in the later (1   )T time period, the D2D transmitter employs the harvested energy to
) T time period, the D2D transmitter employs the harvested energy to communicate with D2D
receiver. The harvested energy at the D2D transmitter j is given by:
communicate with D2D receiver. The harvested energy at the D2D transmitter j is given by:
E j = ξEj θj jTP
 jBS
 jhTP
BjBS hBj (1) (1)

where wherePBS isPBStheistransmit

the transmit
power power of hBS,
of BS, theischannel
Bj ishBj the channel gaingain between
between BS and
BS and D2D D2D transmitter
transmitter j, j ,
ξ j ∈ (0,
j  (0,1) denotes the energy harvesting efficiency of the D2D transmitter, which can be expressed
1) denotes the energy harvesting efficiency of the D2D transmitter, which can be expressed
as [14]:
as [14]:
ξ j = ξm,j · ξp,j · ξo,j · ξdct,j (2)
 j  m, j   p, j  o, j  dct , j (2)
where ξm,j is matching efficiency, and it is related to the impedance of the rectifier antenna and the
inputwhere
impedance m , j isofmatching
the directefficiency,
current (dc) it is relatedξp,j
andconverter. to the
is the impedance
efficiencyofassociated
the rectifier antenna
with and the
parasitic
losses.
inputξo,j impedance
is the efficiency of direct
of the conversion
currentthat is mainly
(dc) converter.related  p , to the non-linear rectifier diode. ξdct,j is
j is the efficiency associated with parasitic
the efficiency of dc power transfer from the non-linear device to the dc load.
losses.  o , j is the efficiency of conversion that is mainly related to the non-linear rectifier diode.
 dct , j is the efficiency of dc power transfer from the non-linear device to the dc load.
Suppose the number of D2D users share the channel of cellular user i is K , thus, the signal to
inference plus noise ratio (SINR) of cellular user i and D2D receiver j can be expressed as:
Algorithms 2019, 12, 93 4 of 12

Suppose the number of D2D users share the channel of cellular user i is K, thus, the signal to
inference plus noise ratio (SINR) of cellular user i and D2D receiver j can be expressed as:

pci hiB
SINRBi = (3)
K
Pdk,i hkB
P
+ N0
k =1

pdj,i h j
SINRdj,i = c P d (4)
pi hij + Pk,i hk j + N0
k, j

The capacity of D2D user j can be written as

Cdj,i = (1 − θ j,i )T log(1 + SINRdj,i ) (5)

where Pci and Pdj,i are the transmission power of the cellular user i and the D2D transmitter j, hiB is
the channel gain between the cellular user i and the BS, hkB is the channel gain between the D2D
transmitter k and the BS, h j is the channel gain between the D2D pair j, hij is the channel gain between
the cellular user i and D the 2D receiver j sharing the same channel, hk j is the channel gain between the
D2D transmitter k and the D2D receiver j reusing the same channel, N0 represents the spectral density
of additive white Gaussian noise (AWGN) for the BS and the D2D receivers.

3. Optimal Joint Power Control and Channel Allocation Algorithm

3.1. Optimization Formulation

In this section, we analyze the optimal transmission power and energy harvesting time of D2D
users, the optimal channel matching between cellular users and D2D users, taking the minimum QoS
demands of cellular users and the limited transmission power into consideration, the optimization
problem (P1) is established as
XM X K
max CD2D = x ji Cdj,i (6)
{Pdj,i ,θ j,i ,x ji } i=1 j=1

Subject to:
SINRBi ≥ rthc (7)

0 < θ j,i < 1 (8)

(1 − θ j,i )Pdj,i ≤ ξ j θ j,i PBS hBj (9)

Pci ≤ Pcmax , Pdj,i ≤ Pdmax (10)

X
x ji ∈ {0, 1}, x ji ≤ 1 (11)
i

where x ji is the channel reuse indicator of the D2D user, x ji = 1 means the D2D user j reuses the
channel of cellular user i, otherwise, it does not reuse. rthc represents the minimum SINR threshold of
the cellular users, Pcmax and Pdmax represent the maximum transmit power of cellular users and D2D
users, respectively. Equation (6) is the objective function of maximizing the total capacity of D2D users.
Equation (7) guarantees the QoS requirement of cellular users. Equation (8) is the energy harvesting
time constraint. Equation (9) is the energy causality constraint and means that the consumed energy for
transmitting signals cannot exceed its harvested energy. Equation (10) indicates the limit transmission
power of the cellular user and the D2D users. Equation (11) represents that one D2D user can reuse at
most one channel.
Algorithms 2019, 12, 93 5 of 12

The optimization problem P1 is a mixed-integer nonlinear programming problem, which is

NP-hard and cannot be solved by standard convex optimization methods [15]. Therefore, we cluster
D2D users according to interference weight graph in the first step, and those in the same cluster can
share the same channel. Then, a joint iteration optimization method is used to determine the optimal
transmission power and energy harvesting time. Last, we allocate channel for D2D users with the KM
algorithm to maximize the total capacity of D2D users.

3.2. Optimal Joint Power Control and Channel Allocation Algorithm

The heuristic dynamic clustering method of [16] is used to divide the N D2D users into M
clusters with the goal of minimizing the co-channel interference of D2D users in each cluster, and
DC = {1, 2, . . . , m, . . . M} represents the set of D2D clusters. Thus, M D2D clusters reuse M channels
of cellular users, each D2D cluster reuses one channel, and each cellular user’s channel is reused by
one D2D cluster. In optimization problem P1, the channel allocation problem of D2D users can be
transformed into the channel allocation problem of D2D clusters, and ymi is used to denote the channel
reuse indicator of D2D cluster, when D2D cluster m reuses the channel of cellular user i, ymi = 1,
otherwise, ymi = 0.
Because different D2D clusters reuse channels of different cellular users, inter-layer interference
only exists among D2D users in the same cluster. Therefore, the maximum capacity of a single D2D
cluster can be solved first, and then the maximum total capacity of D2D users can be obtained by
summing the maximum capacity of all D2D clusters. Assuming that D2D cluster m reuses the channel
of cellular user i, that is ymi = 1, and the number of D2D users in D2D cluster m is K. The capacity of
D2D cluster m when it reuses the channel of cellular user i can be calculated by:

K
X
Cm
D2D,i = Cdj,i (12)
k =1

Analyzing Equation (12) we can find that the capacity of D2D cluster is monotone decreasing
with regard to Pci , the capacity of D2D cluster can be optimal when the minimum value of Pci is taken
on the premise of satisfying the cellular user’s QoS. The lower bound of Pci can be obtained from
Equation (7) as:  
 d∗
Pd∗
P 
rthc P j,i h jB + h + N0 
k,i kB
k, j
Pc∗
i = (13)
hiB
The transmission power of D2D user is related to the energy harvested by D2D transmitter at the
energy harvesting time. We define a new variable as:

1
t j,i = (14)
1 − θ j,i
 
Then the capacity expression of the D2D user is transformed into: Cdj,i = T log 1 + SINRdj,i /t j,i ,
the numerator and denominator are all functions of energy harvesting time. Suppose the maximum
capacity of D2D cluster m is q∗m,i and denoted as:
 
K Q 
d
P
 tk,i T log 1 + SINR j,i 
 
j=1 k,j
q∗m,i = max (15)
{Pdj,i ,t j,i } K
Q
t j,i
j=1
Algorithms 2019, 12, 93 6 of 12

According to [17], the maximum capacity of D2D cluster m can be obtained if and only if,
   

 XK Y    YK 

d   − q∗
   
max  t T log 1 + SINR t =0 (16)
  
 k,i j,i m,i j,i 
{Pdj,i ,t j,i }
 
 
 

 j=1 k, j j=1 

Substituting Equations (13) and (14) into Equation (16), the optimization problem (P2) can be
written as:     
d h
 
K  P K
   
j
X  
j,i
 Y    Y 
∗
     
max  t T log 1 + − q t (17)
    
k,i m,i j,i
Ψ d Ψ d Ψ
  P   
{Pdj,i ,t j,i } P + P +
     
1 j,i 3 k,i 2 
    
j = 1 k, j j = 1

 
 
   

 k,j 

Subject to:
t j,i ≥ 1 (18)
!
1 d 1
P j,i ≤ 1 − Ψ4 (19)
t j,i t j,i

Pci ≤ Pcmax , Pdj,i ≤ Pdmax (20)

where Ψ1 = hij rthc h jB /hiB , Ψ2 = hij rthc hkB /hiB + hk j , Ψ3 = hij rthc N0 hiB + N0 , Ψ4 = ξ j PBS hBj .
The Lagrange function of (17) with respect to Equation (19) is formulated as
  
  K   Pdj,i h j  K    
d
 − q∗m,i −λ 1 d 1
Ψ4
P  Q Q
L P j,i , t j,i =  tk,i T log1 +
 
Ψ1 P j,i + Ψ3 Pk,i +Ψ2 
d P d

t j,i t j,i P j,i − 1− t j,i (21)
j=1k,j 
k, j
 j=1

where λ is the Lagrange multiplier. The D2D users that share the same channel are modeled as
non-cooperative game, thus, for D2D user j, the interference of other D2D users can be treated as noise
in the solving process. We can get the following formulas through seeking the second partial derivative
of Equation (21) with Pdj,i and t j,i
  
Ψ d Ψ  2Ψ1 γ + h j γ + Ψ1 Pd h j
  Q  P 
∂ L P j,i , t j,i
2 d −h j T tk,i 
 3 Pk,i
+ 2  j,i
k,j k, j
 2 = 2
(22)
∂ Pdj,i ln 2 · γ2 (γ + Pdj,i h j )

   
∂2 L Pdj,i , t j,i −2λ Pdj,i + Ψ4
= (23)
∂t2j,i t3j,i

where γ = Ψ1 Pdj,i + Ψ3 Pdk,i + Ψ2 . The formula Equations (22) and (23) are always less than zero,
P
k,j
 
so L Pdj,i , t j,i is a convex function of Pdj,i and t j,i , according to the convex optimization theory, the
 
solution of L Pdj,i , t j,i is the optimal solution of optimization problem P2.
The KKT condition of optimization problem P2 can be expressed as:

Ψ3 Pdk,i + Ψ2
Q P
tk,i
h jT k, j k, j λ
· − =0 (24)
ln 2 γ(γ + Pdj,i h j ) t j,i

 d 
Y  P j,i Ψ 
4
− q∗m,i tk,i − λ− 2 − 2  = 0 (25)

 t t j,i 
k,j j,i
Algorithms 2019, 12, 93 7 of 12

 d 
 P j,i Ψ4 
λ + − Ψ4  = 0 (26)
 
 t j,i t j,i 

Pdj,i Ψ4
+ − Ψ4 ≤ 0 (27)
t j,i t j,i
λ≥0 (28)

When λ = 0, Equation (26) has no solution because of Ψ3 Pdk,i + Ψ2 , 0; when λ , 0, we can

P
k,j
obtain the optimal value of Pdj,i and t j,i according to the equation set consists of Equations (24)–(26):
 
√  
∆ −  Ψ3 Pk,i + Ψ2  2Ψ1 + h j
d
 P

k,j
Pd∗
j,i =   (29)
2 Ψ1 2 + Ψ1 h j

Pd∗
j,i
t∗j,i = 1+ (30)
Ψ4
 
4Ψ4 h j T (Ψ1 2 +Ψ1 h j ) Ψ3 Pdk,i +Ψ2 
 2  P 
k, j
where ∆ = h2j  Ψ3 Pdk,i + Ψ2  + > 0.

 P 
ln 2·q∗m,i
k,j
When K D2D users reuse the same channel, the transmission power of D2D user j varies while
other K − 1 D2D users’ transmission power change, meanwhile, the transmission power of D2D user j
also affects the transmission power of other K − 1 D2D users. Therefore, the transmission power of
D2D users is dynamically adjusted by using the joint iterative optimization method until the optimal
values are obtained.
After obtaining the optimal transmission power and energy harvesting time of K D2D users in the
cluster when each D2D cluster reuses the M channels of cellular users respectively, the KM algorithm
is used to achieve the optimal matching between D2D clusters and cellular users’ channels [18].
The optimization problem to maximize the total capacity of D2D users by allocating the cellular
users’ channels for D2D clusters can be transformed into the optimal matching problem of a weighted
bipartite graph, and the KM algorithm can transform the problem of the maximum weight matching
into the problem of completeness matching by giving a label to each vertex. As shown in Figure 2,
D2D clusters set and cellular users set respectively represents two mutually disjointed vertex sets in the
bipartite graph, are two mutually disjointed vertex sets in the dichotomy graph respectively. When the
D2D cluster m reuses the channel of cellular user i it will create a connecting line between the vertex m
and the vertex i, and the weight value on the connecting line is Cm D2D,i
, which indicates the capacity of
the D2D cluster m when it reuses the channel of cellular user i.
According to the above analysis, the optimal joint power control and channel allocation algorithm
is shown in Algorithm 1.
Complexity Analysis: The proposed optimal joint power control and channel allocation algorithm
consists of three steps. In first step, clustering N D2D users into M clusters in N − M iterations,
 the
complexity is O(N − M). In second step, allocating power to the users, the complexity is O LNM2 in
the worst case, where L is the iteration number. In third iteration, matching
 channels between D2D
clusters and cellular users by KM algorithm, the complexity is O M3 . The overall computational
 
complexity of the proposed algorithm is O LNM2 .
Algorithms 2019, 12, 93 8 of 12
Algorithms 2019, 12, x FOR PEER REVIEW 8 of 13

m 1 2 ... m ... M-1 M

D2D cluster CDi 2 D ,m

C 1
D 2 D ,2 C 2
D 2 D,M CDM2D1,1 CDM2 D , M 1

i 1 2 ... i ... M-1 M

Cellular user

Figure 2. Weightedbipartite
2. Weighted bipartite graph
graph forfor optimal
optimal matching
matching problem
problem of D2D
of D2D clusters
clusters and cellular
and cellular users’
users’ channels.
channels.

Algorithm 1. Optimal
According to thejoint poweranalysis,
above control and
thechannel allocation
optimal joint algorithm
power control and channel allocation
algorithm
Input: theissetshown in Algorithm
of cellular 1. set of D2D users D, the tolerance ε > 0.
users CU, the
Output: the optimal transmission power of cellular user and D2D user Pc∗ i
and Pd∗
j,i
, the optimal energy
harvesting 1.
Algorithm time θ j,i , thejoint
∗
Optimal channel reusecontrol
power indicator of D2D
and x ji .
user allocation
channel algorithm
d ∗
1) Initialization:
Input: P j,i , qm,i , users
the set of cellular t j,i . CU , the set of D2D users D , the tolerance   0 .
2) Divide D2D users into M clusters according to interference weight graph [16].
Output:
3) For i =the
1 : optimal
M transmission power of cellular user and D2D user Pi c* and Pjd,i* , the optimal energy
4) For
harvesting m =1*j ,:i ,Mthe channel reuse indicator
time  of D2D user x ji .
 K  
K

 P  Q d  ∗ Q t  ≥ ε do

While  P d , qtk,i
1)5)Initialization： * C  −q
m , i , j,itj , i . m,i
j ,i
j,i 
 j=1 k, j j=1 
2)6)Divide D2DFor j = 1into
users : K M clusters according to interference weight graph [16].
7) Calculate Pd∗ j,i
and t∗j,i with Equations (29) and (30);
3)8)For i  1: MEnd for
∗
4)9)  1: M qm,i with Equation (15);
For mCalculate
10) End while
Calculate θ∗j,i, Pc∗ anddCm * with Equations (12)–(14);
K K
5)11)
While 
 i tk ,i C j ,i D2D,i
j 1  k  j

 qm,i t j ,i   do
12) End for  j 1
13) End for
6)14) Use the KM algorithm  1: K the optimal matching between D2D clusters and cellular users’ channels.
For toj achieve
7) Calculate Pjd,i* and t *j ,i with Equations (29) and (30);
4. Simulation Results and Discussion
8) End for
In this section, the simulation results of the proposed optimal joint power control and channel
9)
allocation algorithm Calculate
in MATLAB qm*R2015b
, i with areEquation
given, (15);
and the influence of the distance between D2D pair
Rd, the numberEnd
10) of D2D
while users N, and the number of cellular users M on the total capacity of D2D users
is analyzed. In this paper, we denote that channel gain consists of large-scale fading based on path
 *j ,i , based
 2
11) Calculate
loss and small-scale fading Pi c* and CDm2 D ,i with
on Rayleigh Equations
fading and is (12)–(14);
expressed as h = κd−α  g0  [15], where
κ and α respectively
12) End for represents path loss constant and path loss exponent, d is the distance between
 2
transmitter and receiver, and  g0  represents Rayleigh fading that follows the mean value of exponential
13) End for as 1. After analyzing ξ , ξ , ξ and ξ , the simulation diagram in [19] illustrates
distribution m,j p,j o,j dct,j
the relationship between converter efficiency
14) Use the KM algorithm to achieve the optimal matching and input power, according
between to the simulation
D2D clusters  diagram,
and cellular users’
 channels.
we use an expression for energy harvesting efficiency in the simulation is ξ j = 1/ 1 + exp −PBS hBj .
Other simulation parameters and their specific values are given in Table 1.
Complexity
Figure 3Analysis:
shows theThe impact proposed optimal
of different joint power
distance betweencontrol
D2Dand pairchannel allocation
on the total capacityalgorithm
of D2D
consists
users, andof the
three steps. Inalgorithm
proposed first step,inclustering D2D userswith
this paperNis compared intothe clusters in
M algorithm N  and
in [13] M iterations,
the equal
the
timecomplexity
allocation (ETA)  N  M  The
is Omethod. . In ETA second
method step,uses
allocating power
half the time T toto the users,
harvest energythe
andcomplexity is
the other half
O  LNM  in the worst case, where L is the iteration number. In third iteration, matching
to transmit
2 information. Without loss of generality, we consider a standardized unit time period [20],
that is T = 1. In the simulation, it is assumed that there are 10 D2D users and 5 cellular users in 3the cell.
channels between D2D clusters and cellular users by KM algorithm, the complexity is O  M  . The
overall computational complexity of the proposed algorithm is O  LNM 2  .
Algorithms 2019, 12, 93 9 of 12

The channel gain of the D2D link decreases as the distance between the D2D pair increases, which
leads to the decrease of D2D users’ total capacity; therefore, the total capacity of D2D users decreases
with the increasing distance between D2D pair. Meanwhile, the proposed algorithm is superior to the
algorithm in [13] and the ETA method, and the reason is that the proposed algorithm takes both the
co-channel interference of D2D users and the limitation of the harvested energy into account with the
aim of maximizing the total capacity of the D2D user to get each D2D user’s optimal transmission
power, then determines energy harvesting time of each D2D transmitters. The [13] assumes that the
energy harvesting time of multiple D2D transmitters on a same channel is same, however, the optimal
transmission power and energy harvesting time of different D2D transmitters are different. When the
ETA method is adopted, the transmission power of D2D users only depends on the harvested energy
by the D2D transmitter and energy harvesting time is not optimized. Therefore, the algorithm in this
paper can obtain bigger capacity than the algorithm in [13] and ETA method.

Table 1. Simulation parameters.

Parameters Value
Cell radius R/m 500
Maximum transmission power of cellular user Pcmax /dBm 24
Maximum transmission power of D2D user Pdmax /dBm 24
Transmission power of BS PBS /dBm 46
Noise power N0 /dBm −174
Number of cellular users M 5
Algorithms 2019, 12, x FOR PEER REVIEW
Path-loss constant κ 0.01 10 of 13
Path-loss exponent α 3.5

Figure3.3.Total
Figure Totalcapacity
capacityofofD2D
D2Dusers
userswith
withdifferent
differentdistances between
distances the
between D2D
the pair.
D2D pair.

Figure
Figure4 4shows
showsthethetotal
totalcapacity
capacityofofD2D
D2Dusers
userswith
withthe
theincreasing
increasingnumber
numberofofD2D D2Dusers.
users.InInthe
the
simulation, we assume that the distance between D2D pair is 10 m, and there are
simulation, we assume that the distance between D2D pair is 10 m, and there are 5 cellular users in 5 cellular users in
the
thecell.
cell.As
Ascan
canbebeseen
seenfrom
from Figure
Figure 4,
4, with
with the increasing number
the increasing number of of D2D
D2Dusers,
users,thethetotal
totalcapacity
capacityof
ofD2D
D2Dusersusersincreases.
increases.This
Thisisis because
because asas the
the number
number ofof D2D
D2D users
usersincreases,
increases,more moreD2D D2Dusers
userscan
can
reuse the channels of cellular users for communication, which increases the total
reuse the channels of cellular users for communication, which increases the total capacity of D2D capacity of D2D
users.
users.TheThecomplexity
complexityofofthe proposed
the proposed power
power control algorithm
control  is O
 algorithm O )LN
is(LN in theinworst case, case,
the worst and theand
complexity of the power control algorithm in [13] is O LKN in the 3 worst case, where L and K are
the complexity of the power control algorithm in [13] is O  LKN 3  in the worst case, where L and
iteration numbers, the ETA method does not optimize transmission power and energy harvesting time,
andK itsare iteration isnumbers,
complexity O(1). Thethe ETA method
complexity of the does not optimize
proposed transmission
power control algorithmpoweris lowerandthanenergy
[13]
harvesting
and improvestime, andcapacity
the total its complexity is O 1while
of D2D users,  . The
thecomplexity
complexity of proposed power
of the proposed powercontrol
control
algorithm is lower than [13] and improves the total capacity of D2D users, while the complexity of
the proposed power control algorithm is higher than ETA method, but the total capacity of D2D
users increases by 19%. Therefore, the system performance of the proposed power control algorithm
is better than the algorithm in [13] and the ETA method.
users. The complexity of the proposed power control algorithm is O  LN  in the worst case, and
the complexity of the power control algorithm in [13] is O  LKN 3  in the worst case, where L and
K are iteration numbers, the ETA method does not optimize transmission power and energy
harvesting
Algorithms and its complexity is O 1 . The complexity of the proposed power control
2019,time,
12, 93 10 of 12

algorithm is lower than [13] and improves the total capacity of D2D users, while the complexity of
the proposed
algorithm power
is higher control
than algorithm
ETA method, butisthe
higher
total than ETA
capacity ofmethod, butincreases
D2D users the totalbycapacity of D2D
19%. Therefore,
users increases by 19%. Therefore, the system performance of the proposed power control
the system performance of the proposed power control algorithm is better than the algorithm in [13]algorithm
is better
and thanmethod.
the ETA the algorithm in [13] and the ETA method.

Algorithms 2019, 12, xFigure

FOR PEER REVIEW
4. Total capacity of D2D users with different
different number
number of
of D2D
D2D users.
users. 11 of 13

Figure 5 illustrates the relationship between the total capacity of D2D users and the number of
users. In the simulation, it is assumed that there are 10 D2D users in the cell, and the distance
cellular users.
between the D2D D2D pair
pairisis10
10m.
m.It Itcan bebe
can discovered
discovered that as as
that thethe
number
numberof cellular users
of cellular increases,
users the
increases,
totaltotal
the capacity of D2D
capacity users
of D2D increases.
users increases. This is is
This because the
because thenumber
numberofofcellular
cellularusers
usersincreases
increases meaning
that the number of reusable channels increases, which leads to the number of D2D users in some
clusters decreasing so that the mutual interference between D2D users in a same cluster decreases, decreases,
and the total capacity of the D2D D2D useruser is
is increased.
increased.

Total capacity of D2D users with different

Figure 5. Total different number
number of
of cellular
cellular users.
users.

5. Conclusions
5. Conclusions
In this paper, we investigate the problem of assigning optimal transmission power, energy harvesting
In this paper, we investigate the problem of assigning optimal transmission power, energy
time and channels to D2D users under the scenario where multiple D2D users reuse the same channel
harvesting time and channels to D2D users under the scenario where multiple D2D users reuse the
same channel and energy harvesting technology is adopted by the D2D transmitter. An optimal joint
power control and channel allocation algorithm is proposed to maximize the total capacity of D2D
users while ensuring the QoS of cellular users and considering the power limitation of D2D users.
The proposed algorithm firstly divides D2D users into several clusters by constructing the
Algorithms 2019, 12, 93 11 of 12

and energy harvesting technology is adopted by the D2D transmitter. An optimal joint power control
and channel allocation algorithm is proposed to maximize the total capacity of D2D users while
ensuring the QoS of cellular users and considering the power limitation of D2D users. The proposed
algorithm firstly divides D2D users into several clusters by constructing the interference weight graph
based on the channel gain between D2D users, and then D2D users in the same cluster are modeled as
a non-cooperative game; the optimal transmission power and energy harvesting time are obtained
through joint iteration optimization method for each D2D cluster reuse of each channel; and finally,
according to the maximum cluster capacity of each cluster when it reuses every channel, the KM
algorithm is used to allocate channels for D2D clusters to maximize the total capacity of D2D users.
Simulation results show that the proposed algorithm outperforms the algorithm in [13] and the equal
time allocation method in terms of total capacity of D2D users. In the next step, ways of harvesting
energy from the environment will be considered, such as solar energy and wind energy, and other
methods can be learned to study resource allocation in hybrid networks with D2D communication,
such as random geometry and Q learning methods.

6. Patents
Name of patent: Power Control and Channel Allocation Algorithm for D2D Communication
System Based on Energy Harvest. Number: 201811477473.5.

Author Contributions: Conceptualization, N.S. and Q.Z.; Data curation, N.S. and Q.Z.; Formal analysis, N.S. and
Q.Z.; Funding acquisition, Q.Z.; Methodology, N.S. and Q.Z.; Project administration, Q.Z.; Software, N.S. and Q.Z.;
Supervision, Q.Z.; Validation, Q.Z.; Visualization, N.S. and Q.Z.; Writing—original draft, N.S.; Writing—review
and editing, Q.Z.
Funding: This work was funded by National Natural Science Foundation of China (No. 61571234 and 61631020).
Conflicts of Interest: The authors declare no conflict of interest.

References
1. Ahmed, M.; Li, Y.; Waqas, M.; Sheraz, M.; Jin, D.; Han, Z. A survey on socially aware device-to-device
communications. IEEE Commun. Surv. Tutor. 2018, 20, 2169–2197. [CrossRef]
2. Jameel, F.; Hamid, Z.; Jabeen, F.; Zeadally, S.; Javed, M.A. A survey of device-to-device communications:
Research issues and challenges. IEEE Commun. Surv. Tutor. 2018, 20, 2133–2168. [CrossRef]
3. Baniasadi, M.; Maham, B.; Kebriaei, H. Power control for D2D underlay cellular communication: Game
theory approach. In Proceedings of the 2016 8th International Symposium on Telecommunications, Tehran,
Iran, 27–28 September 2016; pp. 314–319.
4. Jiang, Y.X.; Liu, Q.; Zheng, F.C.; Gao, X.; You, X. Energy-efficient joint resource allocation and power control
for D2D communications. IEEE Trans. Veh. Technol. 2016, 65, 6119–6127. [CrossRef]
5. Zhang, G.D.; Hu, J.M.; Heng, W.; Li, X.; Wang, G. Distributed power control for D2D communications
underlaying cellular network using Stackelberg Game. In Proceedings of the 2017 IEEE Wireless
Communications and Networking Conference, San Francisco, CA, USA, 19–22 March 2017; pp. 1–6.
6. Ferdouse, L.; Ejaz, W.; Raahemifar, K.; Anpalagan, A.; Markandaier, M. Interference and throughput aware
resource allocation for multi-class D2D in 5G networks. IET Commun. 2017, 11, 1241–1250. [CrossRef]
7. Saleem, U.; Jangsher, S.; Qureshi, H.K.; Hassan, S.A. Joint subcarrier and power allocation in the
energy-harvesting-aided D2D communication. IEEE Trans. Ind. Inf. 2018, 14, 2608–2617. [CrossRef]
8. Gupta, S.; Zhang, R.; Hanzo, L. Energy harvesting aided device-to-device communication underlaying the
cellular downlink. IEEE Access 2017, 5, 7405–7413. [CrossRef]
9. Kuang, Z.F.; Liu, G.; Li, G.Q.; Deng, X.H. Energy efficient resource allocation algorithm in energy
harvesting-based D2D heterogeneous networks. IEEE Internet Things J. 2018, 6, 557–567. [CrossRef]
10. Yu, S.; Ejaz, W.; Guan, L.; Anpalagan, A. Resource allocation for energy harvesting assisted D2D
communications underlaying OFDMA cellular networks. In Proceedings of the 2017 IEEE 86th Vehicular
Technology Conference, Toronto, ON, Canada, 24–27 September 2017; pp. 1–7.
Algorithms 2019, 12, 93 12 of 12

11. Wang, L.Y.; Liao, X.W.; Li, Y. Transmission strategy for D2D terminal with ambient RF energy harvesting.
In Proceedings of the 2017 IEEE 86th Vehicular Technology Conference, Toronto, ON, Canada, 24–27 September
2017; pp. 1–5.
12. Gong, S.M.; Shen, Y.Y.; Huang, X.X.; Wu, X.X.S.; So, A.M.C. Robust relay beamforming in device-to-device
networks with energy harvesting constraints. In Proceedings of the 2016 IEEE Global Communications
Conference, Washington, DC, USA, 4–8 December 2016; pp. 1–6.
13. Wang, H.C.; Wang, J.L.; Ding, G.R.; Han, Z. D2D communications underlaying wireless powered
communication networks. IEEE Trans. Veh. Technol. 2018, 67, 7872–7876. [CrossRef]
14. Hemour, S.; Zhao, Y.P.; Lorenz, C.H.P.; Dimitri, H.; Gui, Y.S.; Hu, C.M.; Wu, K. Towards low-power
high-efficiency RF and microwave energy harvesting. IEEE Trans. Microw. Theory. Technol. 2014, 62, 965–976.
[CrossRef]
15. Yu, B.Z.; Zhu, Q. A QoS-based channel allocation and power control algorithm for device-to-device
communication underlaying cellular networks. J. Commun. 2016, 11, 624–631.
16. Wei, L.; Wei, Z.; Wen, X.; Tao, S. Dynamic clustering based sub-band allocation in dense femtocell environments.
In Proceedings of the 2012 IEEE 75th Vehicular Technology Conference, Yokohama, Japan, 6–9 May 2012;
pp. 1–5.
17. Dinkelbach, W. On nonlinear fractional programming. Manag. Sci. 1967, 13, 492–498. [CrossRef]
18. Feng, D.Q.; Lu, L.; Yi, Y.W.; Li, G.Y.; Feng, G.; Li, S.Q. Device-to-device communications underlaying cellular
networks. IEEE Trans. Commun. 2013, 61, 3541–3551. [CrossRef]
19. Zoya, P.; Erez, A.F.; Daniel, C.; Regan, Z. Low-power far-field wireless powering for wireless senors.
In Proceedings of the 2013 IEEE Radio and Wireless Symposium, Austin, TX, USA, 20–23 January 2013;
pp. 31–33.
20. Zheng, C.; Huan, X.N.; Tuan, A.L.; Karamanoglu, M.; Ever, E.; Yazici, A. Secure wireless powered and
cooperative jamming D2D communications. IEEE Trans. Green Commun. Netw. 2018, 2, 1–13.

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license (http://creativecommons.org/licenses/by/4.0/).