Wireless Personal Communications

https://doi.org/10.1007/s11277-018-5946-4

Hybrid Resource Allocation Scheme in Multi‑hop

Device‑to‑Device Communication for 5G Networks

Pavan Kumar Mishra1 · Amitesh Kumar1 · Sudhakar Pandey1 · Vinay Pratap Singh2

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Abstract
The 5G communication paradigm provides architecture of coexistence of device-to-device
(D2D) communication with the current cellular communication. Direct D2D communica-
tion offloads the major traffic by enabling the localized communication between the users
with the advantage of close proximity by reusing cellular resource block. However, direct
D2D communication suffers from limited proximity constraint. In order to increase the
proximity, direct D2D communication can be extended to multi-hop D2D communica-
tion. By sharing the cellular resource with multi-hop D2D pairs, a significant interference
may occur that further reduces the system throughput. In order to reduce the interference
and to increase the throughput of the network, a hybrid resource allocation scheme for the
multi-hop D2D communication is proposed in this work. This scheme is divided into two
parts. In first part, an interference matrix is constructed by using graph-based technique.
Particle swarm optimization (PSO) algorithm is applied in second part. The application of
PSO not only reduces the interference at significant level but also harvests true potential
gains of each resource block with improved overall throughput of the system. The exten-
sive simulation results demonstrate the effectiveness of the proposed scheme with the ran-
dom resource allocation scheme and graph-based resource allocation scheme. In addition,
proposed scheme performs better in case of increased proximity and supports the minimum
data rate compared to the orthogonal sharing-based resource allocation and cellular-ori-
ented resource allocation schemes.

Keywords Graph · Interference · Multi-hop D2D communication · Proximity · PSO ·

Resource allocation

* Pavan Kumar Mishra

pavanmishra.it@nitrr.ac.in
1
Department of Information Technology, National Institute of Technology Raipur, Raipur 492010,
India
2
Department of Electrical Engineering, National Institute of Technology Raipur, Raipur 492010,
India

13
Vol.:(0123456789)
 P. K. Mishra et al.

1 Introduction

The rapidly increasing number of mobile devices, voluminous data, and higher data rate
are pushing to rethink the current generation cellular system [1]. The future generation or
fifth generation (5G) cellular networks are expected to meet these requirements. One of
the promising technologies in the fifth generation network is D2D communication where
devices can communicate directly with each other within the proximity area without assis-
tance of communication infrastructure viz. the base station (BS) [2–4]. D2D communica-
tion alleviates traffic loads from BS side and provides higher local data rate and increases
spectral efficiency [4, 5]. D2D users send request to BS for allocating resource block. The
BS allocates resource block based on channel state information (CSI)/signal-to-interfer-
ence plus noise-ratio (SINR).
In resource allocation process, the BS allocates resource block to cellular users (CU)
and D2D users. D2D pairs reuse the resource block of CU users, thus they create interfer-
ence at CU users which decreases the throughput. In order to reduce the interference, an
interference-aware graph-based resource sharing algorithm is proposed [6]. In this scheme,
the authors defined three new attributes (link attribute, resource attribute and cluster attrib-
ute) for each communication link. This interference-aware scheme achieves near-optimum
system performance. In [7], the authors proposed a decentralized multiple gateway assign-
ment protocol based on multi-channel CSMA for machine-to-machine communication
for enhancing throughput of the network. In [8], the authors proposed a channel sharing
scheme based on graph theory for increasing the capacity of CU users and D2D users. This
scheme is based on bipartite graph where vertices are denoted by D2D and CU users, edges
are denoted by the links between D2D pairs and CU users. In [9], the authors proposed a
resource allocation model based on an imperfect information Stackelberg game (CSAM-
IISG) using a hidden Markov model (HMM) in a cloud computing environment. In [10],
the authors proposed a distance constrained resource allocation scheme based on linear
sum assignment problem (LSAP) and linear bottleneck assignment problem (LBAP).
Due to increase in the number of D2D pairs with limited spectrum, it is required to
share same resource block by more than one D2D pairs with CU user. This generates huge
interference which reduces the network throughput. In order to reduce the interference in
multi sharing scenario, several research articles are proposed [11, 12]. In [11], the authors
consider the resource allocation problem as a reverse iterative combinatorial auction game,
and proposed a joint resource and power allocation scheme which results in high energy
efficiency. In [12], the authors proposed a graph-based resource allocation scheme and
sequential second price auction mechanism to allocate the resources for D2D communica-
tions with multiple user pairs.
When the D2D users are not in proximity, they can communicate with the help of other
device (relay) [13, 14]. This is known as multi-hop D2D communication. In the multi-hop
D2D communication, minimum two links will be established between D2D pairs (source-
to-relay and relay-to-destination) which requires resource block for each link communica-
tion. Multi-hop D2D communication increases the proximity area, as a result, the device
will communicate with minimum involvement of the BS. In addition, multi-hop D2D
communication increases the network throughput and spectral efficiency by reusing same
resource block. A very limited number of works related to multi-hop D2D communication
are reported in the literatures which are discussed in Sect. 2 in detail.
Motivation The multi-hop D2D communication increases the network throughput with
limited resources. In addition, it also increases proximity and reduces load from BS side.

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

There are very less works reported in this area. The reported works did not consider the
multi sharing scenario where multiple D2D pairs will use same resource block with CU
user. This generates huge interference in multi-hop D2D communication case. Therefore, it
is required to have a resource allocation scheme for multi-hop D2D communication which
should improve the network throughput and should perform better in case of increased
proximity.
Objectives The objectives of proposed scheme are as follow:

