scroll identifier for mobile
main-content

## Weitere Artikel dieser Ausgabe durch Wischen aufrufen

01.12.2019 | Research | Ausgabe 1/2019 Open Access

# On signal processing scheme based on network coding in relay-assisted D2D systems

Zeitschrift:
EURASIP Journal on Wireless Communications and Networking > Ausgabe 1/2019
Autoren:
Bo Li, Qiuming Zhao, Ruofei Ma, Hongjuan Yang, Gongliang Liu, Weidang Lu

## 1 Introduction

People constantly send and receive messages in different ways, in which the essence is to solve the problems on signal transmission, processing, and detection [1, 2]. With the continuous improvement of communication and signal processing methods, great progress has been made in both effectiveness and reliability. However, it is envisioned that, in future networks, more and more wireless terminals will be included, and communication systems should be able to provide access interfaces for these terminals. Therefore, how to improve system capacity and channel utilization with limited resources is critical [3, 4]. The research of [5] introduces the device-to-device (D2D) communication technology under the control of the base station (BS) in the cellular network, and it demonstrates that users can directly perform signal transmission to complete the communication, whereas the BS is only responsible for allocating resources and controlling the whole communication process, which improves the resources’ usage efficiency and reduces the burden of BS [6, 7]. When the distance between the D2D users is too far to establish a direct link, an idle user can be selected as a relay node to form a relay-assisted D2D (RA-D2D) link to complete the end-to-end signal transmission in two time slots. However, the end-to-end rate and reliability of the signal will be affected due to the user mutual interference which will inevitably occur. In previous researches, the interference was mainly controlled via performing joint scheduling on resource allocation, power control, and communication mode selection at the BS [812]. In the traditional relay-assisted communication system, the relay node is responsible for store-and-forward without performing any signal processing [13]. In [14], it is proved that network coding (NC) can improve system throughput and transmission rate through arithmetic processing in relay. The early study in [1517] identified that NC can be implemented into RA-D2D signal processing to effectively eliminate interference and improve transmission rate and reliability of the system. However, the issue of relay selection and resource allocation are not considered. In [18], the RA-D2D signal processing based on NC was further improved, in which the coding and modulation were adaptively performed according to link quality. Although a scheduling scheme jointly considering resource allocation, power control, and relay selection was proposed in [19], the factors taken into account were not comprehensive. The researches mentioned above are all based on the situation of a single antenna. In [20], NC was implemented into multi-hop and multi-antenna RA-D2D signal processing, and it was proved that bringing NC into RA-D2D signal processing could achieve further improvement on the system performance and enhance security in the data transmission.
In view of the deficiencies in the existing researches, this paper will implement NC into the relay selection of RA-D2D to achieve more efficient cross-layer relay selection and resource allocation. End-to-end data rate, end-to-end transmission delay, and relay survival time will be jointly considered when NC signal processing is performed to select the optimal relay node. Hence, the overall communication process will be optimized.
The main contributions of this paper are summarized as follows:
First, we propose a session mechanism for network coding involved D2D communications, which is mainly implemented in the relay-assisted D2D communication mode. With this mechanism, the interference signal generated by the cellular users is used to perform network coding process at the relay node, thereby improving transmission efficiency and saving resources while eliminating interference.
Second, we incorporate the proposed networking coding mechanism into the relay selection process in the relay-assisted D2D communications. By jointly considering the network coding processing at the candidate relay nodes, the end-to-end data rate of the relay path, end-to-end delay of the relay path, and the remaining battery capacity of the candidate relay nodes, the new relay selection scheme is expected to provide an even better overall transmission performances. Simulation results demonstrate the better performance of our proposed scheme and reveal the impact of network coding on D2D communication systems based on optimal relay selection.
The remainder of this paper is organized as follows. In Section 2, we introduce the system model. The proposed joint scheme is presented in Section 3. Simulation results are provided in Section 4 to illustrate the performance of the proposed algorithms. We conclude this paper in Section 5.

## 2 System model

