Next Article in Journal
Symbol-Level Selective Channel Estimation in Packet-Based OFDM Systems
Next Article in Special Issue
Resource Allocation for Machine-Type Communication of Energy-Harvesting Devices in Wi-Fi HaLow Networks
Previous Article in Journal
Understanding the Washing Damage to Textile ECG Dry Skin Electrodes, Embroidered and Fabric-Based; set up of Equivalent Laboratory Tests
Previous Article in Special Issue
Investigation and Modeling of Multi-Node Body Channel Wireless Power Transfer
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Outage Analysis of Parasitic Ambient Backscatter Communication in Decode-and-Forward Relay Networks with SWIPT

School of Information and Communications Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Sensors 2020, 20(5), 1273; https://doi.org/10.3390/s20051273
Submission received: 31 January 2020 / Revised: 21 February 2020 / Accepted: 25 February 2020 / Published: 26 February 2020
(This article belongs to the Special Issue Sensors and Systems with Energy Harvesting)

Abstract

:
In this paper, we investigate the outage performance of simultaneous wireless information and power transfer (SWIPT) based Decode-and-Forward (DF) relay networks, where the relay needs to simultaneously forward information for two relaying links, primary relaying link and parasitic relaying link. The primary relaying link is the traditional source-relay-destination relay system. While in the parasitic relaying link, the parasitic source, i.e., Internet-of-Things (IoT) tag, is not connected to the stable power source and thus has to backscatter the signals from the primary source to convey its information. The relay not only harvests energy from Radio Frequency (RF) signals from both sources but also forwards messages to their corresponding destinations. The primary source and destination are unaware of the parasitic backscatter transmission, but the relay and parasitic destination can employ successive interference cancellation (SIC) detector to eliminate the interference from the primary link and detect the message from the parasitic source. In order to investigate the interplay between the primary and parasitic relaying links, the outage probabilities of both relaying links are derived. Besides, the effects of system parameters, i.e., power splitting coefficient, forwarding power allocation coefficient and backscatter reflection coefficient, on the system performance are discussed. Simulation results verify our theoretical analysis. In the meanwhile, it is revealed that the advised relaying system has far larger sum throughput than the one with only primary relaying link and the parasitic relaying link can gain considerable throughput at the cost of negligible degradation of primary throughput.

1. Introduction

Backscatter communication enables information transmission by reflecting incident radio frequency (RF) signal and as such enjoys trivial power consumption and low implementation cost. It has been recognized as a promising solution to the massive communication requirements of internet of things (IoT) [1,2,3,4]. Generally speaking, at present there are three main ways to implement backscatter communications, i.e., monostatic, bistatic, and ambient modes [4,5]. In monostatic and bistatic modes, a dedicated carrier transmitter is required to emit excitation RF signal to the backscatter tag. The difference between both modes is that in the monostatic mode the carrier transmitter and information receiver are equipped at the same node and can share the same antenna, and in the bistatic mode carrier transmitter and receiver belong to separate nodes. On the other hand, in ambient backscatter communication (AmBC) mode, the backscatter tag alternatively employs the ambient RF signal as the excitation signal. As IoT is envisioned to provide pervasive and ubiquitous interconnections among various kinds of entities, one of the most significant features of IoT is heterogeneous and compatible with existing networks [6]. For this reason, AmBC can make full use of a mess of various RF signals from heterogeneous wireless networks and has been widely investigated by the research community. To this end, we also focus on AmBC in this paper.
The backscatter tag modulates information onto the incidence RF signal and reflects it to its receiver/reader. The basic principle of backscatter communication is utilizing impedance mismatch to reflect RF signal. Thus, the characteristics of the incidence RF signal can be modified by the tag to convey its information to be transmitted. For examples, On-Off Keying (OOK) [7], Binary Phase Shift Keying (BPSK) [8], Multi-Phase Shift Keying (MPSK) [9], Differential Phase Shift Keying (DPSK) [10], Quadrature Amplitude Modulation (QAM) [11], Multi-frequency-shift Keying (MFSK) [12,13] etc., have been proposed for backscatter communication. Additionally, the Orthogonal Frequency Division Multiplexing (OFDM) signal is exploited to perform AmBC [14,15]. Various detection methods are addressed in [16,17,18,19]. For all these backscatter schemes, the backscattered signal is excited by the incident RF signal. Therefore, except in FSK backscatter scheme, the backscattered signal and ambient RF signal may interfere with each other in certain instances, for example, the tag is close to the legacy receiver. As the FSK backscatter scheme needs extra frequency resources and may not be suitable for massive IoT networks [3], the ambient RF and backscattered signals have the same frequency in our paper.
Along with the rapid development of backscattering technology, AmBC has been applied widely in many wireless systems and incorporated with other advanced wireless technologies. Multi-antenna backscatter tags were considered in order to gain spatial diversity [18,19,20,21,22,23]. The scenarios of multiple backscatter tags were investigated by [5,24,25,26]. In order to prevent the reflected signal from degrading the transmissions of ambient RF signals, the cognitive backscatter tag was proposed in [27,28,29,30]. To improve the energy efficiency of backscatter communication, full-duplex communication was also introduced into backscatter tags [31,32]. In order to achieve high energy efficiency, multiple backscatter tags performing non-orthogonal multiple access (NOMA) was proposed in [33]. Instinctively, the cooperative relaying communications were also incorporated with AmBC. Since the backscatter tag can transmit its information through reflecting incident ambient RF signal, it also can reflect the ambient RF signal to the legacy receiver to improve the reliability of legacy transmission. Then AmBC based relay systems were proposed by [34,35,36]. In [34,35], the ambient RF signal carried no information and the interference from the ambient RF signal was not considered in the AmBC. While the performance of the legacy receiver was not investigated and the non-coherent receiver was employed in [36]. The optimal resource allocation with instantaneous channel state information was addressed for relay-assisted AmBC system in [37]. Based on the two-hop RF signals, the AmBC between relay and the cognitive tag was proposed in [38]. Although the interference from AmBC tag was considered in the primary destination, the secondary AmBC receiver was not interfered by the primary transmission.
Specifically, AmBC naturally causes interference to ambient RF sources. It is of importance to explore interaction and coexistence issues between AmBC and ambient wireless transmissions [39]. Liang et al. in [17,40,41,42] proposed the concept of symbiotic radio to capture the key feature of AmBC and investigated the overall performance of the symbiotic system which incorporates AmBC and other wireless systems. In [17], three practical symbiotic radio schemes, commensal, parasitic, and competitive schemes, were proposed to represent the symbiotic relationship between AmBC and primary transmission. In [40], joint optimal primary transmit power and the reflection coefficient of AmBC tag was studied in different symbiotic setups. A full-duplex AmBC tag in the parasitic scheme was proposed in [41], where the optimization resource allocation was addressed. Furthermore, the symbiotic system consisting of AmBC and NOMA system was proposed in [42,43]. From a practical viewpoint, it is costly to let the IoT backscatter tag fully cooperate with the ambient RF transmitter due to signaling overhead. Considering the transmission quality of the authorized RF signal, the full competition from massive IoT tags is not allowed. Thus, the parasitic AmBC, which means we could only improve the performance of IoT AmBC transmission under the condition that the performance of primary transmission is guaranteed or the performance degradation generated by AmBC is acceptable.
In this paper, we investigate the symbiotic relaying system of AmBC and DF relay networks using SWIPT. To the best of our knowledge, it is the first work concerning the symbiotic relaying system. In our considered symbiotic radio system, there are two source-destination pairs, primary source-destination pair and parasitic source-destination pair. Both pairs have no direct transmission channel, so the DF relay is designed to help both sources to forward messages for their corresponding destinations. Considering the IoT scenario, we assume the relay is not connected to a stable power supply and has to harvest energy from the ambient RF signal. Thus, the DF relay adopts the SWIPT during the source transmission phase. The power splitting structure is adopted at the relay. Thus, the relay can detect the received information signal while harvesting energy (refer to [44] and references therein). If the harvested energy can cover the circuit dissipation, the relay performs DF relaying scheme with the left harvested energy. Furthermore, the relay needs to forward two different messages to both destinations simultaneously, therefore, the power domain NOMA is employed to broadcast regenerated signals. The parasitic relaying transmission is fully compatible with the traditional DF relay scheme. In order to investigate the interplay between primary and parasitic relaying links, we derive the analytical expressions of outage probabilities and throughput of both relaying links. Besides, the effects of system parameters on the system performance are discussed via our theoretical results. Finally, the simulation results verify our theoretical results. We also show that the advised relaying system has far larger sum throughput than the one with only primary relaying link and the parasitic relaying link can gain considerable throughput at the cost of negligible degradation of primary throughput. The main contributions of this paper are summarized as follows:
  • To the best of our knowledge, the scenario, where the DF relay using SWIPT helps the primary source and parasitic AmBC source to forward information for their corresponding destinations, is investigated for the first time.
  • We achieve the analytical expressions of outage probabilities and throughput of both primary and parasitic relaying links. Via the derived theoretical results, we also discuss the effects of the system parameters on the whole system performance.
  • From simulation results, we can see that the considered relaying system has a far larger sum throughput than the one with the only primary relaying link. Besides, it is found that the parasitic relaying link can attain considerable throughput gains at the expense of negligible performance degradation of the primary relaying link. It means that utilizing the provided theoretical results, one can carefully choose the system parameters to drastically improve the system performance of the advised relaying system.
