Next Article in Journal
Gas Measurement Using Static Fourier Transform Infrared Spectrometers
Next Article in Special Issue
Wireless Monitoring of Induction Machine Rotor Physical Variables
Previous Article in Journal
HDOMO: Smart Sensor Integration for an Active and Independent Longevity of the Elderly
Previous Article in Special Issue
Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Wireless Energy Harvesting Two-Way Relay Networks with Hardware Impairments

1
Chongqing Key Lab of Mobile Communications Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2
School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR 97331, USA
*
Author to whom correspondence should be addressed.
Sensors 2017, 17(11), 2604; https://doi.org/10.3390/s17112604
Submission received: 15 October 2017 / Revised: 6 November 2017 / Accepted: 7 November 2017 / Published: 13 November 2017
(This article belongs to the Special Issue Wireless Rechargeable Sensor Networks)

Abstract

:
This paper considers a wireless energy harvesting two-way relay (TWR) network where the relay has energy-harvesting abilities and the effects of practical hardware impairments are taken into consideration. In particular, power splitting (PS) receiver is adopted at relay to harvests the power it needs for relaying the information between the source nodes from the signals transmitted by the source nodes, and hardware impairments is assumed suffered by each node. We analyze the effect of hardware impairments on both decode-and-forward (DF) relaying and amplify-and-forward (AF) relaying networks. By utilizing the obtained new expressions of signal-to-noise-plus-distortion ratios, the exact analytical expressions of the achievable sum rate and ergodic capacities for both DF and AF relaying protocols are derived. Additionally, the optimal power splitting (OPS) ratio that maximizes the instantaneous achievable sum rate is formulated and solved for both protocols. The performances of DF and AF protocols are evaluated via numerical results, which also show the effects of various network parameters on the system performance and on the OPS ratio design.

1. Introduction

Energy harvesting (EH) has recently attracted enormous attention from researchers as a promising supplemental technology in prolonging the lifetime of a wireless network, especially in wireless sensor networks [1], cognitive radio networks [2], etc. With energy harvesting technique, the energy can be captured through solar power [3], strongly coupled magnetic resonances [4] or radio-frequency (RF) signals in ambient environments [5]. Since RF signals carry energy as well as information, the integration of RF energy harvesting capabilities into wireless communication systems provides a possibility of simultaneous wireless information and power transfer (SWIPT) [6]. The pioneer work of initial work on SWIPT is discussed in [7], which considers an ideal receiver design that is able to simultaneously observe and extract power from the same received signal. However, as discussed in [8], this such an ideal receiver does not hold exist in practice. For practical implementation, the study in [8] also introduces two realizable receiver architectures design: time switching (TS) and power splitting (PS).
Cooperative relay network [9,10] is a common application scenario of SWIPT. In relay networks, the relay expenditures additional resources for relaying, which might result a decreased lifetime for energy-constrained relay networks. A handful of research efforts have explored SWIPT for one-way relay (OWR) and two-way relay (TWR) networks. In [11], Nasir et al. analyze TS and PS protocols for one-way amplify-and-forward (AF) relay networks, and derive analytical expressions for the outage probability and the ergodic capacity. Yin et al. [12] study the optimal power splitting design to maximize the cooperative capacity of OWR networks with AF and decode-and-forward (DF) protocols. The work in [13] investigates the impact of SWIPT on the performance of one source-destination, multiple-relay cooperative networks and derive a closed-form expression of the outage probability. With relay selection, the a closed-form expression of the outage probability has been derived and verified over independent Nakagami-m fading channels in [14] for a dual-hop wireless powered cooperative system. For two-way relaying AF networks with the PS protocol, Chen et al. [15] analytically derive the exact expressions, tight upper and lower bounds on the outage probability and the ergodic capacity. In [16], resource allocation of the PS and time phases ratios for the PS-based SWIPT and that of the TS and time phases ratios for the TS-based SWIPT are studied to minimize the system outage probability in TWR networks.
The above research works contribute in the area of assuming that the transceiver and receiver hardware of all nodes is perfect. In practice, however, the hardware of a wireless node undergo several kinds of impairments such as phase noise, I/Q imbalance, high power amplifier non-linearities, etc. [17,18]. There are several works have investigated the effect of hardware impairments (HI) in relay networks, which are illustrated next. In [19], the authors quantify the impact of HI on dual-hop AF and DF relaying networks and derive the outage probability subject to Nakagami-m fading. Matthaiou et al. [20] analyze the impact of HI at the relay in an AF-TWR configuration, and deduce a closed-form expression for the outage probability (OP) and symbol-error rates (SERs). In [21], the impact of HI on spectrum underlay cognitive multiple-relay networks is studied. You et al. [22] study the joint source/relay precoding design for a practical MIMO two-way AF relaying system that suffers from HI. Recently, there emerges a few recent works concentrating on analyzing analyzed the impact of HI on energy harvesting enabled relay networks. Do et al. [23] consider the joint impacts of EH and HI on multiple-relay one-way networks, and analyze the OP under two relay selection protocols. In [24], the outage probability and throughput are investigated for cognitive two-way DF relay networks, under the effects of realistic relay transceiver structures are taken into consideration. It is evident that the research work in [23,24] provides contributions on protocol design and outage performance analysis for energy harvesting DF relay networks with HI. However, Do, et al. [23] analyzed OWR networks, and ignores the multiple-access constraint in TWR with TS and PS protocols in [24]. Meanwhile, the ergodic capacity and optimal energy harvesting design under considering the impact of hardware impairments is lack of exploration.
In this paper, we focus on a two-way passive-relay network in which a power-splitting receiver is adopted at the relay to replenish energy under the consideration of hardware impairments at each node. The exact analytical expressions of the achievable sum rate and ergodic capacities in integral closed-form are derived for both DF and AF protocols and address the optimization problems allocated to energy harvesting and for both protocols to maximize the achievable sumrate, respectively. The main contributions of this paper can be described in more details as follows.
  • We have presented a self-powered TWR energy harvesting and signal transmission models for both DF and AF protocols suffered by hardware impairments considered at all nodes.
  • We obtained the new signal-to-noise-plus-distortion ratio (SNDR) expressions, and derived the exact analytical expressions of the achievable sum rate and ergodic capacities in integral closed-form for both DF and AF protocols respectively.
  • In order to obtain more engineering insights, we formulate and solve the optimal power splitting (OPS) ratio that maximizes the instantaneous achievable sum rate for both DF and AF protocols.
  • Simulation and numerical results are presented to verify our derivation and to assess the effects of various parameter settings on system performance. The achieved sum rate with the OPS design are compared that with the equal power splitting (EPS) design, and the performance of DF and AF protocols are also compared and discussed.
The rest of this paper is organized as follows. In Section 2, we describes the system and signal models, and presents the new expressions of SNDRs and the instantaneous achievable sum rate expressions. The derivation of ergodic capacities of both DF and AF protocols are presented in Section 3. Section 4 formulates and develops solutions of OPS ratio for DF and AF protocols. Section 5 validates the analytical results and assesses the effects of various network parameter settings on the performance and optimal solutions via numerical results, followed by concluding remarks in Section 6.

2. System and Signal Model

Consider a typical half-duplex two-way relay network that consists of three nodes: two source nodes S 1 and S 2 with continuously their power sources, and an energy harvesting relay node R, which harvests the energy it needs from the RF signals transmitted by the two source nodes. It is assumed that there are no direct links between the two source nodes due to deep shadowing or blockage; thus information exchange between them only relies on the relay. A PS receiver architecture is employed at the relay as an energy harvester, and hardware impairments that result in distortion noises suffered by all nodes are modeled as shown in Figure 1a.

2.1. TWR EH and Hardware-Impairment-Distortion Model

The network employs a two-step multiple access broadcast transmission and assumes two common relaying protocols, decode-and-forward (DF) protocol and amplify-and-forward (AF). In this configuration, each round of transmission stage consist of two phases: multiple access (MA) phase and broadcast (BC) phase. In the MA phase, the relay R harvests energy and collects receives data from the wireless signals transmitted by both source nodes simultaneously; in the BC phase, the relay processing the collected data it received through the DF protocol or the AF protocol, and then broadcasts the processed information x R with the harvested energy to both source nodes. Note that the power needed for information processing and for powering the relay hardware is ignored in the model. This kind of assumption has been applied in a lot of references, such as [11]).
The power splitting energy harvesting protocol is considered in this paper, in which the receiver architecture of the relay consists of a power splitter and an information decoder (ID) for the DF protocol is adopted, or an information amplifier (IA) for the AF protocol is adopted. The power splitter divides the received signal (transmitted by the source nodes) into two portions: one portion ρ ( 0 ρ 1 ) is used for EH and the other portion ( 1 ρ ) for information processing.
Hardware impairments are considered both the transmitter and receiver of each node. Similar to [19,23], we model the received signal in the presence of hardware impairments for an end-to-end transmission as
y = h P ( x + τ t x ) + τ r x + n
where τ t x CN ( 0 , κ t x 2 ) and τ r x CN ( 0 , κ r x 2 P rec ) are the aggregate distortiona affecting noise caused by HI at the transmitter and receiver, respectively, κ t x and κ r x characterize the levels of impairments of the transmitter and receiver hardware, respectively, CN ( · ) stands for complex circularly symmetric Gaussian distributions, P rec = | h | 2 P is power of the received signal expressed in (1), h is the channel coefficient and n is the additive white Gaussian noise. For simplicity of analysis, in the following discussion, we assume all nodes have the same structure so that the level of HI are the same, i.e., κ t x , i = κ t x , j = κ 1 , κ r x , i = κ r x , j = κ 2 , ( i , j = 1 , 2 , r represent source S 1 , source S 2 and relay R respectively).

2.2. Information Transmission in TWR