• To increase the network throughput for multi-hop D2D communication for 5G cellular
network.
• To improve the network throughput when the proximity is increased.
• To improve the network throughput guaranteeing the rate requirements of all D2D and
cellular users.

In order to achieve these objectives, a hybrid resource allocation scheme for multi-hop
D2D communication for 5G cellular network is proposed. The hybrid resource allocation
scheme maximizes the throughput by integrating graph-based scheme with PSO. Initially,
graph-based scheme is applied for creating the interference matrices; thereafter PSO is
applied for maximizing the network throughput. This scheme also provides better through-
put in case of increased proximity and supports minimum data rate to maintain the QoS of
the network.
The following sections in this paper are organized as follow. Section 2 deals with the
related work. Section 3 depicts system model and problem formulation for two-hop D2D
communication. Section 4 describes the proposed scheme. In Sect. 5, simulation results are
evaluated. Finally, conclusion is drawn in Sect. 6.

2 Related Works

D2D communication received much attention for next generation network because of reus-
ability of cellular resources. Several research works have been proposed for resource allo-
cation in case of direct D2D communication. D2D communication helps in increasing the
proximity and also helps in improving the network throughput. However, a very limited
works are reported for resource allocation in case of multi-hop D2D communication. In
resource allocation process, the BS allocates same resource block to CU and D2D users.
This creates interference which reduces the network throughput. To reduce the interference
and improve the network throughput, several authors put efforts to minimize interference
for for direct D2D and multi-hop D2D communications in resource sharing case. The tech-
niques proposed for resource allocation can be broadly categorized as graph-based, game
theoretic and optimization-based schemes.
Graph theory-based schemes are extensively used for mitigating the interference
between D2D pairs and CU users. Various graph-based resource allocation schemes [6,
8, 13, 15–19] have been discussed for allocating the resources for CU and D2D users
in uplink/downlink phase. In graph-based schemes, vertex represents the user equip-
ments and edges represent the link connectivity. Graph colouring technique is applied
in [17] for avoiding interference between D2D pairs. In this scheme, a feedback mecha-
nism is used where D2D pairs are able to measure the interference. In [19], the authors

13
 P. K. Mishra et al.

proposed a graph colouring based resource scheme for D2D users in uplink phase where
UE has capability to measure interference.
Game theoretic schemes are also extensively used for solving the resource allocation
problem. A game theoretic approach for resource allocation for intercell D2D commu-
nication underlay cellular network is discussed in [20] where the D2D link is located
in overlapping area of two neighbouring cells. The major drawback of this scheme is
that the authors pre-assumed that all the necessary parameters are shared and exchanged
between the base-stations while the bases stations are belongs by different telecom oper-
ators. However, practically it is not possible. Therefore, in [21], the authors proposed a
resource allocation scheme for multi-cell D2D communication under the assumption of
incomplete information. In this scheme, the BS acts as player competing for resource
supply of D2D. The utility of each player is defined as revenue collected from both cel-
lular and D2D users using spectrum resources.
Optimization techniques are also used for resource allocation for D2D communica-
tion underlay cellular network. A number of optimization techniques are discussed in
[22–26]. In [22], the authors proposed resource allocation scheme based on particle
swarm optimization (PSO) technique. This scheme improves the network throughput
by joint mode selection and resource allocation. In [23], authors proposed PSO based
power allocation scheme for improving overall network throughput. In [24], the authors
proposed sub-carrier allocation scheme to maximize the average weighted sum-rate
throughput with the interference constrained for cellular users. This scheme combines
support vector machine (SVM) and PSO where the probabilistic interference constraint
is computed by SVM. In [25], a joint mode selection and resource allocation based on
evolutionary algorithm is proposed. This scheme improves the sum rate with sharing of
same resource block by multiple users.
When direct D2D communication or during communication, the communicating
devices moves out from their proximity and direct communication is not possible, the com-
munication takes place with the help of other devices. This is known as multi-hop D2D
communication. There are very limited works reported for resource allocation process in
case of multi-hop D2D communication. In [27], the authors proposed radio resource man-
agement algorithm for two-hop D2D communication. A resources allocation scheme based
on the clustering technique for closed subscriber in two tier heterogeneous network is pro-
posed in [28]. In [29], the authors proposed a resource allocation scheme for multi-hop
D2D communication based on interference avoidance for long term evaluation-advance
(LTE-A) networks. In [30], the authors proposed a new method for dealing with security
concerns for multi-hop D2D communication. Further, it is suggested that relay-assisted
multi-hop D2D communications can enhance the achievable throughput and can boost up
the coverage area of cellular networks [31].
Enabling multi-hop D2D communications in a cellular network poses two major chal-
lenges. Firstly, the interference caused to the cellular users by D2D devices could critically
affect the performances of the cellular devices [13, 29, 32]. Secondly, the minimum qual-
ity-of-service (QoS) requirements of D2D communications need to be guaranteed. With
the increasing usage of internet services by mobile users and lack of sufficient spectrum,
there is a need to use this limited spectrum resource optimally by a proper resource alloca-
tion scheme. Allocation of resource based on optimization techniques has become popu-
lar for next generation cellular networks mainly because of their versatility, scalability and
computational simplicity. Existing resource allocation schemes for direct D2D communi-
cation based on optimization are summarized in Table 1. However, Table 2 summarizes the
reported works for multi-hop D2D communication.

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

Table 1  Resource allocation schemes for direct D2D communications

