# Wireless Energy Harvesting for Cognitive Multihop Wireless Sensor Networks

Authors: Van-Dinh Nguyen; Hieu V. Nguyen; Oh-Soon Shin
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

This paper analyzes the performance of cognitive multihop transmissions with wireless energy harvesting in a wireless sensor network. Data transmission between the source and the destination nodes is assumed to occur entirely via several clusters of decode-and-forward relays. The source node and relay nodes are assumed to have the ability to harvest energy from the surrounding signals and to use that harvested energy to forward the information to the next hop. Specifically, we derive an exact closed-form expression to determine throughput and outage probability of the cognitive multihop transmission as a function of an energy harvesting overhead and the interference power constraint at the primary receiver. We assume perfect channel state information at the receivers in order to evaluate the throughput and the outage probability of the cognitive multihop system with wireless energy harvesting.


---

## Body

## 1. Introduction

Recently, wireless energy harvesting has received a significant amount of attention since such technologies can prolong the lifetime of wireless networks under energy constraints [1–11]. Energy harvesting is a process by which energy is derived from external sources (e.g., wind, wave, solar, and thermal energy), captured, and stored for later use. In conventional energy-constrained wireless networks, the lifetime of a device is quite short and is limited by the capacity of the energy supply (e.g., batteries). On the other hand, wireless energy harvesting technologies have the potential to provide unlimited energy from the surrounding environment [1]. The explosive growth in data traffic generated by wireless equipment, such as mobile phones and base stations, will allow for energy to be extracted from ambient radiofrequency signals and then be deployed for other purposes. Recently, energy cooperation for wireless energy harvesting has been studied to improve the performance of such systems [2, 3].In practice, it is not easy for the receiver of a wireless node to decode information and to harvest energy at the same time. Therefore, a receiver requires a mechanism in order to support both the information processing and energy harvesting [4, 5]. In [5], time switching and power splitting energy harvesting methods were introduced. Those methods were used to propose two amplify-and-forward relaying protocols, a time switching-based relaying (TSR) protocol and a power splitting-based relaying (PSR) protocol, to enable information decoding and energy harvesting at a relay [2]. In the TSR, the relay spends a fraction of time slots harvesting energy and the rest processing information, depending on the conditions of the channel. The PSR allows the relay to harvest energy from a portion of the power that has been received, whereas the remaining power is used to decode and transmit information. The TSR was demonstrated to be superior to PSR in the cases with high transmission rate, low signal-to-noise ratio (SNR), and low energy harvesting efficiency.On the other hand, cognitive multihop transmission in a wireless sensor network has been considered as an effective means for achieving high spectrum utilization and wide coverage area with limited energy at the same time [12–16]. In [12], the authors analyzed the performance of cognitive multihop decode-and-forward relay networks with Rayleigh fading channels. The performance of the cognitive underlay multihop networks was analyzed in [13, 14]. Cognitive radio networks with multihop have been shown to outperform single hop communication and provide a promising method to efficiently transmit information in future networks. However, these studies have all considered cases with conventional equipment with batteries. We consider a more challenging scenario where each node does not have a battery and needs to harvest energy from the surrounding signals.In this paper, we develop a wireless energy harvesting model for a cognitive wireless sensor network in the presence of cluster-based decode-and-forward relays. Note that, in a cognitive radio network, energy harvesting can be exploited by a cognitive (secondary) user as well as an incumbent (primary) user [11, 17]. We assume that the relays can harvest energy from their surroundings based on the TSR receiver architecture and they form several clusters to help data transmission from the source to the destination. Under the assumption, we derive exact expressions for the throughput and outage probability of cognitive multihop transmission by considering an energy harvesting overhead and the interference power constraint at the primary receivers. We provide numerical results that show that energy harvesting can be effectively used for cognitive multihop transmissions in wireless sensor networks.The rest of this paper is organized as follows. Section2 describes a wireless sensor network based on cognitive multihop transmission and explains how the relays can harvest energy from the surrounding signals. Analytical expression for the throughput and outage probability for cognitive multihop transmissions is derived in Section 3. In Section 4, numerical results are provided to verify the analysis and to evaluate the performance. Finally, the conclusion is presented in Section 5.


## 2. System Model

### 2.1. Cognitive Multihop Wireless Sensor Networks