Information transmission in this paper consist of two phase, MA phase and BC phase. Let T indicate the duration of one round of transmission, from which half of the time, T / 2 , is used for MA phase, and the remaining half, T / 2 , is used for BC phase, which is shown in Figure 1b. In the MA phase, source nodes S 1 and S 2 transmit the information simultaneously.
With hardware impairments distortion mingled, the received signal at the relay can be written as
y R = h 1 P 1 ( x 1 + τ t x , 1 ) + h 2 P 2 ( x 2 + τ t x , 2 ) + τ r x , r + n r
where τ t x , i CN ( 0 , κ 1 2 ) , i = 1 , 2 , is the HI caused by the transmitter of S i , τ r x , r CN ( 0 , κ 2 2 ( | h 1 | 2 P 1 + | h 2 | 2 P 2 ) ) is the HI caused by the receiver of R, h i denotes the channel coefficient between S i and R, n r = n a , r + n b , r , n r CN 0 , σ r 2 is the additive white noise generated at the relay. And n a , r CN 0 , σ a 2 is the noise generated at the receiver antenna, and n b , r CN 0 , σ b 2 is the noise generated in the down-conversion process of the received signal to baseband [11]. Since in practice the power of the noise generated at the antenna ( σ a 2 ) is generally much smaller than the noise power introduced by the receiver chain ( σ b 2 ), for simplicity, we neglect the noise term n a , r and adopt n r = n b , r in the following analysis.
Next, the relay then splits the received signal into two portions: ρ y R is direct to the energy harvester for EH, 1 ρ y R is direct to the information processing (IP) circuit for information decoding (ID), if the relay works in DF protocol or information amplify (IA) if the relay works in AF protocol. Note that the distortion noises generated at the transmitter could contribute as a source of energy harvesting, while the distortion noises generated at the receiver and the noise n b , r does not contribute to energy harvesting, since the power splitting process is done before the down-conversion process (the majority of the HI distortion noises of receiver is assumed to be caused after the down-conversion process).
Thus, we can parameterize the acquired energy at the relay node as
E = η ρ ( P 1 | h 1 | 2 + P 2 | h 2 | 2 + κ 1 2 ( P 1 | h 1 | 2 + P 2 | h 2 | 2 ) + σ r 2 ) T / 2
where 0 η 1 is the energy-conversion coefficient. The level of hardware impairments in the transmitter and receiver, i.e., κ 1 and κ 2 , are required within the region κ i , i = { 1 , 2 } [ 0.08 , 0.175 ] in 3GPP LTE [25]. Thus, (3) can be approximated as
E = η ρ ( P 1 | h 1 | 2 + P 2 | h 2 | 2 + σ r 2 ) T / 2
And the signal delivered to the IP circuit can be expressed as
y I P = 1 ρ ( h 1 P 1 x 1 + h 2 P 2 x 2 ) + 1 ρ ( h 1 P 1 τ t x , 1 + h 2 P 2 τ t x , 2 ) + τ r x , r + n r
Assume that perfect channel state information is available for all nodes. With different relaying protocol, the received information y I P will undergo different process which is described in the following and simply depict in Figure 1a. We describe the different process in the next.
Decode-and-Forward Protocol: When applying the DF protocol, the relay first decodes y I P to generate the messages x 1 and x 2 , then applies a network coding function to construct the transmitted signal as x R = x 1 x 2 , and finally broadcasts it to both source nodes with the harvested energy.
Amplify-and-Forward Protocol: When applying the AF protocol, the relay utilize an amplifier factor G to directly amplify y I P as x R = G · y I P without any decoding and then transfer the amplified signal to both source nodes with the harvested energy.
After information processing, the relay exhausts the harvested energy to forward the processed information to both source nodes. With the consideration of channel reciprocal, the received signals at the source node S i , i = 1 , 2 , is given by
y S i = h i P R ( x R + τ t x , r ) + τ r x , i + n i = h i P R x R + h i P R τ t x , r + τ r x , i + n i
where P R is the relay’s transmit power, which is calculated as P R = 2 E / T , τ t x , r CN ( 0 , κ 1 2 ) , i = 1 , 2 is the HI caused by the transmitter of R, and τ r x , i CN ( 0 , κ 2 2 | h i | 2 P R ) are the HI caused by the receiver of S i , n i CN 0 , σ i 2 , i = 1 , 2 , is the noise generated at source S i . And
x R = x 1 x 2 , for DF protocol G · y I P , for AF protocol
where
G = [ ( ( 1 ρ ) ( 1 + κ 1 2 ) + κ 2 2 ) ( | h 1 | 2 P 1 + | h 2 | 2 P ) + σ r 2 ] 1 2 = [ ( ρ ¯ + κ 2 ρ κ 1 2 ) ( | h 1 | 2 P 1 + | h 2 | 2 P ) + σ r 2 ] 1 2
where ρ ¯ = 1 ρ , κ 2 = κ 1 2 + κ 2 2 .
Since the signal power is usually much greater than the noise power, σ r 2 in (4) and (8) will be omitted in the following analysis.

2.3. Instantaneous Achievable Sum Rate: DF Relaying

Referring to [26,27], we obtain the capacity region of the MA phase based on (5) as
C MA ( P 1 , P 2 , h 1 , h 2 ) = { ( R 1 , R 2 ) | R 1 C Y 1 R , R 2 C Y 2 R , R 1 + R 2 C Y MA } ,
where C ( x ) = 1 2 log 2 ( 1 + x ) , Y i R , i = { 1 , 2 } , are the end-to-end SNDRs from source node S i to relay R, Y MA is the multiple access signal-to-noise-plus-distortion ratio (SNDR), which are presented as follows
Y 1 R = ( 1 ρ ) γ 1 ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ 1 + 1
Y 2 R = ( 1 ρ ) γ 2 ( κ 2 2 ( 1 ρ ) + κ 2 2 ) γ 2 + 1
Y MA = ( 1 ρ ) ( γ 1 + γ 2 ) ( κ 1 2 ( 1 ρ ) + κ 2 2 ) ( γ 1 + γ 2 ) + 1
where γ 1 = | h 1 | 2 P 1 σ r 2 , γ 2 = | h 2 | 2 P 2 σ r 2 .
With substituting (4) and (7) into (6), we can derive the capacity region of the BC phase as follows referring to [26,27].
C BC ( P 1 , P 2 , h 1 , h 2 ) = ( R 1 , R 2 ) | R 1 C Y R 2 , R 2 C Y R 1
where Y R i , i = { 1 , 2 } , are the end-to-end SNDRs from relay R to source node S i written as
Y R 2 = η ρ γ 2 ( γ 1 + γ 2 ) κ 2 η ρ γ 2 ( γ 1 + γ 2 ) + V 2
Y R 1 = η ρ γ 1 ( γ 1 + γ 2 ) κ 2 η ρ γ 1 ( γ 1 + γ 2 ) + V 1
and V 1 = P 1 σ 1 2 , V 2 = P 2 σ 2 2 . For the noise components in the source and relay nodes, it is reasonable to assume σ 1 2 = σ 2 2 = σ r 2 = σ 2 , which will be adopted in the following derivation.
The capacity region of a two-way relay network is constrained by both MA and BC transmissions, therefore, the capacity region of this network exploiting the DF protocol can be presented by
R = C MA ( P 1 , P 2 , h 1 , h 2 ) C BC ( P R , h 1 , h 2 ) = { ( R 1 , R 2 ) | , R 1 + R 2 R MA , 0 R 1 I 1 , 0 R 2 I 2 } ,
where I 1 = min C Y 1 R , C Y R 2 , I 2 = min C Y 2 R , C Y R 1 , and R MA = C Y MA .
The total achievable sum rate of the network with the DF protocol is expressed as
R sum DF = R 1 + R 2 = min I 1 + I 2 , R MA .
From (10) and (12), note that under the impact of hardware impairments, a continuous increase of the transmit power does not lead to a continuous increase of SNDR and achievable rate performance for DF-TWR scheme.

2.4. Instantaneous Achievable Sum Rate: AF Relaying

Since with the AF protocol directly amplify the received original data, its achievable sum rate is dependent on the end-to-end SNDR. By substituting Equations (5) and (8) into Equation (6), the received signal at S i is rewritten as
y S i = h i P R G · y I P + h i P R τ + n i = h i h i ¯ ( 1 ρ ) P i P R G x i self - interference signal + h i ¯ h i ( 1 ρ ) P i ¯ P R G x i ¯ required signal + h i P R G [ ( h 1 P 1 + h 2 P 2 ) τ t x + τ r x , r ] + h i P R τ impairments distortion noise + h i P R G n r + n i AWGN ,
where i , i ¯ { 1 , 2 } and i i ¯ , τ t x CN ( 0 , κ 1 2 ) , τ CN ( 0 , κ 2 ) , and κ 2 = κ 1 2 + κ 2 2 .
With the perfect knowledge of channel gains and assuming channel reciprocity, S i can remove the self-interference signal from y S i through self-cancellation process. Therefore, we can compute some mathematic manipulations, the SNDR at each node is expressed as follows.
Y 1 = Ξ 1 γ 1 γ 2 Ξ 2 γ 1 ( γ 1 + γ 2 ) + η ρ γ 1 + Ξ 3 V 1
for S 1 (i.e., SNR received at S 1 transmitted by S 2 ) and
Y 2 = Ξ 1 γ 1 γ 2 Ξ 2 γ 2 ( γ 1 + γ 2 ) + η ρ γ 2 + Ξ 3 V 2
for S 2 (i.e., SNR received at S 2 transmitted by S 1 ), where Ξ 1 = η ρ ( 1 ρ ) , Ξ 2 = η ρ [ ( κ 2 ρ κ 1 2 ) ( 1 + κ 2 ) + κ 2 ( 1 ρ ) ] , Ξ 3 = ρ ¯ + κ 2 ρ κ 1 2 .
Accordingly, the data rate at S i , i = 1 , 2 , is given by R i = C ( Y i ) , where C ( x ) = 1 2 log 2 ( 1 + x ) . Furthermore, the total achievable sum rate of the network with the AF protocol can be expressed as
R sum AF = R 1 + R 2 = C ( Y 1 ) + C ( Y 2 ) .
From Equations (16) and (17), note that under the impact of hardware impairments, a continuous increase of the transmit power does not lead to a continuous increase of SNDR and achievable rate performance for AF-TWR scheme as well.

3. Ergodic Capacities Analysis

This section provides the derivation of both DF and AF protocols. The capacity expressions will reveal the effects of hardware impairments on EH-TWR. The channel gain are set to be h i = g i / d i m , where the magnitude of g i is modeled as independent but non-identically distribute Rayleigh random variables with variance λ i , d i is the distance between S i and R, and m is pass loss exponent.
Two lemmas are presented to help the following derivations of ergodic capacities.
Lemma 1.
Since g i obeys Rayleigh distribute, γ i = h i P i σ 2 = g i V i d i m also obeys Rayleigh distribute as well. The probability distribution function (PDF) of γ i is presented as
f γ i ( γ ) = A i e A i γ , for γ > 0
where A i = d i m λ i V i , V i = P i σ 2 .
Proof. 
The proof is straightforward, which is omitted here. ☐
Lemma 2.
Let Y be an arbitrary variable. Then
C = E { C ( Y ) } = 1 2 ln 2 0 + 1 F Y ( t ) 1 + t d t
where C ( Y ) = 1 2 log 2 ( 1 + Y ) , F Y ( · ) is the cumulative distribution function (CDF) of Y.
Proof. 
With C ( Y ) = 1 2 log 2 ( 1 + Y ) , E { C ( Y ) } can be obtained by E { C ( Y ) } = 1 2 0 log 2 ( 1 + t ) f Y ( t ) d t , Then utilizing partial integration, which leads to (20) by using the integration by parts. ☐

3.1. Ergodic Capacity of DF Relaying