The system model in this paper is a single-cell scenario in modern cellular systems (e.g., LTE-A). Assume that there is efficient interference coordination between adjacent cells, with which, the base stations in different cells can perform power coordination and semi-persistent resource scheduling between cells via exchanging the user equipment (UE) information and resource usage information [21, 22]. In such a way, the inter-cell interference can be minimized. Hence, the inter-cell interference is omitted in this paper to emphasize the research focus. The researched single-cell scenario only includes a base station, cellular user equipments (CUEs), relay-capable UEs (RUEs), and D2D-capable UEs (DUEs), as shown in Fig. 1. In order to emphasize the research focus on the influence of network coding processing on relay selection in D2D communications, it is just assumed that there are only one pair of D2D communications users. Meanwhile, there are N CUEs and M RUEs, denoted as [C1,C2,...Cj,...CN] and [R1,R2,...Ri,...RM], respectively. The transmitter and receiver of the DUEs are denoted by S and D respectively. It is assumed that the cell is overloaded; that means resources are not idle and cannot be separately allocated to DUEs, and only CUEs’ uplink resources can be reused [23]. DUEs can communicate directly or with RA-D2D mode according to channel quality and communication requirements. For each of the two communication modes, at most, one CUE’s uplink resource can be reused. In RA-D2D communication mode, transmitter-to-relay and relay-to-receiver transmissions are finished in two time slots, and transmitter-to-relay and relay-to-receiver links reuse the same uplink resource. As a result, the CUE whose uplink channel is reused will generate interference to the relay UE and the receive DUEs. In addition, assume that all UEs in the cell are under the control of the BS, which can acquire all channel state information, control DUEs’ communication mode, select the reused resource, and optimize the relay selection.
Based on a comprehensive survey on the path loss scenarios mentioned in 3GPP releases (e.g., Release 9 [24]), a channel gain model given in [25] is adopted in analysis of the communication process, which jointly considered the path loss, slow fading, and fast fading. Such a channel gain model can ensure the universality of the proposed strategy. One can easily modify such a channel gain model to make the proposed relay selection strategy applicable in a specific propagation scenario suggested in [24]. The channel gain between transmitter a and receiver b is defined as
$$|h_{a,b}|^{2}=K_{0} \beta_{a,b}^{s} \beta_{a,b}^{f} d_{a,b}^{-\alpha}$$
(1)
where $$K_{0} d_{a,b}^{-\alpha }$$ is the path loss given in 3GPP Release 9, K0 is a constant whose value corresponds to the implemented path loss model, da,b is the distance from the transmitter to the receiver, α is is the path loss exponent, $$\beta _{a,b}^{s}$$ is slow fading obeying the logarithmic distribution, and $$\beta _{a,b}^{f}$$ is fast fading obeying the exponential distribution [26].

## 3 The proposed joint scheme

### 3.1 RA-D2D signal processing scheme based on network coding

In this paper, the specific scenario of RA-D2D signal processing based on NC is shown in Fig. 2. S and D are the two DUEs, R is a RUE, and the CUE is a cellular user whose uplink resources are reused. Note that the same CUE’s uplink channel is reused by the RA-D2D communications in the two time slots, and the CUE’s interference to RUE R and the receive DUE D during the signal transmission are taken into account. In the scheduling, when selecting the cellular uplink channel that can be used by the researched D2D link, the required signal to noise and interference ratio (SINR) of the reused uplink channel is assured. Power control strategy at the source UEs is not considered in this paper and the interference suppression is just guaranteed by selecting the optimal cellular uplink channels that can be reused.
In addition, all UEs are assumed to be with single antenna and work on half-duplex mode. The specific procedure for session establishment and communication is depicted in Fig. 3.
Let x and s denote the signal sent by the CUE to the BS and the signal from S to D respectively. We divide the NC-based RA-D2D signal processing into two phases: transmitting phase and receiving phase. In this work, linear channel coding and BPSK modulation are assumed to be used in the network coding assisted D2D communications. The block diagram for the signal processing procedure is shown in Fig. 4. As a result, the CUE whose uplink channel is reused will generate interference to the relay UE and the receive DUEs. In addition, we assume that the distance from the CUE to the DUE and the link quality meet the restriction requirements, so the signals transmitted by the CUE can be correctly detected at both the relay and the DUE D.
In the first phase, the relay R receives the signal transmitted by the CUE and S, and D receives the interference signals transmitted by the CUE. The received signals at R and D can be expressed as
$${{y}_{SR}}=\sqrt{{{P}_{S}}}{{h}_{sr}}s+\sqrt{{{P}_{C}}}{{h}_{cr}}x+{{n}_{SR}}$$
(2)
$${y_{CD}} = \sqrt {{P_{C}}} {h_{cd}}x + {n_{DD}}$$
(3)
where PC and PC are the transmit power of the DUEs and the CUE respectively. hsr, hcr, and hcd are the channel gains between the users; nSR and nDD are additive white Gaussian noises.
In the second phase, the relay node R recovers $$\hat {s}$$ and $$\hat {x}$$ by maximum likelihood detection and then performs network coding operation (XOR) and transmits the encoded signal $$\hat {x}\oplus \hat {s}$$ to the receiver D. The received signal at D is
$${{y}_{RD}}=\sqrt{{{P}_{R}}}{{h}_{rd}}\left(\hat{x}\oplus \hat{s} \right)+{{n}_{DD}}$$
(4)
Then, the encoded signal $$\hat {x}\oplus \hat {s}$$ can be obtained at the receiver D with maximum likelihood detection
$$\widehat{\left(\hat{x}\oplus \hat{s} \right)}=\arg \min\,\left\{{{\left\| {{y}_{RD}}-\sqrt{{{P}_{R}}}{{h}_{rd}}\left(\hat{x}\oplus \hat{s} \right) \right\|}^{2}} \right\}$$
(5)
Finally, the original transmission signal is recovered via NC decoding, i.e., $$\widehat {\left (\hat {x}\oplus \hat {s} \right)}\oplus \hat {x}$$.
The interference signal generated by the CUE is effectively eliminated through the network coding operation, so that the influence of the interference is effectively eliminated and the signal-to-noise ratio is improved. The instantaneous signal to interference and noise ratio (SINR) from the transmitter to the relay in the first phase is
$${{\gamma}_{SR}}=\frac{{{P}_{S}}{{\left| {{h}_{sr}} \right|}^{2}}+{{P}_{C}}{{\left| {{h}_{cr}} \right|}^{2}}}{{{N}_{0}}}$$
(6)
In the second phase, the instantaneous signal to interference and noise ratio (SINR) from the relay to the receiver is
$${{\gamma}_{RD}}=\frac{{{P}_{R}}{{\left| {{h}_{rd}} \right|}^{2}}}{{{N}_{0}}}$$
(7)
Therefore, the end-to-end reachability rate is
$${{R}_{NC}}=\min \left\{\frac{1}{2}{{\log}_{2}}\left(1+{{\gamma}_{SR}} \right),\frac{1}{2}{{\log}_{2}}\left(1+{{\gamma}_{RD}} \right) \right\}$$
(8)

### 3.2 Optimal relay selection strategy

This subsection describes the cross-layer design for the optimal relay selection, which jointly takes into account the end-to-end transmission rate, end-to-end transmission delay, and relay survival time. The end-to-end rate RNC of the system is calculated in Section 3.1. Subsequently, we will introduce how to calculate the relay survival time and end-to-end delay and discuss the optimization problem of relay selection scheme with different criteria considered [27].
a. Relay survival time
Depending on the relay user’s remaining power, obviously the longer survival time, the more information can be delivered. Therefore, the user with more remaining power is selected as the candidate relay. Let E1,E2,...Ei,...,EM denote the remaining battery capacities of the M RUEs. The survival time of RUE Ri can be obtained according to
$${{T}_{i}}={{E}_{i}}/I_{i}^{\alpha}$$
(9)
where Ii stands for the discharge current. According to the relationship among voltage, current, and power, if the discharge voltage and the corresponding power consumed are known, the discharge current can be acquired. In this paper, the discharge voltage is a predefined parameter and the total power used for data transmission at each transmit UE can be calculated according to the remaining battery capacity. α is constant to indicate the non-linear effect, and its value is around 1.3.
b. End-to-end delay
In the communication, the end-to-end delay mainly contains the queue buffer delay on the device and the retransmission delay caused by packet loss. Packet loss includes packet dropping due to limited buffer length and transmission errors due to poor communication link quality.
The average queue length of the device is assumed to be $$Q_{s}^{\left (i,j \right)}$$ in the S-R link, and the average throughput in a time slot is $$T_{s}^{\left (i,j \right)}$$. Using the algorithm in [27], the delay caused by data queuing can be calculated as
$$\nu_{s,1}^{\left(i,j \right)}=\frac{Q_{s}^{\left(i,j \right)}}{T_{s}^{\left(i,j \right)}}=\frac{Q_{s}^{\left(i,j \right)}}{{{\lambda}_{s}}\Delta T\left(1-p_{sd}^{\left(i,j \right)} \right)\left(1-p_{se}^{\left(i,j \right)} \right)}$$
(10)
where λsΔT is the number of packets arriving at the device in one time slot, λs is the arrival rate, and $$p_{sd}^{\left (i,j \right)}$$ and $$p_{se}^{\left (i,j \right)}$$ are the packet dropping rate and packet error rate, respectively.
If the successful transmission time of the data packet is $$T_{s}^{\left (i,j \right)}$$, and the retransmission time required for the failure transmission is $$t_{s,er}^{\left (i,j \right)}$$, the retransmission delay caused by packet errors can be expressed as
$$\nu_{s,2}^{\left(i,j \right)}=t_{s,er}^{\left(i,j \right)}-t_{s}^{\left(i,j \right)}$$
(11)
The sum of (10) and (11) is the delay generated by the S-R link
$$\nu_{s}^{\left(i,j \right)}=\nu_{s,1}^{\left(i,j \right)}+\nu_{s,2}^{\left(i,j \right)}$$
(12)
Similarly, the transmission delay for the R-D link can be acquired as $$\nu _{r}^{(i,j)}$$. Therefore, the end-to-end transmission delay during the communication process is $$\nu _{{}}^{\left (i,j \right)}=\nu _{s}^{\left (i,j \right)}+\nu _{r}^{\left (i,j \right)}$$.
c. Relay selection optimization
The relay selection optimization problem is discussed as follows. The end-to-end date rate-based relay selection model is
$$\underset{i,j}{\max}\,\left\{{{R}_{NC}} \right\} \qquad s.t.\left\{\begin{array}{c} i\in \left[1,2,\cdots,M \right] \\ j\in \left[1,2,\cdots,N \right] \\ {{R}_{NC}}\ge {{B}_{0}}{{\log}_{2}}\left(1+{{\gamma}_{d}} \right) \\ \end{array} \right.$$
(13)
where γd is the SINR at the receiver D. The end-to-end rate- and RUE survival time-based relay selection models are
$$\underset{i,j}{\max}\,\left\{{{T}_{i}}\times {{R}_{NC}} \right\} \qquad s.t.\left\{\begin{array}{c} i\in \left[1,2,\cdots,M \right] \\ j\in \left[1,2,\cdots,N \right] \\ {{R}_{NC}}\ge {{B}_{0}}{{\log}_{2}}\left(1+{{\gamma}_{d}} \right) \\ \end{array} \right.$$
(14)
The relay selection model that jointly considered the end-to-end transmission rate, RUE survival time, and end-to-end transmission delay is given as
$$\underset{i,j}{\max}\,\left\{\frac{{{T}_{i}}\times {{R}_{NC}}}{\nu_{{}}^{\left(i,j \right)}}\right\} \qquad s.t.\left\{\begin{array}{c} i\in \left[1,2,\cdots,M \right] \\ j\in \left[1,2,\cdots,N \right] \\ {{R}_{NC}}\ge {{B}_{0}}{{\log}_{2}}\left(1+{{\gamma}_{d}} \right) \\ \end{array} \right.$$
(15)
It is possible to transmit data at the maximum end-to-end rate over a long relay survival time while producing a short end-to-end delay with (15).

## 4 Simulation results and discussions

In this section, the performance of the joint network coding and optimal RA-D2D signal processing scheme is simulated and analyzed. The scenario is a single cell with a radius of 500 m, and the communication nodes in the cell include a BS and a pair of DUEs; the number of RUEs and CUEs is 10 and 20 respectively. The distribution of different types of UEs is shown in Fig. 5; the source DUE is assumed to be located at a distance no less than half of the cell radius from the base station which is located at the center of the cell. The destination DUE is randomly distributed on a circumference with the source DUE as its center node. All the candidate relay-capable UEs are randomly distributed within the circle area defined by the locations of source and destination DUEs. The other simulation parameters are given in Table 1.
Table 1
Simulation parameters
Parameters
Value
500 m
Path loss exponent (α)
4
Path loss constant (K0)
0.01
Noise power $$\left ({\sigma ^{2}_{N}}\right)$$
− 174 dBm/Hz
Transmit power of UEs
24 dBm
Distance between source and destination DUEs
[0,200](m)
Slow fading coefficient $$\left (\beta ^{s}_{a,b}\right)$$
Log-normal distribution with standard deviation of 8 dB
Fast fading coefficient $$\left (\beta ^{f}_{a,b}\right)$$
Exponential distribution with unit mean
In Fig. 6, the performance on the total amount of data that can be transmitted with the three relay selection schemes, i.e., relay selection based on rate, relay selection based on rate and RUE survival time, and relay selection based on rate, RUE survival time, and delay, are simulated and compared. The simulation results show that, when the distance between the source and the destination DUEs increases, the total data that can be transmitted decreases, due to the fact that the energy consumption increases along with the separation distance increasing and the increasing of path loss leads to the decreasing of the data transmission rate. The vertical comparison shows that the relay selection scheme only based on data rate corresponds to the worst performance on total amount of data that can be transmitted. The reason is that, much more energy is consumed to achieve the maximum transmission rate, which leads to a great decrease of the relay UE’s survival time. The scheme that jointly considers end-to-end rate and relay survival time enables transmission at the fastest rate with the most remaining power, so it corresponds to the best performance on the total amount of data that can be transmitted. For the scheme that jointly considers end-to-end transmission rate, RUE’s survival time, and end-to-end transmission delay, its performance on total data amount is slightly worse than the scheme that jointly considers only the end-to-end data rate and the RUEs’ survival time. The reason is that although the delay caused by the transmission loss is taken into account, the impact can be found to be small. When comparing the results with and without NC for the same relay selection scheme, it shows that no matter which relay selection method is adopted, the total amount of data that can be transmitted under the situation with NC is significantly higher than that under the situation without NC. As NC is performed, the curves for the relay selection schemes based on rate, delay, and RUE survival time and the relay selection scheme based on rate and RUE survival time are almost coincident. Because the possible interference has been effectively eliminated via NC processing, and the reachable data rate is improved while the transmission delay is reduced.
The performance on average end-to-end transmission delay under the three relay selection schemes are further simulated and compared, as shown in Fig. 7. With the distance between the source and destination DUEs is increasing, the delays corresponding to the three relay selection schemes are all increasing. This is reasonable, because increasing of the separation distance leads to the increasing of path loss, which would make the packet loss and retransmission even worse. In addition, the low transmission rate makes the queuing time increasing. The vertical comparison for the three relay selection schemes shows us that the rate-based scheme corresponds to a minimum end-to-end transmission delay under the same simulation settings, because the maximum transmission rate naturally takes the least transmission time. The scheme based on rate and RUE survival time has the maximum end-to-end transmission delay, while the scheme based on rate, delay, and RUE survival time corresponds to a delay performance between the former two schemes.
Jointly reviewing Figs. 6 and 7, it is seen that the scheme based on rate and RUE survival time is similar to the scheme based on rate, delay, and RUE survival time in terms of the performance on total amount of data that can be transmitted, whereas the latter is significantly better than the former in terms of the delay performance. Therefore, the relay selection scheme jointly considering rate, delay, and RUE survival time corresponds to the best overall transmission performance. Furthermore, it can be found that, for each of the three relay selection schemes, implementing NC processing can greatly reduce the end-to-end transmission delay, because the interference is effectively eliminated via the network coding operation. Since NC utilize the interference generated by the CUEs whose uplink channels are reused, it can reduce the retransmission time caused by packet errors and end-to-end time delay. In addition, it will not have a big impact on the time delay caused by increasing of the distance between the source and destination DUEs.
Figures 8 and 9 show the performance on total data amount and average end-to-end transmission delay under the aforementioned two relay selection schemes, i.e., the scheme based on rate and RUE survival time and the scheme based on rate, delay, and RUE survival time, with different channel bandwidths. The influence of the bandwidth on the transmission performance is obvious in Figs. 8 and 9. No matter which relay selection scheme is implemented, with the broadening of the channel bandwidth, the performance on the total amount of data that can be transmitted and the end-to-end transmission delay becomes better. The wider the channel bandwidth, the higher the end-to-end data transmission rate. It further reduces the times consumed on data queuing, and thus decreases the transmission delay and more transmission can be finished within the relay UE’s survival time. In such situations, the influence of taking transmission delay into account on the relay selection is reduces. Accordingly, the performance difference generated by the two different relay selection strategies becomes smaller.

## 5 Conclusions

In this paper, we designed a relay-assisted D2D signal processing scheme based on network coding. Different from the traditional store-and-forward processing, the network coding operation for the desired and interference signal at the selected relay node effectively eliminates the interference caused by resource reusing and expands the communication range of the D2D communications. Bringing network coding into relay assisted D2D signal processing further explores the benefits of D2D communications underlaying cellular systems. The security for the transmitted information in the relay assisted D2D link can also be improved with the help of network coding. In the proposed scheme, the candidate relay-capable UE that can achieve the optimal overall performance on end-to-end data rate, end-to-end transmission delay, and link survival time is selected as the final relay node. Simulation results indicated that the relay selection scheme jointly considering end-to-end data rate, transmission delay, and link survival time corresponds to the best overall performance on total amount of data that can be transmitted and end-to-end transmission delay. Moreover, for a specific relay selection scheme, the overall transmission performance with network coding is significantly better than that without network coding when the optimal relay UE is selected. Hence, the effectiveness of including network coding into the relay selection process in the relay assisted D2D communications is validated.

## Acknowledgements

This work is supported in part by National Natural Science Foundation of China (No. 61801144, No. 61671184, and No. 61871348), Natural Science Foundation of Shandong Province (No. ZR2018PF001 and No. ZR2014FP016), the Fundamental Research Funds for the Central Universities (No. HIT. NSRIF. 201720 and 2016100) and the Scientific Research Foundation of Harbin Institute of Technology at Weihai (No. HIT(WH)201409 and 201410).

### Funding

National Natural Science Foundation of China (Grant No. 61801144, No. 61671184, and No. 61871348) are supporting the data acquisition devices and materials; Natural Science Foundation of Shandong Province (Grant No. ZR2018PF001 and No. ZR2014FP016) are supporting the simulations; and the Fundamental Research Funds for the Central Universities (Grant No. HIT.NSRIF.2016100 and 201720) and the Scientific Research Foundation of Harbin Institute of Technology at Weihai (No. HIT(WH)201409 and 201410) are supporting the data analyses.

### Availability of data and materials

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

### Competing interests

The authors declare that they have no competing interests.

### Publisher’s Note

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

## Unsere Produktempfehlungen

### Premium-Abo der Gesellschaft für Informatik

Sie erhalten uneingeschränkten Vollzugriff auf alle acht Fachgebiete von Springer Professional und damit auf über 45.000 Fachbücher und ca. 300 Fachzeitschriften.

### Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

• über 58.000 Bücher
• über 300 Zeitschriften

aus folgenden Fachgebieten:

• Bauwesen + Immobilien
• Finance + Banking
• Management + Führung
• Marketing + Vertrieb

Testen Sie jetzt 30 Tage kostenlos.

### Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

• über 50.000 Bücher
• über 380 Zeitschriften

aus folgenden Fachgebieten:

• Automobil + Motoren
• Bauwesen + Immobilien
• Elektrotechnik + Elektronik
• Energie + Umwelt
• Maschinenbau + Werkstoffe​​​​​​​

Testen Sie jetzt 30 Tage kostenlos.

Weitere Produktempfehlungen anzeigen
Literatur
Über diesen Artikel

Zur Ausgabe