References Contribution Platform along Achieved performance
with evaluation

Su et al. Proposed a combined scheme for LTEA Improved throughput of the net-
[22] mode selection and resource alloca- System level work up to 20% compared with
tion based on PSO-MSRA evaluation OS-MSRA and 16% compared
with C-RA scheme
Pang et al. Proposed a joint mode selection and LTEA Improved system sum-rate up to
[25] resource allocation method based on System level 20% compared to PSO-MSRA-
evolutionary algorithm to reduce the evaluation SDMR
extra co-channel interference
Sun and Proposed an inference avoidance and LTEA Improved system throughput up
Shin [33] resource allocation scheme based System level to 20% compared to C-RA and
on PSO (IAMA-PSO) for maximiz- evaluation PSO-MSRA schemes
ing the overall network throughput
allowing multiple D2D pairs having
reusability of same resource block
Sun et al. Proposed a PSO based power alloca- LTE/LTE-A Improved overall throughput
[26] tion scheme for D2D multicast Numerical up to 30% compared to fixed
communication underlying cel- evaluation power allocation scheme
lular networks for achieving better
throughput
Nguyen Proposed a distance constrained LTE/LTE-A Improved the performance of
et al. [10] resource allocation scheme based on Numerical proposed scheme in comparison
LSAP and LBAP evaluation to random scheme
Hasan et al. Proposed a network selection and 5G Reduced interference up to 22%
[34] resource allocation scheme based on System level and resource price up to 28%
PSO and modified genetic algorithm evaluation compared to PSO

3 System Model and Problem Formulation

In this section, a schematic representation of system model for two-hop D2D communi-
cation for 5G networks is described. It is considered that D2D communication utilizes
uplink spectrum of cellular network. As shown in Fig. 1, the evolved node B (eNodeB)/
BS is located at center of the cell with M cellular users (CU) and N D2D pairs which are
randomly distributed over the cell area. The CU users, D2D pairs and relay devices are
mobile in random nature. The set of cellular users and D2D pairs are defined as Cm where
m = 1, 2, 3 … M and D2Dn where n = 1, 2, 3 … N respectively. There are K number of
resource block available where k = 1, 2, 3 … K . In direct D2D communication, the devices
move out of their proximity then it is necessary for them to employ a relay in between
defined as Rre where re = 1, 2, 3, … RE.
The multi-hop D2D communication takes place between source and destination by routing
the message through a relay. This not only maximizes the proximity of the communication
between D2D pairs but also improves the resource block throughput. Figure 2 represents the
multi-hop D2D communication setup. The introduction of relay in between D2D communi-
cation proximity range is necessary to solve the various resource block problem. The relay
request is accepted at the BS side only when the relay receives an access request message
(ARM) from the D2D transmitter. If D2D transmitter meets the minimum transmission rate

13
 P. K. Mishra et al.

Table 2  Resource allocation schemes for multi-hop D2D communications

References Contribution Platform Achieved performance
along with
evaluation

da Silva Proposed a novel D2D power control scheme LTEA Improved the average
et al. for balancing energy efficiency and spectral Numerical throughput and decreased
[27] efficiency with random resource allocation for evaluation the outage probability
two hop D2D communication
Mirshra Proposed a new resource allocation scheme 5G Reduced the number of
et al. for two hop communication where first hop Numerical required resource block
[35] communication is in D2D while second hop evaluation up to 40% and uploading
communication is in cellular mode time up to 35% compared
to DBU-RBM
Rigazzi Proposed network aware resource allocation LTEA Improved the network
et al. scheme for multi-hop D2D communication Numerical throughput and reduced
[32] scheme. This scheme used a graph based evaluation the load from BS side
resource allocation strategies compared to cellular
communication
Vlachos Proposed interference aware real time resource LTEA Improved the system sum
et al. allocation framework for relay-aided D2D Numerical rate by 37 and 72% com-
[36] communication using genetic algorithm in evaluation pared to heuristic based
underlay cellular network method and random
resource allocation
Wei et al. Analyzed the energy and spectral efficiencies forLTEA Improved the energy
[37] multi-hop and cellular mode Numeri- and spectral efficiency
cal and compared to traditional
simulation communication
evaluation
Melki Proposed a resource allocation scheme for multi- LTEA Improved the capacity of
et al. hop D2D communication based on interference Numerical network compared to
[29] avoidance scheme evaluation pure cellular communi-
cation

Rmin i.e. RD2D > Rmin, then relay assists the existing D2D pairs in their communication. This
relay device also reuses the cellular resource block as direct D2D communication and han-
dles the communication from source to destination and as result of which interference occurs.
It is assumed that utilized resources are orthogonal in nature, and D2D pairs reuse the cel-
lular resource block. This causes inter-channel interference when different links share same
resource block. Also, the number of cellular user equals the resource block such that one
resource block is reused by at least one D2D pair. Considering Im,k be the interference at cel-
lular user m, which is given by,
N
∑
Im,k = PDTn × gDTn,CUm (1)
n=1

where PDT is transmission power of nth D2D user and gDTn,CUm represents the gain of nth
D2D pair to mth cellular user. Let IBS,k be the interference at the BS in the kth resource
block,

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

UE1
DR3

Up
lin
k
DT3

UE3
eNodeB
DT2 UE2
DR1

D
D2 n
R1 -hop catio
o i
R2 Tw mun
m
DT1 Co
DR2

Fig. 1  System model

N
∑
IBS,k = PDTn × gDTn,BS (2)
n=1

where gDTn,BS denotes the gain from D2D pair transmitter to the eNodeB. The interference
experienced at the nth D2D receiver from other D2D pair transmitter is In,k which is repre-
sented as,
N
∑
In,k = PDTn × gDTn,DRi (3)
n=1,n≠i

where gDTn,DRi denotes the gain from other D2D transmitter to the D2D receiver. Similarly,
the effect of interference in multi-hop D2D communication from the respective relay is
considered on the BS side, cellular user and to the D2D receivers respectively.
In multi-hop D2D communication, same resource block is allocated to more than one
D2D link pairs due to limited number of resource blocks which generates huge interfer-
ence. Thus, to reduce the total interference, the minimum interference level of the system
as an objective is taken. The I DT and I RE represent the interference occurred from other
D2D transmitter and relay device respectively. Thus, the total interference in the system is
described as,

13
 P. K. Mishra et al.

D Tx Rx DRx eNB UE

Connection Dist.>
Refused Proxiity

Moves into D2D

Cellular
Communication
Commun .
Range

ARM

If RD2D>R min the Rx Join in 2-hop

commu.

2-Hop D2D
Commun.

Fig. 2  Multi-hop D2D communication setup

M K N { }
∑ ∑∑
IT = DT
Im,k DT
+ IBS,k DT
+ In,k RE
+ Im,k RE
+ IBS,k RE
+ In,k (4)
m=1 k=1 n=1

The SINR for each resource block is calculated to determine the strength of a particular
resource block. The SINR at the relay end is represented as,
PDT × gDT,Relay
SINRRelay = ∑M ∑N ∑K � DT DT DT
� (5)
𝜎 + m=1 n=1 K=1 Im,k + IBS,k + In,k

Similarly, SINR at the receiver end is represented as,

PRR × gRelay,DR
SINRDR = ∑M ∑N ∑K � RE RE RE
� (6)
𝜎 + m=1 n=1 K=1 Im,k + IBS,k + In,k

where 𝜎 is the thermal noise power, gDT,Relay and gRelay,DR denote the gain from D2D trans-
mitter to relay and relay to D2D receivers, respectively. The end-to-end SINR for two-hop
D2D is obtained by considering the minimum SINR from both hops. It can be calculated
as,

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

{ }
SINRSR = min SINRRelay , SINRDR (7)
Denoting the bandwidth of a particular resource block by BW, and the sum throughput or
transmission capacity of the of nth two-hop D2D pair in kth resource block can be expressed
as
Tn,k = BW × log( 1 + SINRSR ) (8)
The resource allocation problem can be formulated as follows:
{M K RE K N K
}
∑∑
CU
∑ ∑
RE
∑ ∑
D (9)
maximize Tm,k + Tre,k + Tn,k
m=1 k=1 re=1 k=1 n=1 k=1

subjected to
M K
∑ ∑
PCU
m,k
≤ PCU
max (C1)
m=1 k=1

RE K
(C2)
∑ ∑
PRre,k ≤ PRE
max , ∀re ∈ RE
re=1 k=1

N K
∑ ∑
PD
n,k
≤ PD
max , ∀N ∈ D (C3)
n=1 k=1

N K
∑ ∑
RN,K ≥ Rmin , ∀n ∈ N (C4)
n=1 k=1

K
∑
k
xD ≥ 1,
n
1≤k≤K (C5)
k=1

The given constraints are in accordance with the assumption defined for taken model.
The first, second and third constraints mean to restrict the maximum power transmission
from the BS, relay transmit power and source transmit power of D2D pairs, respectively.
The fourth constraint is used to guarantee the minimum required data rate. The fifth con-
straint means that more than one D2D pairs use same resource block.

4 Proposed Scheme

In this section, a hybrid resource allocation scheme for multi-hop D2D communication is
proposed. Initially, we introduce graph-based scheme for the computation of interference
matrices. Then, particle swarm optimization (PSO) and graph-based schemes are inte-
grated to develop a hybrid model which could solve the resource allocation problem.

13
 P. K. Mishra et al.

4.1 Graph‑Based Scheme

In graph-based scheme, a resource block with minimum interference is given the most pri-
ority. To handle the severe effect of interference in the system, an interference matrix setup
based on feedback model is designed. Moreover, this also reduces the chances of one cel-
lular resource block being used by multiple D2D users.
In order to design an interference matrix setup on feedback model, different scenarios
for the multi-hop D2D communication are developed. The different scenarios consist of
random resource allocation and the graph-based allocation between source-to-relay and
relay-to-destination. The scenarios compare both the schemes in resource allocation sce-
nario which are categorized into sub cases as follow

Case‑I The source-to-relay and relay-to-destination communications will follow random

resource allocation scheme.

Case‑II The source-to-relay and relay-to-destination communication will follow both the
random and the graph-based schemes.

Case‑III The source-to-relay and relay-to-destination communication will follow graph-

based schemes.

Each possible communication between source-to-destination is described in the sub-cases

as shown in Table 3.Feedback Configuration As shown in the Fig. 3, the graph-based
scheme starts with the construction of interference graph. It is considered that a graph is
bipartite graph which is comprised of cellular user equipment ­(UEx), D2D transmitters
­(DTx), Relays (­ Rx) and D2D receivers (­ DRx) pairs connected by weighted edges represent-
ing interference between resource blocks. U ­ E1 and U
­ E2, which present the pieces of cellu-
lar UE, compose the central part. The transmitter of D2D pairs ­DT1 and D ­ T2 pairs compose
the right part and ­DT3 and ­DT4 compose the left side.
The graph is denoted by G = (V c , V d , E) where V c is the set of vertices of all cellular
UE, V d is the set of all vertices of all D2D pairs and relay node, and E is the edges set.
Each vertex Vmc ∈ V c represents a cellular UE; each vertex Vnd ∈ V d , Vred ∈ V d represents
a D2D user and relay node respectively. The edge em,n ∈ E implies that the D2D pair
Vnd shares the resource block with the cellular UE Vmc and edge em,re ∈ E implies that
the relay Vred also shares the resource block; the cellular UE Vmc for two-hop D2D com-
munication. Moreover, the weights set are denoted by WM×N , which is M-by-N matrix.
The element wm,n ∈ WM×N , representing the weight of the em,n equals the interference
power Im,n . The edge en,n� ∈ E connects Vnd ∈ V d and Vnd� ∈ V d which implies the inter-
ference level between D2D receiver to other D2D transmitters. The edge en,re ∈ E con-
nects Vnd ∈ V d and Vred ∈ V d which implies the interference level between D2D pair to
relay. The dotted edge lines are showing strong interference. When the interference can

Table 3  Two-Hop D2D Sub-case Source-to-relay Relay-to-destination

communication with different
schemes
Sub-Case-I Random Graph
Sub-Case-II Graph Random
Sub-Case-III Graph Graph

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

DT4 DT1
R1
R4

UE1
DR1

DR4
UE2
DT2
DR3
R2 D2D link
CU link
DT3 DR2
Interference

Fig. 3  Illustration of graph

be ignored, the edge is denoted by solid lines. The interference level can be obtained
according to the matrixes X1M×N , X2N×N � , and X3N×RE

4.2 Particle Swarm Optimization

Although, an interference matrix setup based on feedback model by graph-based scheme is

designed. The resource allocation problem is a mixed integer optimization problem, which
cannot be solved easily. Therefore, we can adopt swarm intelligence algorithm which plays
a vital role in solving the problem. Particle swarm optimization (PSO) is a stochastic, pop-
ulation-based optimization algorithm, which is simple in implementation. In PSO, various
individual particles in a swarm change its search directions and search for the optima in
each iteration. The position of every particle represents a candidate solution for a problem,
and a fitness function is characterized to assess the goodness of the solution. Every particle
has its personal best position and global best position discovered from the best solutions
after several iterations. The velocity and position of particles are based on Eqs. (10) and
(11):
Vot+1 = wVot + r1 c1 Pto − Xot + r2 c2 Gt − Xot (10)
( ) ( )

Xot+1 = Xot + Vot+1 (11)

where w is inertia weight, r1 and r2 are two random numbers in the range [0, 1]. and
Vot
Xot represent the velocity and position of the oth particle at tth iteration. Pto and Gt denote
the personal best position and global best position at tth iteration. The standard PSO is
suited for continuous solution space. As a better way of solving mixed integer non-linear

13
 P. K. Mishra et al.

optimization problem, an algorithm is proposed for handling throughput optimization

problem using PSO.

4.2.1 Throughput Optimization Using PSO

To solve a throughput optimization problem using PSO for the swarm of interference
obtained using graph-based method. The major issues are the particle representation for
mapping the solutions and the fitness function to evaluate the quality of particles after deal-
ing with all the constraints. And to solve this constrained problem, penalty function is uti-
lized to make a fitness function. The main idea of this scheme is to transform a constrained
problem into an unconstrained one by incorporating a penalty function in the objective
function. We construct the penalty function as,
N
{ K }
∑ ∑
Penalty = max 0, Tn,k (12)
n=1 k=1

We can get the fitness function by:

N
{ K
}
∑ ∑
Fitness = Tn,k − max 0, Tn,k (13)
n=1 k=1

The penalty function plays a major role in guiding the particles to fly out of the non-
feasible region as soon as possible or to get as close as possible to the feasible region.
Moreover, the fitness function ensures continuity so that we can make full use of the stand-
ard PSO’s advantage in searching for optima.
The resource allocation problem in Eq. (9) is a proximity constraint problem. There-
fore, this paper demonstrates a hybrid of graph-based scheme and Swarm based optimiza-
tion. In addition to graph-based scheme, PSO further optimize the throughput to achieve a
minimum required rate. The swarm optimization technique utilized after the graph-based
scheme reduces the interference to specified level. The PSO scheme has the significance of
searching the best variable from the entire population. This best variable is selected from
the list of resource blocks and it is optimized by the parameters of the PSO to provide the
minimum rate requirement for multi-hop D2D communication. The pseudo code of hybrid
algorithm is given in Algorithm 1.

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

5 Performance Evaluation and Discussion

In this section, a numerical simulation using MATLAB is presented. The simulation con-
siders a single cell with one BS, 25 CU users and varying number of two hop D2D users
(minimum 5 and maximum 25). The users are distributed randomly over the entire cell.
The receivers of the D2D users and the relays are randomly distributed in the limited prox-
imity. The maximum distance between D2D pairs gets tuned by the indicator L. Link gains
include path loss and Rayleigh fading, where path loss model is L(d) = 128.1 + 37.6 ­log10d
for the cellular communication between BS to cellular users and L(d) = 128.1 + 37.6 ­log10d
for D2D communication, where d is distance in kilometers [38]. For plotting the graph, the
simulation is carried out 100 times consecutively and the average so obtained is plotted.
PSO parameters are set as follow: total population = 25, maximum iterations = 100, learn-
ing factors c1 = c2 = 2, and the inertia weight = [0.4, 0.9]. The system parameters used in the
performance evaluation are summarized in Table 4.
Figure 4a depicts the throughput of two-hop D2D users versus number of two-hop D2D
pairs. The throughputs of random allocation-based and graph-based schemes are compared
with proposed scheme. In the random allocation-based, resources are allocated randomly to
the requested users. When the number of two-hop D2D pairs increases, it is observed that
more than one two-hop D2D pairs can share the same resource block with CU user. Thus,
random scheme do not provide required throughput. However, graph-based resource allo-
cation scheme allocates the resource based on minimum interference. Although the graph-
based scheme could satisfy the minimum throughput requirement, the communication held