In order to determine the ergodic capacity of the DF protocol for such an EH-TWR networks, we need to evaluate the ergodic capacity of the source-to-relay link C i r , the relay-to-destination link C r i , and the multiple-access constraint capacity C mac . Based on Lemma 2, it is non-trivial to obtain the CDFs of each SNDRs: F Y i R , F Y R i , and F Y MA first.
Theorem 1.
Denote X = γ 1 , Y = γ 2 , the CDFs of Y i R , Y R i , and Y MA is given by
F Y i R ( t ) = 1 e t A i ( 1 ρ ) t ( ( 1 ρ ) κ 1 2 + t κ 2 2 , 0 < t < 1 ρ ( 1 ρ ) κ 1 2 + κ 2 2
F Y R i ( t ) = 1 e A i t V i ( 1 t κ 2 ) η ρ A i ¯ ζ i , 0 < t < 1 κ 2
For F Y MA ( t ) , there are two cases based on the relative values of A 1 and A 2 . When A 1 = A 2 , 0 < t < 1 ρ ( 1 ρ ) κ 1 2 + κ 2 2
F Y MA ( t ) = 1 e t A 2 ρ ¯ t ( κ 2 ρ κ 1 2 ) t A 2 ρ ¯ t ( κ 2 ρ κ 1 2 ) e t A 1 ρ ¯ t ( κ 2 ρ κ 1 2 ) .
When A 1 A 2 , 0 < t < 1 ρ ( 1 ρ ) κ 1 2 + κ 2 2
F Y MA ( t ) = 1 + A 1 A 2 A 1 e t A 2 ρ ¯ t ( κ 2 ρ κ 1 2 ) A 2 A 2 A 1 e t A 1 ρ ¯ t ( κ 2 ρ κ 1 2 )
where
ζ i = 0 t V i ( 1 t κ 2 ) η ρ e ( A 1 A 2 ) x + t A i ¯ V i ( 1 t κ 2 ) η ρ · 1 x d x
and i , i ¯ { 1 , 2 } , i i ¯ , ρ ¯ = 1 ρ .
Proof. 
The proof is given in Appendix A. ☐
With the derived CDFs: F Y i R , F Y R i , and F Y MA , we can further derive their ergodic capacities as shown in the following Theorem 2 based on Lemma 2.
Theorem 2.
The ergodic capacities C i R = E { C ( Y i R ) } , C R i = E { C ( Y R i ) } , C MA = E { R MA } can be calculated as
C i R = 1 2 ln 2 J 2 1 + u e A i ρ ¯ + κ 2 ρ κ 1 2 E 1 A i ρ ¯ + κ 2 ρ κ 1 2 + J 1 e A i κ 2 ρ κ 1 2 E 1 A i κ 2 ρ κ 1 2
C R i = 1 2 ln 2 2 J 3 κ 2 + 1 c i Λ i ( κ 2 + 1 ) cos Λ i ( κ 2 + 1 ) + s i Λ i ( κ 2 + 1 ) sin Λ i ( κ 2 + 1 ) 2 J 1 c i Λ i κ 2 cos Λ i κ 2 + s i Λ i κ 2 sin Λ i κ 2 + 0 J 1 A i 1 + z + J 3 A i κ 2 + ( κ 2 + 1 ) z ζ ^ i d z
For C MA , it has are two cases determined by the size of A 1 , A 2 . And for A 1 = A 2 , C MA is expressed as
C MA = 1 2 ln 2 J 1 A 2 κ 2 ρ κ 1 2 κ 2 ρ κ 1 2 A 1 e A 1 κ 2 ρ κ 1 2 E 1 A 1 κ 2 ρ κ 1 2 + ( 1 ρ ) J 2 A 2 κ 2 ρ κ 1 2 1 A 1 e A 1 ( 1 ρ ) + κ 2 ρ κ 1 2 ( 1 ρ ) + κ 2 ρ κ 1 2 E 1 A 1 ( 1 ρ ) + κ 2 ρ κ 1 2 + J 2 1 + δ 1 e A 2 ( 1 ρ ) + κ 2 ρ κ 1 2 E 1 A 2 ( 1 ρ ) + κ 2 ρ κ 1 2 + J 1 e A 2 κ 2 ρ κ 1 2 E 1 A 2 κ 2 ρ κ 1 2 .
and for A 1 A 2 , C MA is expressed as
C MA = ( A 2 A 1 ) 1 2 ln 2 J 2 A 1 1 + δ 1 e A 2 ρ ¯ + κ 2 ρ κ 1 2 E 1 A 2 ρ ¯ + κ 2 ρ κ 1 2 + J 2 A 2 1 + δ 1 e A 1 ρ ¯ + κ 2 ρ κ 1 2 E 1 A 1 ρ ¯ + κ 2 ρ κ 1 2 + J 1 A 2 e A 1 κ 2 ρ κ 1 2 E 1 A 1 κ 2 ρ κ 1 2 + J 1 A 1 e A 2 κ 2 ρ κ 1 2 E 1 A 2 κ 2 ρ κ 1 2
where
J 1 = 1
J 2 = 1 + κ 2
J 3 = 1 + u , u = κ 1 2 + κ 2 2 1 ρ
and
ζ ^ i = 0 z V i κ 2 η ρ e ( A 1 A 2 ) x + z A i ¯ V i κ 2 η ρ · 1 x d x
E 1 ( z ) = z e z z d z
ci ( z ) = z cos z z d z , s i ( z ) = z sin z z d z
Λ i = A i 2 V i η ρ .
Proof. 
The proof is given in Appendix B. ☐
Using the obtained ergodic capacities of each link, the total ergodic capacity can be obtained by
C e DF = min E { I 1 } + E { I 2 } , E { R MA } ,
where E { I 1 } = min ( E { C ( Y 1 R ) } , E { C ( Y R 2 ) } ) , E { I 2 } = min ( E { C ( Y 2 R ) } , E { C ( Y R 1 ) } ) .

3.2. Capacity of AF Relaying

For the AF protocol, the total ergodic capacity can be given by
C e AF = E { C ( Y 1 ) } + E { C ( Y 2 ) }
The CDFs of Y 1 and Y 2 is presented as following Theorem 3.
Theorem 3.
With the define of X = γ 1 and Y = γ 2 . F Y i ( t ) is obtained as
F Y i ( t ) = 1 A i e t A i ¯ η ρ ( Ξ 1 t Ξ 2 ) β i χ i K 1 ( β i χ i ) , t < Ξ 1 Ξ 2
where
β i = 4 A i ¯ Ξ 3 V i t Ξ 1 t Ξ 2 χ i = A i + t Ξ 2 A i ¯ Ξ 1 t Ξ 2
and K 1 ( · ) is the first-order modified Bessel function of the second kind [28].
Proof. 
The CDF of Y 1 for the AF protocol is derived as follows. ☐
F Y 1 ( t ) = Pr Y 1 < t = Pr Ξ 1 γ 1 γ 2 Ξ 2 γ 1 ( γ 1 + γ 2 ) + η ρ γ 1 + Ξ 3 V 1 < t = Pr Ξ 1 X Y < t ( Ξ 2 X ( X + Y ) + η ρ X + Ξ 3 V 1 ) = Pr ( Ξ 1 t Ξ 2 ) X Y < t ( Ξ 2 X 2 + η ρ X + Ξ 3 V 1 )
Thus, when t > Ξ 1 Ξ 2 , F Y 1 ( t ) = 1 , and when t < Ξ 1 Ξ 2
F Y 1 ( t ) = Pr Y < t Ξ 2 Ξ 1 t Ξ 2 X + t η ρ ( Ξ 1 t Ξ 2 ) + t Ξ 3 V 1 ( Ξ 1 t Ξ 2 ) 1 X = 0 f X ( x ) F Y ( t Ξ 2 Ξ 1 t Ξ 2 X + t η ρ ( Ξ 1 t Ξ 2 ) + t Ξ 3 V 1 ( Ξ 1 t Ξ 2 ) 1 X ) dx = 0 A 1 e A 1 x ( 1 e A 2 ( t Ξ 2 Ξ 1 t Ξ 2 X + t η ρ ( Ξ 1 t Ξ 2 ) + t Ξ 3 V 1 ( Ξ 1 t Ξ 2 ) 1 X ) ) dx = 1 A 1 e t A 2 η ρ ( Ξ 1 t Ξ 2 ) 0 e A 1 + t A 2 Ξ 2 Ξ 1 t Ξ 2 + t A 2 Ξ 3 V 1 ( Ξ 1 t Ξ 2 ) 1 x dx .
Denote β 1 = 4 t A 2 Ξ 3 V 1 Ξ 1 ( 1 t Ξ 2 ) and χ 1 = A 1 + t A 2 Ξ 2 1 t Ξ 2 . F Y 1 ( t can be rewrite as shown in (34) by using the equation 0 e β 4 x γ x dx = β γ K 1 ( β γ ) ([26, 3.324, 1]). The CDF of Y 2 can be derived using the same derivation which is omit here due to page limitation. ☐
Substituting the obtained F Y i ( t ) into (20) , which gives in Lemma 2, the ergodic capacities C Y i can be calculated as
C Y i = E { C ( γ i ) } = 1 2 ln 2 0 A i e z A i ¯ η ρ Ξ 1 Ξ 2 β ^ i χ ^ i K 1 ( β ^ i χ ^ i ) Ξ 2 ( 1 + z ) 2 + z ( 1 + z ) d z
where z = t Ξ 2 Ξ 1 t Ξ 2 , β ^ i = 4 A i ¯ Ξ 3 V i z Ξ 2 , χ ^ i = A i + A i ¯ z . Then, substitute (38) into (33) will result in the total ergodic of AF protocol.

4. Optimal Power Splitting Design

Note that if more received signal is allocated to harvest energy, a higher available transmission power can be obtained, which may lead to a higher transmission rate, but less signal is left for transmission, which may lead to the decrease of transmission rate, and vise versa. Therefore, optimizing ρ is proposed as a way of improving.
With the obtained ergodic capacity expressions of DF and AF protocols derived in Section 3, the OPS value that maximize the ergodic capacity can be obtained by solving the optimization problem:
OP 0 : ρ 0 = arg ρ maximize C e Q s . t . 0 ρ 1
where Q = DF for DF protocol, and Q = AF for AF protocol.
However, due to the complicated integral and Bessel function in each ergodic capacity expression, a closed-form solution of the OPS ratio can hardly be obtained. Instead, we are interested in finding the OPS ratio that aims at maximizing the instantaneous achievable sum rate. This optimization is formulated as
OP 1 : ρ 0 = arg ρ maximize R sum Q s . t . 0 ρ 1
where R sum Q denotes the achievable sum rate of using the DF (i.e., Q = DF) or AF (i.e., Q = AF) protocol. Next we design the OPS ratios for DF and AF protocols, respectively.

4.1. The Optimum PS Design for the DF Protocol

From (40), we first analyze the analytical expression R sum DF to determine the OPS ratio. Equation (14) shows that the achievable sum rate R sum DF is determined by I 1 + I 2 and R MA . Since log 2 ( x ) is a monotonically increasing function of x, we note that R MA ( ρ ) = C ( Y MA ) is a decreasing function of ρ because Y MA is a decreasing function of ρ . The analytical expression of I ( ρ ) = I 1 ( ρ ) + I 2 ( ρ ) is expressed in the following proposition.
Proposition 1.
I ( ρ ) is a three-segment continuous function, segmented by ρ min DF = min ( ρ 1 , ρ 2 ) and ρ max DF = max ( ρ 1 , ρ 2 ) . The optimum I ( ρ ) exists in the range of [ ρ min DF , ρ max DF ] , where
ρ 1 = ( 1 + b 1 ) 2 + 4 b 1 κ 2 2 γ 1 ( 1 + b 1 ) 2 κ 2 2 γ 1
ρ 2 = ( 1 + b 2 ) 2 + 4 b 2 κ 2 2 γ 2 ( 1 + b 2 ) 2 κ 2 2 γ 2
b 1 = γ 1 V 2 η γ 2 γ Σ , b 2 = γ 2 V 1 η γ 1 γ Σ
and I ( ρ ) is given by
I ( ρ ) = C η ρ γ 2 γ Σ κ 2 η ρ γ 2 γ Σ + V 2 + C η ρ γ 1 γ Σ κ 2 η ρ γ 1 γ Σ + V 1 , 0 ρ < ρ min DF C ( 1 ρ ) γ n ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ n + 1 + C η ρ γ n γ Σ κ 2 η ρ γ n γ Σ + V n , ρ min DF ρ ρ max DF C ( 1 ρ ) γ 1 ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ 1 + 1 + C ( 1 ρ ) γ 2 ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ 2 + 1 , ρ max DF < ρ 1
where γ Σ = γ 1 + γ 2 , and n = 1 when γ 1 < γ 2 , n = 2 when γ 1 γ 2 .
Proof. 
The proof is given in Appendix C. ☐
By analyzing the second-order derivation of I ( ρ ) , it is easy to determine that in the region of ρ [ 0 , 1 ] , the three sections of I ( ρ ) are, respectively, an increasing function, a concave function and a decreasing function. Since I ( ρ ) is continuous, the overall function I ( ρ ) is a concave function. It is straightforward that I ( ρ = 0 ) = I ( ρ = 1 ) = 0 , R MA ( ρ = 0 ) 0 and R MA ( ρ = 1 ) = 0 . Thus, I ( ρ ) and R MA ( ρ ) have one and only one intersection within the region of ρ [ 0 , 1 ] . The achievable sum rate R sum DF ( ρ ) = min ( I ( ρ ) , R MA ( ρ ) ) , whose analytical expression can be determined by using the following Proposition 2, is achieved by combining I ( ρ ) and R MA ( ρ ) .
Proposition 2.
Denote the second-segment of I ( ρ ) as I s g ( ρ ) = C η ρ γ n γ Σ κ 2 η ρ γ n γ Σ + V n + C ( 1 ρ ) γ n ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ n + 1 , ρ [ 0 , 1 ] , it can get conclude that I s g ( ρ ) and R MA ( ρ ) have one and only one intersection point in the range of ρ [ 0 , ρ max DF ] . Let ρ + be the intersection of I s g ( ρ ) and R MA ( ρ ) , there will be two cases for R sum DF ( ρ ) :
Case I: If ρ + < ρ min DF
R sum DF ( ρ ) = C η ρ γ 2 γ Σ κ 2 η ρ γ 2 γ Σ + V 2 + C η ρ γ 1 γ Σ κ 2 η ρ γ 1 γ Σ + V 1 , 0 ρ ρ * R MA = C ( 1 ρ ) γ Σ ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ Σ + 1 , ρ * ρ 1
Case II: If ρ + ρ min DF
R sum DF ( ρ ) = C η ρ γ 2 γ Σ κ 2 η ρ γ 2 γ Σ + V 2 + C η ρ γ 1 γ Σ κ 2 η ρ γ 1 γ Σ + V 1 , 0 ρ ρ min DF C ( 1 ρ ) γ n ( κ 2 ρ κ 1 2 ) γ n + 1 + C η ρ γ n γ Σ κ 2 η ρ γ n γ Σ + V n , ρ min DF ρ ρ + R MA = C ( 1 ρ ) γ Σ ( κ 2 ρ κ 1 2 ) γ Σ + 1 , ρ + ρ ρ max DF
where ρ + is the intersection of I sg ( ρ ) and R MA ( ρ ) , which can be obtained by solving the following Kubischen Polynoms
B 1 + ρ 3 + B 2 + ρ 2 + B 3 + ρ + B 4 + = 0 B 1 + = κ 1 2 ( 1 + κ 1 2 ) η γ n 2 γ Σ 2 B 2 + = η γ n γ Σ [ γ n κ 1 2 + κ 1 2 ( 1 + κ 2 ) γ n γ Σ + ( 1 + κ 1 2 ) ( 1 + κ 2 ) ( γ n κ 2 γ n ¯ ) ] B 3 + = ( 1 + κ 2 ) η γ n γ Σ ( 1 + ( 1 + κ 2 ) ( γ n κ 2 γ n ¯ ) ) + ( 1 + κ 2 ( 1 + κ 1 2 ) ) V n γ n ¯ B 4 + = ( 1 + κ 2 ) 2 V n γ n ¯
and ρ * is the intersection of the first segment of I ( ρ ) and R MA ( ρ ) , which can be obtained by solving Kubischen Polynoms as follows
B 1 * ρ 3 + B 2 * ρ 2 + B 3 * ρ + B 4 * = 0 B 1 * = η 2 γ Σ 3 γ 1 γ 2 ( κ 2 κ 2 2 κ 1 2 ( 1 + κ 2 ) ) B 2 * = η 2 γ Σ 2 γ 1 γ 2 ( ( 1 + 2 κ 2 ) + κ 2 ( 1 + κ 2 ) γ Σ ) + η γ Σ 2 κ 2 2 ( γ 2 V 1 + γ 1 V 2 ) B 3 * = η γ Σ ( γ 2 V 1 + γ 1 V 2 ) + γ Σ V 1 V 2 B 4 * = γ Σ V 1 V 2
Proof. 
The proof is given in the Appendix D. ☐
From the two cases of the achievable sum rates expressed in (43) and (44), we analyze the OPS ratio ρ 0 by case studies.

4.1.1. Case I: ρ + < ρ min DF

From Equation (43), we can calculate that the first segment is an increasing function of ρ and the second segment is a decreasing function of ρ . Since R sum DF ( ρ ) in a continuous piecewise function, it is easy to get that the optimal achievable sum rate is obtained at ρ * . Thus, in this case the optimum power splitting ratio is ρ 0 = ρ * .

4.1.2. Case II: ρ + ρ min DF

From Proposition 1 and the monotonic of R MA ( ρ ) , we get that the maximum achievable sum rate exists in the second segment of (44), i.e., ρ 0 [ ρ min DF , ρ + ] . Thus, the OPS value is determined by I s g , ρ [ ρ min DF , ρ + ] . Because I s g ( ρ ) , ρ [ 0 , 1 ] is a concave function, there should have three subcases to determine the optimal value by analyzing the location of the extrema of of I s g ( ρ ) . Denote ρ ex as the extrema of of I s g ( ρ ) , it can be obtained by solving the following quadratic equation
B 1 ex ρ 2 + B 2 ex ρ + B 3 ex = 0 B 1 ex = η γ Σ V n κ 1 2 ( 1 + κ 1 2 ) γ n 2 κ 2 ( 1 + κ 2 ) ( 1 + κ 2 γ n ) η 2 γ n 2 γ Σ B 2 ex = η γ Σ V n [ γ n 2 ( 2 κ 2 ( 1 + κ 2 ) + κ 1 2 ( 1 + 2 κ 2 ) ) + 2 γ n ( 1 + κ 1 2 + κ 2 ) ] B 3 ex = η γ Σ V n [ κ 2 ( 1 + κ 2 ) γ n 2 + ( 1 + 2 κ 2 ) γ n + 1 ] ( 1 + κ 2 γ n ) V n 2
Through analysis of the locations of the extreme value ρ ex of I s g ( ρ ) , we can get three subcases for Case II.
  • Subcase 1: ρ ex < ρ min DF
    Since I s g ( ρ ) is a decreasing function in the range of [ ρ ex , 1 ] , it is easy to obtain that I s g , ρ [ ρ min DF , ρ + ] is also a decreasing function. Thus in this case, the optimum power splitting ratio is ρ 0 = ρ min DF .
  • Subcase 2: ρ ex [ ρ min DF , ρ + ]
    In this case, I s g ( ρ ) is an increasing function in the range of ρ [ ρ min , ρ ex ] and is a decreasing function in the range of ρ [ ρ ex , ρ + ] . Thus, I s g , ρ [ ρ min DF , ρ + ] is a concave function and obtain its maximum at ρ 0 = ρ ex .
  • Subcase 3: ρ ex > ρ +
    I s g ( ρ ) is an increasing function in the range of [ 0 , ρ ex ] . So in this case I s g , ρ [ ρ min DF , ρ + ] is an increasing function of ρ . Its optimum is laid on the border ρ 0 = ρ + .
With the aforementioned analysis, we can obtain the optimal power splitting ratio for DF protocol, which is expressed as follows
ρ 0 = ρ * , for ρ + < ρ min DF ρ min DF , for ρ + ρ min DF and ρ ex < ρ min DF ρ ex , for ρ + ρ min DF and ρ min DF ρ ex < ρ + ρ + , for ρ + ρ min DF and ρ ex > ρ +

4.2. The Optimum PS Design of AF Protocol

Based on (16) and (17), we analyze the OPS ratio for the AF protocol starting from (16) and (17). With the notice of that Y 1 and Y 2 are both concave functions of ρ , it is easy to find that R sum AF is a concave function. The OPS of AF protocol can be obtained by equating R sum AF ρ = 0 . However, it is difficult to directly calculate a closed form solution of the OPS ratio by solving R sum AF ρ = 0 because of complex high-order polynomial function of ρ in the numerator and denominator of R sum AF ρ . Therefore, we turn to utilize an approximate optimal solution for AF protocol with the consideration of high SNR regimes.
Using the fact that log 2 ( 1 + x ) log 2 ( x ) when x 1 , the instantaneous achievable rate of S i can be simply approximated in high SNR regimes as
R i 1 2 log 2 ( Ξ 1 γ 1 γ 2 Ξ 2 γ Σ γ i + η ρ γ i + Ξ 3 V i )
Since the convexity of log 2 ( x ) is the same with that of x, by analyzing the convexity of Ξ 1 γ 1 γ 2 Ξ 2 γ Σ γ i + η ρ γ i + Ξ 3 V i , it is easy to get that R i is concave function. And, thus, R sum AF ( ρ ) = R 1 + R 2 is concave function.
The first derivatives of R sum AF can be obtained as
R sum AF ρ = R 1 ρ + R 2 ρ .
The obtained R i ρ is expressed on the top of next page.
R i ρ = 1 2 ln 2 ( η γ Σ γ i ( 1 + κ 2 ) κ 2 2 + η γ i ( 1 + κ 1 2 ) V i ) ρ 2 + 2 ( 1 + κ 2 ) V i ρ ( 1 + κ 2 ) V i η ρ ( 1 ρ ) γ 1 γ 2 [ η ( κ 1 2 + κ 1 2 κ 2 + κ 2 ) γ Σ γ i ρ 2 ( η κ 2 ( 2 + κ 2 ) γ Σ γ i + η γ i ( 1 + κ 1 2 ) V i ) ρ ( 1 + κ 2 ) V i ]
By equating R 1 ρ + R 2 ρ to zero, we obtain that the OPS ratio that maximizes R sum AF ( ρ ) must satisfy the following equation:
Q 1 ρ 4 + Q 2 ρ 3 + Q 3 ρ 2 + Q 4 ρ + Q 5 = 0
where Q n = L n , 1 L n , 2 , n { 1 , 2 , , 5 } . And L n , i , i { 1 , 2 } , is expressed as follows
L 1 , i = q 1 γ i ¯ [ q 2 γ i + η γ i κ 1 , + 2 V i ] L 2 , i = ( q 2 γ i + η γ i κ 1 , + 2 V i ) ( q 3 γ i ¯ + η γ i ¯ κ 1 , + 2 V i ¯ ) + 2 q 1 κ + 2 V i L 3 , i = ( q 2 γ i + η γ i κ 1 , + 2 V i ) κ + 2 V i q 1 γ i ¯ κ + 2 V i 2 ( q 3 γ i ¯ + η γ i ¯ κ 1 , + 2 V i ¯ ) κ + 2 V i L 4 , i = 2 κ + 2 V i V i ¯ + ( q 3 γ i ¯ + η γ i ¯ κ 1 , + 2 V i ¯ ) κ + 2 V i L 5 , i = κ + 2 V i V i ¯
and q 1 = η ( κ 1 2 + κ 1 2 κ 2 + κ 2 ) γ Σ , q 2 = η κ 2 2 ( 1 + κ 2 ) γ Σ , q 3 = η κ 2 ( 2 + κ 2 ) γ Σ , κ 1 , + 2 = 1 + κ 1 2 , κ + 2 = 1 + κ 2 .
The above function is a quartic polynomial on ρ and has at most four real roots. Since R sum AF ( ρ ) is a concave function, at most one of these roots of R sum AF ρ = 0 is real and positive.

5. Numerical Results

5.1. Effects of Various Parameters on Ergodic Capacity

The purpose of this set of simulations is to validate the correctness of the ergodic capacity expression derived and investigate the effect of various parameter settings on the ergodic capacities for that uses the DF protocol or AF protocols. Parameters chosen are: κ 1 = κ 2 = κ ave , σ 2 = 10 6 . The channel gains are considered as Rayleign fading with pass loss, where the variances of the channel coefficients satisfy λ 1 = λ 2 = 1 , and the pass loss exponent is set as m = 2.7 . The transmit power P 1 = P 2 = P t , which is within the region P t = [ 0 , 30 ] dBm.
Figure 2 shows the effect of κ ave on ergodic capacities. The utilized parameter settings are: ρ = 0.5 , d 1 = d 2 = 5 m, and η = 0.8 . The ideal hardware impairment situation ( κ ave = 0 ; i.e., no hardware impairments) are presented as benchmark performance. This figure shows that the ergodic capacities obtained by using the closed-form integral expressions are identical with Monte Carlo simulations. When the effects of hardware impairments are considered, the ergodic capacities tend to saturation with the increase of P t . And the higher the value of κ ave , the more quickly the ergodic capacities saturate. This is because the distortion noises introduced by hardware impairments also increase when P t increases, which will set a bound on the SNDR of each transmission link. Meanwhile, we also find that the effect of κ ave on the DF protocol is more obvious than that on AF protocol. This is because in AF protocol, the amplification of useful signal is more effective than distortion noise with the increase of P t , which will slow down the effect degree of the distortion noise, thus do not contribute severe distortion noises than in the DF protocol in the high SNR region.
The effects of relay deployment on ergodic capacities are presented in Figure 3 for the DF protocol (left) and the AF protocol (right). The distance between S 1 and S 2 is fixed as d 1 + d 2 = 10 m, where d i , i { 1 , 2 } is the distance between S i and R. The utilized parameter settings are: κ ave = 0.1 , ρ = 0.5 , η = 0.8 and destination pair ( d 1 , d 2 ) = { ( 1 , 9 ) , ( 3 , 7 ) , ( 5 , 5 ) , ( 7 , 3 ) , ( 9 , 1 ) } m. It is observed that the ergodic capacity obtained by the closed-form expressions coincide with that obtained by Monte Carlo simulations (Simu). It is evident that the ergodic capacities when ( d 1 , d 2 ) = { ( 1 , 9 ) , ( 3 , 7 ) } m are identical with that when ( d 1 , d 2 ) = { ( 9 , 1 ) , ( 7 , 3 ) } m for both protocols, which infers that the ergodic capacities of both protocols are symmetric with the increase of d 1 . This is because when set P 1 = P 2 and fix the distance between S 1 and S 2 , the system is symmetric, and thus contribute to a symmetric performance. We also find that the DF protocol have the minimum ergodic capacities when the distance pair are set as ( d 1 , d 2 ) = ( 5 , 5 ) m, the minimum ergodic capacities of AF protocol is obtained when ( d 1 , d 2 ) = ( 5 , 5 ) m in the low SNR region, and varies to different destination pairs when setting the transmit power P t to some certain values. This abnormal phenomenon of AF is due to the amplification process.
The effect of energy efficient conversion ratio η on ergodic capacities are presented in Figure 4 for the DF protocol (left) and the AF protocol (right) with parameters κ ave = 0.1 , η = 0.5 , ( d 1 , d 2 ) = ( 5 , 5 ) m, η = [ 0.2 , 0.4 , 0.6 , 0.8 ] . It can be noticed that the ergodic capacities of both protocols obtained by the closed-form expressions are in accordance with that obtained via Monte Carlo simulations (Simu). With the increase of η , it is observed that the ergodic capacity of both protocol increase. This is because P R increases with the increase of η , which will enhance the transmit capabilities of the BC phase. And since P R is provided by energy harvesting, the value of P R is usually not very large. Thus the BC transmission ability dominates the value of ergodic capacity. Thus, with the increase of η , the ergodic capacities increase. The value of η also effects the saturation rate of the DF protocol and the gap between the curves of AF protocol. This phenomenon is due to the value of η effects the value of distortion noises.
The effects of the power splitting ratio ρ on ergodic capacities are evaluated for DF (left) and AF (right) protocols in Figure 5 under the parameters setting: η = 0.8 , ( d 1 , d 2 ) = ( 5 , 5 ) m, κ ave = 0.1 , ρ = [ 0.1 , 0.5 , 0.9 ] . The ergodic capacities of both protocols obtained by the closed-form expressions are in accordance with that obtained via Monte Carlo simulations (Simu). It can be noticed that the maximum ergodic capacities of both DF and AF protocols with ρ = 0.9 has best performance in low P t region; while with the increase of P t , the maximum ergodic capacity change to the value with parameter setting ρ = 0.5 and further change to that with ρ = 0.1 . This configuration verifies that the ergodic capacities can be enhanced through the design of ρ , which validates the meaning of OPS design analyzed in Section 4.

5.2. Effects of Various Parameters on OPS design

The purpose of this set of simulations is to validate the validness of the OPS design and investigate the effect of parameters setting on OPS design for that uses the DF protocol or AF protocol. Since in a practical scenario, the energy conversion efficiency can be known in advance, we mainly focus on the effect of tranmitted power P t , impairments distortion level κ ave and relay deployment d 1 on OPS design in this section. Parameters chosen are: κ 1 = κ 2 = κ ave , σ 2 = 10 6 , η = 0.8 , d 1 + d 2 = 10 m, λ 1 = λ 2 = 1 , m = 2.7 and P 1 = P 2 = P t .
To better understand the importance and the effect of OPS design, we use ρ as x-axis to see the ergodic capacities (EC) and average achievable sum rate (ASR) changes with the increase of ρ . In Figure 6, we present the effect of PS ratio on EC and on average ASR for DF protocol, where the EC is obtained by using the derived closed-form expressions in Section 3.1 and the average ASR is obtained by doing Monte Carlo simulation using (14). It can be notice that, there exists a maximum value for both ergodic capacity and average ASR with the increase of ρ , and the value of ρ that maximize EC and average ASR varies with different transmit power P t sets and different distortion level κ ave sets. The curves of EC and average ASR are not exactly the same, and with the increase of P t and κ ave , the gaps becomes smaller. Though simulation inspect, we find that this is because due to different calculating of EC and average ASR, the correlative influence introduced by multiple-access restraint differs. In addition, with the increase of P t and κ ave , the correlative influence comparatively decreases.
In Figure 7, the EC and average ASR with the increase of ρ for AF protocol are presented. The EC is obtained by using the derived closed-form expressions in Section 3.2 and the average ASR is obtained by doing Monte Carlo simulation using (18). It can be noted that the curves of EC coincide with the curves of average ASR. This is because without the multiple-access constraint influence in AF protocol, the calculation of EC is equal to the calculation of average ASR. In addition, we also find that the transmit power P t sets and the distortion level κ ave effect the OPS value.
In the following configuration, we analyze the effect of parameters setting on OPS design, and the OPS ratio is obtained aiming at maximizing the instantaneous achievable sum rate which is derived in Section 4. Figure 8 shows the average achievable sum rate as a function of the transmit power P t for DF and AF protocols. The setting of distortion level κ ave = { 0.08 , 0.175 } is adopted. Both the numerical search (NS) and the OPS closed-form derived in Section 4 are used to find the OPS ratio and calculate the corresponding achievable sum rate. The achievable sum rate with EPS is presented as benchmark performance. It can be noted that the curves obtained by numerical search coincide with that obtained by using closed-form OPS. It also shows that the OPS design outperforms EPS in each κ ave setting, and the gap grows with the increase of κ ave . The effect of OPS design with DF protocol is more obvious than that with AF protocol.
Figure 9 presents the value of OPS ratio versus the transmit power P t for DF and AF protocols. The setting of distortion level κ ave = { 0.08 , 0.175 } is adopted. Seen from this figure, we find that the OPS ratio obtained by closed-form coincides with that obtained by doing NS for DF protocol, and the OPS ratio obtained by closed-form is quite similar with that obtained by doing NS for AF protocol. It is easy to noted that the OPS ratio is a monotonic decreasing function with the increase of P t for both protocols. The reason for this phenomenon is because when the source provide high transmit power, the recruit of harvested energy is more prone to satisfy the relay to destination transmission, and the enhancement of system performance is relies on the source to relay transmission which means that more information needed to be split to information decoder circuit, i.e., ( 1 ρ ) enhances. We also find that the OPS ratio with κ ave = 0.175 setting is higher than that with κ ave = 0.08 setting for both protocols. The reason for this phenomenon will be discussed below Figure 11.
Figure 10 plots the achievable sum rate versus hardware impairments distortion level κ ave for both DF and AF protocols with different transmit power P t = { 15 , 30 } dBm. The curves with black solid line were generated by utilizing the OPS through numerical search (NS), and the curves with mark were generated by utilizing the OPS derived in Section 4. EPS design is adopted as benchmark performance. As shown in this figure, the achievable sum rate is decreasing and will tend to flatten out as κ ave increases, and the lower the transmit power, the faster the rate approaching to flat. This figure also verifies that OPS design outperforms EPS scheme, and the gaps of DF protocol between OPS and EPS design is bigger than that of AF protocol.
The effect of κ ave on OPS design for DF and AF protocols are presented in Figure 11. This figure presents that the OPS ratio obtained by closed-form is identical with that obtained by doing NS for DF protocol, and for AF protocol, the OPS ratio obtained by closed-form is very close to that obtained by doing NS. It is observed that the OPS ratio is a decreasing function of κ ave , and the decreasing slope increases with the increase of P t . This is because the higher κ ave makes worse decoding ability. To enhance system performance, more energy need to be diverted to the ID circuit to satisfy the decoding process, thus, OPS value decreases. We also find when κ ave is the same, the OPS value with the higher P t is lower than that with the lower P t . This is because in higher P t region, the harvested energy is more prone to satisfy the BC transmission with small ρ .
With fixed κ ave = 0.1 , we analyze the effect of relay deployment on average ASR with the set of P t = { 15 , 30 } dBm for DF and AF protocols ( d 1 is chosen as the x-axis) in Figure 12. This figure verifies that the average ASR with OPS obtained in Section 4 and that obtained by using NS are the same, and the OPS scheme outperform the EPS scheme. For DF protocol, the average ASR is a convex function with the increase of d 1 for P t = { 15 , 30 } dBm. While for AF protocol, the average ASR is convex function when P t = 15 dBm, while when P t = 30 dBm, the average ASR is a concave function. This phenomenon echoes the conclusion in Figure 3 (right) that when P t increase to high enough, the relay is better to deploy close to any one of the source nodes.
Figure 13 plots the value of OPS ratio versus d 1 for DF and AF protocols. It shows that the OPS ratio obtained by closed-form is identical with that obtained by doing NS for DF protocol, and for AF protocol, the OPS ratio obtained by closed-form is very close to that obtained by doing NS. With the increase of d 1 , the OPS values of both DF and AF protocols are concave function. This is because when P 1 = P 2 and d 1 + d 2 = 10 m, the system has symmetric nature. In addition, when the relay is deployed in the middle of S 1 and S 2 , the harvested energy is the smallest with the fixed ρ , and the harvested energy increase when the relay getting closer to any of the source node. Thus, to enhance the performance, more energy is needed to be allocated to energy harvester when ( d 1 , d 2 ) = ( 5 , 5 ) , and when d i , i = 1 or 2 decrease, less energy is needed to be allocate to energy harvester. We also find that the curves with P t = 30 dBm are lower than that with P t = 15 dBm. This is because with higher P t , the harvested energy is more prone to satisfy the transmission with lower ρ .

6. Conclusions

This paper analyzed the a rigorous analysis of a two-way energy harvesting relay network assuming a realistic scenario that the transceiver and receiver hardware is imperfect and will cause distortions. After analyzing two different transmission protocol (DF protocol and AF protocol), we derive the new expression of sum rate with impairment distortions considered. Then, we derive the exact analytical expression of ergodic capacity for both DF and AF relaying protocols. Furthermore, the OPS ratio that maximize the instantaneous achievable sum rate is formulated and solved for both protocols. Through numerical results we find that a continuous increase of the transmit power does not lead to a continuous increase of the ergodic capacity or the achievable sum rate when HI is considered. Also, the effect of HI is more obvious for DF protocol than for AF protocol with the increase of the transmit power. It can be also noticed that the achievable sum-rate with the OPS design outperforms that with EPS design. These results and observations provide very useful insights to guide the system optimization.

Acknowledgments

This research was supported by The National Science Foundation of China (61271260 & 61572231), and The Ph.D. Project of Chongqing University of Posts and Telecommunications (BYJS2016006).

Author Contributions

The main contributions of Chunling Peng were to create the main ideas and execute performance evaluations by theoretical analysis and simulation while Fangwei Li and Huaping Liu works as the advisor of Chunling Peng to discuss, create, and advise the main ideas and performance evaluations together.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Denote γ 1 = X , γ 2 = Y , the PDF of X and Y is f x ( x ) = 0 A 1 e A 1 x dx , x > 0 , f y ( y ) = 0 A 2 e A 2 y dy , y > 0 , respectively, according to Lemma 1.
We first derive the CDF of Y 1 R , which is given by
F Y 1 R ( t ) = Pr Y 1 R < t = Pr ( 1 ρ ) γ 1 ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ 1 + 1 < t = Pr ( 1 ρ ) X ( κ 1 2 ( 1 ρ ) + κ 2 2 ) X + 1 < t = Pr [ ( 1 ρ ) ( 1 t κ 1 2 ) + t κ 2 2 ] X < t
From (A1), we note that when ( 1 ρ ) ( 1 t κ 1 2 ) + t κ 2 2 < 0 , [ ( 1 ρ ) ( 1 t κ 1 2 ) + t κ 2 2 ] X is always less equal than t ( t > 0 ) , which contribute to F Y 1 R ( t ) = 1 . Whereas, when ( 1 ρ ) ( 1 t κ 1 2 ) + t κ 2 2 > 0 , we have
F Y 1 R ( t ) = Pr X < t ( 1 ρ ) ( 1 t κ 1 2 ) + κ 2 2 = 1 e t A 1 ( 1 ρ ) ( 1 t κ 1 2 ) + κ 2 2
Similar to the derivation of F Y 1 R , we can obtain F Y 2 R ( t ) = 1 e t A 2 ( 1 ρ ) ( 1 t κ 1 2 ) + κ 2 2 . Thus, F Y i R can be rewrite as shown in (21).
Next, we derive the CDF of Y R 1 , which is express as follows
F Y R 1 ( t ) = Pr Y R 1 < t = Pr η ρ X ( X + Y ) κ 2 η ρ X ( X + Y ) + V 1 < t = Pr η ρ ( 1 t κ 2 ) X ( X + Y ) < t V 1
It is straightforward that F Y R 1 ( t ) = 1 when t > 1 κ 2 . In addition, when t < 1 κ 2 , F Y R 1 ( t ) can be derived as follows
F Y R 1 ( t ) = Pr X ( X + Y ) < t V 1 η ρ ( 1 t κ 2 ) = Pr Y < t V 1 η ρ ( 1 t κ 2 ) X X = 0 t V 1 η ρ ( 1 t κ 2 ) 0 t V 1 η ρ ( 1 t κ 2 ) · 1 x x A 1 e A 1 x · A 2 e A 2 y dxdy = 0 t V 1 η ρ ( 1 t κ 2 ) A 1 e A 1 x ( 1 e A 2 ( t V 1 η ρ ( 1 t κ 2 ) · 1 x x ) ) dx = 1 e A 1 t V 1 η ρ ( 1 t κ 2 ) A 2 0 t V 1 η ρ ( 1 t κ 2 ) e ( A 1 A 2 ) x + t A 2 V 1 η ρ ( 1 t κ 2 ) · 1 x dx
Similar to the derivation of F Y R 1 , we can obtain F Y R 2 ( t ) . Denote ζ i = 0 t V i η ρ ( 1 t κ 2 ) e ( A i A i ¯ ) x + t A i ¯ V i η ρ ( 1 t κ 2 ) · 1 x d x , Equation (22) is obtained.
The CDF of Y MA is derived in the following.
F Y MA ( t ) = Pr Y MA < t = Pr ( 1 ρ ) ( X + Y ) ( κ 1 2 ( 1 ρ ) + κ 2 2 ) ( X + Y ) + 1 < t = Pr [ ( 1 ρ ) ( 1 t κ 1 2 ) t κ 2 2 ] ( X + Y ) < t
It is straightforward that F Y MA ( t ) = 1 when t > 1 ρ ( 1 ρ ) κ 1 2 + κ 2 2 . In addition, when t < 1 ρ ( 1 ρ ) κ 1 2 + κ 2 2 , F Y MA ( t ) can be derived as follows
F Y MA ( t ) = Pr X < t ( 1 ρ ) ( 1 t κ 1 2 ) t κ 2 2 Y = Pr X < t ρ ¯ t κ 2 t κ 1 2 ρ Y = 0 t ρ ¯ t κ 2 t κ 1 2 ρ 0 t ρ ¯ t κ 2 t κ 1 2 ρ y A 1 e A 1 x · A 2 e A 2 y dxdy = 0 t ρ ¯ t κ 2 t κ 1 2 ρ A 2 e A 2 y ( 1 e A 1 t ρ ¯ t κ 2 t κ 1 2 ρ y ) dy = 1 e t A 2 ρ ¯ t κ 2 t κ 1 2 ρ A 2 e t A 1 ρ ¯ t κ 2 t κ 1 2 ρ 0 t ρ ¯ t κ 2 t κ 1 2 ρ e ( A 2 A 1 ) y dy
Thus, when A 1 = A 2 ,
F Y MA ( t ) = 1 e t A 2 ρ ¯ t κ 2 t κ 1 2 ρ t A 2 ρ ¯ t κ 2 t κ 1 2 ρ e t A 1 ρ ¯ t κ 2 t κ 1 2 ρ
and when A 1 A 2 ,
F Y MA ( t ) = 1 e t A 2 ρ ¯ t κ 2 t κ 1 2 ρ A 2 e t A 1 ρ ¯ t κ 2 t κ 1 2 ρ A 2 A 1 ( 1 e ( A 2 A 1 ) t ρ ¯ t κ 2 t κ 1 2 ρ ) = 1 + A 1 A 2 A 1 e t A 1 ρ ¯ t κ 2 t κ 1 2 ρ A 2 A 2 A 1 e t A 1 ρ ¯ t κ 2 t κ 1 2 ρ
The above derivations proof the Theorem 1.

Appendix B

Appendix B.1. The Derivation of C R i

We first derive C i R . Substituting (21) into (20), we obtain
C i R = 1 2 ln 2 0 1 ρ ( 1 ρ ) κ 1 2 + κ 2 2 e t A i ( 1 ρ ) t ( 1 ρ ) κ 1 2 t κ 2 2 1 + t dt
Denote z = t ( κ 2 ρ κ 1 2 ) ρ ¯ t ( κ 2 ρ κ 1 2 ) , and substitute it into (A9), we obtain
C i R = 1 2 ln 2 0 + e z A i κ 2 ρ κ 1 2 ( κ 1 2 + κ 2 2 1 ρ ) ( 1 + z ) 2 + z ( 1 + z ) dz = 1 2 ln 2 0 + e z A i κ 2 ρ κ 1 2 ( 1 + z ) ( u + ( 1 + u ) z ) dz ( where u = κ 1 2 + κ 2 2 1 ρ )
With some manipulation, it is easy to obtain that 1 ( 1 + z ) ( u + ( 1 + u ) z ) can be decomposed into J 1 1 + z + J 2 u + ( 1 + u ) z , where J 1 = 1 , J 2 = 1 + u . Thus,
C i R = 1 2 ln 2 0 + J 1 1 + z + J 2 u + ( 1 + u ) z e z A i κ 2 ρ κ 1 2 dz = 1 2 ln 2 0 J 1 e z A i κ 2 ρ κ 1 2 1 + z dz + 0 J 2 e z A i κ 2 ρ κ 1 2 u + ( 1 + u ) z dz = 1 2 ln 2 J 1 e A i κ 2 ρ κ 1 2 E 1 A i κ 2 ρ κ 1 2 + J 2 1 + u e A i ρ ¯ + κ 2 ρ κ 1 2 E 1 A i ρ ¯ + κ 2 ρ κ 1 2
Thus (26) is proofed.

Appendix B.2. The Derivation of C R i

Substituting (22) into (20), we obtain that
C R i = 1 2 ln 2 0 1 κ 2 e A i t V i ( 1 t κ 2 ) η ρ + A i ζ i 1 + t dt
Denote z = t κ 2 1 t κ 2 , and substitute it into (A12), we obtain
C R i = 1 2 ln 2 0 e A i z V i κ 2 η ρ + A i ζ ^ i κ 2 ( 1 + z ) 2 + z ( 1 + z ) dz = 1 2 ln 2 0 e A i z V i κ 2 η ρ + A i ζ ^ i ( 1 + z ) ( κ 2 + ( 1 + κ 2 ) z ) dz
where ζ ^ i = 0 z V i κ 2 η ρ e ( A 1 A 2 ) x + z A i ¯ V i κ 2 η ρ · 1 x dx
With some manipulation, it is easy to obtain that 1 ( 1 + z ) ( κ 2 + ( 1 + κ 2 ) z ) = J 1 1 + z + J 3 κ 2 + ( 1 + κ 2 ) z , where J 3 = 1 + κ 2 . Thus
C R i = 1 2 ln 2 0 J 1 e A i z V i κ 2 η ρ 1 + z dz + 0 J 3 e A i z V i κ 2 η ρ κ 2 + ( 1 + κ 2 ) z dz + 0 J 1 1 + z + J 3 κ 2 + ( 1 + κ 2 ) z A i ζ ^ i dz = 1 2 ln 2 2 J 1 0 w e A 1 w V 1 κ 2 η ρ + w 2 dw + 2 J 3 1 + κ 2 0 w e A i w V i κ + 2 η ρ + w 2 dw + 0 J 1 1 + z + J 3 κ 2 + ( 1 + κ 2 ) z A i ζ ^ i dz ( where w = z V i κ 2 η ρ )
Referring to [28, 3.354, 2], (27) is obtained.

Appendix B.3. The Derivation of C MAC

(1) When A 1 = A 2
Substituting (23) into (20), we obtain
C MAC = 1 2 ln 2 0 1 1 t e t A 2 ρ ¯ t ( κ 2 ρ κ 1 2 ) t A 2 e t A 1 ρ ¯ t ( κ 2 ρ κ 1 2 ) ρ ¯ t ( κ 2 ρ κ 1 2 ) dt
Similar to the derivation of C i R , we denote z = t ( κ 2 ρ κ 1 2 ) ρ ¯ t ( κ 2 ρ κ 1 2 ) , and (A15) can rewrite as
C MAC = 1 2 ln 2 0 J 1 1 + z e z A 2 κ 2 ρ κ 1 2 dz + 0 J 2 e z A 2 κ 2 ρ κ 1 2 u + ( 1 + u ) z dz Δ 1 + 0 J 1 1 + z z A 2 e z A 1 κ 2 ρ κ 1 2 κ 2 ρ κ 1 2 dz + 0 J 2 u + ( 1 + u ) z z A 2 e z A 1 κ 2 ρ κ 1 2 κ 2 ρ κ 1 2 dz Δ 2
The value of Δ 1 can be derived following the derivation of C i R . In addition, Δ 2 can be obtained by using the integral formula presented in [26, 3.353, 5], which is 0 x n e μ x x + β dx = ( 1 ) n β n e η μ E 1 ( η μ ) + k = 1 n ( k 1 ) ! ( β ) n k μ k . Combined Δ 1 and Δ 2 , (28) is obtained.
(2) When A 1 A 2
Substituting (24) into (20), we obtain
C MAC = 1 2 ln 2 0 1 1 t A 2 e t A 1 ρ ¯ t ( κ 2 ρ κ 1 2 ) A 2 A 1 A 1 e t A 2 ρ ¯ t ( κ 2 ρ κ 1 2 ) A 2 A 1 dt
Denote z = t ( κ 2 ρ κ 1 2 ) ρ ¯ t ( κ 2 ρ κ 1 2 ) , Equation (A17) changes into the following equation with some manipulations.
C MAC = ( A 2 A 1 ) 1 2 ln 2 J 1 A 2 0 e z A 1 κ 2 ρ κ 1 2 1 + z dz + J 1 A 1 0 e z A 2 κ 2 ρ κ 1 2 1 + z dz + J 2 A 2 0 e z A 1 κ 2 ρ κ 1 2 u + ( 1 + u ) z dz + J 2 A 1 0 e z A 2 κ 2 ρ κ 1 2 u + ( 1 + u ) z dz = ( A 2 A 1 ) 1 2 ln 2 J 1 A 2 e A 1 κ 2 ρ κ 1 2 E 1 A 1 κ 2 ρ κ 1 2 + J 1 A 1 e A 2 κ 2 ρ κ 1 2 E 1 A 2 κ 2 ρ κ 1 2 + J 2 A 2 1 + u e A 1 ρ ¯ + κ 2 ρ κ 1 2 E 1 A 1 ρ ¯ + κ 2 ρ κ 1 2 + J 2 A 1 1 + u e A 2 ρ ¯ + κ 2 ρ κ 1 2 E 1 ( A 2 ρ ¯ + κ 2 ρ κ 1 2 )
Thus, (29) is obtained.

Appendix C

As a simple extension, the two-way relaying system can be treated as two one-way relay systems. We first obtain two suboptimal power splitting designs ρ i , i = 1 , 2 , which maximize I 1 ( ρ ) or maximize I 2 ( ρ ) to obtain I sub , i = I ( ρ i ) .
Note that I i , i = 1 , 2 is determined by Y i r ( ρ ) = C ( 1 ρ ) γ 1 ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ 1 + 1 and Y r i ¯ ( ρ ) = C η ρ γ i ¯ ( γ 1 + γ 2 ) κ 2 η ρ γ i ¯ ( γ 1 + γ 2 ) + V i ¯ , where i , i ¯ = 1 , 2 , i i ¯ . Through calculation of the second derivation, we find that Y i r ( ρ ) is a decreasing functions in the region of ρ [ 0 , 1 ] , which decreases from a positive real number to 0, while Y r i ¯ ( ρ ) is an increasing function, which increases from 0 to a positive real number. Thus, Y i r ( ρ ) = Y r i ¯ ( ρ ) has one and only one solution ρ i (intersection), which is the optimum value since ρ is continuous. This shows that the optimal value ρ i can be obtained can be obtained via (41a,b).
Denote ρ min DF = min ( ρ 1 , ρ 2 ) and ρ max DF = max ( ρ 1 , ρ 2 ) . By substituting ρ min DF and ρ max DF into I ( ρ ) , we obtain two suboptimal values I sub , min DF = I ( ρ min DF ) and I sub , max DF = I ( ρ max DF ) . It is easy to notice that I ( ρ min DF Δ ρ ) < I ( ρ min DF ) , because in the range of ρ [ 0 , ρ min DF ] both of I 1 ( ρ ) and I 2 ( ρ ) are increasing functions; and I ( ρ max DF + Δ ρ ) < I ( ρ max DF ) , because in the range of ρ [ ρ max DF , 1 ] both of I 1 ( ρ ) and I 2 ( ρ ) are decreasing functions, where 0 < Δ ρ < 1 and { ρ min DF Δ ρ , ρ max DF + Δ ρ } [ 0 , 1 ] . In the range of [ ρ min DF , ρ max DF ] , I 1 ( ρ ) and I 2 ( ρ ) have opposite monotonicity; thus there exist only one intersection point within the range of [ ρ min DF , ρ max DF ] , which is the maximum value of I ( ρ ) . With the above analysis, we can rewrite I ( ρ ) as shown in (42).

Appendix D

As a simple extension, the two-way relaying system can be treated as two one-way relay systems. We first obtain two suboptimal power splitting designs ρ i , i = 1 , 2 , which maximize I 1 ( ρ ) or maximize I 2 ( ρ ) to obtain I sub , i = I ( ρ i ) .
Note that I i , i = 1 , 2 is determined by Y i r ( ρ ) = C ( 1 ρ ) γ 1 ( κ 1 2 ( 1 ρ ) + κ 2 2 ) γ 1 + 1 and Y r i ¯ ( ρ ) = C η ρ γ i ¯ ( γ 1 + γ 2 ) κ 2 η ρ γ i ¯ ( γ 1 + γ 2 ) + V i ¯ , where i , i ¯ = 1 , 2 , i i ¯ . Through calculation of the second derivation, we find that Y i r ( ρ ) is a decreasing function in the region of ρ [ 0 , 1 ] , which decreases from a positive real number to 0, while Y r i ¯ ( ρ ) is an increasing function, which increases from 0 to a positive real number. Thus, Y i r ( ρ ) = Y r i ¯ ( ρ ) has one and only one solution ρ i (intersection), which is the optimum value since ρ is continuous. This shows that the optimal value ρ i can be obtained can be obtained via (41a,b).
Denote ρ min DF = min ( ρ 1 , ρ 2 ) and ρ max DF = max ( ρ 1 , ρ 2 ) . By substituting ρ min DF and ρ max DF into I ( ρ ) , we obtain two suboptimal values I sub , min DF = I ( ρ min DF ) and I sub , max DF = I ( ρ max DF ) . Notice that I ( ρ min DF Δ ρ ) < I ( ρ min DF ) , because in the range of ρ [ 0 , ρ min DF ] both of I 1 ( ρ ) and I 2 ( ρ ) are increasing functions; and I ( ρ max DF + Δ ρ ) < I ( ρ max DF ) , because in the range of ρ [ ρ max DF , 1 ] both of I 1 ( ρ ) and I 2 ( ρ ) are decreasing functions, where 0 < Δ ρ < 1 and { ρ min DF Δ ρ , ρ max DF + Δ ρ } [ 0 , 1 ] . In the range of [ ρ min DF , ρ max DF ] , I 1 ( ρ ) and I 2 ( ρ ) have opposite monotonicity; thus there exist only one intersection point within the range of [ ρ min DF , ρ max DF ] , which is the maximum value of I ( ρ ) . With the above analysis, we can rewrite I ( ρ ) as shown in (42).

References

  1. Guo, S.; Wang, F.; Yang, Y.; Xiao, B. Energy-Efficient Cooperative Transmission for Simultaneous Wireless Information and Power Transfer in Clustered Wireless Sensor Networks. IEEE Trans. Commun. 2015, 63, 4405–4417. [Google Scholar] [CrossRef]
  2. Ahmed, M.E.; Kim, D.I. Traffic-Pattern Aware Opportunistic Wireless Energy Harvesting in Cognitive Radio Networks. In Proceedings of the 2017 IEEE International Conference on Communications (ICC), Paris, France, 21–25 May 2017; pp. 1–6. [Google Scholar]
  3. Wang, C.; Guo, S.; Yang, Y. An optimization framework for mobile data collection in energy-harvesting wireless sensor networks. IEEE Trans. Mob. Comput. 2016, 15, 2969–2986. [Google Scholar] [CrossRef]
  4. Guo, S.; Wang, C.; Yang, Y. Joint mobile data gathering and energy provisioning in wireless rechargeable sensor networks. IEEE Trans. Mob. Comput. 2014, 13, 2836–2852. [Google Scholar] [CrossRef]
  5. Xiao, L.; Wang, P.; Niyato, D.; Kim, D.I.; Han, Z. Wireless Ne tworks With RF Energy Harvesting: A Contemporary Survey. IEEE Commun. Surv. Tutor. 2015, 17, 757–789. [Google Scholar]
  6. Zhang, R.; Maunder, R.G.; Hanzo, L. Wireless information and power transfer: from scientific hypothesis to engineering practice. IEEE Commun. Mag. 2015, 53, 99–105. [Google Scholar] [CrossRef]
  7. Varshney, L.R. Transporting Information and Energy Simultaneously. In Proceedings of the IEEE International Symposium on Information Theory, Toronto, ON, Canada, 6–11 July 2008; pp. 1612–1616. [Google Scholar]
  8. Zhou, X.; Zhang, R.; Ho, C.K. Wireless information and power transfer: Architecture design and rate-energy tradeoff. IEEE Trans. Commun. 2013, 61, 4754–4767. [Google Scholar] [CrossRef]
  9. Rankov, B.; Wittneben, A. Spectral efficient protocols for half-duplex fading relay channels. IEEE J. Sel. Areas Commun. 2007, 25, 379–389. [Google Scholar] [CrossRef]
  10. Dai, M.; Wang, P.; Zhang, S.; Chen, B.; Wang, H.; Lin, X.; Sun, C. Survey on cooperative strategies for wireless relay channels. Trans. Emerg. Telecommun. Technol. 2014, 25, 926–942. [Google Scholar] [CrossRef]
  11. Nasir, A.A.; Zhou, X.; Durrani, S.; Kennedy, R.A. Relaying protocols for wireless energy harvesting and information processing. IEEE Trans. Wirel. Commun. 2013, 12, 3622–3636. [Google Scholar] [CrossRef]
  12. Yin, S.; Qu, Z.; Zhang, L. Wireless information and power transfer in cooperative communications with power splitting. In Proceedings of the 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA, 6–10 December 2015; pp. 1–6. [Google Scholar]
  13. Chen, Z.; Xu, P.; Ding, Z.; Dai, X. Cooperative transmission in simultaneous wireless information and power transfer networks. IEEE Trans. Veh. Technol. 2016, 65, 8710–8715. [Google Scholar] [CrossRef]
  14. Yu, H.; Wang, D.; Pan, G.; Shi, R.; Zhang, J.; Chen, Y. On outage of WPC system with relay selection over Nakagami-m fading channels. IEEE Trans. Veh. Technol. 2017, 99, 8590–8594. [Google Scholar] [CrossRef]
  15. Chen, Z.; Xia, B.; Liu, H. Wireless information and power transfer in two-way amplify-and-forward relaying channels. In Proceedings of the 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), Atlanta, GA, USA, 3–5 Decemebr 2014; pp. 168–172. [Google Scholar]
  16. Do, T.P.; Song, I.; Kim, Y.H. Simultaneouly wireless information and power transfer in a decode-and-forward two-way relaying network. IEEE Trans. Wirel. Commun. 2017, 13, 1579–1592. [Google Scholar] [CrossRef]
  17. Costa, E.; Pupolin, S. m-QAM-OFDM system performance in the presence of a nonlinear amplifier and phase noise. IEEE Trans. Wirel. Commun. 2002, 50, 462–472. [Google Scholar] [CrossRef]
  18. Schenk, T. RF Imperfections in High-Rate Wireless Systems: Impact and Digital Compensation; Springer International Publishing: Cham, Switzerland, 2008. [Google Scholar]
  19. Bjornson, E.; Debbah, M. A new look at dual-hop relaying: performance limits with hardware impairments. IEEE Trans. Commun. 2013, 61, 4512–4525. [Google Scholar] [CrossRef] [Green Version]
  20. Matthaiou, M.; Papadogiannis, A.; Bjornson, E.; Debbah, M. Two-way relaying under the presence of relay transceiver hardware impairments. IEEE Commun. Lett. 2013, 17, 1136–1139. [Google Scholar] [CrossRef]
  21. Huang, H.; Li, Z.; Ai, B.; Wang, G.; Obaidat, M.S. Impact of hardware impairment on spectrum underlay cognitive multiple relays network. In Proceedings of the 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia, 22–27 May 2016; pp. 1–6. [Google Scholar]
  22. You, J.; Liu, E.; Wang, R.; Su, W. Joint source and relay precoding design for MIMO two-way relay systems with transceiver impairments. IEEE Commun. Lett. 2017, 21, 572–575. [Google Scholar] [CrossRef]
  23. Do, N.T.; Costa, D.B.D.; An, B. Performance analysis of multirelay RF energy harvesting cooperative networks with hardware impairments. IIEEE IET Commun. 2016, 10, 2551–2558. [Google Scholar] [CrossRef]
  24. Nguyen, D.K.; Jayakody, D.N.K.; Chatzinotas, S.; Thompson, J.; Li, J. Wireless energy harvesting assisted two-way cognitive relay networks: protocol design and performance analysis. IEEE Access 2017, 5, 21447–21460. [Google Scholar] [CrossRef]
  25. Holma, H.; Toskala, A. LTE for UMTS: Evolution to LTE-Advanced; Wiley: Hoboken, NJ, USA, 2011. [Google Scholar]
  26. Kim, S.; Devroye, N.; Mitra, P.; Tarokh, V. Achievable rate regions and performance comparison of half duplex bi-directional relaying protocols. IEEE Trans. Inf. Theory 2011, 10, 6405–6418. [Google Scholar] [CrossRef]
  27. Xiong, K.; Shi, Q.; Fan, P.; Leitaief, K.B. Resource allocation for two-way relay networks with symmetric data rates: an information theoretic approach. In Proceedings of the 2013 IEEE International Conference on Communications (ICC), Budapest, Hungary, 9–13 June 2013; pp. 6060–6064. [Google Scholar]
  28. Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products, 4th ed.; Academic Press: Cambridge, MA, USA, 1980. [Google Scholar]
Figure 1. System model: (a) energy harvesting two way relaying networks with hardware impairments; (b) data frame structure of the PS protocol.
Figure 1. System model: (a) energy harvesting two way relaying networks with hardware impairments; (b) data frame structure of the PS protocol.
Sensors 17 02604 g001
Figure 2. The effect of κ ave on Ergodic Capacity for DF (upper) and AF (lower) Protocols.
Figure 2. The effect of κ ave on Ergodic Capacity for DF (upper) and AF (lower) Protocols.
Sensors 17 02604 g002
Figure 3. The effect of d 1 on Ergodic Capacity for DF (left) and AF (right) Protocols.
Figure 3. The effect of d 1 on Ergodic Capacity for DF (left) and AF (right) Protocols.
Sensors 17 02604 g003
Figure 4. The effect of η on Ergodic Capacity for DF (left) and AF (right) Protocols.
Figure 4. The effect of η on Ergodic Capacity for DF (left) and AF (right) Protocols.
Sensors 17 02604 g004
Figure 5. The effect of ρ on Ergodic Capacity for DF (left) and AF (right) Protocols.
Figure 5. The effect of ρ on Ergodic Capacity for DF (left) and AF (right) Protocols.
Sensors 17 02604 g005
Figure 6. Comparison between ergodic capacity and average achievable sum rate versus ρ for DF protocol.
Figure 6. Comparison between ergodic capacity and average achievable sum rate versus ρ for DF protocol.
Sensors 17 02604 g006
Figure 7. Comparison between ergodic capacity and average achievable sum rate versus ρ for AF protocol.
Figure 7. Comparison between ergodic capacity and average achievable sum rate versus ρ for AF protocol.
Sensors 17 02604 g007
Figure 8. Average achievable sum rate comparison versus P t for DF and AF protocols.
Figure 8. Average achievable sum rate comparison versus P t for DF and AF protocols.
Sensors 17 02604 g008
Figure 9. The effect of P t on OPS design for DF and AF protocols.
Figure 9. The effect of P t on OPS design for DF and AF protocols.
Sensors 17 02604 g009
Figure 10. Average achievable sum rate comparison versus κ ave for DF and AF protocols.
Figure 10. Average achievable sum rate comparison versus κ ave for DF and AF protocols.
Sensors 17 02604 g010
Figure 11. The effect of κ ave on OPS design for DF and AF protocols.
Figure 11. The effect of κ ave on OPS design for DF and AF protocols.
Sensors 17 02604 g011
Figure 12. Average achievable sum rate comparison versus d 1 for DF and AF protocols.
Figure 12. Average achievable sum rate comparison versus d 1 for DF and AF protocols.
Sensors 17 02604 g012
Figure 13. The effect of d 1 on OPS design for DF and AF protocols.
Figure 13. The effect of d 1 on OPS design for DF and AF protocols.
Sensors 17 02604 g013

Share and Cite

MDPI and ACS Style

Peng, C.; Li, F.; Liu, H. Wireless Energy Harvesting Two-Way Relay Networks with Hardware Impairments. Sensors 2017, 17, 2604. https://doi.org/10.3390/s17112604

AMA Style

Peng C, Li F, Liu H. Wireless Energy Harvesting Two-Way Relay Networks with Hardware Impairments. Sensors. 2017; 17(11):2604. https://doi.org/10.3390/s17112604

Chicago/Turabian Style

Peng, Chunling, Fangwei Li, and Huaping Liu. 2017. "Wireless Energy Harvesting Two-Way Relay Networks with Hardware Impairments" Sensors 17, no. 11: 2604. https://doi.org/10.3390/s17112604

APA Style

Peng, C., Li, F., & Liu, H. (2017). Wireless Energy Harvesting Two-Way Relay Networks with Hardware Impairments. Sensors, 17(11), 2604. https://doi.org/10.3390/s17112604

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop