# Exploiting the User-Level Interference Based on Network Coding in D2D Underlaid Cellular Networks

Authors: Yijun Guo; Jing Gao; Jianjun Hao
Journal: Mobile Information Systems
 (2015)

---

## Abstract

Interference is an important and challenging problem
faced by the D2D underlaid cellular networks. In this
paper, we focus on the user-level interference under multicasting
scenarios. Rather than the traditional pairwise way of
D2D communications, we propose to implement the information
exchanging through a groupwise way. Through introducing the
idea of network coding, the proposed scheme is able to utilize
the interference as valid signals to enhance the receiving performance,
instead of only managing or controlling it. Both theoretical
analysis and simulation results prove that the proposed scheme
achieves better SINR performance and lower resources occupation
than the traditional pairwise D2D transmission schemes.


---

## Body

## 1. Introduction

Device-to-device (D2D) underlaid cellular networks [1] have attracted increasing interests in recent years with the proliferation of wireless devices and the fast progress of mobile computing and wireless network services. It enables nearby pieces of user equipment (UE) to exchange data directly with each other over D2D links without the help of cellular base stations (BS). The advantages of D2D communications lie in high-rate local data transmission, high spectral frequency efficiency by reusing cellular resources, and the capability of lightening the load at BS [2, 3]. From user’s aspects, the D2D techniques mainly provides authenticated peer-to-peer communications, public safety services, and context-aware services. From operator’s aspects, it lies in enhancing the network operation through user cooperation on the D2D links [4]. Recently, 3GPP LTE Rel-12 has a dedicated study item for D2D in which technical specifications are currently being discussed by the industry [5]. D2D underlaid cellular networks became a popular subject for research in recent years, and various studies have been made to increase the performance of the networks and support more advanced mobile services and applications [6–9].Interference is a severe problem faced by D2D underlaid cellular networks. On the one hand, since the D2D links reuse the cellular time-frequency resources, the interchannel interference (ICI) between the cellular and D2D links, referred to as cell-level ICI, emerges. On the other hand, the ICI between D2D links themselves, referred to as user-level ICI, increases as the number of D2D users increases since they share limited time-frequency resources. Both cell-level ICI and user-level ICI severely deteriorate the entire system performance [3]. Many efforts have been made in recent years to manage the interference in D2D underlaid cellular networks, in order to improve the spectrum efficiency and ultimately improve the network capacity. In view of spectrum scarcity (a deficit of about 275 MHz by 2014 according to FCC), it is clear that any improvement on the interference control and management side is more than just favorable and eventually shall bring us closer to the yet unknown capacity of cellular networks.Schemes based on orthogonal resource allocation are studied as direct ways for D2D interference management in [10–14]. Works in [10–12] mainly focus on the cell-level ICI. The principle is to assign orthogonal time frequency to D2D user equipment (DUE) and cellular user equipment (CUE). Authors in [13, 14] introduce specialized schemes for user-level interference such as maximum carrier-to-interference ratio (MCI) scheduling and maximum throughput (MT) scheduling. However, these orthogonal schemes have not considered the spectrum efficiency.For efficiency enhancement, nonorthogonal frequency reuse strategies are investigated in [3, 15–17]. δD-interference limited area control scheme is proposed to manage interference in [3]. It limits DUE’s maximum transmit power and excludes the CUEs from the δD-interference limited area, in order to minimize the interference to DUEs. In [15], three receiving modes are switched at the D2D receiver according to the interference level in order to improve the D2D performance in terms of outage probability. The mind of cooperative interference cancellation (CIC) has been introduced in [16]. CIC exploits the interference correlation between close-by users to eliminate interference cooperatively and improve downlink throughput. The authors in [17] adopt interference alignment (IA) to mitigate the cell-level interference and improve capacity. This paper intends to adopt interference alignment (IA) for improving the energy efficiency (EE) of both the device-to-device (D2D) and cellular links in a D2D multiple-input and multiple-output (MIMO) downlink underlaying cellular network. For this case, a critical issue is to properly coordinate existing interference to guarantee both reliable macro cellular and D2D communications as they simultaneously reuse the same frequency and time resources. However, these schemes only treat the interference as a negative factor and focus on controlling and eliminating but do not consider utilizing the interference for better receiving.In D2D underlaid cellular networks, it is important and challenging to manage the interference in the presence of limited resources and large amount of users. To deal with the interference problem and improve network capacity discussed above, in this work, we focus on the user-level interference under multicasting scenarios and propose to introduce the idea of network coding (NC) into D2D underlaid cellular networks. Rather than the traditional pairwise way, we propose to implement the information exchanging process through a groupwise way and utilize the interference to enhance the receiving performance. Besides serving as a physical transmission scheme for multicasting services in cellular networks, we expect the proposed scheme to be applicable in other network research fields for a higher network performance.The remainder of this paper is organized as follows. Section2 gives the system model; Section 3 describes the proposed NC-based groupwise (NC-G) transmission scheme; Section 4 analyzes the theory performance; Section 5 simulates and compares the NC-G scheme with another two traditional schemes; Section 6 concludes the paper.Notations. Lowercase boldface letters represent vectors. · returns the absolute value of a scalar and · gives the norm of a vector.