As shown in Figure1, we consider a cognitive cluster-based multihop wireless sensor network that operates as an underlay to a primary system. Between the source sensor node S0 and the destination sensor node SK, there are K-1 clusters of relay sensor nodes which forms a K-hop relaying channel from the source to the destination. The kth cluster is assumed to be composed of Mk relay nodes, Sk1,Sk2,…,SkMk, for k=1,2,…,K-1. We consider only primary receivers, PUn, n=1,2,…,N, and assume that the primary transmitters are far away from the sensor nodes [15]. We also assume that there is no direct link between the source and the destination, so S0 transmits data to SK with the help of the K-1 best relays, which are chosen to correspond with the cluster of relay nodes. For the selection of a relay in each cluster, we consider a partial relay selection scheme as in [15]. Accordingly, the selected relay Sk∗ in the kth cluster is found as(1)Sk∗=argmaxm=1,2,…,Mkhkm2,k=1,2,…,K-1,where hkm denotes the channel coefficient between Sk-1∗ and Skm and S0∗≡S0 and SK∗≡SK.Figure 1
A cognitive cluster-based multihop wireless sensor network.We assume that the channel between any two transmit and receive nodes is modeled as an independent flat Rayleigh fading channel and that perfect channel state information (CSI) is available at the receiver. Each node is equipped with a single antenna and has a half-duplex radio, which implies that each hop in betweenS0 and SK should happen in K separate time intervals. Let hk, k=1,2,…,K, denote the channel coefficient of the link S(k-1)∗→Sk∗ and let gkn, k=1,2,…,K, denote the channel coefficient of the link S(k-1)∗→PUn. Then, the corresponding channel power gains hk2 and gkn2 will follow an exponential distribution with parameters λk and μkn, respectively. Accordingly, the probability density functions (PDFs) of the random variables hk2 and gkn2 are given as(2)fhk2(x)=λke-λkx,fgkn2x=μkne-μknx,where λk≜E{hk2}=dkβ and μkn≜E{gkn2}=rknβ. dk and rkn denote the distance in S(k-1)∗→Sk∗ and the distance between S(k-1)∗ and PUn, and β is the path-loss exponent. In a cognitive radio system, the secondary system accesses the spectrum with a simultaneous primary system. As the system under consideration is a cognitive radio system, the transmit power at the Skn must be limited so as not to cause excessive interference to primary users. The received interference power at the primary receiver is assumed not to be greater than Ip which is referred to as interference power constraint.


### 2.2. Energy Harvesting

We assume that the sensor nodes have no available energy to transmit information and the nodes have to harvest energy from the surrounding environment in order to be able to transmit or forward the signal to the destination. We consider a time switching receiver (TSR) protocol to harvest energy and to process information atSmk [2], as depicted in Figure 2. Each node Skm harvests energy for a fraction α(0≤α≤1) of each time slot. The remaining (1-α) fraction of the time slot is subdivided into K phases of the same length (1-α)/K for the K-hop relaying. The channel fading coefficients are assumed to remain constant during each time slot but change independently across time slots. In the first phase, S0 broadcasts data signal to all the relays in the first cluster and each relay decodes the data. In the second phase, the selected relay S1∗ forwards the decoded data to the relays in the second cluster. The process is repeated K times so that the data are delivered to the destination SK. We assume that all the relays can correctly decode the signal from a relay in the previous cluster.Figure 2
The TSR protocol proposed to harvest energy and process information at the sensor nodes.According to the availability of energy storage, energy harvesting can be categorized into two different modes of use [1, 18]. The first mode is a harvest-use (HU) mode where the harvested energy cannot be stored or depleted after each slot. The second mode is a harvest-store-use (HSU) mode where the harvested energy can be stored for later use. We assume that each sensor node adopts the HU mode for energy harvesting. This assumption is reasonable under the ground that sensor nodes will be equipped with inexpensive capacitors for energy storage. Therefore, for each time slot, energy harvesting is conducted at the beginning and the harvested energy is used to transmit data in the corresponding slot. (For simplicity, we omit the time slot index hereafter.) Energy harvested at the node Skn can be expressed as follows (we assume that every relay in the kth cluster harvests the same amount of energy) [19]:(3)Ek=∫0αT‍ek(t)dt=δkαT,where ek(t)=δk is a function of the surrounding energy that is available during a period of time and it also depends on the energy conversion efficiency of the system [5] and T denotes a duration for a time slot. From the harvested energy in (3), a maximum transmit power at node Skm for the time duration (1-α)/K is computed as(4)Pkmax⁡=Ek(1-α)T/K=δkαK(1-α).


### 2.3. Signal Model

In thekth phase of relaying, the signal received at each relay node Skm is fully decoded and is then reencoded before being forwarded (decode-and-forward) to the next cluster or to destination. The signal that is received at the relay node Skm or at destination is given as(5)ykm=Pk-1hkmxk-1+nkm,where xk-1 denotes the symbol transmitted from Sk-1∗ which is assumed to follow a Gaussian distribution as xk-1~CN(0,1), Pk-1 denotes the transmit power of Sk-1∗, and nkm~CN(0,σk2) denotes the additive white Gaussian noise (AWGN) at Skm. With the consideration on the interference power constraint Ip at the PUs, Pk-1 is determined as(6)Pk-1=min⁡Pk-1max⁡,Ipmax⁡n=1,2,…,N⁡g(k-1)n2.Hence, the instantaneous signal-to-noise ratio (SNR) γkm at Skm can be computed as [20](7)γkm=min⁡Pk-1max⁡,Ip/max⁡n=1,2,…,N⁡gk-1n2hkm2σk2.It should be noted that the system model can easily be modified to a conventional noncognitive multihop transmission by releasing the interference constraints for the primary receivers as in [21]. Accordingly, if we let Ip in (6) go to ∞, all the results derived in this paper will be applied to such a system.


## 2.1. Cognitive Multihop Wireless Sensor Networks

As shown in Figure1, we consider a cognitive cluster-based multihop wireless sensor network that operates as an underlay to a primary system. Between the source sensor node S0 and the destination sensor node SK, there are K-1 clusters of relay sensor nodes which forms a K-hop relaying channel from the source to the destination. The kth cluster is assumed to be composed of Mk relay nodes, Sk1,Sk2,…,SkMk, for k=1,2,…,K-1. We consider only primary receivers, PUn, n=1,2,…,N, and assume that the primary transmitters are far away from the sensor nodes [15]. We also assume that there is no direct link between the source and the destination, so S0 transmits data to SK with the help of the K-1 best relays, which are chosen to correspond with the cluster of relay nodes. For the selection of a relay in each cluster, we consider a partial relay selection scheme as in [15]. Accordingly, the selected relay Sk∗ in the kth cluster is found as(1)Sk∗=argmaxm=1,2,…,Mkhkm2,k=1,2,…,K-1,where hkm denotes the channel coefficient between Sk-1∗ and Skm and S0∗≡S0 and SK∗≡SK.Figure 1
A cognitive cluster-based multihop wireless sensor network.We assume that the channel between any two transmit and receive nodes is modeled as an independent flat Rayleigh fading channel and that perfect channel state information (CSI) is available at the receiver. Each node is equipped with a single antenna and has a half-duplex radio, which implies that each hop in betweenS0 and SK should happen in K separate time intervals. Let hk, k=1,2,…,K, denote the channel coefficient of the link S(k-1)∗→Sk∗ and let gkn, k=1,2,…,K, denote the channel coefficient of the link S(k-1)∗→PUn. Then, the corresponding channel power gains hk2 and gkn2 will follow an exponential distribution with parameters λk and μkn, respectively. Accordingly, the probability density functions (PDFs) of the random variables hk2 and gkn2 are given as(2)fhk2(x)=λke-λkx,fgkn2x=μkne-μknx,where λk≜E{hk2}=dkβ and μkn≜E{gkn2}=rknβ. dk and rkn denote the distance in S(k-1)∗→Sk∗ and the distance between S(k-1)∗ and PUn, and β is the path-loss exponent. In a cognitive radio system, the secondary system accesses the spectrum with a simultaneous primary system. As the system under consideration is a cognitive radio system, the transmit power at the Skn must be limited so as not to cause excessive interference to primary users. The received interference power at the primary receiver is assumed not to be greater than Ip which is referred to as interference power constraint.


## 2.2. Energy Harvesting

We assume that the sensor nodes have no available energy to transmit information and the nodes have to harvest energy from the surrounding environment in order to be able to transmit or forward the signal to the destination. We consider a time switching receiver (TSR) protocol to harvest energy and to process information atSmk [2], as depicted in Figure 2. Each node Skm harvests energy for a fraction α(0≤α≤1) of each time slot. The remaining (1-α) fraction of the time slot is subdivided into K phases of the same length (1-α)/K for the K-hop relaying. The channel fading coefficients are assumed to remain constant during each time slot but change independently across time slots. In the first phase, S0 broadcasts data signal to all the relays in the first cluster and each relay decodes the data. In the second phase, the selected relay S1∗ forwards the decoded data to the relays in the second cluster. The process is repeated K times so that the data are delivered to the destination SK. We assume that all the relays can correctly decode the signal from a relay in the previous cluster.Figure 2
The TSR protocol proposed to harvest energy and process information at the sensor nodes.According to the availability of energy storage, energy harvesting can be categorized into two different modes of use [1, 18]. The first mode is a harvest-use (HU) mode where the harvested energy cannot be stored or depleted after each slot. The second mode is a harvest-store-use (HSU) mode where the harvested energy can be stored for later use. We assume that each sensor node adopts the HU mode for energy harvesting. This assumption is reasonable under the ground that sensor nodes will be equipped with inexpensive capacitors for energy storage. Therefore, for each time slot, energy harvesting is conducted at the beginning and the harvested energy is used to transmit data in the corresponding slot. (For simplicity, we omit the time slot index hereafter.) Energy harvested at the node Skn can be expressed as follows (we assume that every relay in the kth cluster harvests the same amount of energy) [19]:(3)Ek=∫0αT‍ek(t)dt=δkαT,where ek(t)=δk is a function of the surrounding energy that is available during a period of time and it also depends on the energy conversion efficiency of the system [5] and T denotes a duration for a time slot. From the harvested energy in (3), a maximum transmit power at node Skm for the time duration (1-α)/K is computed as(4)Pkmax⁡=Ek(1-α)T/K=δkαK(1-α).


## 2.3. Signal Model

In thekth phase of relaying, the signal received at each relay node Skm is fully decoded and is then reencoded before being forwarded (decode-and-forward) to the next cluster or to destination. The signal that is received at the relay node Skm or at destination is given as(5)ykm=Pk-1hkmxk-1+nkm,where xk-1 denotes the symbol transmitted from Sk-1∗ which is assumed to follow a Gaussian distribution as xk-1~CN(0,1), Pk-1 denotes the transmit power of Sk-1∗, and nkm~CN(0,σk2) denotes the additive white Gaussian noise (AWGN) at Skm. With the consideration on the interference power constraint Ip at the PUs, Pk-1 is determined as(6)Pk-1=min⁡Pk-1max⁡,Ipmax⁡n=1,2,…,N⁡g(k-1)n2.Hence, the instantaneous signal-to-noise ratio (SNR) γkm at Skm can be computed as [20](7)γkm=min⁡Pk-1max⁡,Ip/max⁡n=1,2,…,N⁡gk-1n2hkm2σk2.It should be noted that the system model can easily be modified to a conventional noncognitive multihop transmission by releasing the interference constraints for the primary receivers as in [21]. Accordingly, if we let Ip in (6) go to ∞, all the results derived in this paper will be applied to such a system.


## 3. Performance Analysis

In this section, we first derive the exact cumulative distribution function (CDF) and the PDF of the received SNR for each hop. Then, the throughput and the outage probability of the end-to-end linkS0→SK are derived.Lemma 1.
The CDFFγk(z) and the PDF fγk(z) of γk of the SNR at Sk∗ for the kth hop are, respectively, given in a closed form as(8)Fγkz=1+∑m=1Mk‍-1mCMkmexp⁡-λkmzP¯k-1∗·∑t=0m‍Cmt∑n=1N‍-1nCNnλkznμk-1I¯p+λkzt·exp⁡-ntμk-1I¯pP¯k-1∗,(9)fγkz=MkλkP¯k-1∗∑m=0Mk-1‍-1mCMk-1m·exp⁡-λk(m+1)zP¯k-1∗·∑t=0m‍Cmt∑n1=0N‍-1n1CNn1·λkzn1μk-1I¯p+λkztexp⁡-n1tμk-1I¯pP¯k-1∗·∑n2=0N‍-1n2CNn2·λkzn2μk-1I¯p+λkz-n2μk-1I¯pP¯k-1∗n2μk-1I¯p+λkz2·exp⁡-n2μk-1I¯pP¯k-1∗,where P¯k-1∗≜δkαK/(1-α)σk2, I¯p≜Ip/σk2, CNn≜N!/n!(N-n)!, and CNn≜N!/n!(N-n)!.Proof.
LetX≜max⁡n=1,2,…,Ng(k-1)n2; then the CDF of γkm conditioned to X is obtained as(10)Fγkmz∣X=Pr⁡min⁡P¯k-1∗,I¯pXhkm2<z=1-exp⁡-λkzmin⁡P¯k-1∗,I¯p/X.By averaging with respect to X, the CDF of γkm is found as(11)Fγkmz=1-exp⁡-λkzP¯k-1∗Pr⁡X≤I¯pP¯k-1∗+Pr⁡1-exp⁡-λkzXI¯p,X>I¯pP¯k-1∗.In addition, the CDF and the PDF of X can be written as(12)FX(x)=∑n=0N‍-1nCNnexp⁡-nμk-1x(13)fX(x)=∑n=1N‍-1n+1CNnnμk-1exp⁡-nμk-1x,respectively. Therefore, the CDF of γkm in (11) can be rewritten as(14)Fγkmz=1-exp⁡-λkzP¯k-1∗FXI¯pP¯k-1∗+∫I¯p/P¯k-1∗∞‍1-exp⁡-λkzxI¯pfX(x)dx.Substituting (12) and (13) into (14), after some manipulation, we can derive Fγkm(z) as(15)Fγkmz=1-exp⁡-λkzP¯k-1∗-∑n=1N‍-1nCNnλkznμk-1I¯p+λkz·exp⁡-nμk-1I¯p+λkzP¯k-1∗.Based on the relay selection strategy in (1), the CDF Fγk(z) at Sk∗ for the kth hop can be derived as (8). Moreover, by taking the first derivative of Fγk(z), we obtain the PDF in (9).


