# A Categorized Resource Sharing Mechanism for Device-to-Device Communications in Cellular Networks

Authors: Jie Chen; Chang Liu; Husheng Li; Xulong Li; Shaoqian Li
Journal: Mobile Information Systems
 (2016)

---

## Abstract

Device-to-Device (D2D) communications are considered one of the key technologies for 5G wireless communication systems. In this paper, a resource sharing mechanism, which applies different policies for different cases (thus being categorized), is proposed. In this scheme, all D2D pairs are divided into three groups by comparing the minimum transmit power with the maximum transmit power of each cellular UE. The proposed mechanism enables multiple D2D pairs in the second group to share the resource with cellular user equipment (UE) simultaneously, by adjusting the transmit powers of these D2D transmitters. At the same time, D2D pairs in the first group and the third group share resource with cellular UE based on the transmit power minimization principle. Simulation results show that the proposed scheme can achieve relatively higher network throughput and lower transmit power consumption of the D2D system.


---

## Body

## 1. Introduction

The increasing demand for higher data rates within local area and the gradually increasing spectrum congestion have triggered research activities on improving the spectral efficiency and interference management. In recent years, D2D (Device-to-Device) communications have gained much attention [1, 2]. D2D communications enhance the spectral efficiency by spatially reusing radio resource and prolong the battery life of user equipment (UE) by reducing the transmission power. Due to these advantages, the D2D communications have been actively discussed in standardization bodies for the next generation cellular systems such as Long Term Evolution-Advanced (LTE-A) [3].However, D2D links may yield significant interference to the communication system. Therefore, resource management scheme, which supports the resource reuse by taking the intracell interference into account, has a great impact on the overall network performance. So far, major efforts are to be aimed at interference control through resource sharing mode selection [4], power control [5–7], and resource allocation [8–10]. The previous works [5–7] are mainly concentrated on the power control in a specific resource block without the consideration of resource allocation, while the previous works in [8–10] have focused on the case that only one D2D link can share resource with one cellular link. Additionally, in [11], the authors study joint channel and power allocation to improve the energy efficiency of user equipment. In [12–15], the authors design the power-based resources allocation scheme and achieved relatively better performance, while they do not consider the factor of geography distribution, which may affect the power seriously. In [16], the authors proposed an interference-aware graph based resource sharing algorithm that can effectively obtain the near-optimal resource assignment solutions at the base station but with low computational complexity. In [17], a resource allocation scheme based on a column generation method is proposed. In [18], the authors aimed to optimize resource sharing for D2D communication to better utilize uplink resources in a multiuser cellular system with guaranteed quality of normal cellular communications.In this paper, to further improve spectrum utilization and system capacity, a resource sharing method, which enables multiple D2D links to share resource with cellular UE simultaneously, is proposed. Firstly, the minimum transmit power of a D2D transmitter is calculated by the required minimum Signal-to-Interference-plus-Noise Ratio (SINR) and the interference from cellular UE which shares the resource with the D2D link. Secondly, based on the interference threshold of eNodeB, the maximum transmit power of a D2D transmitter is calculated. Thirdly, by comparing the minimum transmit power with the maximum one on the resource of each cellular UE, a set of cellular UE devices that can share resource with the D2D link is attained. Then, the D2D pairs are divided into three groups according to the comparison result.Finally, when many D2D links can only share resource with some special cellular UE or the number of D2D links is larger than the number of cellular UE devices, the transmit powers of these D2D transmitters are adjusted to ensure that the cumulative interference to eNodeB is below a threshold; and the minimum SINR value of each D2D link is met as well. After that, they can share resource with the cellular UE simultaneously. Simulation results show that the proposed scheme can achieve a higher network capacity and lower transmit power consumption of the D2D system.Then, we can summarize the main contributions in the following:(i)
Different from the existing works, we analyze the resource sharing from the feasibility of transmit power and design the power bound principle by the requirement of minimum SINR and maximum interference, which provides a novel power management scheme.(ii)
According to the different geometry distribution (distances of various nodes in the system), the resources are divided into 3 groups based on the power bound principle, thus fully utilizing the UE resources.(iii)
Taking advantage of the adjustable transmit power of D2D, the proposed mechanism enables multiple D2D pairs in the second group to share the resource with cellular UE simultaneously. In addition, D2D pairs in the first group and the third group can share resource with cellular UE based on the transmit power minimization principle, which further improves the power efficiency.The remainder of this paper is organized as follows. The next section describes the system model. The resource sharing method between cellular UE and D2D pairs is presented in Section3. The performance of the proposed method is evaluated in Section 4 and the paper is concluded with Section 5.


## 2. System Model

Considering an OFDMA based cellular network, which is frequency division duplex (FDD), and concentrating on a single cell served by eNodeB as depicted in Figure1, it is assumed that the eNodeB knows the path-loss components between any two UE devices and between any UE and the eNodeB, based on the locations of the UE or the average channel qualities [19]. In the cell, there are m cellular UE devices, where m=1,…,M. In addition to m cellular UE devices, there are k pairs of D2D UE devices which communicate directly with each other, where k=1,…,K. Consider the notion that D2D UE devices only share uplink resource with cellular UE. Furthermore, it is also assumed that exclusive resources are reserved for N pairs of D2D UE devices.Figure 1
Device-to-Device communication scenarios in a cellular network.In this work, we focus on the factor of path loss due to the different distance between the D2D pairs and UE. The different distances lead to the different channel gains and thus can further affect the transmit power. According to Figure1, gDD,k,n represents the channel gain between D2D k and D2D i, while gCD,m,k signifies the channel gain between cellular UE m and D2D k, and gDC,k,m denotes the channel gain between D2D k and cellular UE m


## 3. The Proposed Resource Sharing Mechanism

### 3.1. Conditions for Sharing Resource between a Cellular Link and D2D Links

We defineu as a set of D2D links, which can share uplink resources with the cellular UE m if and only if the following condition is met:(1)SINRk=PkgDD,k,nNk+Im,k+∑i∈u,i≠kPigDD,i,k≥T0,∀k∈u,(2)∑k∈uPkgDC,k,m≤I0,(3)Im,k=PmgCD,m,k.Here, T0 and I0 are defined as the minimal SINR value of D2D k and the interference threshold value of cellular UE, respectively. Pk and Pm denote the transmit power of D2D link k and transmit power of cellular UE m, respectively.


### 3.2. Resource Sharing and Power Adjustment

#### 3.2.1. Acquiring Transmit Power Matrix

We define aK×M matrix X, of which the k,mth element xk,m denotes the minimum transmitter power of D2D k that shared resources with cellular UE m, where xk,m can be calculated by (4). We define a K×M matrix Y, of which the k,mth element yk,m means the maximum transmitter power of D2D k that shared resources with cellular UE m, where yk,m can be calculated by (5). Hence,(4)SINRk=xk,mgDD,k,mNk+PmgCD,m,k≥T0(5)Ik=yk,mgDB,k,m≤I0.Here,T0 and I0 are defined as the minimal SINR value of D2D k and the interference threshold value of cellular UE, respectively.


#### 3.2.2. Grouping D2D UE