The rest of this paper is structured as follows. Section 2 introduces the transmission scheme, system models and assumptions. In Section 3, the outage probabilities and throughput are derived. Besides, the effects of system parameters are also discussed in Section 3. Numerical and theoretical results are shown in Section 4 to verify our analysis. Finally, we conclude this paper in Section 5.
Notations: P ( A ) denotes the probability of random event A. E { x } is the expectation of random variable x. CN ( μ , σ 2 ) stands for the complex Gaussian distribution with mean μ and variance σ 2 . Exp ( λ ) denotes the exponential distribution with mean 1 / λ . | x | is the magnitude of complex number x.

2. System Model

The considered DF relay network consists of five types of nodes, primary source (PS), tag source (TS), primary destination (PD), tag destination (TD), and relay (R), as illustrated in Figure 1. Due to the possible blockage and severe path loss, PS and TS intend to transmit their information to PD and TD respectively, with the help of DF relay. It is assumed that there is no direct transmission between both source-destination pairs. PS is an active information transmitter while TS, which employs AmBC to convey information, is a passive transmitter. If PS keeps silent, there is no RF signal for TS performing signal reflection. Therefore, the PS-R-PD is the primary relaying link while TS-R-TD is the parasitic relaying link. In practice, PS with stable power supply is usually designed to transmit data with high quality of service (QoS) requirement, e.g., high information rate and reliability. The TS using AmBC always deliveries low rate application, such as measurement data, environment state information or indicator signal [1,2,3,4].
Besides that, the DF relay is not linked to the stable power supply, so that it needs to harvest energy from ambient RF signals. For the PS-R-PD link, h s r and h r d denote the channel coefficients from PT to R and from R to PD, respectively. While, for the parasitic relaying link, h s t , h t r and h r t stand for the channel coefficients of PS-PT, PT-R, and R-TD, respectively. For clarity, we use d a b > 1 to denote the transmission distance which corresponds to channel h a b ; e.g., d s r is the distance from PS to R. The path loss exponent is θ . For convenience, we assume that all channel coefficients follow the independently and identically distributed (i.i.d) complex Gaussian distribution with zero mean and unit variance, e.g., h s r CN ( 0 , 1 ) . That is to say, all channel power gains are i.i.d. exponential distribution with unit mean, e.g., | h s r | 2 Exp ( 1 ) . Additionally, all channels experience quasi-static fading and change from block to block.
Since the relay-assisted AmBC is parasitic on the traditional DF relaying transmission, the whole transmission block is still divided into two phases, source transmitting and relay forwarding phases. The relaying block is shown in Figure 2. In order to let the time-block structure compatible with the traditional DF relaying scheme, we herein adopt the power splitting scheme in the DF relaying network. Suppose the whole transmission duration is T, we allocate T / 2 to the source transmitting phase and the left duration belongs to the relay forwarding phase.

2.1. Models in Source Transmitting Phase

In the source transmitting phase, both PS and TS transmit information to the DF relay using SWIPT. In the considered scenario, PS has L s bits to be delivered to PD while TS tries to convey L c bits to TD. In other words, the target information rates of PS and TS are R s = 2 L s / T and R c = 2 L c / T . Let s and c be the transmitted baseband symbol from PS and TS respectively. In this paper, both s and c are generated from Gaussian codebook and E { | s | 2 } = E { | c | 2 } = 1 . Considering the practical applications, the primary relaying link usually has larger information rate than the parasitic relaying link, i.e., R s R c . The received signal at the relay can be expressed as
y r = P s d s r θ h s r s + P s η d s t θ d t r θ h s t h t r s c + n r = P s d s r θ h s r s + P s η d t θ h t s c + n r ,
where P s is the transmit power of PS and 0 η 1 is the power reflection coefficient of AmBC. We define h t = h s t h t r and d t θ = d s t θ d t r θ . As h s t CN ( 0 , 1 ) and h t r CN ( 0 , 1 ) , the probability density function (PDF) of | h t | 2 is
f | h t | 2 ( x ) = 2 K 0 ( y ) , y 0 ,
where K 0 ( · ) is the zero-order modified Bessel function of the second kind. Note that we omit the reflected antenna noise from the TS for the reason that the reflected noise is degraded by the path loss and becomes negligible [34,45]. n r is the received noise which follows complex Gaussian distribution with zero mean and variance N 0 . The received signal y r is fed into a power splitter with a splitting coefficient α . As Figure 2 α y r is used to harvest energy (EH) and ( 1 α ) y r is employed to perform information detection (ID).
At the energy harvester, the harvested direct current (DC) power is
P e = α ρ P s d s r θ | h s r | 2 + η d t θ | h t | 2 ,
in which 0 ρ 1 is the RF-DC power conversion efficiency. Although we can deduce the PDF of P e with the PDFs of | h t | 2 and | h s r | 2 , the exact expression of PDF of P e makes performance analyzing intractable. Hence, in this paper, considering the severe path loss and power reflection loss, we alternatively evaluate the performance lower-bound with approximation P e α ρ P s d s r θ | h s r | 2 . In practice, ρ depends on the input RF power and appears non-linear behavior with respect to input RF power. While the non-linear power conversion model introduces a considerable complexity when we analyze the statistical performance of wireless-powered communications. As stated in [46], the distribution function of the non-linear energy harvesting (EH) model can be approximately represented by the piecewise linear EH models. Therefore, many works adopt the linear EH model for tractability [44,47,48,49,50]. The DF relay uses all harvested energy to forward its decoded information to PD and TD. Denote the transmit circuit dissipation power with P c , then the total energy consumption is E c = P c T / 2 . The available transmit power of the DF relay is given as
P r = max { P e P c , 0 } .
Obviously, P r = 0 means the relay has no enough harvested energy to forward information.
For information transmission, the first step in the DF relay is to extract information from ( 1 α ) y r . As the strength of backscattered signal from TS to R is always far less than the primary signal from PS to R due to more severe path loss and signal reflection loss, successive interference cancellation (SIC) is applied to detecting s and c in sequence. It means that s is firstly detected and subtracted from ( 1 α ) y r . Then c is detected from the left information signal. Thus, the received signal-to-interference-plus-noise ratio (SINR) with respect to s at relay can be written as
γ r s = ( 1 α ) P s d s r θ | h s r | 2 ( 1 α ) P s η d t θ | h t | 2 + N 0 .
We assume that the ideal channel coding is utilized to protect the information bits. That is to say if γ r s γ th s where γ th s = 2 R s 1 , the relay can recover s successfully. Otherwise, relay cannot obtain s without error. Note that if the detected s is in error, we omit the probability of detecting c successfully in this case, because the detection error of s is propagated to the detector of c and the success probability of detecting c becomes trivial [8]. Consequently, if γ r s < γ th s , the relay does not forward information and the transmission block ends. When s is detected successfully, the received signal-to-plus-noise ratio (SNR) of c at relay is
γ r c = ( 1 α ) P s η d t θ | h t | 2 N 0 .
Similarly, the detection SNR threshold of c is γ th c = 2 R c 1 . If γ r c γ th c , we can recover c with no error.

2.2. Models in Relay Forwarding Phase

By the DF relaying scheme, the relay discards the received message with error and only forwards the information decoded successfully. Therefore, the DF relay acts in one of two cases, only forwarding s and forwarding s and c simultaneously. If the relay does not forward information, the harvested energy is stored in the battery to maintain the system operation and routine. Next, we describe both relaying cases separately.
In the case of only forwarding s, case I, the relay uses P r to transmit s to PD. Then, the received signal at PD is
y d = P r d r d θ h r d s + n d ,
in which n d is the receiver noise following complex Gaussian distribution with zero mean and variance N 0 . In this case, only PD needs to detect s from y d . The SNR on s at PD is
γ d s = P r d r d θ | h r d | 2 N 0 .
While if both s and c are detected correctly, case II, the relay has the ability of forwarding s and c to PD and TD. In order to be compatible with the traditional DF relaying scheme, the relay simultaneously transmits s and c with transmit power P r in the second phase. Let 0 β 1 , then 1 β s + β c is forwarded by the relay. Hence the received signal at PD is
y d = ( 1 β ) P r d r d θ h r d s + β P r d r d θ h r d c + n d .
Similarly, the received signal at TD is
y t = ( 1 β ) P r d r t θ h r t s + β P r d r t θ h r t c + n t ,
where n t is the receiver noise and n t CN ( 0 , N 0 ) . Considering L x L c , we set ( 1 β ) β to guarantee the QoS priority of the primary relaying link. As a result, PD just employs traditional detector to extract s from y d . So, the SINR at PD is
γ d s = ( 1 β ) P r d r d θ | h r d | 2 β P r d r d θ | h r d | 2 + N 0 .
Differently, the TD has to adopt SIC detection to decode c from y t . The SINR of s at TD is
γ t s = ( 1 β ) P r d r t θ | h r t | 2 β P r d r t θ | h r t | 2 + N 0 .
If γ t s γ th s , then s can be successfully decoded by TD and subtracted from y t . Consequently, the SNR of c at TD is expressed as
γ t c = β P r d r t θ | h r t | 2 N 0 .
While if γ t s < γ th s , we also deem that both s and c cannot be decoded without error.

3. Outage Performance Analysis

In this section, we investigate the outage performance of the primary PS-R-PD and parasitic TS-R-TD links. As the harvested energy in the source transmitting phase is used to transmit information in the relay forwarding phase, the two hops in DF relaying scheme are not independent any more. Besides, the parasitic AmBC link affects the primary link. Therefore, we take two hops as a whole to analyze the outage probabilities.

3.1. Outage Probability of Primary Relay Transmission

For the primary relay transmission, successfully transmitting s via PS-R-PD link needs to simultaneously meet three conditions: (1) Relay decodes s without error; (2) Relay harvests enough energy, i.e., P r > 0 ; (3) PD decodes s correctly. Furthermore, as stated in the system model section there are two cases in the relay forwarding phase, case I (only forwarding s) and case II (forwarding s and c simultaneously), according to the results of SIC detection at the DF relay. Let P suc , I s and P suc , II s denote the successful transmission probabilities in cases I and II, respectively. The overall outage probability with respect to s can be expressed as
P out s = 1 P suc , I s P suc , II s .
Next, we derive the expressions of P suc , I s and P suc , II s separately.
Theorem 1.
The probability of successful transmission of s via PS-R-PD in case I, where the relay only forwards s to PD, can be expressed as
P s u c , I s = I 1 + I 2 , if   ϕ < a 0 a 2 + a 1 I 2 , otherwise ,
where
I 1 = a 0 a 2 + a 1 ϕ 2 i = 1 n ω i W a 0 a 2 + a 1 ϕ 2 x i + a 0 a 2 + a 1 + ϕ 2 1 x i , I 2 = 1 2 a 2 K 1 2 a 2 e E c b 0 b 0 2 b 1 b 0 K 1 2 b 1 b 0 b 0 ξ E c 2 i = 1 n ω i V b 0 ξ E c 2 x i + b 0 ξ E c 2 1 x i ,
where x i = cos ( 2 i 1 2 n π ) , and ω i = π n . The definitions of a 0 , a 1 , a 2 , b 0 , b 1 , ϕ, W ( · ) and V ( · ) can be found in (A3), (A4), (A9), and (A13) in Appendix A.
Proof. 
See Appendix A.  □
Theorem 2.
The probability of successful transmission of s via PS-R-PD in case II, where the relay simultaneously forwards s and c to PD and TD, can be expressed as
P suc , I I s = 2 a 2 K 1 ( 2 a 2 ) G ( b 2 ) F ( b 2 ) , if   0 β 1 2 R s , 0 , otherwise .
where G ( · ) and F ( · ) are as defined in (A22) in Appendix B.
Proof. 
See Appendix B.  □
Due to Theorem 1 and 2, the overall outage probability with respect to s can be deduced. In addition, the throughput of the primary PS-R-PD link is given by
κ s = 1 T L s ( 1 P out s ) = 1 2 R s ( 1 P out s ) .

3.2. Outage Probability of Parasitic AmBC Transmission

In contrast to the primary relay transmission, correctly transmitting c through the parasitic AmBC transmission has four conditions: (1) Relay decodes c correctly; (2) Relay harvests enough energy, i.e., P r > 0 ; (3) TD decodes s with no error; (4) TD decodes s successfully. Accordingly, the overall outage probability of c can be written as
P out c = 1 P suc c ,
where
P suc c = P γ r s γ th s , γ r c γ th c , γ d s γ th s , γ d c γ th c , P r > 0 .
Theorem 3.
The probability of successful transmission of c via TS-R-TD can be expressed as
P suc c = 2 a 2 K 1 ( 2 a 2 ) G ( φ ) F ( φ ) ,
where the definition of φ can be found in (A27) in Appendix C.
Proof. 
See Appendix C.  □
Therefore, the throughput of the parasitic TS-R-TD link can be presented as
κ c = 1 T L c ( 1 P out c ) = 1 2 R c ( 1 P out c ) .

3.3. Effects of Parameters

After deriving the outage probability and throughput of two relaying links, we can now investigate the effects of the system parameters on transmission performance. By the derived outage probabilities, all parameters affect the performance of P out s and P out c greatly. Note that ρ stands for the efficiency of RF-DC power converting. Therefore, it is usually preferable to let ρ approach 1 as closely as possible. In practical scenarios, ρ is determined by the rectifier. Next, therefore, we discuss the effects of these three parameters ( α , β , η ) on both relaying links.

3.3.1. Effects of α

As α is involved in a 1 , a 2 and b 0 , there exists great difficulty in investigating the effects of α in a theoretical way. Unavoidably, we have to apply numerical methods to determine the optimal α in this paper. In spite of this, we can explore the asymptotic performance in the extreme cases of α . If α 0 , we have b 0 0 and ϕ . Accordingly, there are P suc , I s = I 2 0 and P suc c 0 . The reason is that the relay cannot harvest any energy on the condition of α = 0 . On the contrary, if α 1 , both a 1 and a 2 converge to infinity. Due to (A2) and (A17), in this case it is easy to know P suc , I s 0 , P suc , II s 0 , and P suc c 0 . The phenomenon can be interpreted as the fact that no information is passed to relay in this case. As a result, we need to choose an optimal α to minimize the outage probability via numerical methods.

3.3.2. Effects of β

Obviously, β just affects the system performance during the relay forwarding phase and is only involved in b 2 [cf. (A3)]. For PD, it is expected that the relay allocates as much power as possible to s. So P suc , II s is a monotonically decreasing function with respect to β and the optimal choice is β = 0 .
However, TD should detect s first and detect c after subtracting s. Thus, we should balance the power allocated to s and c in order to maximize P suc c . Based on (A26), we can rewrite P suc c as
P suc c = ξ exp x γ s N 0 T 2 d r t θ ( 1 β β γ s ) ( b 0 x E c ) Θ ( x ) d x , if   β γ th s γ th c + γ th s + 1 1 , γ th s + 1 1 ξ exp x γ c N 0 T 2 d s r θ β ( b 0 x E c ) Θ ( x ) d x , if   β 0 , γ th s γ th c + γ th s + 1 1
where Θ ( x ) = 2 a 2 K 1 ( 2 a 2 ) 2 x a 1 a 0 K 1 2 x a 1 a 0 . We can see that if β γ th s γ th c + γ th s + 1 1 , γ th s + 1 1 , P suc c is a monotonically decreasing function of β . Differently, if β 0 , γ th s γ th c + γ th s + 1 1 , P suc c increases as β increasing. That is to say the optimal β to maximize P suc c , i.e., to minimize P out c , is
β = γ th s γ th c + γ th s + 1 1 = 2 R s 1 2 R c 1 + 2 R s 1 .
Interestingly, we can see that β is independent of α . It means even if α affects the performance of P out c , it does not influence β . Oppositely, it is apparent that α influences not only the source transmitting phase but also the relay forwarding phase. So, seeking the optimal α to minimize P out c , we should concern β as β affects the performance of the relay forwarding phase. While, for P out s , the optimal β equals to zero (note that we let β 0 in practice). It means the optimal α has no relation to the optimal β to maximize P out s .

3.3.3. Effects of η

Similarly, the expressions of the outage probabilities are so complicated with respect to η , thus we have to apply numerical method to investigate the effects of η on the system performance. There is an evident fact that given all other parameters, η = 0 makes P out s achieve the minimum. This is because all harvested power is used to forward s to PD and there is no interference. For c, increasing η from zero, the strength of the signal reflected by TS becomes greater and it may improve the probability of decoding c without error at the relay. Nonetheless, increasing η also causes a degradation of the probability of decoding s successfully at the relay. As a result, enlarging η is not always the best choice to minimize P out c . We need to find the optimal η via numerical solutions.

4. Simulation

In this section, we show the simulation results to verify our theoretical analysis. The system parameters in simulations follow the default values listed in Table 1, unless otherwise specified. The simulation results are generated by Monte Carlo experiments over 10 6 channel realizations. The theoretical results are obtained by the expressions of the derived outage probabilities. In the figure legends, ‘Sim.’ and ‘The.’ are the abbreviations of simulational and theoretical, respectively.
In Figure 3, the outage probabilities are demonstrated with various information rate configurations. First of all, we can see that all theoretical results fit the simulational results closely. It means our derived expressions of outage probabilities can represent the performance of both primary and parasitic relaying links. As P s raises up, both P out s and P out c constantly decrease. Moreover, under the same rate configuration P out s is always less than P out c given a P s . We consider three information rate configurations in this simulation. For R c = 0.5 bps/Hz, decreasing R s from 1 bps/Hz to 0.5 bps/Hz diminishes not only P out s but also P out s . Nevertheless, for R s = 0.5 bps/Hz, decreasing R c from 0.5 bps/Hz to 0.1 bps/Hz just reduces P out c . This phenomenon shows R s plays a more significant role in transmission performance than R c . The reason is that the precondition of decoding c successfully is that s has been decoded without error. Furthermore, the scenario R s = R c = 0.5 bps/Hz has the maximum performance gap between P out s and P out c among all three scenarios. While the scenario with R s = 0.5 bps/Hz and R c = 0.1 bps/Hz achieves the minimum performance gap. In other words, the larger the rate difference between primary and parasitic relaying links is, the less the outage probability gap is. Therefore, the derived theoretical results provide useful tools for the system designers to determine system parameters according to the required transmission QoS.
The effects of power splitting coefficient α on outage probabilities are illustrated in Figure 4. Obviously, the simulation results verify our theoretical results well. Given an α , the larger transmit power P s brings in lower outage probability. When α = 0 , the relay can not harvest any RF energy and has to stop forwarding information. So the outage probabilities equal to 1. As α increasing, the relay harvests more and more energy to forward information during the relay forwarding phase. Thus, P out s and P out c start to decrease. When α 0.6 , P out s and P out c achieve almost the same performance. While, when α > 0.6 , the performance gap between P out s and P out c gradually appears. The reason is R can simultaneously successfully decode s and c in most cases when α < 0.6 . So, P out s and P out c have nearly the same values. However, when α > 0.6 , increasing α lowers the growth of probability of decoding s successfully at R and produces more harm to decoding c successfully due to the SIC detector. As s result, the outage gap appears. We also can see that given P s , P out c apparently has the minimum value over α [ 0 , 1 ] . As for P out s , the optimal α generating minimum P out approaches 1 extremely closely, e.g., the optimal α is about 0.98 when P s = 40 dBm. This is because the extremely high α produces large harvested energy and nearly no c can be received successfully at R. In this case, although the probability of decoding s correctly becomes lower, R could own large transmit power to forward s to PD with almost no interference. Given that in the source transmitting phase s and c always interference each other, it is obviously to deduce that the optimal α tends to allocate more energy to the R-PD transmission without interference.
That is to say that P out s and P out c own different optimal power splitting coefficients. When α = 1 , both P out s and P out c converge to 1 again because of information link interruption. Then our analysis on the effect of α is also verified. Comparing these three scenarios with different P s , it is observed that the optimal α occurs at the same P s and it is independent on P s . From Figure 4, it is concluded that we have to carefully choose α to balance the performance of primary and parasitic relaying links. In Table 1, we let α = 0.9 to make both P out s and P out c achieve favorable performance.
In Figure 5, we show the performance of P out s and P out c versus power allocation coefficient β . In this simulation, we set R s = 1 bps/Hz and R c = 0.5 bps/Hz. Therefore, by (23) the optimal power allocation coefficient is β 0.22 for P out c . Then, the feasible region of β is [ 0 , 0.5 ) . The curves of P out c in Figure 5 also show that β = 0.22 makes minimum P out c . On the contrary, P out s increases as β rises. These results verify our analysis on the effects of β . When β = 0 , P out s reaches the minimum value because all relay transmit power P r is allocated to s. Differently, if β = 1 , although total P r is used to forward c, P out c still converges to 1. The reason is that SIC detector at TD cannot decode c successfully under the condition of P out s = 1 . By this figure, it is shown that β also affects P out s and P out c greatly and we need to adjust β to coordinate the performance of both relaying links. In practice, the QoS requirement of primary relaying link should be satisfied as far as possible. With the primary QoS constraint, the outage probability of parasitic relaying link could be minimized through optimizing β . For example, in the scenario P s = 30 dBm, if the constraint is P out s 0.02 , the optimal β is 0.22 to minimize P out c . While, if we let P out s 0.03 , β should be larger than 0.36. Therefore, the optimal β for P out c is 0.36, since β is out of the feasible range.
The effects of reflection coefficient η on outage probabilities are investigated in Figure 6. It is notable that P out c decreases and P out s nearly keep constant as η increases in the cases of P s = 20 dBm and P s = 30 dBm. This is because the reflected signal by TS interferes with the primary link slightly. Therefore, in both cases, we can reduce P out c via enhancing η while bringing in trivial impact on P out s . In other words, the performance of parasitic relaying link can be improved at the expense of negligible performance degradation of primary relaying link. However, the aforementioned conclusion does not hold if P s = 40 dBm. We can see that as η increases P out s becomes larger and larger. The reason is the power of reflection signal conveying c is proportional to P s η . When P s and η are large enough, e.g., P s = 40 dB and η > 0.1 , the signal reflected by TS incurs considerable interference to the primary link. Therefore, increasing η increases P out s in the case of P s = 40 dB. Furthermore, the increasing P out s finally enlarges P out c a little. It is also shown we can choose a suitable η to meet the QoS requirements of primary and parasitic relaying links.
In Figure 7, average throughput versus P s are depicted. Note that κ r stands for the average throughput of the system with only a primary relaying link, i.e., η = 0 and β = 0 . Here, κ sum is the sum throughput, i.e., κ sum = κ s + κ c . Herein we draw κ r and κ sum to demonstrate the throughput gain and advantage of the parasitic relaying link. As P s increases, all four types of throughput increase and approach corresponding performance limits. Observing the throughput performance over P s [ 5 dBm , 35 dBm ] , the considered parasitic relaying link can gain certain throughput at the expense of sacrificing a little throughput of the primary relaying link. It is worth pointing out that the sum throughput κ sum outperforms κ r when P s > 10 dBm. That is to say, the parasitic relaying link can attain throughput gains than the traditional SWIPT relaying system which just forwards s. Not only that, when P s > 35 dBm, κ s approaches κ r closely. It means the throughput degradation caused by parasitic relaying link can be eliminated in the high transmit power scenario and the parasitic relaying link can gain considerable throughput at no additional expense.

5. Conclusions

In conclusion, we have studied AmBC, which is parasitic on a relay system that employs simultaneous wireless information and power transfer and decode-and-forward. The relay is responsible for forwarding information both for the primary source and for the AmBC tag source. Both the relay and the tag destination perform successive interference cancellation to eliminate the interference from the primary source and detect the message from tag source. We presented a careful analysis of the outage probabilities of both the primary and parasitic relaying transmissions. The analytical expressions obtained to enable a system designer to perform optimization on the system parameters. Specifically, we have studied the effects of three system parameters, namely power splitting coefficient, forwarding power allocation coefficient and the AmBC reflection coefficient, on the system performance. Simulation results show that the considered relay system achieves more sum throughput than the original relay system. It is also found that the parasitic relaying link is able to achieve sizable throughput at the cost of negligible degradation of the relay system without AmBC tag.

Author Contributions

Conceptualization, Y.T. and C.Z.; methodology and formal analysis, Y.T.; validation, Y.T., C.Z.; writing—original draft preparation and editing, C.Z.; supervision, C.Z.; project administration, C.Z.; funding acquisition, C.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported in part by the Key Research and Development Program of Shaanxi Province.

Acknowledgments

The authors would like to express their thanks and appreciation to Zhengdao Wang for his valuable suggestion and comments.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, and in the decision to publish the results.

Appendix A. Proof of Theorem 1

In the case I, in the light of the system model, we have
P suc , I s = P ( γ r s γ th s , γ r c < γ th c , γ d s γ th s , P r > 0 ) .
Substituting (5), (6), (8), and (4) into (A1) and after some manipulations, we have
P suc , I s = P | h t | 2 | h s r | 2 a 1 a 0 , | h t | 2 < a 2 , | h s r | 2 E c b 0 + b 1 | h r d | 2 , | h s r | 2 > E c b 0 ,
in which
a 0 = η γ th s d t θ d s r θ a 1 = γ th s N 0 P s d s r θ ( 1 α ) a 2 = γ th c N 0 P s η d t θ ( 1 α ) b 0 = P s α ρ d s r θ T 2 b 1 = γ th s N 0 d r d θ T 2 .
Based on (A2), we can see that if | h s r | 2 max E c b 0 , a 1 , it is obvious that P suc , I s = 0 , which means s cannot be transmitted successfully under this condition. Therefore, we just need to investigate the performance under the condition
| h s r | 2 > ϕ = : max E c b 0 , a 1 .
Moreover, comparing | h s r | 2 a 1 a 0 to a 2 , we can rewrite (A2) as
P suc , I s = P | h t | 2 | h s r | 2 a 1 a 0 , | h s r | 2 > ϕ , | h s r | 2 a 0 a 2 + a 1 , | h r d | 2 b 1 b 0 | h s r | 2 E c I 1 + P | h t | 2 < a 2 , | h s r | 2 > ϕ , | h s r | 2 > a 0 a 2 + a 1 , | h r d | 2 > b 1 p 0 | h s r | 2 E c I 2 .
Nest, we separately give the expressions of I 1 and I 2 .
For I 1 , if ϕ a 0 a 2 + a 1 , then I 1 = 0 . If ϕ < a 0 a 2 + a 1 , I 1 can be rewritten by
I 1 = P | h t | 2 | h s r | 2 a 1 a 0 , ϕ < | h s r | 2 a 0 a 2 + a 1 , | h r d | 2 b 1 b 0 | h s r | 2 E c = ϕ a 0 a 2 + a 1 e x P | h t | 2 x a 1 a 0 P | h r d | 2 b 1 b 0 x E c d x .
Due to h r d CN ( 0 , 1 ) , it is obvious that
P | h r d | 2 b 1 b 0 x E c = e b 1 b 0 x E c
Utilizing the PDF of | h t | 2 in (2), we have
P | h t | 2 x a 1 a 0 = 0 x a 1 a 0 2 K 0 ( x ) d x = 1 2 x a 1 a 0 K 1 2 x a 1 a 0 ,
where K 1 ( · ) the first-order modified Bessel function of the second kind. Substituting (A7) and (A8) into (A6), we can express I 1 as
ϕ a 0 a 2 + a 1 e x b 1 b 0 x E c 1 2 x a 1 a 0 K 1 2 x a 1 a 0 W ( x ) d x .
Although (A9) is a definite integral, it is intractable mathematically. Alternatively, we can resort to the n-point Chebyshev-Gauss Quadrature [52] to approximately express (A9) as
I 1 a 0 a 2 + a 1 ϕ 2 i = 1 n ω i W a 0 a 2 + a 1 ϕ 2 x i + a 0 a 2 + a 1 + ϕ 2 1 x i ,
where x i = cos ( 2 i 1 2 n π ) , ω i = π n , and n controls the exactness of the computed integral.
For I 2 , define ξ = max a 0 a 2 + a 1 , E c b 0 , there is
I 2 = P | h t | 2 < a 2 P | h s r | 2 > ξ , | h r d | 2 > b 1 b 0 | h s r | 2 E c .
Like (A8), it can be expressed as
P | h t | 2 < a 2 = 1 2 a 2 K 1 2 a 2 .
Furthermore, we have
P | h s r | 2 > ξ , | h r d | 2 > b 1 b 0 | h s r | 2 E c   = ξ e x P | h r d | 2 > b 1 b 0 x E c d x   = ξ e x b 1 b 0 x E c d x = ( a ) e E c b 0 b 0 b 0 ξ E c e t b 0 b 1 t d t   = ( b ) e E c b 0 b 0 2 b 1 b 0 K 1 2 b 1 b 0 0 b 0 ξ E c e t b 0 b 1 t V ( t ) d t .
In step ( a ) , we let b 0 x E c = t and step ( b ) refers to ([53], eq. (3.324)). Following also the n-point Chebyshev-Gauss Quadrature, we have
0 b 0 ξ E c V ( t ) d t b 0 ξ E c 2 i = 1 n ω i V b 0 ξ E c 2 x i + b 0 ξ E c 2 1 x i .
Then, substituting (A12)–(A14) into (A11), we can obtain the expression of I 2 . So there is
P suc , I s = I 1 + I 2 , if   ϕ < a 0 a 2 + a 1 , I 2 , otherwise , ,
which is the desired result.

Appendix B. Proof of Theorem 2

In the case II, like (A1), there is
P suc , II s = P γ r s γ th s , γ t c γ th c , γ d s γ th s , P r > 0 .
Following the similar derivation in (A2), P suc , II s can be rewritten as
P suc , II s = P a 2 | h t | 2 | h s r | 2 a 1 a 0 , | h r d | 2 b 2 b 0 | h s r | 2 E c , | h s r | 2 > ξ ,
where
b 2 = γ th s N 0 ( 1 β β γ th s ) d r d θ T 2 .
Obviously, if b 2 < 0 , P suc , II s = 0 . It represents the event that when the relay simultaneously transmits s and c to PD, s cannot be received correctly. This situation leads to energy inefficiency. To avoid such situation, we should choose β to make b 2 > 0 ; i.e., 0 β 1 2 R s . Meanwhile, recall that in the analysis in the case I, there is no extra constraint on β . As the system performance depends on the statistical channel state information (CSI), to make PD receive s successfully with a non-vanishing probability in both cases, we force 0 β 1 2 R s to hold.
Considering | h s r | Exp ( 1 ) , P suc , II s can be further written as
P suc , II s = ξ e x P a 2 | h t | 2 x a 1 a 0 P | h r d | 2 b 2 b 0 x E c d x .
Since | h r d | 2 Exp ( 1 ) , we can obtain
P | h r d | 2 b 2 p 0 x E c = e b 2 p 0 x E c .
By the PDF of | h t | 2 , we have
P a 2 | h t | 2 x a 1 a 0 = 2 a 2 K 1 ( 2 a 2 ) 2 x a 1 a 0 K 1 2 x a 1 a 0 .
Therefore, under the constraint 0 β 1 2 R s , the successful transmission probability of s in case II can be expressed as in (A22).
P suc , II s = ξ e x b 2 b 0 x E c 2 a 2 K 1 ( 2 a 2 ) 2 x a 1 a 0 K 1 2 x a 1 a 0 d x = 2 a 2 K 1 ( 2 a 2 ) ξ e x b 2 b 0 x E c d x G ( b 2 ) ξ e x b 2 b 0 x E c 2 x a 1 a 0 K 1 2 x a 1 a 0 d x F ( b 2 )
Due to the derivation from (A13) to (A14), we can deduce
G ( b 2 ) e E c b 0 b 0 2 b 2 b 0 K 1 2 b 2 b 0 b 0 ξ E c 2 i = 1 n ω i V b 0 ξ E c 2 x i + b 0 ξ E c 2 1 x i .
Unfortunately, we cannot find an analytical expression of F ( b 2 ) . We can resort to Gauss–Laguerre Quadrature [52] to evaluate F ( b 2 ) , i.e.,
F ( b 2 ) e ξ i = 1 n ν i e b 2 b 0 z i ξ E c 2 z i ξ a 1 a 0 · K 1 2 z i ξ a 1 a 0 ,
where nodes ν i and weights z i can be found in [52].
In summary, if 0 β 1 2 R s , then
P suc , II s = 2 a 2 K 1 ( 2 a 2 ) G ( b 2 ) F ( b 2 ) ,
and if β > 1 2 R s , P suc , II s = 0 . Therefore, Theorem 2 is proven.

Appendix C. Proof of Theorem 3

Substitute the expressions of γ r s , γ r c , γ d s and γ d c into (19), after some manipulations, we have
P suc c = P a 2 < | h t | 2 < | h s r | 2 a 1 a 0 , | h s r 2 > ξ , | h r t | 2 > φ b 0 | h s r | 2 E c = ξ e x P a 2 < | h t | 2 < x a 1 a 0 P | h r t | 2 > φ b 0 x E c d x = ξ e x φ b 0 x E c 2 a 2 K 1 ( 2 a 2 ) 2 x a 1 a 0 K 1 2 x a 1 a 0 d x = 2 a 2 K 1 ( 2 a 2 ) G ( φ ) F ( φ ) ,
where
φ = max γ s N 0 T 2 d r t θ ( 1 β β γ s ) , γ c N 0 T 2 d s r θ β .
Therefore, Theorem 3 is proven.

References

  1. Huynh, N.V.; Hoang, D.T.; Lu, X.; Niyato, D.; Wang, P.; Kim, D.I. Ambient backscatter communications: A contemporary survey. IEEE Commun. Surv. Tutorials 2018, 20, 2889–2922. [Google Scholar] [CrossRef] [Green Version]
  2. Clerckx, B.; Zhang, R.; Schober, R.; Ng, D.W.K.; Kim, D.I.; Poor, H.V. Fundamentals of wireless information and power transfer: From RF energy harvester models to signal and system designs. IEEE J. Sel. Areas Commun. 2019, 37, 4–33. [Google Scholar] [CrossRef] [Green Version]
  3. Bletsas, A.; Alevizos, P.N.; Vougioukas, G. The Art of Signal Processing in Backscatter Radio for μW (or Less) Internet of Things: Intelligent Signal Processing and Backscatter Radio Enabling Batteryless Connectivity. IEEE Signal Process. Mag. 2018, 35, 28–40. [Google Scholar] [CrossRef]
  4. Xu, C.; Yang, L.; Zhang, P. Practical Backscatter Communication Systems for Battery-Free Internet of Things: A Tutorial and Survey of Recent Research. IEEE Signal Process. Mag. 2018, 35, 16–27. [Google Scholar] [CrossRef]
  5. Mishra, D.; Larsson, E.G. Sum Throughput Maximization in Multi-Tag Backscattering to Multiantenna Reader. IEEE Trans. Commun. 2019, 67, 5689–5705. [Google Scholar] [CrossRef]
  6. Xu, K.; Qu, Y.; Yang, K. A tutorial on the internet of things: from a heterogeneous network integration perspective. IEEE Netw. 2016, 30, 102–108. [Google Scholar] [CrossRef] [Green Version]
  7. Zhao, W.; Wang, G.; Fan, R.; Fan, L.S.; Atapattu, S. Ambient Backscatter Communication Systems: Capacity and Outage Performance Analysis. IEEE Access 2018, 6, 22695–22704. [Google Scholar] [CrossRef]
  8. Yang, G.; Zhang, Q.; Liang, Y.C. Cooperative Ambient Backscatter Communications for Green Internet-of-Things. IEEE Internet Things J. 2018, 5, 1116–1130. [Google Scholar] [CrossRef] [Green Version]
  9. Qian, J.; Parks, A.N.; Smith, J.R.; Gao, F.; Jin, S. IoT Communications with M -PSK Modulated Ambient Backscatter: Algorithm, Analysis, and Implementation. IEEE Internet Things J. 2019, 6, 844–855. [Google Scholar] [CrossRef]
  10. Qian, J.; Gao, F.; Wang, G. Signal detection of ambient backscatter system with differential modulation. In Proceedings of the 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Shanghai, China, 20–25 March 2016; pp. 3831–3835. [Google Scholar]
  11. Correia, R.; Carvalho, N.B. Dual-band high order modulation ambient backscatter. In Proceedings of the 2018 IEEE/MTT-S International Microwave Symposium - IMS, Philadelphia, PA, USA, 10–15 June 2018; pp. 270–273. [Google Scholar]
  12. Tao, Q.; Zhong, C.; Huang, K.; Chen, X.; Zhang, Z. Ambient Backscatter Communication Systems with MFSK Modulation. IEEE Trans. Wirel. Commun. 2019, 18, 2553–2564. [Google Scholar] [CrossRef]
  13. Vougioukas, G.; Bletsas, A. Switching frequency techniques for universal ambient backscatter networking. IEEE J. Sel. Areas Commun. 2019, 37, 464–477. [Google Scholar] [CrossRef]
  14. Yang, G.; Liang, Y.C.; Zhang, R.; Pei, Y. Modulation in the air: Backscatter communication over ambient OFDM carrier. IEEE Trans. Commun. 2018, 66, 1219–1233. [Google Scholar] [CrossRef] [Green Version]
  15. ElMossallamy, M.A.; Pan, M.; Jantti, R.; Seddik, K.G.; Li, G.Y.; Han, Z. Noncoherent backscatter communications over ambient OFDM signals. IEEE Trans. Commun. 2019, 67, 3597–3611. [Google Scholar] [CrossRef]
  16. Tao, Q.; Zhong, C.; Lin, H.; Zhang, Z. Symbol Detection of Ambient Backscatter Systems with Manchester Coding. IEEE Trans. Wirel. Commun. 2018, 17, 4028–4038. [Google Scholar] [CrossRef] [Green Version]
  17. Guo, H.; Liang, Y.-C.; Long, R.; Zhang, Q. Cooperative Ambient Backscatter System: A Symbiotic Radio Paradigm for Passive IoT. IEEE Wirel. Commun. Lett. 2019, 8, 1191–1194. [Google Scholar] [CrossRef]
  18. Chen, C.; Wang, G.; He, R.; Gao, F.; Li, Z. Semi-blind detection of ambient backscatter signals from multiple-antenna tags. In Proceedings of the 2018 24th Asia-Pacific Conference on Communications (APCC), Ningbo, China, 12–14 November 2018; pp. 570–575. [Google Scholar]
  19. Zhang, Y.; Gao, F.; Fan, L.; Lei, X.; Karagiannidis, G.K. Backscatter communications over correlated nakagami-m fading channels. IEEE Trans. Commun. 2019, 67, 1693–1704. [Google Scholar] [CrossRef]
  20. Guo, H.; Zhang, Q.; Xiao, S.; Liang, Y.C. Exploiting Multiple Antennas for Cognitive Ambient Backscatter Communication. IEEE Internet Things J. 2019, 6, 765–775. [Google Scholar] [CrossRef]
  21. Duan, R.; Jantti, R.; ElMossallamy, M.; Han, Z.; Pan, M. Multi-antenna receiver for ambient backscatter communication systems. In Proceedings of the 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Kalamata, Greece, 25–28 June 2018; pp. 1–5. [Google Scholar]
  22. Chen, C.; Wang, G.; Fan, L.; Verde, F.; Guan, H. Detection of ambient backscatter signals from multiple-antenna tags. In Proceedings of the 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Kalamata, Greece, 25–28 June 2018; pp. 1–5. [Google Scholar]
  23. Tao, Q.; Zhong, C.; Chen, X.; Wu, Q.; Zhang, Z. Ambient backscatter communication systems with multi-antenna reader. In Proceedings of the 2018 24th Asia-Pacific Conference on Communications (APCC), Ningbo, China, 12–14 November 2018; pp. 245–250. [Google Scholar]
  24. Zhu, G.; Ko, S.W.; Huang, K. Inference from Randomized Transmissions by Many Backscatter Sensors. IEEE Trans. Wirel. Commun. 2018, 17, 3111–3127. [Google Scholar] [CrossRef]
  25. Zawawi, Z.B.; Huang, Y.; Clerckx, B. Multiuser Wirelessly Powered Backscatter Communications: Nonlinearity, Waveform Design, and SINR-Energy Tradeoff. IEEE Trans. Wirel. Commun. 2019, 18, 241–253. [Google Scholar] [CrossRef] [Green Version]
  26. Zhang, Y.; Gao, F.; Fan, L.; Lei, X.; Karagiannidis, G.K. Secure Communications for Multi-tag Backscatter Systems. IEEE Wirel. Commun. Lett. 2019, 8, 1146–1149. [Google Scholar] [CrossRef]
  27. Kang, X.; Liang, Y.C.; Yang, J. Riding on the Primary: A New Spectrum Sharing Paradigm for Wireless-Powered IoT Devices. IEEE Trans. Wirel. Commun. 2018, 17, 6335–6347. [Google Scholar] [CrossRef]
  28. Lyu, B.; Guo, H.; Yang, Z.; Gui, G. Throughput Maximization for Hybrid Backscatter Assisted Cognitive Wireless Powered Radio Networks. IEEE Internet Things J. 2018, 5, 2015–2024. [Google Scholar] [CrossRef]
  29. Darsena, D.; Gelli, G.; Verde, F. Cloud-Aided Cognitive Ambient Backscatter Wireless Sensor Networks. IEEE Access 2019, 7, 57399–57414. [Google Scholar] [CrossRef]
  30. Kishore, R.; Gurugopinath, S.; Sofotasios, P.C.; Muhaidat, S.; Al-Dhahir, N. Opportunistic Ambient Backscatter Communication in RF-Powered Cognitive Radio Networks. IEEE Trans. Cogn. Commun. Netw. 2019, 5, 413–426. [Google Scholar] [CrossRef] [Green Version]
  31. Yang, G.; Yuan, D.; Liang, Y.; Zhang, R.; Leung, V.C. Optimal resource allocation in full-duplex ambient backscatter communication networks for wireless-powered iot. IEEE Internet of Things J. 2019, 6, 2612–2625. [Google Scholar] [CrossRef] [Green Version]
  32. Xiao, S.; Guo, H.; Liang, Y. Resource allocation for full-duplex-enabled cognitive backscatter networks. IEEE Trans. Wirel. Commun. 2019, 18, 3222–3235. [Google Scholar] [CrossRef]
  33. Guo, J.; Zhou, X.; Durrani, S.; Yanikomeroglu, H. Design of non-orthogonal multiple access enhanced backscatter communication. IEEE Trans. Wirel. Commun. 2018, 17, 6837–6852. [Google Scholar] [CrossRef] [Green Version]
  34. Gong, S.; Huang, X.; Xu, J.; Liu, W.; Wang, P.; Niyato, D. Backscatter Relay Communications Powered by Wireless Energy Beamforming. IEEE Trans. Commun. 2018, 66, 3187–3200. [Google Scholar] [CrossRef]
  35. Jia, X.; Zhou, X. Performance Characterisation of Relaying Using Backscatter Devices. CoRR 2019. Available online: http://arxiv.org/abs/1904.01323 (accessed on 25 February 2020).
  36. Yan, W.; Li, L.; He, G.; Li, X.; Gao, A.; Zhang, H.; Han, Z. Performance analysis of two-way relay system based on ambient backscatter. In Proceedings of the 2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), Wuhan, China, 31 May–2 June 2018; pp. 1853–1858. [Google Scholar]
  37. Lyu, B.; Yang, Z.; Guo, H.; Tian, F.; Gui, G. Relay cooperation enhanced backscatter communication for internet-of-things. IEEE Internet Things J. 2019, 6, 2860–2871. [Google Scholar] [CrossRef]
  38. Shah, S.T.; Choi, K.W.; Lee, T.; Chung, M.Y. Outage probability and throughput analysis of swipt enabled cognitive relay network with ambient backscatter. IEEE Internet Things J. 2018, 5, 3198–3208. [Google Scholar] [CrossRef]
  39. Ruttik, K.; Duan, R.; Jäntti, R.; Han, Z. Does ambient backscatter communication need additional regulations? In Proceedings of the 2018 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN), Seoul, Korea, 22–25 October 2018; pp. 1–6. [Google Scholar]
  40. Guo, H.; Liang, Y.C.; Long, R.; Xiao, S.; Zhang, Q. Resource Allocation for Symbiotic Radio System with Fading Channels. IEEE Access 2019, 7, 34333–34347. [Google Scholar] [CrossRef]
  41. Long, R.; Guo, H.; Zhang, L.; Liang, Y.C. Full-Duplex Backscatter Communications in Symbiotic Radio Systems. IEEE Access 2019, 7, 21597–21608. [Google Scholar] [CrossRef]
  42. Zhang, Q.; Zhang, L.; Liang, Y.C.; Kam, P.Y. Backscatter-NOMA: A Symbiotic System of Cellular and Internet-of-Things Networks. IEEE Access 2019, 7, 20000–20013. [Google Scholar] [CrossRef]
  43. Li, Y.; Jiang, M.; Zhang, Q.; Qin, J. Secure Beamforming in MISO NOMA Backscatter Device Aided Symbiotic Radio Networks. CoRR 2019, 1–4. Available online: http://arxiv.org/abs/1906.03410 (accessed on 25 February 2020).
  44. Ye, Y.; Li, Y.; Wang, D.; Zhou, F.; Hu, R.Q.; Zhang, H. Optimal Transmission Schemes for DF Relaying Networks Using SWIPT. IEEE Trans. Veh. Technol. 2018, 67, 7062–7072. [Google Scholar] [CrossRef]
  45. Lyu, B.; Hoang, D.T.; Yang, Z. User Cooperation in Wireless-Powered Backscatter Communication Networks. IEEE Wirel. Commun. Lett. 2019, 8, 632–635. [Google Scholar] [CrossRef]
  46. Alevizos, P.N.; Bletsas, A. Sensitive and Nonlinear Far-Field RF Energy Harvesting in Wireless Communications. IEEE Trans. Wirel. Commun. 2018, 17, 3670–3685. [Google Scholar] [CrossRef] [Green Version]
  47. Hoang, D.T.; Niyato, D.; Wang, P.; Kim, D.I.; Han, Z. Ambient Backscatter: A New Approach to Improve Network Performance for RF-Powered Cognitive Radio Networks. IEEE Trans. Commun. 2017, 65, 3659–3674. [Google Scholar] [CrossRef]
  48. Li, D.; Peng, W.; Liang, Y.C. Hybrid Ambient Backscatter Communication Systems With Harvest-Then-Transmit Protocols. IEEE Access 2018, 6, 45288–45298. [Google Scholar] [CrossRef]
  49. Kim, S.H.; Kim, D.I. Hybrid Backscatter Communication for Wireless-Powered Heterogeneous Networks. IEEE Trans. Wirel. Commun. 2017, 16, 6557–6570. [Google Scholar] [CrossRef]
  50. Ma, Z.H.E.; He, C.; Rao, Y.; Jiang, J.; Ma, S.; Gao, F.; Xing, L. Time- and Power-Splitting Strategies for Ambient Backscatter System. IEEE Access 2019, 7, 40068–40077. [Google Scholar] [CrossRef]
  51. Kong, H.; Flint, I.; Wang, P.; Niyato, D.; Privault, N. Exact performance analysis of ambient RF energy harvesting wireless sensor networks with Ginibre point process. IEEE J. Sel. Areas Commun. 2016, 34, 3769–3784. [Google Scholar] [CrossRef]
  52. Olver, F.W.J.; Olde Daalhuis, A.B.; Lozier, D.W.; Schneider, B.I.; Boisvert, R.F.; Clark, C.W.; Miller, B.R.; Saunders, B.V. NIST Digital Library of Mathematical Functions. Release 1.0.23 of 2019-06-15. Ann. Math. Artif. Intell. 2003, 38. Available online: http://dlmf.nist.gov/ (accessed on 25 February 2020).
  53. Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products, 7th ed.; Elsevier/Academic Press: Amsterdam, The Netherlands, 2007. [Google Scholar]
Figure 1. System model.
Figure 1. System model.
Sensors 20 01273 g001
Figure 2. Illustration of transmission time-block.
Figure 2. Illustration of transmission time-block.
Sensors 20 01273 g002
Figure 3. Outage probabilities versus P s with different information rates.
Figure 3. Outage probabilities versus P s with different information rates.
Sensors 20 01273 g003
Figure 4. Outage probabilities versus α with different P s .
Figure 4. Outage probabilities versus α with different P s .
Sensors 20 01273 g004
Figure 5. Outage probabilities versus β with different P s .
Figure 5. Outage probabilities versus β with different P s .
Sensors 20 01273 g005
Figure 6. Outage probabilities versus η with different P s .
Figure 6. Outage probabilities versus η with different P s .
Sensors 20 01273 g006
Figure 7. Average throughput versus P s .
Figure 7. Average throughput versus P s .
Sensors 20 01273 g007
Table 1. Parameters in simulations.
Table 1. Parameters in simulations.
SymbolDefinitionDefault Value
P s PS transmit power30 dBm
d s r Distance from PS to R10 m
d s t Distance from PS to TS12 m
d t r Distance from TS to R5 m
d r d Distance from R to PD10 m
d r t Distance from R to TD10 m
ρ RF-DC power conversion efficiency1
α Power splitting coefficient0.9
β Power allocation coefficient0.4
η Reflection coefficient0.6
P c Circuit dissipation power15.8 μ W [51]
θ Path-loss exponential3
R s Information rate of PS1 bit/s/Hz
R c Information rate of TS0.5 bit/s/Hz
TTransmission block length1 s
N 0 Receiver noise power−65 dBm

Share and Cite

MDPI and ACS Style

Tuo, Y.; Zhang, C. Outage Analysis of Parasitic Ambient Backscatter Communication in Decode-and-Forward Relay Networks with SWIPT. Sensors 2020, 20, 1273. https://doi.org/10.3390/s20051273

AMA Style

Tuo Y, Zhang C. Outage Analysis of Parasitic Ambient Backscatter Communication in Decode-and-Forward Relay Networks with SWIPT. Sensors. 2020; 20(5):1273. https://doi.org/10.3390/s20051273

Chicago/Turabian Style

Tuo, Yanhong, and Chao Zhang. 2020. "Outage Analysis of Parasitic Ambient Backscatter Communication in Decode-and-Forward Relay Networks with SWIPT" Sensors 20, no. 5: 1273. https://doi.org/10.3390/s20051273

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