### 3.1. Throughput Analysis

Before computing the throughput for the end-to-end link, we derive the ergodic capacity of each hop. We first rewrite the PDF in (9) in a more compact form as(16)fγkz=MkλkP¯k-1∗∑m=0Mk-1‍∑t=0m‍∑n1=0N‍∑n2=0N‍-1m+n1+n2CMkmCmtCNn1CNn2·exp⁡-n1t+n2μk-1I¯pP¯k-1∗·exp⁡-λkm+1zP¯k-1∗A-B,where(17)A≜zt+1n1μk-1I¯p/λk+ztn2μk-1I¯p/λk+z,B≜n2μk-1λk-2I¯pP¯k-1∗ztn1μk-1I¯p/λk+ztn2μk-1I¯p/λk+z2.Next, we express the product form of A and B in (17) in the following partial-fraction expansion:(18)A=∑l=1t‍zt+1Aln1μk-1I¯p/λk+zl+zt+1(n1-n2)μk-1I¯pλktaaaaaaa(n1-n2)μk-1I¯pλkt·n2μk-1I¯pλk+z-1,B=n2μk-1λk-2I¯pP¯k-1∗·∑l=1t‍ztBln1μk-1I¯p/λk+zlaaa+zt(n1-n2)μk-1I¯pλktaaaaaaaaa·n2μk-1I¯pλk+z2-1aaa-tzt(n1-n2)μk-1I¯pλkt-1aaaaaaaaa∑l=1t‍·(n1-n2)μk-1I¯pλkt-1n2μk-1I¯pλk+z-1,where Al≜(1/(t-l)!)(dt-l/dzt-l)n2μk-1I¯p/λk+z-1 and Bl≜(1/(t-l)!)(dt-l/dzt-l)n1μk-1I¯p/λk+z-2.Based on the PDF ofγk in (9), the ergodic capacity for the kth hop can be computed as(19)Ck=Eγklog⁡21+γk=∫0∞‍log⁡2(1+z)fγk(z)dz.In addition, we express the integrand ln⁡(1+z) in terms of the Meijer G-function [22, Equation (8.4.6.5)] as ln⁡(1+z)=G3,21,2z1,01,1 and express e-θz using the Maclaurin series expansion: e-θz=∑i=0∞‍-1i(θzi/i!). We also use [23, Equation (7.811.5)] and Γ(2)=Γ(1)=1 to obtain the ergodic capacity of the kth hop in (20), which appears in the following, where Γ(x) denotes the gamma function [23, Equation (8.8310)]:(20)Ck=MkλkP¯k-1∗log⁡2e·∑m=0Mk-1‍∑t=0m‍∑n1=0N‍∑n2=0N‍∑i=0∞‍-1m+n1+n2+i·CMkmCmtCNn1CNn2·exp⁡-(n1t+n2)μk-1I¯pP¯k-1∗λk(m+1)P¯k-1∗i1i!·∑l=1t‍Aln1μk-1I¯pλkt+i+2-l1ΓlG3,32,3·n1μk-1I¯pλkl-t-i-2,1,0-i-t-1,1,1+n2μk-1I¯p/λkt+i+1n1-n2μk-1I¯p/λktG3,32,3·n2μk-1I¯pλk-t-i-1,1,0-i-t-1,1,1-n2μk-1λk-2P¯k-1∗I¯p·∑l=1t‍Bln1μk-1I¯pλkt+i+1-l1Γ(l)aaaaaaaaa·G3,32,3n1μk-1I¯pλkl-t-i-1,1,0-i-t,1,1aaaaaaaaa+n2μk-1I¯p/λkt+i-1n1-n2μk-1I¯p/λktaaaaaaaaa·G3,32,3n2μk-1I¯pλk1-t-i,1,0-i-t,1,1aaaaaaaaa-tn2μk-1I¯p/λkt+in1-n2μk-1I¯p/λkt-1G3,32,3aaaaaaaaa·n2μk-1I¯pλk-t-i,1,0-i-t,1,1.UsingCk in (20), the ergodic capacity C of the end-to-end link S0→SK is given as(21)C=min⁡k=1,2,…,KCk.Furthermore, the total transmission time from the source to the destination is (1-α)T and we fixed the transmission time for each hop to (1-α)T/K, leading to the effective communication time of (1-α)T/K in each slot. If each node transmits at a fixed rate equal to the ergodic capacity in (20), then the throughput R of the end-to-end link is given as(22)R=(1-α)T/KTC=1-αKC.To find the optimal value ofα in order to maximize the throughput R, we consider an optimization problem as follows:(23)α∗=argmaxα⁡Rα,subjectto0≤α≤1.It is easy to verify that (23) is a concave function of α. Therefore, the optimal α can be obtained by taking the first derivative of the throughput in (22) with respect to α. However, a closed-form solution to (23) cannot be obtained. Nevertheless, the optimal α can be found through a numerical search.


### 3.2. Outage Probability Analysis

The outage probabilityPout of the end-to-end link in a multihop transmission is defined as the probability that the minimum SNR will fall below a given threshold ρ. Using the CDF in Lemma 1, Pout can be obtained as (24)Pout=Pr⁡min⁡γ1,…,γK<ρ=1-Pr⁡γ1≥ρ,…,γK≥ρ=1-∏k=1K‍1-Fγk(ρ),where ρ=2KRth/(1-α)-1 and Rth is a threshold for the transmission rate. Substituting (8) into (24), we have(25)Pout=1-∏k=1K‍∑m=1Mk‍∑t=0m‍∑n=1N‍-1m+n+1CMkmCmtCNn·exp⁡-λkmρ+ntμk-1I¯pP¯k-1∗·λkρnμk-1I¯p+λkρt.


## 3.1. Throughput Analysis

Before computing the throughput for the end-to-end link, we derive the ergodic capacity of each hop. We first rewrite the PDF in (9) in a more compact form as(16)fγkz=MkλkP¯k-1∗∑m=0Mk-1‍∑t=0m‍∑n1=0N‍∑n2=0N‍-1m+n1+n2CMkmCmtCNn1CNn2·exp⁡-n1t+n2μk-1I¯pP¯k-1∗·exp⁡-λkm+1zP¯k-1∗A-B,where(17)A≜zt+1n1μk-1I¯p/λk+ztn2μk-1I¯p/λk+z,B≜n2μk-1λk-2I¯pP¯k-1∗ztn1μk-1I¯p/λk+ztn2μk-1I¯p/λk+z2.Next, we express the product form of A and B in (17) in the following partial-fraction expansion:(18)A=∑l=1t‍zt+1Aln1μk-1I¯p/λk+zl+zt+1(n1-n2)μk-1I¯pλktaaaaaaa(n1-n2)μk-1I¯pλkt·n2μk-1I¯pλk+z-1,B=n2μk-1λk-2I¯pP¯k-1∗·∑l=1t‍ztBln1μk-1I¯p/λk+zlaaa+zt(n1-n2)μk-1I¯pλktaaaaaaaaa·n2μk-1I¯pλk+z2-1aaa-tzt(n1-n2)μk-1I¯pλkt-1aaaaaaaaa∑l=1t‍·(n1-n2)μk-1I¯pλkt-1n2μk-1I¯pλk+z-1,where Al≜(1/(t-l)!)(dt-l/dzt-l)n2μk-1I¯p/λk+z-1 and Bl≜(1/(t-l)!)(dt-l/dzt-l)n1μk-1I¯p/λk+z-2.Based on the PDF ofγk in (9), the ergodic capacity for the kth hop can be computed as(19)Ck=Eγklog⁡21+γk=∫0∞‍log⁡2(1+z)fγk(z)dz.In addition, we express the integrand ln⁡(1+z) in terms of the Meijer G-function [22, Equation (8.4.6.5)] as ln⁡(1+z)=G3,21,2z1,01,1 and express e-θz using the Maclaurin series expansion: e-θz=∑i=0∞‍-1i(θzi/i!). We also use [23, Equation (7.811.5)] and Γ(2)=Γ(1)=1 to obtain the ergodic capacity of the kth hop in (20), which appears in the following, where Γ(x) denotes the gamma function [23, Equation (8.8310)]:(20)Ck=MkλkP¯k-1∗log⁡2e·∑m=0Mk-1‍∑t=0m‍∑n1=0N‍∑n2=0N‍∑i=0∞‍-1m+n1+n2+i·CMkmCmtCNn1CNn2·exp⁡-(n1t+n2)μk-1I¯pP¯k-1∗λk(m+1)P¯k-1∗i1i!·∑l=1t‍Aln1μk-1I¯pλkt+i+2-l1ΓlG3,32,3·n1μk-1I¯pλkl-t-i-2,1,0-i-t-1,1,1+n2μk-1I¯p/λkt+i+1n1-n2μk-1I¯p/λktG3,32,3·n2μk-1I¯pλk-t-i-1,1,0-i-t-1,1,1-n2μk-1λk-2P¯k-1∗I¯p·∑l=1t‍Bln1μk-1I¯pλkt+i+1-l1Γ(l)aaaaaaaaa·G3,32,3n1μk-1I¯pλkl-t-i-1,1,0-i-t,1,1aaaaaaaaa+n2μk-1I¯p/λkt+i-1n1-n2μk-1I¯p/λktaaaaaaaaa·G3,32,3n2μk-1I¯pλk1-t-i,1,0-i-t,1,1aaaaaaaaa-tn2μk-1I¯p/λkt+in1-n2μk-1I¯p/λkt-1G3,32,3aaaaaaaaa·n2μk-1I¯pλk-t-i,1,0-i-t,1,1.UsingCk in (20), the ergodic capacity C of the end-to-end link S0→SK is given as(21)C=min⁡k=1,2,…,KCk.Furthermore, the total transmission time from the source to the destination is (1-α)T and we fixed the transmission time for each hop to (1-α)T/K, leading to the effective communication time of (1-α)T/K in each slot. If each node transmits at a fixed rate equal to the ergodic capacity in (20), then the throughput R of the end-to-end link is given as(22)R=(1-α)T/KTC=1-αKC.To find the optimal value ofα in order to maximize the throughput R, we consider an optimization problem as follows:(23)α∗=argmaxα⁡Rα,subjectto0≤α≤1.It is easy to verify that (23) is a concave function of α. Therefore, the optimal α can be obtained by taking the first derivative of the throughput in (22) with respect to α. However, a closed-form solution to (23) cannot be obtained. Nevertheless, the optimal α can be found through a numerical search.