## 2. Background and Foundation

### 2.1. System Model

Consider D2D underlaid cellular networks consisting of one BS and 2 D2D pairs. Use a two-dimensional plane to represent their positions. Place the BS node at the original point and place the 4 DUE nodes as a rectangle as shown in Figure1. The topology is determined by three kinds of distance: dintra denotes the distance between two DUEs in a pair; dinter denotes the distance between the centers of two pairs; dBS denotes the distance between BS and the rectangular center.Figure 1
System model.D2D communications are established and share time-frequency resources with the cellular communications through central controlling from BS using dedicated control channels. Use physical resource block (PRB) to measure the time-frequency resources. The transmitting and receiving of each DUE node are implemented with different PRBs.The base station (BS) need to broadcast a block of data to the 4 D2D user equipments (DUEs). To alleviate its own load, BS distributes the block of data to each DUE and initiates D2D communications to exchange information locally. Each DUE, denoted byDi(i∈1,4), has been allocated data of length N to exchange, denoted by xi=[xi,1,…,xi,N]. As for D2D communication, assume that M-ary modulation is adopted for all the DUEs; the D2D links are block fading, and perfect channel state information (CSI) is known at the receivers.


### 2.2. The Traditional Way

The proposed scheme detailed later will be compared with the traditional underlaid D2D communication scheme based on pairwise transmissions. Based on pairwise way, the 4 DUEs as discussed in Section2.1 have to establish communications and exchange their information in pairs.Below we give a simple pairwise transmission scheme. A complete information exchange process between the 4 DUEs contains three stages, as listed in Table1, where Dx↔Dy represents the notion that the communication channel between Dx and Dy is constructed and they could exchange information with each other. In particular, under the communication target described in Section 2.1, in the first stage, D1 and D2 exchange x1 and x2 while D3 and D4 exchange x3 and x4. In the following stages, the two pairs are interchanged for similar pairwise information exchanging. After three stages, each DUE node has exchanged information with 3 other DUE nodes. Thus, all of the 4 DUEs obtain the complete data x=[x1,x2,x3,x4].Table 1
Scheduling for exchanging data between 4 DUEs by pairwise D2D communications.
Phase 1
D
1
↔
D
2
D
3
↔
D
4
Phase 2
D
1
↔
D
3
D
2
↔
D
4
Phase 3
D
1
↔
D
4
D
2
↔
D
3


## 2.1. System Model

Consider D2D underlaid cellular networks consisting of one BS and 2 D2D pairs. Use a two-dimensional plane to represent their positions. Place the BS node at the original point and place the 4 DUE nodes as a rectangle as shown in Figure1. The topology is determined by three kinds of distance: dintra denotes the distance between two DUEs in a pair; dinter denotes the distance between the centers of two pairs; dBS denotes the distance between BS and the rectangular center.Figure 1
System model.D2D communications are established and share time-frequency resources with the cellular communications through central controlling from BS using dedicated control channels. Use physical resource block (PRB) to measure the time-frequency resources. The transmitting and receiving of each DUE node are implemented with different PRBs.The base station (BS) need to broadcast a block of data to the 4 D2D user equipments (DUEs). To alleviate its own load, BS distributes the block of data to each DUE and initiates D2D communications to exchange information locally. Each DUE, denoted byDi(i∈1,4), has been allocated data of length N to exchange, denoted by xi=[xi,1,…,xi,N]. As for D2D communication, assume that M-ary modulation is adopted for all the DUEs; the D2D links are block fading, and perfect channel state information (CSI) is known at the receivers.


## 2.2. The Traditional Way

The proposed scheme detailed later will be compared with the traditional underlaid D2D communication scheme based on pairwise transmissions. Based on pairwise way, the 4 DUEs as discussed in Section2.1 have to establish communications and exchange their information in pairs.Below we give a simple pairwise transmission scheme. A complete information exchange process between the 4 DUEs contains three stages, as listed in Table1, where Dx↔Dy represents the notion that the communication channel between Dx and Dy is constructed and they could exchange information with each other. In particular, under the communication target described in Section 2.1, in the first stage, D1 and D2 exchange x1 and x2 while D3 and D4 exchange x3 and x4. In the following stages, the two pairs are interchanged for similar pairwise information exchanging. After three stages, each DUE node has exchanged information with 3 other DUE nodes. Thus, all of the 4 DUEs obtain the complete data x=[x1,x2,x3,x4].Table 1
Scheduling for exchanging data between 4 DUEs by pairwise D2D communications.
Phase 1
D
1
↔
D
2
D
3
↔
D
4
Phase 2
D
1
↔
D
3
D
2
↔
D
4
Phase 3
D
1
↔
D
4
D
2
↔
D
3


## 3. Problem Description

As mentioned above, there are two kinds of interferences in an underlaid cellular D2D network: cell-level ICI and user-level ICI. The former one has been researched deeply and would not be discussed in this paper. When limited PRBs are assigned for D2D communications, the user-level ICI is a severe problem especially when the amount of DUEs is large.In particular, as for the pairwise D2D way, if two D2D pairs positioned in each other’s communication range are assigned by the same PRBs, they would interfere with each other as illustrated in Figure2. For example, let M· denote the modulation function and let si=[si,1,…,si,N] denote the symbol vector modulated by xi; that is, si=Mxi. Assume each symbol si,n is energy normalized; that is, Esi,n=1.Figure 2
Interference model under traditional pairwise D2D transmission.Focus on the receiving atD1. The valid signal is s2 from D2 through PRB1. Since D3 also uses PRB1 to transmit s3 to D4, the signal received by D1 is interfered with and is formulated as(1)rD1=α21P2h21s2+α31P3h31s3+nD1,where αij characterizes the path loss effect of channel Di→Dj. Pi constrains the transmit power at Di. hij denotes the multipath fading item with its entries modeled as independent and identically distributed (i.i.d.) Rayleigh variables. nDi~CN0,1 models the normalized additive Gaussian noise at the receiver of Di.According to (1), the received signal-to-noise-plus-interference ratios (SINR) at D1 are given by(2)γ1=α21P2h212α31P3h312+1.Obviously, the valid signals from D3 are interfered with by the signals from D4. Besides, given transmit power, the receiving performance would degrade when α41 increases; that is, the two D2D pairs become close.Based on the above analysis, user-level ICI management is an important and challenging problem in underlaid D2D networks, and it is our major concern in this work. In the following sections, we will show a new group-based transmission scheme for multicasting scenarios. Rather than controlling or eliminating the interference by traditional schemes, the proposed scheme is able to exploit the user-level ICI to improve the receiving performance using the idea of network coding.


## 4. The Proposed Scheme

With the proposed NC-based groupwise scheme, two D2D pairs, that is, 4 DUE nodes, are organized as a group to implement the information exchanging process, as illustrated in Figure3. Assume that all of the 4 DUEs are synchronized through the BS. The synchronization problem in realization would be discussed later. D1 and D4 use PRB1 to receive and PRB2 to transmit. D2 and D3 are just opposite, using PRB2 to receive and PRB1 to transmit.Figure 3
The proposed group-based transmission model.We propose to exploit the idea of network coding in order to enable the simultaneous receiving of two distinct signals and also improve the transmission efficiency. In particular, focus on the exchanging of thenth symbols to describe the proposed scheme. A complete exchange of the nth symbols is defined as each DUE obtaining the nth symbols from all the DUEs, that is, [s1,n,s2,n,s3,n,s4,n]. This process contains two stages, referred to as the precoding (PC) stage and the network coding (NC) stage, respectively.


### 4.1. The PC Stage

Initially, each of the 4 DUEs only has its own codeword, that is,x1,n, x2,n, x3,n, and x4,n, respectively. The PC stage occupies two time slots (TS). At the transmitter of each DUE node, for example, Di, it precodes its own symbol si,n by different coefficients in the two time slots, denoted by ci1 and ci2, respectively, and then sends them to its two neighbor receivers. At the receiver, each DUE receives superposition of two signals from the two neighbors in each TS.Focus on the reception atD1 for illustration. D1 receives signals from both D2 and D3 simultaneously. For the assumption of block fading, the channel fading coefficients could be seen as the same during the whole exchanging process of the nth symbols. Thus, the superposition signals received by D1 during TS1 and TS2, respectively, are formulated as(3a)rD1,n1=α21P2h21,nc21s2,n+α31P3h31,nc31s3,n+nD1,n1,(3b)rD1,n2=α21P2h21,nc22s2,n-α31P3h31,nc32s3,n+nD1,n2,where rDi,nj(j=1,2) represents the reception at Di in TSj for the nth symbol. Notice here that the signal from D4 is transmitted through PRB1, which would not interfere with the receiving at D1 through PRB2.With the two received signals,D1 is able to recover s2,n and s3,n if and only if the two precoding vectors c21,c31 and c22,c32 are linearly independent. For simplicity, specify the precoding coefficients used by the 4 DUEs in the PC stage as shown in Table 2. Hence, at D1, s2,n and s3,n can be recovered through simple Gaussian eliminations as(4a)s^2,n1=12α21P2h21,nrD1,n1+rD1,n2,(4b)s^3,n1=12α31P3h31,nrD1,n1-rD1,n2,where s^i,n1 denotes the recovered version of si,n at D1. Then D1 can demodulate s^2,n and s^3,n to get the codewords x2,n and x3,n as(5a)x^2,n1=M-1s^2,n1,(5b)x^3,n1=M-1s^3,n1.Table 2
Precoding coefficients in the PC stage.
c
i
j
D
1
D
2
D
3
D
4
T
S
1
1
1
1
1
T
S
2
1
1
−1
−1


### 4.2. The NC Stage

Next, the NC stage occupies one TS to complete the whole exchange of[x1,n,x2,n,x3,n,x4,n] between the 4 DUEs. The transmitter of each DUE node performs linear network coding, for example, XOR function to the two codewords it has already obtained during the previous PC stage. Then it remodulates and sends the encoded codewords through its transmit PRB. At the receiver, each DUE receives superposition of two copies of the encoded symbol from its two neighbors. Through demodulating the superposition signal to get the encoded codeword, and then decoding it using local codeword information, each DUE can obtain the last unknown codeword. So far, the whole exchanging process for the nth symbols between all the 4 DUEs is completed.Focus on the reception atD1 for illustration, again. Through the previous PC stage, its two neighbors D2 and D3 have already gotten the information from D1 and D4, denoted by [x^1,n2,x^4,n2] and [x^1,n3,x^4,n3], respectively. In TS3, D2 and D3 perform network coding to the recovered codewords and then modulate the network coded codeword as(6a)s1⊕4,n2=Mx^1,n2⊕x^4,n2,(6b)s1⊕4,n3=Mx^1,n3⊕x^4,n3,respectively. Correspondingly, D1 receives the superposition of these two copies of the network coded symbol s1⊕4,n, formulated as(7)rD1,n3=α21P2h21,ns1⊕4,n2+α31P3h31,ns1⊕4,n3+nD1,n3.In order to getx4,n, D1 first applies the combining receiving method to the superposition signal and detects s1⊕4,n as(8)s^1⊕4,n1=rD1,n3α21P2h21,n+α31P3h31,n.Then D1 demodulates s^1⊕4,n1 to get the encoded codeword as(9)x^1⊕4,n1=M-1s^1⊕4,n1.Finally, D1 decodes x^1⊕4,n1 using its local codeword x1,n to obtain x4,n as(10)x^4,n1=x^1⊕4,n1⊕x1,n.Through the PC stage and the NC stage,D1 gets the whole nth symbols x^n1=[x^1,n1,x^2,n1,x^3,n1,x^4,n1]. As for D2, D3, and D4, the communication processes are similar with D1. As described above, for each DUE, both signals from the two neighbors transmitting in the same PRB are valid signals rather than interference. Hence the purpose of exploiting interference to improve the receiving performance is realized.


### 4.3. Realization Problems

Two realization problems would be discussed in this subsection.


#### 4.3.1. Synchronization

Intuitively, the proposed scheme is highly dependent on the synchronization between the 4 DUEs, which seems difficult to realize. However, the stress is relieved in cellular-controlled D2D networks. The reason is that the centralized control mode allows every DUE to be synchronized with the center node, that is, the BS. On the other hand, the synchronization offset caused by the transmission delay between DUE nodes can be negligible since a D2D communication is established only if the DUEs are close.


#### 4.3.2. Assignment of Precoding Coefficients

As described in the scheme, the 4 DUEs need to be preassigned the precoding coefficients for the PC stage. This assignment can be implemented easily by the BS through its control channels with all of the DUEs during the establishment stage of the D2D communication.


## 4.1. The PC Stage

Initially, each of the 4 DUEs only has its own codeword, that is,x1,n, x2,n, x3,n, and x4,n, respectively. The PC stage occupies two time slots (TS). At the transmitter of each DUE node, for example, Di, it precodes its own symbol si,n by different coefficients in the two time slots, denoted by ci1 and ci2, respectively, and then sends them to its two neighbor receivers. At the receiver, each DUE receives superposition of two signals from the two neighbors in each TS.Focus on the reception atD1 for illustration. D1 receives signals from both D2 and D3 simultaneously. For the assumption of block fading, the channel fading coefficients could be seen as the same during the whole exchanging process of the nth symbols. Thus, the superposition signals received by D1 during TS1 and TS2, respectively, are formulated as(3a)rD1,n1=α21P2h21,nc21s2,n+α31P3h31,nc31s3,n+nD1,n1,(3b)rD1,n2=α21P2h21,nc22s2,n-α31P3h31,nc32s3,n+nD1,n2,where rDi,nj(j=1,2) represents the reception at Di in TSj for the nth symbol. Notice here that the signal from D4 is transmitted through PRB1, which would not interfere with the receiving at D1 through PRB2.With the two received signals,D1 is able to recover s2,n and s3,n if and only if the two precoding vectors c21,c31 and c22,c32 are linearly independent. For simplicity, specify the precoding coefficients used by the 4 DUEs in the PC stage as shown in Table 2. Hence, at D1, s2,n and s3,n can be recovered through simple Gaussian eliminations as(4a)s^2,n1=12α21P2h21,nrD1,n1+rD1,n2,(4b)s^3,n1=12α31P3h31,nrD1,n1-rD1,n2,where s^i,n1 denotes the recovered version of si,n at D1. Then D1 can demodulate s^2,n and s^3,n to get the codewords x2,n and x3,n as(5a)x^2,n1=M-1s^2,n1,(5b)x^3,n1=M-1s^3,n1.Table 2
Precoding coefficients in the PC stage.
c
i
j
D
1
D
2
D
3
D
4
T
S
1
1
1
1
1
T
S
2
1
1
−1
−1


## 4.2. The NC Stage

Next, the NC stage occupies one TS to complete the whole exchange of[x1,n,x2,n,x3,n,x4,n] between the 4 DUEs. The transmitter of each DUE node performs linear network coding, for example, XOR function to the two codewords it has already obtained during the previous PC stage. Then it remodulates and sends the encoded codewords through its transmit PRB. At the receiver, each DUE receives superposition of two copies of the encoded symbol from its two neighbors. Through demodulating the superposition signal to get the encoded codeword, and then decoding it using local codeword information, each DUE can obtain the last unknown codeword. So far, the whole exchanging process for the nth symbols between all the 4 DUEs is completed.Focus on the reception atD1 for illustration, again. Through the previous PC stage, its two neighbors D2 and D3 have already gotten the information from D1 and D4, denoted by [x^1,n2,x^4,n2] and [x^1,n3,x^4,n3], respectively. In TS3, D2 and D3 perform network coding to the recovered codewords and then modulate the network coded codeword as(6a)s1⊕4,n2=Mx^1,n2⊕x^4,n2,(6b)s1⊕4,n3=Mx^1,n3⊕x^4,n3,respectively. Correspondingly, D1 receives the superposition of these two copies of the network coded symbol s1⊕4,n, formulated as(7)rD1,n3=α21P2h21,ns1⊕4,n2+α31P3h31,ns1⊕4,n3+nD1,n3.In order to getx4,n, D1 first applies the combining receiving method to the superposition signal and detects s1⊕4,n as(8)s^1⊕4,n1=rD1,n3α21P2h21,n+α31P3h31,n.Then D1 demodulates s^1⊕4,n1 to get the encoded codeword as(9)x^1⊕4,n1=M-1s^1⊕4,n1.Finally, D1 decodes x^1⊕4,n1 using its local codeword x1,n to obtain x4,n as(10)x^4,n1=x^1⊕4,n1⊕x1,n.Through the PC stage and the NC stage,D1 gets the whole nth symbols x^n1=[x^1,n1,x^2,n1,x^3,n1,x^4,n1]. As for D2, D3, and D4, the communication processes are similar with D1. As described above, for each DUE, both signals from the two neighbors transmitting in the same PRB are valid signals rather than interference. Hence the purpose of exploiting interference to improve the receiving performance is realized.


## 4.3. Realization Problems

Two realization problems would be discussed in this subsection.


### 4.3.1. Synchronization

Intuitively, the proposed scheme is highly dependent on the synchronization between the 4 DUEs, which seems difficult to realize. However, the stress is relieved in cellular-controlled D2D networks. The reason is that the centralized control mode allows every DUE to be synchronized with the center node, that is, the BS. On the other hand, the synchronization offset caused by the transmission delay between DUE nodes can be negligible since a D2D communication is established only if the DUEs are close.


### 4.3.2. Assignment of Precoding Coefficients

As described in the scheme, the 4 DUEs need to be preassigned the precoding coefficients for the PC stage. This assignment can be implemented easily by the BS through its control channels with all of the DUEs during the establishment stage of the D2D communication.


## 4.3.1. Synchronization

Intuitively, the proposed scheme is highly dependent on the synchronization between the 4 DUEs, which seems difficult to realize. However, the stress is relieved in cellular-controlled D2D networks. The reason is that the centralized control mode allows every DUE to be synchronized with the center node, that is, the BS. On the other hand, the synchronization offset caused by the transmission delay between DUE nodes can be negligible since a D2D communication is established only if the DUEs are close.


## 4.3.2. Assignment of Precoding Coefficients

As described in the scheme, the 4 DUEs need to be preassigned the precoding coefficients for the PC stage. This assignment can be implemented easily by the BS through its control channels with all of the DUEs during the establishment stage of the D2D communication.


## 5. Performance Analysis

From a statistical point of view, the 4 DUEs are symmetric and equivalent. Without loss of generality, focus onD1 to analyze its SINR performance and the results can be extended to the other DUE nodes.


### 5.1. The SINR of the Proposed Scheme

The proposed scheme has different SINR in its two stages. In the PC stage, the combined received signal for the decoding ofs2,n is(11)rD1,n1+rD1,n2=2α21P2h21,ns2,n+nD1,n1+nD1,n2which corresponds to SINR of 2α21P2h21,n2. Similarly, the combined received signal for the decoding of s3,n is(12)rD1,n1-rD1,n2=2α31P3h31,ns3,n+nD1,n1-nD1,n2which corresponds to SINR of 2α31P3h31,n2. Hence, the average SINR during the PC stage can be calculated as(13)γ¯D1,nPC=α21P2h21,n2+α31P3h31,n2.In the NC stage, sinces1,n is known by D1 locally, the decoding performance of s4,n equals s1⊕4,n. View the two versions of s1⊕4,n from D2 and D3, that is, s1⊕4,n2 and s1⊕4,n3, as the same information; the combined received signal can be formulated as(14)rD1,n3=α21P2h21,n+α31P3h31,ns1⊕4,n+nD1,n3.The corresponding instant SINR which equals the SINR in the NC stage is shown as(15)γD1,nNC=α21P2h21,n+α31P3h31,n2.


### 5.2. Comparison with the Traditional Scheme

Next, we compare the SINR performance of the proposed scheme and the traditional scheme. For the whole dataxi=[xi,1,…,xi,N], according to (2), the SINR of the traditional scheme is formulated as(16)γD1T=α21P2h212α31P3h312+1.According to (13) and (15), the SINRs of the proposed scheme in the two stages are, respectively, written as(17)γ¯D1PC=α21P2h212+α31P3h312,γD1NC=α21P2h21+α31P3h312.With a simple deduction, we prove that γ¯D1PC≥γD1T. Besides, γD1NC≥γD1T is a big probability event when the distance from D3 to D1 has a magnitude equal to the distance from D2 to D1.


## 5.1. The SINR of the Proposed Scheme

The proposed scheme has different SINR in its two stages. In the PC stage, the combined received signal for the decoding ofs2,n is(11)rD1,n1+rD1,n2=2α21P2h21,ns2,n+nD1,n1+nD1,n2which corresponds to SINR of 2α21P2h21,n2. Similarly, the combined received signal for the decoding of s3,n is(12)rD1,n1-rD1,n2=2α31P3h31,ns3,n+nD1,n1-nD1,n2which corresponds to SINR of 2α31P3h31,n2. Hence, the average SINR during the PC stage can be calculated as(13)γ¯D1,nPC=α21P2h21,n2+α31P3h31,n2.In the NC stage, sinces1,n is known by D1 locally, the decoding performance of s4,n equals s1⊕4,n. View the two versions of s1⊕4,n from D2 and D3, that is, s1⊕4,n2 and s1⊕4,n3, as the same information; the combined received signal can be formulated as(14)rD1,n3=α21P2h21,n+α31P3h31,ns1⊕4,n+nD1,n3.The corresponding instant SINR which equals the SINR in the NC stage is shown as(15)γD1,nNC=α21P2h21,n+α31P3h31,n2.


## 5.2. Comparison with the Traditional Scheme

Next, we compare the SINR performance of the proposed scheme and the traditional scheme. For the whole dataxi=[xi,1,…,xi,N], according to (2), the SINR of the traditional scheme is formulated as(16)γD1T=α21P2h212α31P3h312+1.According to (13) and (15), the SINRs of the proposed scheme in the two stages are, respectively, written as(17)γ¯D1PC=α21P2h212+α31P3h312,γD1NC=α21P2h21+α31P3h312.With a simple deduction, we prove that γ¯D1PC≥γD1T. Besides, γD1NC≥γD1T is a big probability event when the distance from D3 to D1 has a magnitude equal to the distance from D2 to D1.


## 6. Simulations

### 6.1. Simulation Scenario and Schemes

Three schemes are simulated and compared in this section:(1)
NC-G Scheme: the proposed NC-based groupwise transmission scheme. Use function F· to represent the amount of used physical resources blocks. Thus, it holds that(18)FNC-G=1.(2)
OF-P scheme: the traditional pairwise transmission with orthogonal resources. Each D2D pair occupies a distinct PRB to exchange information; thus we have(19)FOF-P=2.(3)
IF-P scheme: the traditional pairwise transmission with identical resource. Two pairs use the same PRB for transmission; thus we have(20)FIF-P=1.


### 6.2. Simulation Parameters Setting

The path loss effect is characterized by the log distance path loss model [18], formulated as(21)PLdB=-20log10⁡λ4πd0+10nlog10⁡dd0,where n is the path loss index, d0 is the reference distance, λ=3×108/fc is the wavelength of the carrier waves, and PLdB represents the path loss in the unit of dB. As for the transmission within buildings with line of sight (LOS), n is set in the range of 1.6–1.8, and d0 takes value near 1 when the transmission distance is no bigger than 1 kilometer. The multipath fading effect is modeled as the Rice fading with index K.The simulation parameters are set as shown in Table3. 106 symbols for each DUE had been exchanged to get stabilized simulation results.Table 3
Simulation parameters setting.
Parameters
Values
Unit
Topology
d
B
S
1000
m
d
i
n
t
r
a
5~20
m
d
i
n
t
e
r
5~20
m
Channel modeling
n
1.6
—
d
0
1
m
K
d
B
−40~15
dB
Transmission
f
c
1
1.5
×
1
0
9
Hz
f
c
2
1.6
×
1
0
9
Hz
P
t
1
W
N
0
−70~20
dBm


### 6.3. Simulation Results

#### 6.3.1. SINR

The received SINRs are simulated to observe the receiver performance intuitively.Figure4 compares the SINR distribution functions of the three schemes in each stage (NC-G) or each phase (OF-P and IF-P). Define d=dintra,dinter as the topology parameter vector. The parameters are set as d=5,5, K=15, and N0=-40. The result shows that, within the NC-G scheme, although the signals received in stage 1 and stage 2 are distributed differently, the positions of their peaks are nearly the same. Within both the OF-P and the IF-P schemes, the signals received in phase 1 and phase 2 have the same distribution, which is better than phase 3. This is because, in phase 3, DUEs on the diagonal of the square are paired to communicate. Longer distance causes worse SINR. As for the comparison between three schemes, we observe that NC-G is the best, OF-P is inferior, and IF-P is the worst.Figure 4
SINR distribution functions in each stage/phase of the three schemes.Next, we fixd=5,5 and N0=-40 dBm and vary K from −40 dB (Rayleigh distribution) to 15 dB (Gaussian distribution). Use the SINRs in stage 1 of NC-G and phase 1 of OF-P/IF-P to represent each scheme. The results are illustrated in Figure 5. With different Rice index K, the position of the peak value in each scheme only moves a little. However, as K decreases, the SINR curve of each scheme becomes more diffuse, which implies that the variance increases.Figure 5
SINR distribution functions in stage 1 of the three schemes with differentK.Then, we fixd=5,5 and K=0 and vary N0 from −70 dBm to 70 dBm. The results are shown in Figure 6. The increase of N0 leads to a leftward shift in the SINR curve of each scheme but hardly changes the shape of each curve.Figure 6
SINR distribution functions in stage 1 of the three schemes with differentN0.


#### 6.3.2. SER

The average symbol error rate (SER) at receivers is simulated under different channel fading and topology.Whend=5,5, the cases where K=-30 dB, 0 dB, and 15 dB are simulated. The curves of SER with N0 changes are plotted in Figure 7. The result corresponding to K=15 dB performs the best since the channel fading obeys an approximate Gaussian distribution. As K=15 dB increases, the SER performance degrades severely. Besides, the performance gains brought by the NC-G also degrade. However, the NC-G scheme performs better than the other two schemes in all of these cases.Figure 7
SER curves of the three schemes with differentK.Finally, we fixedK=0 dB and changed d to observe the SER performance under different topology. The results illustrated in Figure 8 show that when the average of dintra and dinter increases, for example, changing d from 10,10 to 20,20, the SER performance degrades correspondingly. However, when the average distance is fixed and dintra/dinter decreases, for example, changing d from 10,10 to 5,15, the SER performance remains nearly unchanged.Figure 8
SER curves of the three schemes with differentd.


## 6.1. Simulation Scenario and Schemes

Three schemes are simulated and compared in this section:(1)
NC-G Scheme: the proposed NC-based groupwise transmission scheme. Use function F· to represent the amount of used physical resources blocks. Thus, it holds that(18)FNC-G=1.(2)
OF-P scheme: the traditional pairwise transmission with orthogonal resources. Each D2D pair occupies a distinct PRB to exchange information; thus we have(19)FOF-P=2.(3)
IF-P scheme: the traditional pairwise transmission with identical resource. Two pairs use the same PRB for transmission; thus we have(20)FIF-P=1.


## 6.2. Simulation Parameters Setting

The path loss effect is characterized by the log distance path loss model [18], formulated as(21)PLdB=-20log10⁡λ4πd0+10nlog10⁡dd0,where n is the path loss index, d0 is the reference distance, λ=3×108/fc is the wavelength of the carrier waves, and PLdB represents the path loss in the unit of dB. As for the transmission within buildings with line of sight (LOS), n is set in the range of 1.6–1.8, and d0 takes value near 1 when the transmission distance is no bigger than 1 kilometer. The multipath fading effect is modeled as the Rice fading with index K.The simulation parameters are set as shown in Table3. 106 symbols for each DUE had been exchanged to get stabilized simulation results.Table 3
Simulation parameters setting.
Parameters
Values
Unit
Topology
d
B
S
1000
m
d
i
n
t
r
a
5~20
m
d
i
n
t
e
r
5~20
m
Channel modeling
n
1.6
—
d
0
1
m
K
d
B
−40~15
dB
Transmission
f
c
1
1.5
×
1
0
9
Hz
f
c
2
1.6
×
1
0
9
Hz
P
t
1
W
N
0
−70~20
dBm


## 6.3. Simulation Results

### 6.3.1. SINR

The received SINRs are simulated to observe the receiver performance intuitively.Figure4 compares the SINR distribution functions of the three schemes in each stage (NC-G) or each phase (OF-P and IF-P). Define d=dintra,dinter as the topology parameter vector. The parameters are set as d=5,5, K=15, and N0=-40. The result shows that, within the NC-G scheme, although the signals received in stage 1 and stage 2 are distributed differently, the positions of their peaks are nearly the same. Within both the OF-P and the IF-P schemes, the signals received in phase 1 and phase 2 have the same distribution, which is better than phase 3. This is because, in phase 3, DUEs on the diagonal of the square are paired to communicate. Longer distance causes worse SINR. As for the comparison between three schemes, we observe that NC-G is the best, OF-P is inferior, and IF-P is the worst.Figure 4
SINR distribution functions in each stage/phase of the three schemes.Next, we fixd=5,5 and N0=-40 dBm and vary K from −40 dB (Rayleigh distribution) to 15 dB (Gaussian distribution). Use the SINRs in stage 1 of NC-G and phase 1 of OF-P/IF-P to represent each scheme. The results are illustrated in Figure 5. With different Rice index K, the position of the peak value in each scheme only moves a little. However, as K decreases, the SINR curve of each scheme becomes more diffuse, which implies that the variance increases.Figure 5
SINR distribution functions in stage 1 of the three schemes with differentK.Then, we fixd=5,5 and K=0 and vary N0 from −70 dBm to 70 dBm. The results are shown in Figure 6. The increase of N0 leads to a leftward shift in the SINR curve of each scheme but hardly changes the shape of each curve.Figure 6
SINR distribution functions in stage 1 of the three schemes with differentN0.


### 6.3.2. SER

The average symbol error rate (SER) at receivers is simulated under different channel fading and topology.Whend=5,5, the cases where K=-30 dB, 0 dB, and 15 dB are simulated. The curves of SER with N0 changes are plotted in Figure 7. The result corresponding to K=15 dB performs the best since the channel fading obeys an approximate Gaussian distribution. As K=15 dB increases, the SER performance degrades severely. Besides, the performance gains brought by the NC-G also degrade. However, the NC-G scheme performs better than the other two schemes in all of these cases.Figure 7
SER curves of the three schemes with differentK.Finally, we fixedK=0 dB and changed d to observe the SER performance under different topology. The results illustrated in Figure 8 show that when the average of dintra and dinter increases, for example, changing d from 10,10 to 20,20, the SER performance degrades correspondingly. However, when the average distance is fixed and dintra/dinter decreases, for example, changing d from 10,10 to 5,15, the SER performance remains nearly unchanged.Figure 8
SER curves of the three schemes with differentd.


## 6.3.1. SINR

The received SINRs are simulated to observe the receiver performance intuitively.Figure4 compares the SINR distribution functions of the three schemes in each stage (NC-G) or each phase (OF-P and IF-P). Define d=dintra,dinter as the topology parameter vector. The parameters are set as d=5,5, K=15, and N0=-40. The result shows that, within the NC-G scheme, although the signals received in stage 1 and stage 2 are distributed differently, the positions of their peaks are nearly the same. Within both the OF-P and the IF-P schemes, the signals received in phase 1 and phase 2 have the same distribution, which is better than phase 3. This is because, in phase 3, DUEs on the diagonal of the square are paired to communicate. Longer distance causes worse SINR. As for the comparison between three schemes, we observe that NC-G is the best, OF-P is inferior, and IF-P is the worst.Figure 4
SINR distribution functions in each stage/phase of the three schemes.Next, we fixd=5,5 and N0=-40 dBm and vary K from −40 dB (Rayleigh distribution) to 15 dB (Gaussian distribution). Use the SINRs in stage 1 of NC-G and phase 1 of OF-P/IF-P to represent each scheme. The results are illustrated in Figure 5. With different Rice index K, the position of the peak value in each scheme only moves a little. However, as K decreases, the SINR curve of each scheme becomes more diffuse, which implies that the variance increases.Figure 5
SINR distribution functions in stage 1 of the three schemes with differentK.Then, we fixd=5,5 and K=0 and vary N0 from −70 dBm to 70 dBm. The results are shown in Figure 6. The increase of N0 leads to a leftward shift in the SINR curve of each scheme but hardly changes the shape of each curve.Figure 6
SINR distribution functions in stage 1 of the three schemes with differentN0.


## 6.3.2. SER

The average symbol error rate (SER) at receivers is simulated under different channel fading and topology.Whend=5,5, the cases where K=-30 dB, 0 dB, and 15 dB are simulated. The curves of SER with N0 changes are plotted in Figure 7. The result corresponding to K=15 dB performs the best since the channel fading obeys an approximate Gaussian distribution. As K=15 dB increases, the SER performance degrades severely. Besides, the performance gains brought by the NC-G also degrade. However, the NC-G scheme performs better than the other two schemes in all of these cases.Figure 7
SER curves of the three schemes with differentK.Finally, we fixedK=0 dB and changed d to observe the SER performance under different topology. The results illustrated in Figure 8 show that when the average of dintra and dinter increases, for example, changing d from 10,10 to 20,20, the SER performance degrades correspondingly. However, when the average distance is fixed and dintra/dinter decreases, for example, changing d from 10,10 to 5,15, the SER performance remains nearly unchanged.Figure 8
SER curves of the three schemes with differentd.


## 7. Conclusion

In this paper, we focus on the user-level interference under multicasting scenarios. Rather than the traditional pairwise way of D2D communications, we propose to implement the information exchanging through a groupwise way. Through introducing the idea of network coding, the proposed scheme is able to utilize the interference as valid signals to enhance the receiving performance, instead of only managing or controlling it. Both theoretical analysis and simulation results prove that the proposed scheme achieves better SINR performance and lower resources occupation than the traditional pairwise D2D transmission schemes. Besides serving as a physical transmission scheme for multicasting services in cellular networks, we expect the proposed scheme to be applicable in other network research fields for a higher network performance.



---

*Source: 142967-2015-10-04.xml*