According to the condition for sharing resource between the cellular linkm and D2D link k, k cannot share resource with m if xk,m>yk,m. Then, D2D pairs are divided into the following three groups by comparing each element of matrix X and matrix Y:(i)
First group (if allxk,m are more than all yk,m): D2D pairs in the first group cannot share resource with any cellular UE.(ii)
Second group (if part ofxk,m are more than part of yk,m): D2D pairs in the second group can share resource with some cellular UE.(iii)
Third group (if allxk,m are less than all yk,m): D2D pairs in the third group can share resource with all cellular UE.For further understanding, according to the geography distribution (distances of the various nodes), we then draw Figure2 to address the categorization problem. It is shown that if the distance between D2DkTx and CUEmTx is short and the distance between D2DkTx and D2DnRx is long, then the channel gain gDC,k,m turns to large value and gDD,k,n turns to small value. In this case, the corresponding minimum transmit power in (4) may be larger than the maximum transmit power in (5), which makes the first group and D2D pairs unable to share resource with any cellular UE. Otherwise, the corresponding minimum transmit power in (4) may be smaller than the maximum transmit power in (5) and this situation belongs to the third group. Hence, as for the second group, due to the geometry (distance of the various nodes) varying between the first and third groups, the corresponding channel gains in the second group fall within that in the first and third groups.Figure 2
Grouping illustration for a cellular network.Now, the resource sharing model, which enables multiple D2D UE devices to reuse the resource of cellular UE and minimizes the total transmit power of D2D system, is presented. We concentrate on resource sharing between cellular UE and D2D links in the second group. We construct anL-by-M matrix P by selecting rows corresponding to the D2D links in the second group from matrix X, that is, selecting the ith row from matrix X if D2D link belongs to the second group. Similarly, we construct an L-by-M matrix P by selecting rows from matrix Y. L denotes the number of D2D pairs in the second group. Then, two algorithms are provided for seeking the minimum transmit power value in matrix P under the following two cases.Case 1 (L<M).
In Algorithm1, X and Y denote the row and the column of P. Lines (2)–(9) in Algorithm 1 are used for seeking the minimum transmit power value p in matrix P, then marking the row and column that p belongs to, and continuing searching for the minimum transmit power value in the unmarked rows and columns in matrix P; the algorithm repeats the above operation about L times, thus obtaining L minimum transmit power values. Lines (10)–(18) are explained as follows: if each of these transmit power values is less than the corresponding maximum transmit power value, the algorithm returns them. If some of them are larger than the corresponding maximum transmit power, Algorithm 1 continues searching for the minimum transmit power of these D2D links according to lines (2)–(9) until each of them is less than the corresponding maximum transmit power. In line (19), pk⇒pl,m means that pk is the l,mth element of matrix P.Algorithm 1:Seeking the minimum transmit power value.
Input: The matrixP; Output: A set of minimum transmit powerp=p1,p2,…,pL; (1) X←1,2,…,L, (2) do Y←1,2,…,M (3) for  k=1:L (4)   for all  l∈X,m∈Y (5)   pk←min⁡Pl,m, record l and m (6)   qk←ql,m (7)   X←X-l,Y=Y-m (8)   end for (9)end for (10)fork=1:L (11)ifpk≤qk (12)returnpk (13)else (14)pk⇒pl,m,pl,m belongs to matrix P (15)    add the subscriptl to X (16)end if (17)end for (18)while (X≠∅) (19)P=p1,p2,…,pLCase 2 (L>M).
In Algorithm2, first, it searches for M minimum transmit power values from matrix P by calling Algorithm 1. Then, it updates all the columns in matrix P to unmarked and searches for the minimum transmit power values of the other L-M D2D links by calling Algorithm 1. When a feasible set p is obtained, a set of transmit power values in matrix X can be also attained by pk⇒pl,m⇒xk,m. If these transmit power values (xk,m) belong to different rows and different columns, the D2D links share resource with cellular UE by the subscript of the minimum transmit power; that is, xi,j means that D2D link i shares resource with cellular UE j. However, some minimum transmit power values belong to the same column, which means that multiple D2D links compete for the resource of cellular UE.
Thus, according to (1) and (3), the algorithm adjusts the transmitter power of these D2D links, such that they can share resource with the cellular UE when (2) holds. Otherwise, a D2D link, of which the transmit power value is minimal to share resource with the cellular UE, is selected.
As mentioned above, the target of the resource sharing method is not only to improve the system capacity but also to minimize the transmit power of D2D system. In order to minimize the total transmit power of D2D system, D2D links in the second group and the third group share resource with cellular UE based on the power minimization principle. The exclusive resources prefer to be allocated to the D2D UE of smaller transmit power in the first group, while each of the remaining cellular UE devices prefers to share resource with the D2D UE of smaller transmit power in the third group.Algorithm 2:Seeking the minimum transmit power value.
Input: The matrixP; Output: A set of minimum transmit powerp=p1,p2,…,pM; (1)  X←1,2,…,M,Y←1,2,…,M (2)  call Algorithm 1 (3)  X←M+1,M+2,…,L,Y←1,2,…,M (4)  call Algorithm 1 (5)  P=p1,p2,…,pM


## 3.1. Conditions for Sharing Resource between a Cellular Link and D2D Links

We defineu as a set of D2D links, which can share uplink resources with the cellular UE m if and only if the following condition is met:(1)SINRk=PkgDD,k,nNk+Im,k+∑i∈u,i≠kPigDD,i,k≥T0,∀k∈u,(2)∑k∈uPkgDC,k,m≤I0,(3)Im,k=PmgCD,m,k.Here, T0 and I0 are defined as the minimal SINR value of D2D k and the interference threshold value of cellular UE, respectively. Pk and Pm denote the transmit power of D2D link k and transmit power of cellular UE m, respectively.


## 3.2. Resource Sharing and Power Adjustment

### 3.2.1. Acquiring Transmit Power Matrix

We define aK×M matrix X, of which the k,mth element xk,m denotes the minimum transmitter power of D2D k that shared resources with cellular UE m, where xk,m can be calculated by (4). We define a K×M matrix Y, of which the k,mth element yk,m means the maximum transmitter power of D2D k that shared resources with cellular UE m, where yk,m can be calculated by (5). Hence,(4)SINRk=xk,mgDD,k,mNk+PmgCD,m,k≥T0(5)Ik=yk,mgDB,k,m≤I0.Here,T0 and I0 are defined as the minimal SINR value of D2D k and the interference threshold value of cellular UE, respectively.


### 3.2.2. Grouping D2D UE

According to the condition for sharing resource between the cellular linkm and D2D link k, k cannot share resource with m if xk,m>yk,m. Then, D2D pairs are divided into the following three groups by comparing each element of matrix X and matrix Y:(i)
First group (if allxk,m are more than all yk,m): D2D pairs in the first group cannot share resource with any cellular UE.(ii)
Second group (if part ofxk,m are more than part of yk,m): D2D pairs in the second group can share resource with some cellular UE.(iii)
Third group (if allxk,m are less than all yk,m): D2D pairs in the third group can share resource with all cellular UE.For further understanding, according to the geography distribution (distances of the various nodes), we then draw Figure2 to address the categorization problem. It is shown that if the distance between D2DkTx and CUEmTx is short and the distance between D2DkTx and D2DnRx is long, then the channel gain gDC,k,m turns to large value and gDD,k,n turns to small value. In this case, the corresponding minimum transmit power in (4) may be larger than the maximum transmit power in (5), which makes the first group and D2D pairs unable to share resource with any cellular UE. Otherwise, the corresponding minimum transmit power in (4) may be smaller than the maximum transmit power in (5) and this situation belongs to the third group. Hence, as for the second group, due to the geometry (distance of the various nodes) varying between the first and third groups, the corresponding channel gains in the second group fall within that in the first and third groups.Figure 2
Grouping illustration for a cellular network.Now, the resource sharing model, which enables multiple D2D UE devices to reuse the resource of cellular UE and minimizes the total transmit power of D2D system, is presented. We concentrate on resource sharing between cellular UE and D2D links in the second group. We construct anL-by-M matrix P by selecting rows corresponding to the D2D links in the second group from matrix X, that is, selecting the ith row from matrix X if D2D link belongs to the second group. Similarly, we construct an L-by-M matrix P by selecting rows from matrix Y. L denotes the number of D2D pairs in the second group. Then, two algorithms are provided for seeking the minimum transmit power value in matrix P under the following two cases.Case 1 (L<M).
In Algorithm1, X and Y denote the row and the column of P. Lines (2)–(9) in Algorithm 1 are used for seeking the minimum transmit power value p in matrix P, then marking the row and column that p belongs to, and continuing searching for the minimum transmit power value in the unmarked rows and columns in matrix P; the algorithm repeats the above operation about L times, thus obtaining L minimum transmit power values. Lines (10)–(18) are explained as follows: if each of these transmit power values is less than the corresponding maximum transmit power value, the algorithm returns them. If some of them are larger than the corresponding maximum transmit power, Algorithm 1 continues searching for the minimum transmit power of these D2D links according to lines (2)–(9) until each of them is less than the corresponding maximum transmit power. In line (19), pk⇒pl,m means that pk is the l,mth element of matrix P.Algorithm 1:Seeking the minimum transmit power value.
Input: The matrixP; Output: A set of minimum transmit powerp=p1,p2,…,pL; (1) X←1,2,…,L, (2) do Y←1,2,…,M (3) for  k=1:L (4)   for all  l∈X,m∈Y (5)   pk←min⁡Pl,m, record l and m (6)   qk←ql,m (7)   X←X-l,Y=Y-m (8)   end for (9)end for (10)fork=1:L (11)ifpk≤qk (12)returnpk (13)else (14)pk⇒pl,m,pl,m belongs to matrix P (15)    add the subscriptl to X (16)end if (17)end for (18)while (X≠∅) (19)P=p1,p2,…,pLCase 2 (L>M).
In Algorithm2, first, it searches for M minimum transmit power values from matrix P by calling Algorithm 1. Then, it updates all the columns in matrix P to unmarked and searches for the minimum transmit power values of the other L-M D2D links by calling Algorithm 1. When a feasible set p is obtained, a set of transmit power values in matrix X can be also attained by pk⇒pl,m⇒xk,m. If these transmit power values (xk,m) belong to different rows and different columns, the D2D links share resource with cellular UE by the subscript of the minimum transmit power; that is, xi,j means that D2D link i shares resource with cellular UE j. However, some minimum transmit power values belong to the same column, which means that multiple D2D links compete for the resource of cellular UE.
Thus, according to (1) and (3), the algorithm adjusts the transmitter power of these D2D links, such that they can share resource with the cellular UE when (2) holds. Otherwise, a D2D link, of which the transmit power value is minimal to share resource with the cellular UE, is selected.
As mentioned above, the target of the resource sharing method is not only to improve the system capacity but also to minimize the transmit power of D2D system. In order to minimize the total transmit power of D2D system, D2D links in the second group and the third group share resource with cellular UE based on the power minimization principle. The exclusive resources prefer to be allocated to the D2D UE of smaller transmit power in the first group, while each of the remaining cellular UE devices prefers to share resource with the D2D UE of smaller transmit power in the third group.Algorithm 2:Seeking the minimum transmit power value.
Input: The matrixP; Output: A set of minimum transmit powerp=p1,p2,…,pM; (1)  X←1,2,…,M,Y←1,2,…,M (2)  call Algorithm 1 (3)  X←M+1,M+2,…,L,Y←1,2,…,M (4)  call Algorithm 1 (5)  P=p1,p2,…,pM


## 3.2.1. Acquiring Transmit Power Matrix

We define aK×M matrix X, of which the k,mth element xk,m denotes the minimum transmitter power of D2D k that shared resources with cellular UE m, where xk,m can be calculated by (4). We define a K×M matrix Y, of which the k,mth element yk,m means the maximum transmitter power of D2D k that shared resources with cellular UE m, where yk,m can be calculated by (5). Hence,(4)SINRk=xk,mgDD,k,mNk+PmgCD,m,k≥T0(5)Ik=yk,mgDB,k,m≤I0.Here,T0 and I0 are defined as the minimal SINR value of D2D k and the interference threshold value of cellular UE, respectively.


## 3.2.2. Grouping D2D UE

According to the condition for sharing resource between the cellular linkm and D2D link k, k cannot share resource with m if xk,m>yk,m. Then, D2D pairs are divided into the following three groups by comparing each element of matrix X and matrix Y:(i)
First group (if allxk,m are more than all yk,m): D2D pairs in the first group cannot share resource with any cellular UE.(ii)
Second group (if part ofxk,m are more than part of yk,m): D2D pairs in the second group can share resource with some cellular UE.(iii)
Third group (if allxk,m are less than all yk,m): D2D pairs in the third group can share resource with all cellular UE.For further understanding, according to the geography distribution (distances of the various nodes), we then draw Figure2 to address the categorization problem. It is shown that if the distance between D2DkTx and CUEmTx is short and the distance between D2DkTx and D2DnRx is long, then the channel gain gDC,k,m turns to large value and gDD,k,n turns to small value. In this case, the corresponding minimum transmit power in (4) may be larger than the maximum transmit power in (5), which makes the first group and D2D pairs unable to share resource with any cellular UE. Otherwise, the corresponding minimum transmit power in (4) may be smaller than the maximum transmit power in (5) and this situation belongs to the third group. Hence, as for the second group, due to the geometry (distance of the various nodes) varying between the first and third groups, the corresponding channel gains in the second group fall within that in the first and third groups.Figure 2
Grouping illustration for a cellular network.Now, the resource sharing model, which enables multiple D2D UE devices to reuse the resource of cellular UE and minimizes the total transmit power of D2D system, is presented. We concentrate on resource sharing between cellular UE and D2D links in the second group. We construct anL-by-M matrix P by selecting rows corresponding to the D2D links in the second group from matrix X, that is, selecting the ith row from matrix X if D2D link belongs to the second group. Similarly, we construct an L-by-M matrix P by selecting rows from matrix Y. L denotes the number of D2D pairs in the second group. Then, two algorithms are provided for seeking the minimum transmit power value in matrix P under the following two cases.Case 1 (L<M).
In Algorithm1, X and Y denote the row and the column of P. Lines (2)–(9) in Algorithm 1 are used for seeking the minimum transmit power value p in matrix P, then marking the row and column that p belongs to, and continuing searching for the minimum transmit power value in the unmarked rows and columns in matrix P; the algorithm repeats the above operation about L times, thus obtaining L minimum transmit power values. Lines (10)–(18) are explained as follows: if each of these transmit power values is less than the corresponding maximum transmit power value, the algorithm returns them. If some of them are larger than the corresponding maximum transmit power, Algorithm 1 continues searching for the minimum transmit power of these D2D links according to lines (2)–(9) until each of them is less than the corresponding maximum transmit power. In line (19), pk⇒pl,m means that pk is the l,mth element of matrix P.Algorithm 1:Seeking the minimum transmit power value.
Input: The matrixP; Output: A set of minimum transmit powerp=p1,p2,…,pL; (1) X←1,2,…,L, (2) do Y←1,2,…,M (3) for  k=1:L (4)   for all  l∈X,m∈Y (5)   pk←min⁡Pl,m, record l and m (6)   qk←ql,m (7)   X←X-l,Y=Y-m (8)   end for (9)end for (10)fork=1:L (11)ifpk≤qk (12)returnpk (13)else (14)pk⇒pl,m,pl,m belongs to matrix P (15)    add the subscriptl to X (16)end if (17)end for (18)while (X≠∅) (19)P=p1,p2,…,pLCase 2 (L>M).
In Algorithm2, first, it searches for M minimum transmit power values from matrix P by calling Algorithm 1. Then, it updates all the columns in matrix P to unmarked and searches for the minimum transmit power values of the other L-M D2D links by calling Algorithm 1. When a feasible set p is obtained, a set of transmit power values in matrix X can be also attained by pk⇒pl,m⇒xk,m. If these transmit power values (xk,m) belong to different rows and different columns, the D2D links share resource with cellular UE by the subscript of the minimum transmit power; that is, xi,j means that D2D link i shares resource with cellular UE j. However, some minimum transmit power values belong to the same column, which means that multiple D2D links compete for the resource of cellular UE.
Thus, according to (1) and (3), the algorithm adjusts the transmitter power of these D2D links, such that they can share resource with the cellular UE when (2) holds. Otherwise, a D2D link, of which the transmit power value is minimal to share resource with the cellular UE, is selected.
As mentioned above, the target of the resource sharing method is not only to improve the system capacity but also to minimize the transmit power of D2D system. In order to minimize the total transmit power of D2D system, D2D links in the second group and the third group share resource with cellular UE based on the power minimization principle. The exclusive resources prefer to be allocated to the D2D UE of smaller transmit power in the first group, while each of the remaining cellular UE devices prefers to share resource with the D2D UE of smaller transmit power in the third group.Algorithm 2:Seeking the minimum transmit power value.
Input: The matrixP; Output: A set of minimum transmit powerp=p1,p2,…,pM; (1)  X←1,2,…,M,Y←1,2,…,M (2)  call Algorithm 1 (3)  X←M+1,M+2,…,L,Y←1,2,…,M (4)  call Algorithm 1 (5)  P=p1,p2,…,pM


## 4. Performance Analysis

In this section, the performance of the proposed resource sharing mechanism is evaluated. First, the simulation parameters are set and then the simulation results are presented and analyzed. All the simulations are operated under the MATLAB environment.


### 4.1. Simulation Setup

There areM cellular UE devices and K D2D pairs within a single circular cell with the radius of 500 m. It is assumed that the bandwidth of an RB is WRB=180 kHZ, and the noise spectral density is N0=-174 dBm/Hz. The path loss, shadowing, and Rayleigh fading are considered. Based on LTE system models [19], the path-loss model is z=35.3+37.6log10⁡d (dB), where d is the distance between the transmitter and the receiver. According to [20], it is assumed that the shadowing components of all links are i.i.d., and the shadowing component η follows a log-normal distribution with zero mean and standard deviation σn, σn=8 dB. It is also assumed that the multipath components of all links are independent of each other, and all of them are exponentially distributed with the same mean of μφ, μφ=1. The minimal SINR threshold value of each D2D pair for normal communication is T0=0 dB, and the transmit power of each cellular UE is 20 dBm. We consider the number of D2D pairs and the interference threshold value of eNodeB I0 as variables of the simulation. Simulation parameters are summarized in Table 1.Table 1
Simulation parameters.
Cell radius 500 m Maximal distance between one D2D pair 50 m Number of cellular users 25 Number of D2D pairs 25 Bandwidth per RBWRB 180 kHz Path-loss model 35.3 + 37.6  log 10 ⁡ d dB Target bit error rateBER1 0.01 The probability thresholdθ 0.01 Power level of thermal noiseN0 - 174 dBm/Hz The meanμφ of multipath fading 1 dB The standard deviationσn of shadowing 8 dB 1Note that BER is an important effect factor on the throughput for systems; that is, the larger the BER, the smaller the achievable throughput. Thus, we add it to the simulation parameters for the calculation of achievable throughput.


### 4.2. Simulation Results

The simulation results are plotted in Figures3–8. Before discussing the results, we shortly describe the random algorithm [21] and the heuristic algorithm [22]; both of them assume that cellular UE can only share resource with a D2D pair. In the random algorithm, a D2D pair shares resource with random cellular UE in the cell, while cellular UE of priority shares resource with a D2D pair which causes the least interference to the eNodeB in the heuristic algorithm.Figure 3
The number of D2D pairs in each group.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 4
System sum rate with the number of D2D under different interference thresholds.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 5
The number of accessed D2D pairs.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 6
Transmit power of D2D transmitter.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 7
Average transmit power with the number of D2D for different methods.Figure 8
System sum rate with the number of D2D for different methods.In Figure3, the number of D2D pairs in each group is presented. It can be observed that the number of D2D pairs in the first group is increasing while the number of D2D pairs in the third group is decreasing with the interference threshold value of eNodeB becoming smaller. Since D2D pairs in the first group can only use exclusive resource, some of them cannot access the system when exclusive resource is insufficient. Next, we analyze the performance of the proposed scheme.The system sum rate with the number of D2D under different interference thresholds can be found in Figure4. It can be seen that the system sum rate of the proposed algorithm is better than the other two algorithms.In Figure5, since the proposed algorithm enables multiple D2D UE devices to share resource with the same cellular UE simultaneously, it achieves a higher network capacity than the other two algorithms. From Figure 5(a), we can see that the maximum number of accessed D2D pairs is 25 which is equal to cellular UE. The reason is that cellular UE can only share resource with a D2D pair in the other two algorithms. At the same time, it can be observed that the number of accessed D2D pairs is decreasing with the interference threshold value of eNodeB becoming smaller. When many D2D pairs belong to the first group and they can only use exclusive limited resources, as a result, some D2D pairs have no resource to use and thus cannot access the system.The average transmit power of D2D transmitter is presented in Figure6. It shows that the proposed resource sharing method has a better performance in the aspect of transmit power over the random algorithm and heuristic algorithm. The reason is as follows. In the random algorithm, a D2D pair shares resource with random cellular UE, while cellular UE of priority shares resource with D2D pair which causes the least interference to the eNodeB in the heuristic algorithm. However, in the proposed algorithm, cellular UE devices prefer to share resource with the D2D pairs of smaller transmit power.At the end, we have compared the proposed method with the methods proposed in [11], as shown in Figures 7 and 8. As for literatures [16–18], the proposed methods indeed achieve relatively better performance and lay the foundation in the area of the D2D resource sharing. However, it is shown that the CA algorithm in [11] can achieve a relatively higher sum rate compared with our proposed method, while the average transmit power is rather higher than the proposed method in our paper. Hence, our proposed method can be regarded as a kind of sum rate-power tradeoff scheme and can be used as an alternative in reality.


## 4.1. Simulation Setup

There areM cellular UE devices and K D2D pairs within a single circular cell with the radius of 500 m. It is assumed that the bandwidth of an RB is WRB=180 kHZ, and the noise spectral density is N0=-174 dBm/Hz. The path loss, shadowing, and Rayleigh fading are considered. Based on LTE system models [19], the path-loss model is z=35.3+37.6log10⁡d (dB), where d is the distance between the transmitter and the receiver. According to [20], it is assumed that the shadowing components of all links are i.i.d., and the shadowing component η follows a log-normal distribution with zero mean and standard deviation σn, σn=8 dB. It is also assumed that the multipath components of all links are independent of each other, and all of them are exponentially distributed with the same mean of μφ, μφ=1. The minimal SINR threshold value of each D2D pair for normal communication is T0=0 dB, and the transmit power of each cellular UE is 20 dBm. We consider the number of D2D pairs and the interference threshold value of eNodeB I0 as variables of the simulation. Simulation parameters are summarized in Table 1.Table 1
Simulation parameters.
Cell radius 500 m Maximal distance between one D2D pair 50 m Number of cellular users 25 Number of D2D pairs 25 Bandwidth per RBWRB 180 kHz Path-loss model 35.3 + 37.6  log 10 ⁡ d dB Target bit error rateBER1 0.01 The probability thresholdθ 0.01 Power level of thermal noiseN0 - 174 dBm/Hz The meanμφ of multipath fading 1 dB The standard deviationσn of shadowing 8 dB 1Note that BER is an important effect factor on the throughput for systems; that is, the larger the BER, the smaller the achievable throughput. Thus, we add it to the simulation parameters for the calculation of achievable throughput.


## 4.2. Simulation Results

The simulation results are plotted in Figures3–8. Before discussing the results, we shortly describe the random algorithm [21] and the heuristic algorithm [22]; both of them assume that cellular UE can only share resource with a D2D pair. In the random algorithm, a D2D pair shares resource with random cellular UE in the cell, while cellular UE of priority shares resource with a D2D pair which causes the least interference to the eNodeB in the heuristic algorithm.Figure 3
The number of D2D pairs in each group.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 4
System sum rate with the number of D2D under different interference thresholds.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 5
The number of accessed D2D pairs.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 6
Transmit power of D2D transmitter.
(a)
I 0 = - 100 dB (b)
I 0 = - 120 dB (c)
I 0 = - 130 dBFigure 7
Average transmit power with the number of D2D for different methods.Figure 8
System sum rate with the number of D2D for different methods.In Figure3, the number of D2D pairs in each group is presented. It can be observed that the number of D2D pairs in the first group is increasing while the number of D2D pairs in the third group is decreasing with the interference threshold value of eNodeB becoming smaller. Since D2D pairs in the first group can only use exclusive resource, some of them cannot access the system when exclusive resource is insufficient. Next, we analyze the performance of the proposed scheme.The system sum rate with the number of D2D under different interference thresholds can be found in Figure4. It can be seen that the system sum rate of the proposed algorithm is better than the other two algorithms.In Figure5, since the proposed algorithm enables multiple D2D UE devices to share resource with the same cellular UE simultaneously, it achieves a higher network capacity than the other two algorithms. From Figure 5(a), we can see that the maximum number of accessed D2D pairs is 25 which is equal to cellular UE. The reason is that cellular UE can only share resource with a D2D pair in the other two algorithms. At the same time, it can be observed that the number of accessed D2D pairs is decreasing with the interference threshold value of eNodeB becoming smaller. When many D2D pairs belong to the first group and they can only use exclusive limited resources, as a result, some D2D pairs have no resource to use and thus cannot access the system.The average transmit power of D2D transmitter is presented in Figure6. It shows that the proposed resource sharing method has a better performance in the aspect of transmit power over the random algorithm and heuristic algorithm. The reason is as follows. In the random algorithm, a D2D pair shares resource with random cellular UE, while cellular UE of priority shares resource with D2D pair which causes the least interference to the eNodeB in the heuristic algorithm. However, in the proposed algorithm, cellular UE devices prefer to share resource with the D2D pairs of smaller transmit power.At the end, we have compared the proposed method with the methods proposed in [11], as shown in Figures 7 and 8. As for literatures [16–18], the proposed methods indeed achieve relatively better performance and lay the foundation in the area of the D2D resource sharing. However, it is shown that the CA algorithm in [11] can achieve a relatively higher sum rate compared with our proposed method, while the average transmit power is rather higher than the proposed method in our paper. Hence, our proposed method can be regarded as a kind of sum rate-power tradeoff scheme and can be used as an alternative in reality.


## 5. Conclusion

In this paper, a mechanism where multiple D2D links share resource with a cellular link in cellular network is proposed. Firstly, a minimum transmit power matrix and a maximum transmit power matrix are constructed, and D2D UE devices are divided into three groups by comparing each element of matrix. We construct a minimum transmit power matrix according to D2D pairs in the second group. By circular searching of the minimum value in matrix and comparing it with the corresponding maximum transmit power, the minimum transmit power values are obtained. Then, we adjust the transmit power of D2D transmitters that belong to the same column, and the D2D pairs share resource with cellular UE by the subscript of the selected minimum transmit power. In order to minimize the transmit power of D2D system, D2D UE devices in the first group and third group share resource with cellular UE based on the transmit power minimization principle. Finally, the simulation results show that the proposed policy can achieve a relatively higher network capacity and lower transmit power of D2D system.



---

*Source: 5894752-2016-11-29.xml*