## 3.2. Outage Probability Analysis

The outage probabilityPout of the end-to-end link in a multihop transmission is defined as the probability that the minimum SNR will fall below a given threshold ρ. Using the CDF in Lemma 1, Pout can be obtained as (24)Pout=Pr⁡min⁡γ1,…,γK<ρ=1-Pr⁡γ1≥ρ,…,γK≥ρ=1-∏k=1K‍1-Fγk(ρ),where ρ=2KRth/(1-α)-1 and Rth is a threshold for the transmission rate. Substituting (8) into (24), we have(25)Pout=1-∏k=1K‍∑m=1Mk‍∑t=0m‍∑n=1N‍-1m+n+1CMkmCmtCNn·exp⁡-λkmρ+ntμk-1I¯pP¯k-1∗·λkρnμk-1I¯p+λkρt.


## 4. Numerical Results

In this section, we evaluate the performance of cognitive multihop transmission analyzed in Section3. We use the analytical expressions (20) and (25) for the throughput and the outage probability, respectively, to evaluate the system performance. In particular, we investigate the impact of the time fraction α for energy harvesting, the number of hops K, the number of relays Mk in each cluster, and the impact of the primary users on the throughput and on the outage probability. We assume that the source S0, the relay Skm, the destination SK, and the primary receivers PUs are located at (0,0), (xkm,0), (4,0), and (xP, yP), respectively. Furthermore, the distance of every hop is assumed to be equal and the relays in each cluster are located at the same position. Accordingly, the distance between S(k-1)∗ and Sk∗ is equal to 4/K. The path-loss exponent β is set to 3 and δk is assumed to be equal to 1 for every k, unless stated otherwise. Every cluster is assumed to have the same number of relays; that is, MK=M, k=1,2,…,K-1. Noise power σk2, k=1,2,…,K, is normalized to unity.In Figure3, we show the effect that the time fraction α for energy harvesting has on the throughput. N  PUs are assumed to be deployed at the same location (2,2). The number of PUs N, the number of hops K, and the number of relays in each cluster M are all set to 3. The throughput is found to increase as δ increases, since a larger δ will result in more energy harvested. As expected with (23), for each value of δ, there exists an optimal α that maximizes the throughput. Furthermore, the optimal α is found to decrease as δ increases. The reason for this can be explained as a trade-off between the duration of energy harvesting and that of the data transmission. A longer harvesting period will result in more energy accumulated, but less time is used to transmit data. Figure 3 also confirms that results of the simulation and the analytical results are in exact agreements.Figure 3
Throughput versusα for δ=-5 dB, 0 dB, 5 dB, and 10 dB ((xP,yP)=(2,2) and N=M=K=3).Figure4 depicts the throughput versus α for various values of (K,M), when N=3  PUs are assumed to be located at (1,2). The throughput is found to increase as the number of relays M and/or the number of hops K increases, and the optimal α decreases as the number of hops K increases to compensate for the reduced transmission time for each hop. If we look at (4), as K increases with Pkmax⁡ being constant, α needs to decrease in order to guarantee more time for data transmission.Figure 4
Throughput versusα for (K,M)=(2,1), (2,2), (3,2), and (3,4) (δ=5 dB, (xP,yP)=(1,2), and N=3).Figure5 depicts the outage probability versus the SNR γ≜Pkmax⁡/σk2 for various values of K, when ρ=1 dB, α=0.3, N=3, M=1, and (xP,yP)=(2,2). The outage probability is observed to decrease as the SNR γ increases, that is, as more energy is harvested. Also, the outage probability decreases as the number of hops K increases.Figure 5
Outage probability versus SNRγ for K=1,2,3, and 4 (ρ=1 dB, α=0.3, N=3, M=1, and (xP,yP)=(2,2)).The effect ofPUs on the outage probability is depicted in Figure 6, when α=0.3, ρ=1 dB, Ip=1 dB, N=3, M=1, and (xP,yP)=(1,1). We see that the outage probability decreases as K increases. Moreover, for all cases where K=1,2,3,4, the outage probability decreases as δ increases. However, the outage probability is found to saturate as δ becomes greater than 3 dB. This is because the transmit power Pk in (6) has to satisfy the interference power constraint Ip at PUs even though the energy harvested increases.Figure 6
Outage probability versusδ for K = 1, 2, 3, and 4 (α=0.3, ρ=1 dB, Ip=1 dB, N=3, M=1, and (xP,yP)=(1,1)).


## 5. Conclusion

In this paper, wireless energy harvesting has been investigated for a cognitive multihop wireless sensor network. Based on the TSR protocol for energy harvesting, we have established a time-division energy harvesting and relaying scheme for efficient multihop transmission. We have derived the CDF and PDF of the SNR for each hop, based on which an exact analytical expression for the throughput and for the outage probability has been derived for the end-to-end link. We have also provided numerical results that validate the analysis and show the performance. It has been shown that, in order to improve the performance in terms of the throughput and outage probability, it is necessary to distribute many relay nodes between the source and the destination so that sufficient energy can accumulate for use during data transmissions. The performance of the system can also be improved by increasing the number of relays for each cluster. Analyzing the PSR protocol instead of the TSR protocol for energy harvesting at the source and relay nodes is left for future work. In addition, comparisons between the TSR and PSR protocols in terms of the system performance will provide a better insight into wireless energy harvesting in a cognitive radio system. Another interesting future work is to consider an underlay cognitive radio system where the source and relay nodes of the secondary system will be able to harvest energy from the interference signal of the primary transmitter.



---

*Source: 613165-2015-08-27.xml*