13
 P. K. Mishra et al.

Table 4  System parameters Parameters Values

Cell radius 1000 m

Carrier frequency 2.5 GHz
Cell radius 500 m
System bandwidth 5 MHz
Number of RB 25
Number of two-hop D2D pairs 5, 10, 15, 20, 25
Proximity distance (meter) 50, 100
BS Tx power 36 dBm
UE Tx power 17 dBm
Noise power − 174 dBm/Hz
Simulation type MATLAB

(A) (B)

Fig. 4  a Throughput of two-hop D2D pair versus number of two-hop D2D pairs. b Interference of two-hop
D2D users versus number of two-hop D2D pairs

in this scheme fails in optimum resource allocation and also the throughput of graph-based
resource allocation scheme is less than that of proposed scheme. Therefore, proposed
scheme gives better throughput in comparison to random allocation and graph-based allo-
cation schemes.
Figure 4b represents the interference generated by two-hop D2D pairs versus number
of two-hop D2D pairs. The random resource allocation scheme is severely affected by
inter-channel interference and resource allocation for two-hop D2D communication by this
scheme is gruesome task for the BS. Because, multiple two-hop D2D pairs share same
resource with CU user which generates more interference. Although, the graph-based
scheme in two-hop D2D communication has resulted in depression of interference, how-
ever, the proposed scheme outperforms the other two schemes in reducing the effect of
interference between the resource blocks. The proposed scheme reduces the interference

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

to desired level where flawless communication between source-to-relay and relay-to-desti-

nation can be achieved. Thus, the proposed scheme generates less amount of interference
compared to random resource allocation and graph-based resource allocation schemes.
Figure 5a plots the throughput of the cellular users versus the number of two-hop D2D
pairs for different schemes. Using the random resource allocation, the CU throughput
reduces drastically due to sharing the same resource block with multiple two-hop D2D
pairs which also disables the cellular communication frequently. The throughput obtained
by the graph-based scheme is greater than that of random scheme and less than the through-
put of the proposed scheme. The proposed scheme maintains an environment of flawless
communication between the two-hop D2D pairs and also for the CU users. When the num-
ber of two-hop D2D pairs increases, the throughput of CU users is degraded. However, the
proposed scheme performs better in compared to random and graph-based resource alloca-
tion schemes.
Figure 5b depicts the effect of interference on the cellular users versus the number
of two-hop D2D users for different schemes. It is noted that the interference affects the
cellular users severely in the random resource allocation scheme and reduces the QoS.
Although the affect of interference for graph-based scheme is less than the random
resource allocation but it fails to achieve the QoS parameters for two-hop D2D com-
munication. The proposed scheme maintains the interference level below the desired
one so that CU users are provided with the fair quality resource blocks. In addition, two-
hop D2D pairs also reuse the resource block with less interference. Thus, the proposed
scheme gives better result in comparison to random resource and graph-based resource
allocation scheme.
Figure 6a records the trace of the system throughput versus the number of two-hop D2D
pairs obtained for various schemes. The system throughput is the total throughput which is
generated for end-to-end communication in two-hop D2D communication and cellular user
communication. Initially, when the numbers of two-hop D2D pairs are lesser, the through-
put of random resource, graph-based and proposed scheme increases sharply. The random

(A) (B)

Fig. 5  a Throughput of CU users versus number of two-hop D2D pairs. b Interference of CU users versus
number of two-hop D2D pairs

13
 P. K. Mishra et al.

(A) (B)

Fig. 6  a System throughput versus number of two-hop D2D pairs. b System interference versus number of
two-hop D2D pairs

resource allocation and graph-based resource allocation scheme do not perform better in
comparison to proposed scheme in case of increasing the number of two-hop D2D pairs.
The important point to be noted is that the proposed scheme throughput improvement is up
to 105 Mbps in random resource allocation scheme case and up to 50 Mbps graph-based
resource allocation scheme. This increase in throughput enables the two-hop D2D commu-
nication which is in far proximity to communicate with higher data rates at constant flow.
Figure 6b plots the system interference versus number of two-hop D2D pairs for
different schemes. Initially, when the number of two-hop D2D pair is lesser (up to 10
two-hop D2D pairs) with fixed number of cellular user (25), the proposed scheme and
graph-based schemes generated interference of same value approximately. However,
the random resource allocation scheme generated much interference in comparison to
proposed scheme and graph-based resource allocation schemes. When the number of
two-hop D2D pairs increases, it is observed that the graph-based and random resource
allocation scheme gives poor performance in comparison to proposed scheme. The pro-
posed scheme performed better even though in larger proximity case in comparison to
random resource allocation and graph-based resource allocation schemes.
After optimizing the throughput of the system, we have also compared proposed scheme
with other two schemes, namely, orthogonal sharing-based resource allocation (OS-RA)
[39] and cellular-oriented resource allocation (C-RA) [40]. Figure 7 plots a graph between
proximity versus system throughput. The throughput of the three schemes for proximity
value at 50 and 100 m is shown. Analyzing the figure, it can clearly be concluded that
PSO scheme outperforms in throughput optimization as compared to C-RA and OS-RA
schemes. This is possible because proposed scheme utilizes the resource block by reusing
it between cellular user and the two-hop D2D pairs.
In Fig. 8, the system throughput is plotted as against the minimum required rate with the
minimum proximity 50 m. The proposed scheme attains the highest throughput in compari-
son to OS-RA scheme [39] and C-RA scheme [40]. The proposed scheme also supports the

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

Fig. 7  Proximity comparison 40

OS-RA
C-RA
35
PSO-RA
30

The System Throughput

25

20

15

10

0
50 100
Proximity

Fig. 8  System throughput versus minimum required rate

minimum required rate. Initially, the minimum rate is not constrained, our scheme gives
better throughput. When the minimum data rate is increased, the throughput is going to
degraded and C-RA and OS-RA give near same throughput. However, proposed scheme
still gives better throughput up to 2000 kbps minimum data rate.

6 Conclusion

In this article, a multi-sharing resource allocation problem for two-hop D2D communica-
tion is discussed. To improve the throughput of the network, a hybrid resource allocation
scheme is proposed. This hybrid scheme integrated a graph-based scheme and PSO. In this

13
 P. K. Mishra et al.

scheme, interference matrix is created by graph-based technique and preceded by through-

put optimization with the help of PSO. The simulation result shows superiority of proposed
scheme over graph-based and random resource allocation scheme. This scheme also pro-
vides better throughput when the proximity is increased.
The proposed scheme only considered the cellular users and two-hop D2D users for
uplink communication system. Further, this work can be extended for downlink commu-
nication system with different types of communication (cellular, direct D2D and multi-hop
D2D). The other extensions of the work include application of various recently proposed
optimization algorithms to solve the multi-sharing resource allocation problem.

References
1. Tullberg, H. et al. (2014). Towards the METIS 5G concept: First view on Horizontal Topics concepts.
In 2014 European conference on networks and communications (EuCNC) (pp. 1–5).
2. Shen, X. (2015). Device-to-device communication in 5G cellular networks. IEEE Network, 29, 2–3.
3. Tehrani, M. N., et al. (2014). Device-to-device communication in 5G cellular networks: challenges,
solutions, and future directions. IEEE Communications Magazine, 52, 86–92.
4. Asadi, A., et al. (2014). A survey on device-to-device communication in cellular networks. IEEE Com-
munications Surveys and Tutorials, 16, 1801–1819.
5. Lin, X., et al. (2014). An overview of 3GPP device-to-device proximity services. IEEE Communica-
tions Magazine, 52, 40–48.
6. Zhang, R. et al. (2013). Interference-aware graph based resource sharing for device-to-device com-
munications underlaying cellular networks. In 2013 IEEE wireless communications and networking
conference (WCNC) (pp. 140–145).
7. Naeem, M. et al. (2017) Distributed gateway selection for M2M communication in cognitive 5G net-
works. In IEEE Network.
8. Zhang, H. et al. (2013) Graph-based resource allocation for D2D communications underlaying cellular
networks. In 2013 IEEE/CIC international conference on communications in China-workshops (CIC/
ICCC) (pp. 187–192).
9. Wei, W. et al. (2016). Imperfect information dynamic stackelberg game based resource allocation using
hidden Markov for cloud computing. In IEEE transactions on services computing.
10. Nguyen, H. V., et al. (2015). Optimization of resource allocation for underlay device-to-device com-
munications in cellular networks. Peer-to-Peer Networking and Applications, 9(5), 965–977.
11. Wang, F. et al. (2013) Energy-aware resource allocation for device-to-device underlay communication.
In 2013 IEEE international conference on communications (ICC) (pp. 6076–6080).
12. Xu, C. et al. (2012). Interference-aware resource allocation for device-to-device communications as an
underlay using sequential second price auction. In 2012 IEEE international conference on communica-
tions (ICC) (pp. 445–449).
13. Li, Y., et al. (2014). A dynamic graph optimization framework for multihop device-to-device commu-
nication underlaying cellular networks. IEEE Wireless Communications, 21, 52–61.
14. Zafar, B., et al. (2012). Analysis of multihop relaying networks: Communication between range-lim-
ited and cooperative nodes. IEEE Vehicular Technology Magazine, 7, 40–47.
15. Guo, B., et al. (2014). Graph-based resource allocation for D2D communications underlying cellu-
lar networks in multiuser scenario. International Journal of Antennas and Propagation. https​://doi.
org/10.1155/2014/78363​1.
16. Hao, J. et al. (2014). Graph-based resource allocation for device-to-device communications aided
cellular network. In 2014 IEEE/CIC international conference on communications in China (ICCC)
(pp. 256–260).
17. Lee, C., et al. (2014). Interference avoidance resource allocation for D2D communication based on
graph-coloring. International Conference on Information and Communication Technology Conver-
gence (ICTC), 2014, 895–896.
18. Zhang, R., et al. (2015). Interference graph-based resource allocation (InGRA) for D2D communi-
cations underlaying cellular networks. IEEE Transactions on Vehicular Technology, 64, 3844–3850.

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

19. Tsolkas, D. et al. (2012) A graph-coloring secondary resource allocation for D2D communications
in LTE networks. In 2012 IEEE 17th international workshop on computer aided modeling and
design of communication links and networks (CAMAD) (pp. 56–60).
20. Huang, J. et al. (2014). Resource allocation for intercell device-to-device communication underlay-
ing cellular network: A game-theoretic approach. In 2014 23rd international conference on com-
puter communication and networks (ICCCN) (pp. 1–8).
21. Huang, J., et al. (2015). Game theoretic resource allocation for multicell D2D communications
with incomplete information. IEEE International Conference on Communications (ICC), 2015,
3039–3044.
22. Su, L., et al. (2013). Resource allocation using particle swarm optimization for D2D communi-
cation underlay of cellular networks. IEEE wireless communications and networking conference
(WCNC), 2013, 129–133.
23. Gong, W., & Wang, X. (2015). Particle swarm optimization based power allocation schemes of
device-to-device multicast communication. Wireless Personal Communications, 85, 1261–1277.
24. Xu, L., et al. (2015). Resource allocation algorithm based on hybrid particle swarm optimization
for multiuser cognitive OFDM network. Expert Systems with Applications, 42, 7186–7194.
25. Pang, H., et al. (2013). Joint mode selection and resource allocation using evolutionary algorithm
for device-to-device communication underlaying cellular networks. Journal of communications, 8,
751–757.
26. Sun, S., et al. (2015). Device-to-device resource allocation in LTE-advanced networks by hybrid
particle swarm optimization and genetic algorithm. Peer-to-Peer Networking and Applications,
9(5), 945–954.
27. da Silva, J. M. B., et al. (2014). Performance analysis of network-assisted two-hop D2D communi-
cations. IEEE Globecom Workshops (GC Wkshps), 2014, 1050–1056.
28. Zhang, H., et al. (2016). Cluster-based resource allocation for spectrum-sharing femtocell net-
works. IEEE Access, 4, 8643–8656.
29. Melki, L., et al. (2016). Radio resource management scheme and outage analysis for network-
assisted multi-hop D2D communications. Digital Communications and Networks, 2, 225–232.
30. Umar, M. M., et al. (2016). SeCRoP: secure cluster head centered multi-hop routing protocol for
mobile ad hoc networks. Security and Communication Networks, 9, 3378–3387.
31. Lee, D. et al. (2012). Performance of multihop decode-and-forward relaying assisted device-to-
device communication underlaying cellular networks. In 2012 international symposium on infor-
mation theory and its applications (ISITA) (pp. 455–459).
32. Rigazzi, G. et al. (2014). Multi-hop D2D networking and resource management scheme for M2M
communications over LTE-A systems. In 2014 international wireless communications and mobile
computing conference (IWCMC) (pp. 973–978).
33. Sun, S., & Shin, Y. (2014). Resource allocation for D2D communication using particle swarm opti-
mization in LTE networks. In 2014 international conference on information and communication
technology convergence (ICTC) (pp. 371–376).
34. Hasan, N. U., et al. (2016). Network selection and channel allocation for spectrum sharing in 5G
heterogeneous networks. IEEE Access, 4, 980–992.
35. Mishra, P. K. et al. (2016). Efficient resource management by exploiting D2D communication for
5G networks. In IEEE Access.
36. Vlachos, C. et al. (2016). Bio-inspired resource allocation for relay-aided device-to-device commu-
nications. arXiv preprint arXiv​:1606.04849​.
37. Wei, L., et al. (2016). Energy efficiency and spectrum efficiency of multihop device-to-device
communications underlaying cellular networks. IEEE Transactions on Vehicular Technology, 65,
367–380.
38. ETS I. (1998). Selection procedures for the choice of radio transmission technologies of the UMTS
(UMTS 30.03 version 3.2. 0). In Universal mobile telecommunications system (UMTS).
39. Hui, D., et al. (2012). Joint mode selection and resource allocation for cellular controlled short-
range communication in OFDMA networks. IEICE Transactions on Communications, 95,
1023–1026.
40. Zulhasnine, M. et al. (2010). Efficient resource allocation for device-to-device communication
underlaying LTE network. In 2010 IEEE 6th international conference on wireless and mobile com-
puting, networking and communications (WiMob) (pp. 368–375).

Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps
and institutional affiliations.

13
 P. K. Mishra et al.

Pavan Kumar Mishra is an Assistant Professor in the Department of

Information Technology at the National Institute of Technology,
Raipur India. He has received PhD degree from National Institute of
Technology, Raipur India. in 2016. His research focuses on, Cellular
and Mobile Communication, 5G Communication, Device-to- device
Communication, Green Communication, etc.

Amitesh Kumar is doing M.Tech. in department of Information Tech-

nology Raipur, India. He has done is B.Tech. from D. N. Patel College
of Engineering, Nandurbar in 2012. His research focus on 5G Commu-
nication, resource allocation in Device-to-device Communication.

Sudhakar Pandey is an Assistant Professor in the Department of Infor-

mation Technology at the National Institute of Technology, Raipur
India. He received his Ph.D. from Allahabad University. He has pub-
lished several research articles in reputed journals and conferences.
His research focuses on Ad Hoc Networks, Sensor Networks, and Cel-
lular and Mobile Communication.

13
Hybrid Resource Allocation Scheme in Multi-hop Device-to-Device…

Vinay Pratap Singh is an Assistant Professor in the Department of

Electrical Engineering at the National Institute of Technology, Raipur
India. He has done at M.Tech. and Ph.D. from Motilal Nehru National
Institute of Technology Allahabad, India. He has published several
research articles in various journal and conferences. His research
focus on Optimization Techniques and Approximation.

13