# Downlink and Uplink Cooperative Transmission for Primary Secrecy Based Cognitive Radio Sensor Networks

Authors: Dawei Wang; Pinyi Ren; Qinghe Du; Li Sun; Yichen Wang
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

Aiming at allocating more licensed spectrum to
wireless sensor nodes (SNs) under the constraint of the information
security requirement of the primary system, in this
paper, we propose a cooperative relaying and jamming secure
transmission (CRJS) scheme in which SNs will relay primary
message and jam primary eavesdrop concurrently with SN’s
downlink and uplink information transmission in cognitive radio
sensor networks (CRSNs). In our proposed CRJS scheme, SNs
take advantages of physical layer secure technologies to protect
the primary transmission and acquire some interference-free
licensed spectrum as a reward. In addition, both decode-and-forward
(DF) and amplify-and-forward (AF) relaying protocols
are investigated in our proposed CRJS scheme. Our object is to
maximize the transmission rate of SNs by optimal allocating of the
relaying power, jamming power, and downlink and uplink transmit
power under the target secure transmission rate requirement
of the primary system. Moreover, two suboptimal algorithms are
proposed to deal with these optimization problems. Furthermore,
we analyze the transmission rate of SNs and allocate the relaying
power, jamming power, and downlink and uplink transmit power
for the asymptotic scenarios. Simulation results demonstrate
the performance superiority of our developed strategy over
conventional jamming scheme in terms of the transmission rate
of WSN.


---

## Body

## 1. Introduction

Rapid proliferation of wireless communication devices and technologies burdens the available wireless spectrum resource and exacerbates the spectrum shortage problem. However, current fixed spectrum allocation strategy utilizes the spectrum resource with low efficiency according to the US FCC report [1] due to the neglect of vast temporal and spatial variations in the usage of allocated spectrum. Dynamic spectrum access as the main technology of cognitive radio (CR) can exploit the instantaneous availability spectrum by allowing the unlicensed users (secondary users) to access the licensed spectrum [2–5]. In cognitive radio networks (CRNs), secondary users (SUs) access the vacant licensed spectrum by sensing the surrounding spectrum environment or concurrently transmit with licensed users (primary user) under the requirement of interference constraint [6]. In addition, SUs can also cooperate with primary users (PUs) to assist the primary transmission and acquire some licensed spectrum opportunities as a reward [7].Employing low-cost, lower-power, and low-data-rate wireless SNs in wide application areas such as military affairs, environment [8], health [9], home [10], and other commercial areas [11], wireless sensor network (WSN) has been identified as an important technology for future intelligent world. In WSNs, SNs collect sensing data and deliver it to the access node or sink node to make a global decision. However, thousands of sophisticated, overlap, and coexisted WSNs crowd the license-exempt industrial, scientific, and medical (ISM) bands which are utilized by the existing WSNs. In addition, SNs will be interfered by many other communication systems which also occupy the ISM bands such as Wi-Fi, ZigBee, and Bluetooth [12]. Therefore, WSNs face the challenge of wireless spectrum shortage problem.Equipping SNs with cognitive ability to form a new communication paradigm denoted as CRSN is an effective method to overcome the lack of wireless spectrum resource in WSNs which can take advantages of dynamic spectrum access technology in CRNs. Recently, many works have investigated the performance of CRSN in [13–17]. Reference [13] introduced the system architecture, the application areas, the spectrum sharing method, the communication diagram, and the open research areas of CRSN. Reference [14] investigated the design issues and further extensions of CRSN. To support delay-sensitive and high-bandwidth multimedia applications in CRSN, [15] proposed a spectrum-aware clustering routing protocol with limited clusters. In addition, an energy and spectrum awareness cluster-head selection method was designed to utilize the noncontiguous available spectrum bands and support continuous transmission application. For real-time application, [16] introduced two types of channel switching methods which were periodic switching method and triggered switching method to transmit periodically generated packets and random generated packets, respectively. An energy-efficient channel management scheme was proposed with considering the constraint of SNs’ lifetime in CRSN [16]. The optimal packet size of CRSN was determined in [17] under constraints of PUs’ acceptable interference level and reliable event detection probability requirement at the sink. In [18], an adaptive power allocation method and sensing information correlation were utilized in the information theoretical capacity maximization frameworks.SNs can sense the licensed spectrum or control their transmit power to access the licensed spectrum in CRSNs. However, due to the inevitable sensing errors and undetermined interference threshold, it is hard for PU to be not adversely affected by SNs in conventional spectrum sharing methods. Cooperative communication in cognitive radio networks (CRNs) can settle these problems by allowing SUs to cooperate with PUs to support their quality-of-service (QoS) requirement and acquire some spectrum opportunities as a return [19]. In [20], PUs would lease half of the frame in exchange for assistance from SUs. In addition, an optimal power allocation method and antenna weights were designed and closed-form expression of bit error rate was derived to evaluate the performance. Game theory was employed in [21] to model the cooperation between PUs and SUs. SUs would optimally adjust their action to acquire more spectrum opportunities with less energy wasting. Reference [22] proposed a schedule strategy to improve the performance of PUs and guarantee the spectrum benefit of SUs in immediate or long-term bases. Automatic repeat-request (ARQ) signals were utilized by SUs to determine whether to cooperate or to access of SUs in [23]. Full-duplex cooperation scheme was proposed in [24] where the achievable primary-secondary benefit region was studied and SUs’ transmission rate maximum problem was solved. Two-path successive relaying cooperative spectrum sharing scheme was proposed in [25] where two secondary transmitters alternately relay PUs’ message. In addition, superposition coding and successive interference cancelation technologies were adopted at each SU to increase the primary transmission rate. Therefore, cooperative communication is a promising technology which can benefit both PUs and SUs. In this paper, we can employ the cooperation between SNs and PUs in CRSN to efficiently utilize the licensed spectrum without adverse effect on PUs.Cooperation between SNs and PUs can support PUs’ QoS requirement and allocate some spectrum opportunities for SNs in CRSNs. However, for some PUs with malicious eavesdropping challenge, they need new cooperation diagram. Traditional cryptographic method which assumes that eavesdroppers have limited computing ability is becoming easy to be attacked due to the rapid development of computing hardware. Physical layer secure methods which take advantages of the physical layer characteristics to confirm secure communication are widely investigated recently [26]. Cooperative relaying and cooperative jamming are two commonly physical layer secrecy methods [27]. Reference [28] investigated the optimal relays selection method in CRN for secure communication in which one selected relay for secure information transmission and other relays for jamming signal transmission. Reference [29] considered the secure transmission for OFDM based CRN with relay assisted under uncertain channel state information (CSI) condition. The worst case robust formulation was utilized to optimally allocate the power and subcarriers. Secure relay and jammer selection method for multiple eavesdroppers scenario was studied in [30] where closed-form expression of secrecy outage probability was derived. Hybrid relaying and jamming scheme was proposed in [31] where an optimal cooperative node was selected as relay and the other cooperative nodes would transmit jamming signal in beamforming way. Reference [32] derived the optimal beamforming vectors for relay signal and jamming signal under the constraints of maximum signal-to-interference and noise ratios (SINR) at eavesdroppers and minimum SINR at the destination requirements. Reference [33] investigated the destination assisted jamming scheme to protect the information from eavesdropper. Inspired by the above works, for the primary secure transmission requirement in CRSN, SNs can also provide cooperative relaying and jamming to protect the primary transmission and acquire some interference-free licensed spectrum as a reward. To the best of our knowledge, this is the first work which studies the cooperation between SNs and PUs under the secure requirement of the primary system.In this paper, we propose a CRJS scheme to maximize the transmission rate of SNs and protect the primary transmission through physical layer secure methods of cooperative relaying and jamming. In our proposed CRJS scheme, SNs will relay primary message and jam primary eavesdropper during SNs’ downlink and uplink transmission stages concurrently the transmission of WSN. Specifically, our cooperation scheme is implemented into two slots. During the first slot, SNs transmit their downlink message and jamming signal concurrently with the primary information transmission. During the second slot, SNs will decode the downlink message and forward the primary message. In addition, SNs still transmit the same jamming signal concurrently with their uplink transmission. Both decode-and-forward (DF) and amplify-and-forward (AF) relaying protocols are investigated in our proposed CRJS scheme. Our object is to maximize the transmission rate of SNs by optimal allocating of the relaying power, jamming power, and downlink and uplink transmit power under the target secure transmission rate requirement of the primary system. Moreover, two suboptimal algorithms are proposed to deal with these optimization problems. Furthermore, we analyze the transmission rate of SNs and allocate the relaying power, jamming power, and downlink and uplink transmit power for asymptotic scenarios. Simulation results demonstrate the performance superiority of our developed strategy over conventional jamming scheme in terms of the transmission rate of WSN. The main contributions of this work are summarized as follows:(i)
We propose a cooperative relaying and jamming scheme to maximize the transmission rate of SNs under primary target secure transmission rate requirement in CRSN. Our scheme will provide more licensed spectrum for SNs by employing their downlink and uplink transmission opportunities. In addition, our scheme takes advantages of physical layer characteristics to protect primary transmission. Both PUs and SNs can be benefited from this scheme.(ii)
Both AF and DF relaying protocols are investigated in our scheme. For AF relaying protocol, both primary and jamming signals will be amplified and forwarded. For DF relaying protocol, the primary message will be decoded and forwarded. In addition, the same jamming signal will be transmitted to interference the primary eavesdropper.(iii)
We formulate our optimization problems to maximize SN’s transmission rate under primary target secure transmission rate requirement. Two sequential parametric convex approximation (SPCA) based algorithms are proposed to solve these problems and allocate the relaying power, jamming power, and downlink and uplink transmit power.(iv)
For asymptotic scenarios, we also analyze SNs’ transmission rate and primary secure transmission rate. Meanwhile, we also formulate our optimization problems to maximize SNs’ transmission rate and allocate the relaying power, jamming power, and downlink and uplink transmit power.The rest of this paper is organized as follows. Section2 describes the system model and interpret the information exchange for DF and AF strategies. Section 3 interprets our cooperation scheme and formulates the optimization problems for DF and AF strategies. In addition, suboptimal algorithms are proposed to solve these problems and allocate the transmit power. In Section 4, we analyze the asymptotic scenarios. The authors conduct extensive simulations in Section 5, and Section 6 concludes the paper.Notations. Boldface letters denote M×1 vectors. The transpose, conjugate, and conjugate transpose of vector h are denoted as hT, h∗, and hH, respectively.


## 2. System Model

In our CRSN, a WSN coexists with a primary system which is shown in Figure1. The WSN with no licensed spectrum consists of SN and an access node (AN). Both SN and AN are willing to exchange information which can capture the wireless communication scenario where SN transmits its sensing date to AN for making a decision and then AN guides SN to make appropriate action. The primary system consists of a primary transmit (PT) and a primary receiver (PR). Due to the large-scale fading or serious interference, the direct transmission link between PT and PR always experiences outage [19, 34]. In addition, there is an external malicious eavesdropper (EV) who tries to eavesdrop the primary message. Therefore, the primary system needs the cooperation of SN and AN to confirm its secure communication and reward SN and AN with some interference-free licensed spectrum opportunities to inspire motivation of cooperation.Figure 1
The system model diagram of our proposed scheme. We consider the scenario for cognitive radio sensor networks where two SNs with downlink and uplink information exchange requirement coexisted with the primary system.We assume that AN hasM antennas and all other nodes have only one antenna. The primary network synchronizes with WSN and both networks experience stationary, ergodic, independent, and block Rayleigh fading; that is, channel gains are invariant within a frame but independently vary from one frame to another [35, 36]. In our system, each frame is equally divided into two slots which correspond to the downlink and uplink transmission stages of AN and SN, respectively. The channel variables of PT→SN, SN→PR, SN→EV, SN→AN, AN→SN, and AN→EV are denoted as hps, hsp, hse, hsa, has, and hae, respectively. The channel power gains of PT→SN, SN→PR, and SN→EV are denoted as gps=hps2, gsp=hsp2, and gse=hse2, respectively. We assume that all channels are reciprocity which means hsa=has. For the sake of simplicity, we assume that all noise variables follow cyclic symmetry complex Gaussian distribution with zero mean and unit variance. The maximum transmit power of the primary network and WSN is Pp and Ps, respectively. To securely transmit the primary message, the secrecy capacity of the primary system should reach the target rate Rsectar.Our proposed cooperation scheme is implemented into two slots. During the first slot, AN transmits downlink signal and jamming signal concurrently with the transmission of primary signal. Then the receiver signals at SN are(1)ysn=pdjω1Hxj+pdsω2Hxdhas+Pphpsxp+nsn,where pdj is jamming power, pds is the downlink transmit power, ω1H and ω2H are the jamming power and downlink transmit power beamforming vectors, respectively, xj2=1 and xd2=1 are the jamming signal and downlink signal, respectively, xp2=1 is the primary signal, and nsn is the noise variable at SN. The downlink signals can also be eavesdropped by EV which are given by(2)ye1=pdjω1Hxj+pdaω2Hxdhae+ne1,where ne1 is the noise variable at EV.During the second slot, SN will relay the primary message to PR and jam EV with the artificial noise. Therefore, we will interpret the information exchanging in both AF and DF relaying protocols in this slot.


### 2.1. AF Relaying Protocol

When SN adopts the AF relaying protocol, SN will decode and cancel the downlink message firstly. Then SN amplifies and forwards the remaining signals concurrently with the transmission of uplink signal. The received signals at AN are(3)yana=pdjω1Hhasxj+Pphpsxp+nsnpdjω1HhashasHω1+Ppgps+1paphas+pashasxu+nana,where pap and pas are the relay power and uplink transmit power, respectively, xu2=1 is the uplink signal, and nana is the noise variable at AN. Similarly, the received signals at PR are(4)ypa=pdjω1Hhasxj+Pphpsxp+nsnpdjω1HhashasHω1+Ppgps+1paphsp+pashspxu+npa,where npa is the noise variable at PR. The signals received at EV are(5)ye2a=pdjω1Hhasxj+Pphpsxp+nsnpdjω1HhashasHω1+Ppgps+1paphae+pashaexu+ne2a,where ne2a is the noise variable at EV.


### 2.2. DF Relaying Protocol

When SN adopts the DF relaying protocol, SN will decode the downlink message and primary message with the method of successive interference cancellation. Then, SN will forward PUs’ signal concurrently with the uplink signal and jamming signal. In this paper, we assume that the uplink jamming signal is the same with the uplink jamming signal. AN and SN can share the same jamming signal though signal encryption method. Then, the received signals at AN are(6)yand=pfpxp+pfjxj+pfsxuhas+nand,where pfp, pfj, and pfs are the relaying power, jamming power, and uplink transmit power and nand is noise variable at AN. Similarly, the received signals at PR and EV are(7)yprd=pfpxp+pfjxj+pfsxuhsp+npd,(8)ye2d=pfpxp+pfjxj+pfsxuhse+ne2d,respectively, where npd and ne2d are the noise variables at PR and EV, respectively.During the signals exchanging process, the allocation of relaying power, jamming power, and downlink and uplink transmit power will affect the primary information security and the transmission rate of WSN. Then, in the next section, we will try to maximize the transmission rate of WSN under the constraint of PUs’ security requirement by optimal allocating of the relaying power, jamming power, and downlink and uplink transmit power in AF and DF relaying protocols, respectively.


## 2.1. AF Relaying Protocol

When SN adopts the AF relaying protocol, SN will decode and cancel the downlink message firstly. Then SN amplifies and forwards the remaining signals concurrently with the transmission of uplink signal. The received signals at AN are(3)yana=pdjω1Hhasxj+Pphpsxp+nsnpdjω1HhashasHω1+Ppgps+1paphas+pashasxu+nana,where pap and pas are the relay power and uplink transmit power, respectively, xu2=1 is the uplink signal, and nana is the noise variable at AN. Similarly, the received signals at PR are(4)ypa=pdjω1Hhasxj+Pphpsxp+nsnpdjω1HhashasHω1+Ppgps+1paphsp+pashspxu+npa,where npa is the noise variable at PR. The signals received at EV are(5)ye2a=pdjω1Hhasxj+Pphpsxp+nsnpdjω1HhashasHω1+Ppgps+1paphae+pashaexu+ne2a,where ne2a is the noise variable at EV.


## 2.2. DF Relaying Protocol

When SN adopts the DF relaying protocol, SN will decode the downlink message and primary message with the method of successive interference cancellation. Then, SN will forward PUs’ signal concurrently with the uplink signal and jamming signal. In this paper, we assume that the uplink jamming signal is the same with the uplink jamming signal. AN and SN can share the same jamming signal though signal encryption method. Then, the received signals at AN are(6)yand=pfpxp+pfjxj+pfsxuhas+nand,where pfp, pfj, and pfs are the relaying power, jamming power, and uplink transmit power and nand is noise variable at AN. Similarly, the received signals at PR and EV are(7)yprd=pfpxp+pfjxj+pfsxuhsp+npd,(8)ye2d=pfpxp+pfjxj+pfsxuhse+ne2d,respectively, where npd and ne2d are the noise variables at PR and EV, respectively.During the signals exchanging process, the allocation of relaying power, jamming power, and downlink and uplink transmit power will affect the primary information security and the transmission rate of WSN. Then, in the next section, we will try to maximize the transmission rate of WSN under the constraint of PUs’ security requirement by optimal allocating of the relaying power, jamming power, and downlink and uplink transmit power in AF and DF relaying protocols, respectively.


## 3. CRJS Scheme

In this section, we will interpret our proposed CRJS scheme in both AF and DF relaying protocols. Then, the optimization problems will be formulated to maximize the transmission rate of WSN under the security requirement of the primary system. In addition, SPCA based algorithms are formulated to solve these problems and allocate the relaying power, jamming power, and the downlink and uplink transmit power.


### 3.1. Problem Formulation

During the first slot, the downlink transmission rate at SN is(9)Rsn=log21+pdsω2hasHhasω2H1+pdjω1hasHhasω1H+Ppgps.Then, we will derive the transmission rate during the second slot in both AF and DF relaying protocols.


#### 3.1.1. AF Relaying Protocol

When SN utilizes AF relaying protocol, AN firstly cancels the jamming signal and acquires the uplink transmission rate as(10)Rana=log21+pashasHhasPpgpt+1paphasHhas/pdjω1HhashasHω1+Ppgps+1+M.PR also receives the forwarding signal with rate Rpa which is given by(11)Rpa=12log21+Ppgpspapgsp/pdjω1HhashasHω1+Ppgps+1pdjω1HhashasHω1+1papgsp/pdjω1HhashasHω1+Ppgps+1+pasgsp+1.EV tries to eavesdrop the primary message during the second slot. However, in both slots, EV can receive the jamming signal which can be used for the jamming interference cancellation. Then, the received signals at EV can be rewritten as(12)yea=heaxp+nea,where(13)hea=0Pphpsxppdjω1HhashasHω1+Ppgps+1paphae,nea=ne1ane2a,with(14)ne1a=pdjω1Hxj+pdsω2Hxdhae+ne1,ne2a=pdjω1Hhasxj+nsnpaphtepdjω1HhashasHω1+Ppgps+1+pashsexu+ne2a.Then the covariance matrix of nea is derived as Qa which is given by(15)Qa=q11aq12aq21aq22a,where(16)q11a=pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1,q12a=pdjω1HhaehasHω1paphsepdjω1HhashasHω1+Ppgps+1,q21a=pdjω1HhaehasHω1paphsepdjω1HhashasHω1+Ppgps+1∗,q22a=pdjω1HhashasHω1+1pdjω1HhashasHω1+Ppgps+1papgse+pasgse+1.Multiplying both sides of (12) with Qa-1/2, then nea can be transformed into white Gaussian noise. Therefore, the eavesdropping rate can be derived as Rea which is shown in (17)Rea=12log2⁡I+Qa-1/2heaheaHQa-1/2H=12log21+pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1Pppapgsegpspdjω1HhashasHω1+Ppgps+1pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pdjω1HhashasHω1+1pdjω1HhashasHω1+Ppgps+1papgse+pasgse+1-pdj2papgseω1HhaehasHω12pdjω1HhashasHω1+Ppgps+12-1.Therefore, the secrecy rate of the primary system is(18)Rseca=Rpa-Rea+,where x+=max0,x.Then our optimization problem can be formulated as(19)P1:maxpdj,pds,pap,pasRsn+Rana(20)s.t.pdj+pds≤Ps,pap+pas≤Ps,Rseca≥Rsectar,where the first two constraints are the maximum transmit power constraints and the third constraint is the secure transmission rate requirement.


#### 3.1.2. DF Relaying Protocol

When SN employs the DF relaying protocol to forward the primary message concurrently with the uplink message and jamming signal, SN will cancel the jamming signal firstly and decode the primary message with achieved rate as(21)Rpsd=12log2⁡1+Ppgps1+pdjω1HhashasHω1.Then the uplink transmission rate is(22)Rand=log⁡1+pfshashasHpfphashasH+1.The primary transmission rate is(23)Rpd=12log21+pfpgsppfjgsp+pfsgsp+1.Similarly as the AF relaying protocol, EV will receive signals in both slots and the received signals can be written as(24)yed=hedxp+ned,where(25)hed=0pdphse,ned=pfjω1Hxj+pfsω2Hxdhae+ne1pfjxj+pfsxuhse+ne2d.Then, the covariance matrix of ned is derived as Qd which is given by(26)Qd=q11dq12dq21dq22d,where(27)q11d=pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1,q12d=pdjpfjω1Hhaehse,q21d=pfjpdjω1Hhaehse∗,q22d=pfj+pfsgse+1.Multiplying both sides of(24) with Qd-1/2, we can derive the eavesdropping rate as shown in (28)Red=12log2I+Qs-1/2nednedHQs-1/2H=12log21+pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pfpgsepdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pfj+pfsgse+1-pfjpdjgseω1Hhae2.Then the secrecy rate of the primary system is(29)Rsecd=Rpd-Red+.To maximize the transmission rate of SN, we formulate the optimaizaition problem as(30)P2:maxpdj,pds,pfp,pfj,pfsRsn+Rands.t.pdj+pds≤Ps,pfp+pfj+pfs≤Ps,Rsecd≥Rsectar,Rsn≥Rs,Rpsd≥Rp,where the first two constraints are the maximum transmit power constraints, the third constraint is the secure transmission rate requirement, the fourth constraint is the SN’s downlink target transmission rate requirement, and the fifth constraint is the primary target transmission rate requirement.


### 3.2. Power Allocation Strategy

In this section, we will try to solve the optimization problemsP1 and P2 by allocating the relaying power, jamming power, and uplink and downlink power to maximize the transmission rate of WSN under the constraint of PUs’ security requirement. For the sake of simplicity, we set ω1=has/has and ω2=hae/hae.


#### 3.2.1. AF Relaying Protocol

For problemP1, as the security constraint is nonconvex, we cannot solve this problem through the conventional convex method. To solve this problem, we try to transform the nonconvex items into convex items and utilize the conventional convex method to solve the transformed problem.SetRsn≥αa and Rana≥βa; we can transform the optimization problem into P3 which is given by(31)P3:maxpdj,pds,pap,pasαa+βas.t.Rsn≥αa,Rana≥βa,equation20,where Rsn≥αa and Rana≥βa can be written as (32)pdsω2HhashasHω2-pdjω1HhashasHω12αa-1-2αa-11+Ppgps≥0,paspdj2β-1hasHhasω1HhashasHω1+pasPpgpt+12β-1hasHhas-paphasHhasPpgps+1-pdjω1HhashasHω1M-PpgpsM-M≥0.The security constraint of (20) can be approximated by its lower bound which is given by(33)Rseca=Rpa-Rea≥log2γpaγea≥Rsectar,where γpa and γea are the second items of the right sides of (11) and (17), respectively. Then (33) can be written as (34)1-22Rsectarpapgpspappdj2Ppω1HhashasHω1+paspdj2Ppω1HhashasHω1+paspdjgps+pdjpappdsPpω1HhashasHω1+paspdjpdsPpω1HhashasHω1+pdspasPp2gps+pappdj3ω1HhashasHω1+paspdj3ω1HhashasHω1+paspdj2Ppgps+pappdspdj2ω1HhashasHω1+paspdspdj2ω1HhashasHω1+paspdspdjPpgps-pdj2pap≥0.Then the optimization problem P3 can be written as(35)P4:maxpdj,pds,pap,pasαa+βas.t.pdj+pds≤Ps,pap+pas≤Ps,equations32,34.The constraints of P4 are still nonconvex due to the polynomial items of pds, pdj, pap, and pas. To solve this problem, based on the SPCA method [37], we propose a SPCA based iterative algorithm which will approximate the nonconvex items with their inner convex bounds.Proposition 1.
The nonconvex polynomial itemxtoytϱztςutυ can be approximated by their inner convex bound Gxt,yt,zt,ut which is given by(36)Gxt,yt,zt,ut=φ1txt2+φ2tyt2+φ3tzt2+φ4tut2,where(37)φ1t-1=oxt-1o-1yt-1ϱzt-1ςut-1υ2,φ2t-1=ϱxt-1oyt-1ϱ-1zt-1ςut-1υ2,φ3t-1=ςxt-1oyt-1ϱzt-1ς-1ut-1υ2,φ4t-1=υxt-1oyt-1ϱzt-1ςut-1υ-12,and t is the iterative number.Proof.
Based on the SPCA method in [37], xoyϱzςuυ can be approximated by Gx,y,z,u when o, ϱ, ς, and υ satisfy the follow properties:(38)xoyϱzςuυ=Gx,y,z,u,∇xoyϱzςuυ=∇Gx,y,z,u,with given x>0, y>0, z>0, and u>0. To satisfy (38), o, ϱ, ς, and υ should be the functions of x, y, z, and u. Therefore, we construct o, ϱ, ς, and υ as shown in (37) which satisfies the first constraint in (38). As ∇Gx,y,z,u=2φ1x,2φ2y,2φ3z,2φ4uT and ∇xoyϱzςuυ=oxo-1yϱzςuυ,ϱxoyϱ1zςuυ,ςxoyϱzς-1uυ,υxoyϱzςuυ-1T and substituting (37) into ∇Gx,y,z,u, we can prove the second constraint of (38). Then, we prove Proposition 1.Utilizing Proposition1, P4 can be transformed into convex problem which will be solved by the conventional convex algorithm. Then, our proposed SPCA based iterative algorithm can be summarized as in Algorithm 1.Algorithm 1:Our proposed SPCA based iterative algorithm for AF relaying protocol.
(1) Set t=1 and select arbitrary initial feasible o, ϱ, ς, υ, αa and βa.
(2) repeat
(3)  Transform P4 into convex problem and solve it through Lagrange dual method. Then acquire the optimal power pds(t),
pdj(t), pap(t) and pas(t);
(4)  Update o(t), ϱ(t), ς(t) and υ(t) with (37);
(5)  Update αa(t) and βa(t) with Rsn(t)=αa and Rana(t)=βa(t), respectively;
(6) until  The differences of both αa and βa in successive iterations are less than 10-3.Therefore, we acquire the suboptimal relaying power, jamming power, and downlink and uplink power for AF relaying protocol.


#### 3.2.2. DF Relaying Protocol

Similar to the AF relaying protocol, we solve the nonconvex problem P2 by transforming its nonconvex items into convex items. SetRsn≥αd and Rand≥βd which can be written as(39)pdsω2HhashasHω2-pdjω1HhashasHω12αd-1-2αd-11+Ppgps≥0,pfshashasH-2βd-1pfphashasH-1≥0.For the secrecy rate constraint, we can utilize the lower bound to demonstrate this constraint as(40)Rsecd=Rpd-Red≥log2γpdγed≥Rsectar,where γpd and γed are the second items of the right sides of (23) and (28), respectively. Then (40) can be written as shown in (41)pfspdj1-22Rsectar+pfjpds1-22Rsectar+pfspds1-22Rsectar-pfjpdj22Rsectar-22Rsectargsppdj-22Rsectargsppds≥0.Similarly, the last two constraints of P2 can be rewritten as(42)Ppgps-22Rp-1-pdjω1HhashasHω122Rp-1≥0,pdsω2HhashasHω2-pdjω1HhashasHω12Rs-1-2Rs-11+Ppgps≥0.Then, the optimization problem of P2 can be written as(43)P5:maxpdj,pds,pfp,pfj,pfsαd+βds.t.pdj+pds≤Ps,pfp+pfj+pfs≤Ps,equations39,41,42.Utilizing Proposition1 and constructing Gpdj,pds,pfp,pfj,pfs with parameters o, ϱ, ς, υ, and ϕ, then we can solve this problem with Algorithm 2.Algorithm 2:Our proposed SPCA based iterative algorithm for DF relaying protocol.
(1) Set t=1 and select arbitrary initial feasible o, ϱ, ς, υ, ϕ, αd and βd.
(2) repeat
(3)  Transform P4 into convex problem and solve it through Lagrange dual method. Then acquire the optimal power pds(t),
pdj(t), pfp(t), pfj(t) and pfs(t);
(4)  Update o(t), ϱ(t), ς(t), υ(t) and ϕ(t);
(5)  Update αd(t) and βd(t) with Rsn(t)=αd and Rand(t)=βd(t), respectively;
(6) until The differences of both αd and βd in successive iterations are less than 10-3.Therefore, we acquire the suboptimal relaying power, jamming power, and downlink and uplink power for AF relaying protocol.


## 3.1. Problem Formulation

During the first slot, the downlink transmission rate at SN is(9)Rsn=log21+pdsω2hasHhasω2H1+pdjω1hasHhasω1H+Ppgps.Then, we will derive the transmission rate during the second slot in both AF and DF relaying protocols.


### 3.1.1. AF Relaying Protocol

When SN utilizes AF relaying protocol, AN firstly cancels the jamming signal and acquires the uplink transmission rate as(10)Rana=log21+pashasHhasPpgpt+1paphasHhas/pdjω1HhashasHω1+Ppgps+1+M.PR also receives the forwarding signal with rate Rpa which is given by(11)Rpa=12log21+Ppgpspapgsp/pdjω1HhashasHω1+Ppgps+1pdjω1HhashasHω1+1papgsp/pdjω1HhashasHω1+Ppgps+1+pasgsp+1.EV tries to eavesdrop the primary message during the second slot. However, in both slots, EV can receive the jamming signal which can be used for the jamming interference cancellation. Then, the received signals at EV can be rewritten as(12)yea=heaxp+nea,where(13)hea=0Pphpsxppdjω1HhashasHω1+Ppgps+1paphae,nea=ne1ane2a,with(14)ne1a=pdjω1Hxj+pdsω2Hxdhae+ne1,ne2a=pdjω1Hhasxj+nsnpaphtepdjω1HhashasHω1+Ppgps+1+pashsexu+ne2a.Then the covariance matrix of nea is derived as Qa which is given by(15)Qa=q11aq12aq21aq22a,where(16)q11a=pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1,q12a=pdjω1HhaehasHω1paphsepdjω1HhashasHω1+Ppgps+1,q21a=pdjω1HhaehasHω1paphsepdjω1HhashasHω1+Ppgps+1∗,q22a=pdjω1HhashasHω1+1pdjω1HhashasHω1+Ppgps+1papgse+pasgse+1.Multiplying both sides of (12) with Qa-1/2, then nea can be transformed into white Gaussian noise. Therefore, the eavesdropping rate can be derived as Rea which is shown in (17)Rea=12log2⁡I+Qa-1/2heaheaHQa-1/2H=12log21+pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1Pppapgsegpspdjω1HhashasHω1+Ppgps+1pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pdjω1HhashasHω1+1pdjω1HhashasHω1+Ppgps+1papgse+pasgse+1-pdj2papgseω1HhaehasHω12pdjω1HhashasHω1+Ppgps+12-1.Therefore, the secrecy rate of the primary system is(18)Rseca=Rpa-Rea+,where x+=max0,x.Then our optimization problem can be formulated as(19)P1:maxpdj,pds,pap,pasRsn+Rana(20)s.t.pdj+pds≤Ps,pap+pas≤Ps,Rseca≥Rsectar,where the first two constraints are the maximum transmit power constraints and the third constraint is the secure transmission rate requirement.


### 3.1.2. DF Relaying Protocol

When SN employs the DF relaying protocol to forward the primary message concurrently with the uplink message and jamming signal, SN will cancel the jamming signal firstly and decode the primary message with achieved rate as(21)Rpsd=12log2⁡1+Ppgps1+pdjω1HhashasHω1.Then the uplink transmission rate is(22)Rand=log⁡1+pfshashasHpfphashasH+1.The primary transmission rate is(23)Rpd=12log21+pfpgsppfjgsp+pfsgsp+1.Similarly as the AF relaying protocol, EV will receive signals in both slots and the received signals can be written as(24)yed=hedxp+ned,where(25)hed=0pdphse,ned=pfjω1Hxj+pfsω2Hxdhae+ne1pfjxj+pfsxuhse+ne2d.Then, the covariance matrix of ned is derived as Qd which is given by(26)Qd=q11dq12dq21dq22d,where(27)q11d=pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1,q12d=pdjpfjω1Hhaehse,q21d=pfjpdjω1Hhaehse∗,q22d=pfj+pfsgse+1.Multiplying both sides of(24) with Qd-1/2, we can derive the eavesdropping rate as shown in (28)Red=12log2I+Qs-1/2nednedHQs-1/2H=12log21+pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pfpgsepdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pfj+pfsgse+1-pfjpdjgseω1Hhae2.Then the secrecy rate of the primary system is(29)Rsecd=Rpd-Red+.To maximize the transmission rate of SN, we formulate the optimaizaition problem as(30)P2:maxpdj,pds,pfp,pfj,pfsRsn+Rands.t.pdj+pds≤Ps,pfp+pfj+pfs≤Ps,Rsecd≥Rsectar,Rsn≥Rs,Rpsd≥Rp,where the first two constraints are the maximum transmit power constraints, the third constraint is the secure transmission rate requirement, the fourth constraint is the SN’s downlink target transmission rate requirement, and the fifth constraint is the primary target transmission rate requirement.


## 3.1.1. AF Relaying Protocol

When SN utilizes AF relaying protocol, AN firstly cancels the jamming signal and acquires the uplink transmission rate as(10)Rana=log21+pashasHhasPpgpt+1paphasHhas/pdjω1HhashasHω1+Ppgps+1+M.PR also receives the forwarding signal with rate Rpa which is given by(11)Rpa=12log21+Ppgpspapgsp/pdjω1HhashasHω1+Ppgps+1pdjω1HhashasHω1+1papgsp/pdjω1HhashasHω1+Ppgps+1+pasgsp+1.EV tries to eavesdrop the primary message during the second slot. However, in both slots, EV can receive the jamming signal which can be used for the jamming interference cancellation. Then, the received signals at EV can be rewritten as(12)yea=heaxp+nea,where(13)hea=0Pphpsxppdjω1HhashasHω1+Ppgps+1paphae,nea=ne1ane2a,with(14)ne1a=pdjω1Hxj+pdsω2Hxdhae+ne1,ne2a=pdjω1Hhasxj+nsnpaphtepdjω1HhashasHω1+Ppgps+1+pashsexu+ne2a.Then the covariance matrix of nea is derived as Qa which is given by(15)Qa=q11aq12aq21aq22a,where(16)q11a=pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1,q12a=pdjω1HhaehasHω1paphsepdjω1HhashasHω1+Ppgps+1,q21a=pdjω1HhaehasHω1paphsepdjω1HhashasHω1+Ppgps+1∗,q22a=pdjω1HhashasHω1+1pdjω1HhashasHω1+Ppgps+1papgse+pasgse+1.Multiplying both sides of (12) with Qa-1/2, then nea can be transformed into white Gaussian noise. Therefore, the eavesdropping rate can be derived as Rea which is shown in (17)Rea=12log2⁡I+Qa-1/2heaheaHQa-1/2H=12log21+pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1Pppapgsegpspdjω1HhashasHω1+Ppgps+1pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pdjω1HhashasHω1+1pdjω1HhashasHω1+Ppgps+1papgse+pasgse+1-pdj2papgseω1HhaehasHω12pdjω1HhashasHω1+Ppgps+12-1.Therefore, the secrecy rate of the primary system is(18)Rseca=Rpa-Rea+,where x+=max0,x.Then our optimization problem can be formulated as(19)P1:maxpdj,pds,pap,pasRsn+Rana(20)s.t.pdj+pds≤Ps,pap+pas≤Ps,Rseca≥Rsectar,where the first two constraints are the maximum transmit power constraints and the third constraint is the secure transmission rate requirement.


## 3.1.2. DF Relaying Protocol

When SN employs the DF relaying protocol to forward the primary message concurrently with the uplink message and jamming signal, SN will cancel the jamming signal firstly and decode the primary message with achieved rate as(21)Rpsd=12log2⁡1+Ppgps1+pdjω1HhashasHω1.Then the uplink transmission rate is(22)Rand=log⁡1+pfshashasHpfphashasH+1.The primary transmission rate is(23)Rpd=12log21+pfpgsppfjgsp+pfsgsp+1.Similarly as the AF relaying protocol, EV will receive signals in both slots and the received signals can be written as(24)yed=hedxp+ned,where(25)hed=0pdphse,ned=pfjω1Hxj+pfsω2Hxdhae+ne1pfjxj+pfsxuhse+ne2d.Then, the covariance matrix of ned is derived as Qd which is given by(26)Qd=q11dq12dq21dq22d,where(27)q11d=pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1,q12d=pdjpfjω1Hhaehse,q21d=pfjpdjω1Hhaehse∗,q22d=pfj+pfsgse+1.Multiplying both sides of(24) with Qd-1/2, we can derive the eavesdropping rate as shown in (28)Red=12log2I+Qs-1/2nednedHQs-1/2H=12log21+pdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pfpgsepdjω1HhaehaeHω1+pdsω2HhaehaeHω2+1pfj+pfsgse+1-pfjpdjgseω1Hhae2.Then the secrecy rate of the primary system is(29)Rsecd=Rpd-Red+.To maximize the transmission rate of SN, we formulate the optimaizaition problem as(30)P2:maxpdj,pds,pfp,pfj,pfsRsn+Rands.t.pdj+pds≤Ps,pfp+pfj+pfs≤Ps,Rsecd≥Rsectar,Rsn≥Rs,Rpsd≥Rp,where the first two constraints are the maximum transmit power constraints, the third constraint is the secure transmission rate requirement, the fourth constraint is the SN’s downlink target transmission rate requirement, and the fifth constraint is the primary target transmission rate requirement.


## 3.2. Power Allocation Strategy

In this section, we will try to solve the optimization problemsP1 and P2 by allocating the relaying power, jamming power, and uplink and downlink power to maximize the transmission rate of WSN under the constraint of PUs’ security requirement. For the sake of simplicity, we set ω1=has/has and ω2=hae/hae.


### 3.2.1. AF Relaying Protocol

For problemP1, as the security constraint is nonconvex, we cannot solve this problem through the conventional convex method. To solve this problem, we try to transform the nonconvex items into convex items and utilize the conventional convex method to solve the transformed problem.SetRsn≥αa and Rana≥βa; we can transform the optimization problem into P3 which is given by(31)P3:maxpdj,pds,pap,pasαa+βas.t.Rsn≥αa,Rana≥βa,equation20,where Rsn≥αa and Rana≥βa can be written as (32)pdsω2HhashasHω2-pdjω1HhashasHω12αa-1-2αa-11+Ppgps≥0,paspdj2β-1hasHhasω1HhashasHω1+pasPpgpt+12β-1hasHhas-paphasHhasPpgps+1-pdjω1HhashasHω1M-PpgpsM-M≥0.The security constraint of (20) can be approximated by its lower bound which is given by(33)Rseca=Rpa-Rea≥log2γpaγea≥Rsectar,where γpa and γea are the second items of the right sides of (11) and (17), respectively. Then (33) can be written as (34)1-22Rsectarpapgpspappdj2Ppω1HhashasHω1+paspdj2Ppω1HhashasHω1+paspdjgps+pdjpappdsPpω1HhashasHω1+paspdjpdsPpω1HhashasHω1+pdspasPp2gps+pappdj3ω1HhashasHω1+paspdj3ω1HhashasHω1+paspdj2Ppgps+pappdspdj2ω1HhashasHω1+paspdspdj2ω1HhashasHω1+paspdspdjPpgps-pdj2pap≥0.Then the optimization problem P3 can be written as(35)P4:maxpdj,pds,pap,pasαa+βas.t.pdj+pds≤Ps,pap+pas≤Ps,equations32,34.The constraints of P4 are still nonconvex due to the polynomial items of pds, pdj, pap, and pas. To solve this problem, based on the SPCA method [37], we propose a SPCA based iterative algorithm which will approximate the nonconvex items with their inner convex bounds.Proposition 1.
The nonconvex polynomial itemxtoytϱztςutυ can be approximated by their inner convex bound Gxt,yt,zt,ut which is given by(36)Gxt,yt,zt,ut=φ1txt2+φ2tyt2+φ3tzt2+φ4tut2,where(37)φ1t-1=oxt-1o-1yt-1ϱzt-1ςut-1υ2,φ2t-1=ϱxt-1oyt-1ϱ-1zt-1ςut-1υ2,φ3t-1=ςxt-1oyt-1ϱzt-1ς-1ut-1υ2,φ4t-1=υxt-1oyt-1ϱzt-1ςut-1υ-12,and t is the iterative number.Proof.
Based on the SPCA method in [37], xoyϱzςuυ can be approximated by Gx,y,z,u when o, ϱ, ς, and υ satisfy the follow properties:(38)xoyϱzςuυ=Gx,y,z,u,∇xoyϱzςuυ=∇Gx,y,z,u,with given x>0, y>0, z>0, and u>0. To satisfy (38), o, ϱ, ς, and υ should be the functions of x, y, z, and u. Therefore, we construct o, ϱ, ς, and υ as shown in (37) which satisfies the first constraint in (38). As ∇Gx,y,z,u=2φ1x,2φ2y,2φ3z,2φ4uT and ∇xoyϱzςuυ=oxo-1yϱzςuυ,ϱxoyϱ1zςuυ,ςxoyϱzς-1uυ,υxoyϱzςuυ-1T and substituting (37) into ∇Gx,y,z,u, we can prove the second constraint of (38). Then, we prove Proposition 1.Utilizing Proposition1, P4 can be transformed into convex problem which will be solved by the conventional convex algorithm. Then, our proposed SPCA based iterative algorithm can be summarized as in Algorithm 1.Algorithm 1:Our proposed SPCA based iterative algorithm for AF relaying protocol.
(1) Set t=1 and select arbitrary initial feasible o, ϱ, ς, υ, αa and βa.
(2) repeat
(3)  Transform P4 into convex problem and solve it through Lagrange dual method. Then acquire the optimal power pds(t),
pdj(t), pap(t) and pas(t);
(4)  Update o(t), ϱ(t), ς(t) and υ(t) with (37);
(5)  Update αa(t) and βa(t) with Rsn(t)=αa and Rana(t)=βa(t), respectively;
(6) until  The differences of both αa and βa in successive iterations are less than 10-3.Therefore, we acquire the suboptimal relaying power, jamming power, and downlink and uplink power for AF relaying protocol.


### 3.2.2. DF Relaying Protocol

Similar to the AF relaying protocol, we solve the nonconvex problem P2 by transforming its nonconvex items into convex items. SetRsn≥αd and Rand≥βd which can be written as(39)pdsω2HhashasHω2-pdjω1HhashasHω12αd-1-2αd-11+Ppgps≥0,pfshashasH-2βd-1pfphashasH-1≥0.For the secrecy rate constraint, we can utilize the lower bound to demonstrate this constraint as(40)Rsecd=Rpd-Red≥log2γpdγed≥Rsectar,where γpd and γed are the second items of the right sides of (23) and (28), respectively. Then (40) can be written as shown in (41)pfspdj1-22Rsectar+pfjpds1-22Rsectar+pfspds1-22Rsectar-pfjpdj22Rsectar-22Rsectargsppdj-22Rsectargsppds≥0.Similarly, the last two constraints of P2 can be rewritten as(42)Ppgps-22Rp-1-pdjω1HhashasHω122Rp-1≥0,pdsω2HhashasHω2-pdjω1HhashasHω12Rs-1-2Rs-11+Ppgps≥0.Then, the optimization problem of P2 can be written as(43)P5:maxpdj,pds,pfp,pfj,pfsαd+βds.t.pdj+pds≤Ps,pfp+pfj+pfs≤Ps,equations39,41,42.Utilizing Proposition1 and constructing Gpdj,pds,pfp,pfj,pfs with parameters o, ϱ, ς, υ, and ϕ, then we can solve this problem with Algorithm 2.Algorithm 2:Our proposed SPCA based iterative algorithm for DF relaying protocol.
(1) Set t=1 and select arbitrary initial feasible o, ϱ, ς, υ, ϕ, αd and βd.
(2) repeat
(3)  Transform P4 into convex problem and solve it through Lagrange dual method. Then acquire the optimal power pds(t),
pdj(t), pfp(t), pfj(t) and pfs(t);
(4)  Update o(t), ϱ(t), ς(t), υ(t) and ϕ(t);
(5)  Update αd(t) and βd(t) with Rsn(t)=αd and Rand(t)=βd(t), respectively;
(6) until The differences of both αd and βd in successive iterations are less than 10-3.Therefore, we acquire the suboptimal relaying power, jamming power, and downlink and uplink power for AF relaying protocol.


## 3.2.1. AF Relaying Protocol

For problemP1, as the security constraint is nonconvex, we cannot solve this problem through the conventional convex method. To solve this problem, we try to transform the nonconvex items into convex items and utilize the conventional convex method to solve the transformed problem.SetRsn≥αa and Rana≥βa; we can transform the optimization problem into P3 which is given by(31)P3:maxpdj,pds,pap,pasαa+βas.t.Rsn≥αa,Rana≥βa,equation20,where Rsn≥αa and Rana≥βa can be written as (32)pdsω2HhashasHω2-pdjω1HhashasHω12αa-1-2αa-11+Ppgps≥0,paspdj2β-1hasHhasω1HhashasHω1+pasPpgpt+12β-1hasHhas-paphasHhasPpgps+1-pdjω1HhashasHω1M-PpgpsM-M≥0.The security constraint of (20) can be approximated by its lower bound which is given by(33)Rseca=Rpa-Rea≥log2γpaγea≥Rsectar,where γpa and γea are the second items of the right sides of (11) and (17), respectively. Then (33) can be written as (34)1-22Rsectarpapgpspappdj2Ppω1HhashasHω1+paspdj2Ppω1HhashasHω1+paspdjgps+pdjpappdsPpω1HhashasHω1+paspdjpdsPpω1HhashasHω1+pdspasPp2gps+pappdj3ω1HhashasHω1+paspdj3ω1HhashasHω1+paspdj2Ppgps+pappdspdj2ω1HhashasHω1+paspdspdj2ω1HhashasHω1+paspdspdjPpgps-pdj2pap≥0.Then the optimization problem P3 can be written as(35)P4:maxpdj,pds,pap,pasαa+βas.t.pdj+pds≤Ps,pap+pas≤Ps,equations32,34.The constraints of P4 are still nonconvex due to the polynomial items of pds, pdj, pap, and pas. To solve this problem, based on the SPCA method [37], we propose a SPCA based iterative algorithm which will approximate the nonconvex items with their inner convex bounds.Proposition 1.
The nonconvex polynomial itemxtoytϱztςutυ can be approximated by their inner convex bound Gxt,yt,zt,ut which is given by(36)Gxt,yt,zt,ut=φ1txt2+φ2tyt2+φ3tzt2+φ4tut2,where(37)φ1t-1=oxt-1o-1yt-1ϱzt-1ςut-1υ2,φ2t-1=ϱxt-1oyt-1ϱ-1zt-1ςut-1υ2,φ3t-1=ςxt-1oyt-1ϱzt-1ς-1ut-1υ2,φ4t-1=υxt-1oyt-1ϱzt-1ςut-1υ-12,and t is the iterative number.Proof.
Based on the SPCA method in [37], xoyϱzςuυ can be approximated by Gx,y,z,u when o, ϱ, ς, and υ satisfy the follow properties:(38)xoyϱzςuυ=Gx,y,z,u,∇xoyϱzςuυ=∇Gx,y,z,u,with given x>0, y>0, z>0, and u>0. To satisfy (38), o, ϱ, ς, and υ should be the functions of x, y, z, and u. Therefore, we construct o, ϱ, ς, and υ as shown in (37) which satisfies the first constraint in (38). As ∇Gx,y,z,u=2φ1x,2φ2y,2φ3z,2φ4uT and ∇xoyϱzςuυ=oxo-1yϱzςuυ,ϱxoyϱ1zςuυ,ςxoyϱzς-1uυ,υxoyϱzςuυ-1T and substituting (37) into ∇Gx,y,z,u, we can prove the second constraint of (38). Then, we prove Proposition 1.Utilizing Proposition1, P4 can be transformed into convex problem which will be solved by the conventional convex algorithm. Then, our proposed SPCA based iterative algorithm can be summarized as in Algorithm 1.Algorithm 1:Our proposed SPCA based iterative algorithm for AF relaying protocol.
(1) Set t=1 and select arbitrary initial feasible o, ϱ, ς, υ, αa and βa.
(2) repeat
(3)  Transform P4 into convex problem and solve it through Lagrange dual method. Then acquire the optimal power pds(t),
pdj(t), pap(t) and pas(t);
(4)  Update o(t), ϱ(t), ς(t) and υ(t) with (37);
(5)  Update αa(t) and βa(t) with Rsn(t)=αa and Rana(t)=βa(t), respectively;
(6) until  The differences of both αa and βa in successive iterations are less than 10-3.Therefore, we acquire the suboptimal relaying power, jamming power, and downlink and uplink power for AF relaying protocol.


## 3.2.2. DF Relaying Protocol

Similar to the AF relaying protocol, we solve the nonconvex problem P2 by transforming its nonconvex items into convex items. SetRsn≥αd and Rand≥βd which can be written as(39)pdsω2HhashasHω2-pdjω1HhashasHω12αd-1-2αd-11+Ppgps≥0,pfshashasH-2βd-1pfphashasH-1≥0.For the secrecy rate constraint, we can utilize the lower bound to demonstrate this constraint as(40)Rsecd=Rpd-Red≥log2γpdγed≥Rsectar,where γpd and γed are the second items of the right sides of (23) and (28), respectively. Then (40) can be written as shown in (41)pfspdj1-22Rsectar+pfjpds1-22Rsectar+pfspds1-22Rsectar-pfjpdj22Rsectar-22Rsectargsppdj-22Rsectargsppds≥0.Similarly, the last two constraints of P2 can be rewritten as(42)Ppgps-22Rp-1-pdjω1HhashasHω122Rp-1≥0,pdsω2HhashasHω2-pdjω1HhashasHω12Rs-1-2Rs-11+Ppgps≥0.Then, the optimization problem of P2 can be written as(43)P5:maxpdj,pds,pfp,pfj,pfsαd+βds.t.pdj+pds≤Ps,pfp+pfj+pfs≤Ps,equations39,41,42.Utilizing Proposition1 and constructing Gpdj,pds,pfp,pfj,pfs with parameters o, ϱ, ς, υ, and ϕ, then we can solve this problem with Algorithm 2.Algorithm 2:Our proposed SPCA based iterative algorithm for DF relaying protocol.
(1) Set t=1 and select arbitrary initial feasible o, ϱ, ς, υ, ϕ, αd and βd.
(2) repeat
(3)  Transform P4 into convex problem and solve it through Lagrange dual method. Then acquire the optimal power pds(t),
pdj(t), pfp(t), pfj(t) and pfs(t);
(4)  Update o(t), ϱ(t), ς(t), υ(t) and ϕ(t);
(5)  Update αd(t) and βd(t) with Rsn(t)=αd and Rand(t)=βd(t), respectively;
(6) until The differences of both αd and βd in successive iterations are less than 10-3.Therefore, we acquire the suboptimal relaying power, jamming power, and downlink and uplink power for AF relaying protocol.


## 4. Asymptotic Analysis

In this section, we will analyze the asymptotic performance of our proposed scheme and allocate the relaying power, jamming power, and the downlink and uplink transmit power.


### 4.1. High SINR Regime withPs→∞

For the high SINR regime withPs→∞, AN and SN have enough power to assist the primary system and transmit their own signal. However, due to the security of PUs, AN and SN should still control their uplink and down link power, jamming power, and relaying power.


#### 4.1.1. AF Relaying Protocol

WhenPs→∞, the first two constraints of P1 can be removed and we derive the optimization problem as(44)P6:maxpdj,pds,pap,pasRsn+Ranas.t.Rseca≥Rsectar.Problem P6 is still nonconvex and we can adopt Proposition 1 to transform the nonconvex items into convex items. Then our optimization problem can be rewritten as(45)P7:maxpdj,pds,pap,pasαa+βas.t.equations32,34.Adopting Algorithm 1, we can derive the optimal jamming power, relaying power, and uplink and downlink power.


#### 4.1.2. DF Relaying Protocol

WhenPs→∞, it can be easy to decode the downlink signal. In addition, the total power constraints can be removed. Therefore, we can formulate our optimization problem as(46)P8:maxpdj,pds,pfp,pfj,pfsRsn+Rands.t.Rsecd≥Rsectar,Rps≥Rp,where the first constraint can guarantee the secure transmission of the primary system and the second constraint will restrict the jamming power to confirm the successful decoding of the primary message.For this problem, we transform the nonconvex items into convex items and the optimization problem can be written as(47)P9:maxpdj,pds,pfp,pfj,pfsαd+βds.t.Thefirstconstraintof42,39,41.Then, we can adopt Algorithm2 to solve it and acquire the jamming power, relaying power, and uplink and downlink power.


### 4.2. Low SINR Regime withPp→0

WhenPp→0, AN will strictly control its jamming power to confirm secrecy transmission of primary system. Under the condition of Pp→0, we will approximate the transmission rate with its first order derivation as(48)RPp=R˙0Pp+oPp,where oPp denotes the higher-order item.


#### 4.2.1. AF Relaying Protocol

WhenPp→0, the primary system will operate in low SINR regime and we will express their secrecy rate with its first-order derivation with respect to Pp. Therefore, the primary transmission rate can be demonstrated as (49)R˙pa=12ln⁡2Ppgsppdjω1HhashasHω1+1papgsp+pasgsp+1pdjω1HhashasHω1+1+oPp.For the eavesdropping rate, we consider its upper bound by ignoring the noise. Then the eavesdropping rate can be demonstrated as(50)
R
˙
e
a
=
1
2
ln
⁡
2
P
p
p
a
p
g
p
s
p
d
j
p
a
p
ω
1
H
h
a
s
h
a
s
H
ω
1
+
p
a
s
p
d
j
ω
1
H
h
a
s
h
a
s
H
ω
1
-
p
a
p
.Then the secrecy rate can be written as(51)R˙seca=R˙pa-R˙ea.AsPp→0, then the primary transmit power can be ignored when we are calculating the downlink and uplink transmission rate. Then the downlink and uplink transmission rate can be derived as(52)Rsn=log21+pdsω2hasHhasω2H1+pdjω1hasHhasω1H,Rana=log21+pashasHhaspaphasHhas-pdjω1HhashasHω1paphasHhas/pdjω1HhashasHω1+1+M.Set Rsn≥αa and Rana≥βa; (52) can be rewritten as (53)pdsω2HhashasHω2-pdjω1HhashasHω12αa-1-2αa-1≥0,paspdj12βa-1hasHhasω1HhashasHω1+pas12βa-1hasHhas-paphasHhas-pdjω1HhashasHω1M-M.Then the optimization problem can be formulated as(54)P9:maxpdj,pds,pap,pasαa+βas.t.R˙seca≥Rsectar,equation53.For this problem, we can also adopt Algorithm1 to solve it.


#### 4.2.2. DF Relaying Protocol

For the DF relaying protocol withPp→0, we also approximate the secrecy rate with their first-order derivation. When Pp→0, Rsn≤Rand. To confirm the successful decoding of the primary message at SN, AN should not transmit jamming signal. SN adopts the successive interference cancellation method to decode the downlink message and PU’s message. When the downlink message is decoded, it can be cancelled during the decoding of PU’s message. Therefore, AN will transmit with Ps for the downlink message. The primary transmission rate is derived as(55)R˙pd=Ppgps2ln⁡2+oPp.EV will keep silent during the first slot and eavesdrop the primary message during the second slot. Then, the primary transmission rate at EV can be expressed as(56)Red=12log21+pfpgsepfj+pfsgse+1.To simplify the analysis of the problem, we assume the both networks work in low SINR regime. Therefore, the low bound of the eavesdropping rate can be approximated as(57)R˙ed=12pfpgsepfj+pfsgse+1.Then, the secrecy transmission rate is(58)R˙secd=R˙pd-R˙ed.During the first slot, AN can transmit with Ps. Therefore, we force on the power allocation during the second slot. Then the transmission rate is(59)Rand=log⁡1+pfshashasHpfphashasH+pfjhashasH+1.Set Rand≥βd; we can acquire(60)pfs-2β-1pfj+pfphashasH-1≥0.Therefore, the optimization problem can be formulated as(61)P10:maxpfj,pfs,pfpβas.t.R˙secd≥Rsectar,equation60.For this problem, we can adopt Proposition 1 to transform the nonconvex items into convex items. Then, this problem can be solved by the SPCA based algorithm.


## 4.1. High SINR Regime withPs→∞

For the high SINR regime withPs→∞, AN and SN have enough power to assist the primary system and transmit their own signal. However, due to the security of PUs, AN and SN should still control their uplink and down link power, jamming power, and relaying power.


### 4.1.1. AF Relaying Protocol

WhenPs→∞, the first two constraints of P1 can be removed and we derive the optimization problem as(44)P6:maxpdj,pds,pap,pasRsn+Ranas.t.Rseca≥Rsectar.Problem P6 is still nonconvex and we can adopt Proposition 1 to transform the nonconvex items into convex items. Then our optimization problem can be rewritten as(45)P7:maxpdj,pds,pap,pasαa+βas.t.equations32,34.Adopting Algorithm 1, we can derive the optimal jamming power, relaying power, and uplink and downlink power.


### 4.1.2. DF Relaying Protocol

WhenPs→∞, it can be easy to decode the downlink signal. In addition, the total power constraints can be removed. Therefore, we can formulate our optimization problem as(46)P8:maxpdj,pds,pfp,pfj,pfsRsn+Rands.t.Rsecd≥Rsectar,Rps≥Rp,where the first constraint can guarantee the secure transmission of the primary system and the second constraint will restrict the jamming power to confirm the successful decoding of the primary message.For this problem, we transform the nonconvex items into convex items and the optimization problem can be written as(47)P9:maxpdj,pds,pfp,pfj,pfsαd+βds.t.Thefirstconstraintof42,39,41.Then, we can adopt Algorithm2 to solve it and acquire the jamming power, relaying power, and uplink and downlink power.


## 4.1.1. AF Relaying Protocol

WhenPs→∞, the first two constraints of P1 can be removed and we derive the optimization problem as(44)P6:maxpdj,pds,pap,pasRsn+Ranas.t.Rseca≥Rsectar.Problem P6 is still nonconvex and we can adopt Proposition 1 to transform the nonconvex items into convex items. Then our optimization problem can be rewritten as(45)P7:maxpdj,pds,pap,pasαa+βas.t.equations32,34.Adopting Algorithm 1, we can derive the optimal jamming power, relaying power, and uplink and downlink power.


## 4.1.2. DF Relaying Protocol

WhenPs→∞, it can be easy to decode the downlink signal. In addition, the total power constraints can be removed. Therefore, we can formulate our optimization problem as(46)P8:maxpdj,pds,pfp,pfj,pfsRsn+Rands.t.Rsecd≥Rsectar,Rps≥Rp,where the first constraint can guarantee the secure transmission of the primary system and the second constraint will restrict the jamming power to confirm the successful decoding of the primary message.For this problem, we transform the nonconvex items into convex items and the optimization problem can be written as(47)P9:maxpdj,pds,pfp,pfj,pfsαd+βds.t.Thefirstconstraintof42,39,41.Then, we can adopt Algorithm2 to solve it and acquire the jamming power, relaying power, and uplink and downlink power.


## 4.2. Low SINR Regime withPp→0

WhenPp→0, AN will strictly control its jamming power to confirm secrecy transmission of primary system. Under the condition of Pp→0, we will approximate the transmission rate with its first order derivation as(48)RPp=R˙0Pp+oPp,where oPp denotes the higher-order item.


### 4.2.1. AF Relaying Protocol

WhenPp→0, the primary system will operate in low SINR regime and we will express their secrecy rate with its first-order derivation with respect to Pp. Therefore, the primary transmission rate can be demonstrated as (49)R˙pa=12ln⁡2Ppgsppdjω1HhashasHω1+1papgsp+pasgsp+1pdjω1HhashasHω1+1+oPp.For the eavesdropping rate, we consider its upper bound by ignoring the noise. Then the eavesdropping rate can be demonstrated as(50)
R
˙
e
a
=
1
2
ln
⁡
2
P
p
p
a
p
g
p
s
p
d
j
p
a
p
ω
1
H
h
a
s
h
a
s
H
ω
1
+
p
a
s
p
d
j
ω
1
H
h
a
s
h
a
s
H
ω
1
-
p
a
p
.Then the secrecy rate can be written as(51)R˙seca=R˙pa-R˙ea.AsPp→0, then the primary transmit power can be ignored when we are calculating the downlink and uplink transmission rate. Then the downlink and uplink transmission rate can be derived as(52)Rsn=log21+pdsω2hasHhasω2H1+pdjω1hasHhasω1H,Rana=log21+pashasHhaspaphasHhas-pdjω1HhashasHω1paphasHhas/pdjω1HhashasHω1+1+M.Set Rsn≥αa and Rana≥βa; (52) can be rewritten as (53)pdsω2HhashasHω2-pdjω1HhashasHω12αa-1-2αa-1≥0,paspdj12βa-1hasHhasω1HhashasHω1+pas12βa-1hasHhas-paphasHhas-pdjω1HhashasHω1M-M.Then the optimization problem can be formulated as(54)P9:maxpdj,pds,pap,pasαa+βas.t.R˙seca≥Rsectar,equation53.For this problem, we can also adopt Algorithm1 to solve it.


### 4.2.2. DF Relaying Protocol

For the DF relaying protocol withPp→0, we also approximate the secrecy rate with their first-order derivation. When Pp→0, Rsn≤Rand. To confirm the successful decoding of the primary message at SN, AN should not transmit jamming signal. SN adopts the successive interference cancellation method to decode the downlink message and PU’s message. When the downlink message is decoded, it can be cancelled during the decoding of PU’s message. Therefore, AN will transmit with Ps for the downlink message. The primary transmission rate is derived as(55)R˙pd=Ppgps2ln⁡2+oPp.EV will keep silent during the first slot and eavesdrop the primary message during the second slot. Then, the primary transmission rate at EV can be expressed as(56)Red=12log21+pfpgsepfj+pfsgse+1.To simplify the analysis of the problem, we assume the both networks work in low SINR regime. Therefore, the low bound of the eavesdropping rate can be approximated as(57)R˙ed=12pfpgsepfj+pfsgse+1.Then, the secrecy transmission rate is(58)R˙secd=R˙pd-R˙ed.During the first slot, AN can transmit with Ps. Therefore, we force on the power allocation during the second slot. Then the transmission rate is(59)Rand=log⁡1+pfshashasHpfphashasH+pfjhashasH+1.Set Rand≥βd; we can acquire(60)pfs-2β-1pfj+pfphashasH-1≥0.Therefore, the optimization problem can be formulated as(61)P10:maxpfj,pfs,pfpβas.t.R˙secd≥Rsectar,equation60.For this problem, we can adopt Proposition 1 to transform the nonconvex items into convex items. Then, this problem can be solved by the SPCA based algorithm.


## 4.2.1. AF Relaying Protocol

WhenPp→0, the primary system will operate in low SINR regime and we will express their secrecy rate with its first-order derivation with respect to Pp. Therefore, the primary transmission rate can be demonstrated as (49)R˙pa=12ln⁡2Ppgsppdjω1HhashasHω1+1papgsp+pasgsp+1pdjω1HhashasHω1+1+oPp.For the eavesdropping rate, we consider its upper bound by ignoring the noise. Then the eavesdropping rate can be demonstrated as(50)
R
˙
e
a
=
1
2
ln
⁡
2
P
p
p
a
p
g
p
s
p
d
j
p
a
p
ω
1
H
h
a
s
h
a
s
H
ω
1
+
p
a
s
p
d
j
ω
1
H
h
a
s
h
a
s
H
ω
1
-
p
a
p
.Then the secrecy rate can be written as(51)R˙seca=R˙pa-R˙ea.AsPp→0, then the primary transmit power can be ignored when we are calculating the downlink and uplink transmission rate. Then the downlink and uplink transmission rate can be derived as(52)Rsn=log21+pdsω2hasHhasω2H1+pdjω1hasHhasω1H,Rana=log21+pashasHhaspaphasHhas-pdjω1HhashasHω1paphasHhas/pdjω1HhashasHω1+1+M.Set Rsn≥αa and Rana≥βa; (52) can be rewritten as (53)pdsω2HhashasHω2-pdjω1HhashasHω12αa-1-2αa-1≥0,paspdj12βa-1hasHhasω1HhashasHω1+pas12βa-1hasHhas-paphasHhas-pdjω1HhashasHω1M-M.Then the optimization problem can be formulated as(54)P9:maxpdj,pds,pap,pasαa+βas.t.R˙seca≥Rsectar,equation53.For this problem, we can also adopt Algorithm1 to solve it.


## 4.2.2. DF Relaying Protocol

For the DF relaying protocol withPp→0, we also approximate the secrecy rate with their first-order derivation. When Pp→0, Rsn≤Rand. To confirm the successful decoding of the primary message at SN, AN should not transmit jamming signal. SN adopts the successive interference cancellation method to decode the downlink message and PU’s message. When the downlink message is decoded, it can be cancelled during the decoding of PU’s message. Therefore, AN will transmit with Ps for the downlink message. The primary transmission rate is derived as(55)R˙pd=Ppgps2ln⁡2+oPp.EV will keep silent during the first slot and eavesdrop the primary message during the second slot. Then, the primary transmission rate at EV can be expressed as(56)Red=12log21+pfpgsepfj+pfsgse+1.To simplify the analysis of the problem, we assume the both networks work in low SINR regime. Therefore, the low bound of the eavesdropping rate can be approximated as(57)R˙ed=12pfpgsepfj+pfsgse+1.Then, the secrecy transmission rate is(58)R˙secd=R˙pd-R˙ed.During the first slot, AN can transmit with Ps. Therefore, we force on the power allocation during the second slot. Then the transmission rate is(59)Rand=log⁡1+pfshashasHpfphashasH+pfjhashasH+1.Set Rand≥βd; we can acquire(60)pfs-2β-1pfj+pfphashasH-1≥0.Therefore, the optimization problem can be formulated as(61)P10:maxpfj,pfs,pfpβas.t.R˙secd≥Rsectar,equation60.For this problem, we can adopt Proposition 1 to transform the nonconvex items into convex items. Then, this problem can be solved by the SPCA based algorithm.


## 5. Simulation Results

In this section, we will investigate the performance of our proposed scheme with empirical parameters. The communication scenario is demonstrated in Section2. In our simulation, we assume that AN has four antennas and all other nodes have only one antenna. AN and SN locate in the middle between PT and PR. All channels experience large scale and small scale fading. The path loss parameter is set to 3. We will evaluate the transmission rate of WSN under the constraint of primary security requirement with Monte Carlo experiments. In addition, we will evaluate the cooperative jamming scheme (CJS) in [33] for comparison. For CJS, PT transmits its message during the first slot and SN cooperates with PT during the second slot. In addition, SN will transmit its signal only during the second slot.In Figure2, we simulate the transmission rate of our proposed scheme, underlay scheme, and the CJS scheme. In addition, we also investigate effect of the downlink decoding failure to the transmission rate and we denoted these schemes as DF-Uplink and AF-Uplink. In this figure, we can figure out that the performance of the our proposed scheme outperforms the comparison schemes. High Ps means that there will be more power for the transmission of WSN even satisfying the primary secure transmission requirement. Therefore the transmission rate of WSN will increase with the increasing of Ps. For the underlay scheme, when Ps is low, the transmission rate of WSN will increase with the increasing of Ps. However, due to the interference threshold constraint, the transmission rate of WSN will stay the same under high Ps for underlay scheme. In addition, due to the effect of interference from the primary users and the constraint of interference threshold, the transmission rate of WSN for the underlay scheme is lower than other schemes. When the downlink message is unsuccessfully decoded, the downlink signal will be regarded as noise and the cognitive sensor network only has the uplink transmission. Then the transmission rate of WSN will decrease. As the jamming interference at AN cannot be cancelled and the downlink transmission is not considered in the CJS scheme, the transmission rate of CJS scheme is lower than our proposed scheme.Figure 2
The transmission rate of WSN (Rsectar=0.05, Ps=6dB, and Pp=8dB).In Figure3, we simulate the transmission rate of WSN versus the primary transmit power Pp with different Rsectar requirements. High Rsectar means that AN and SN have to spend more power for the primary secure transmission. Therefore, there will be less power for the transmission of WSN which results in low transmission rate for AN and SN. For AF relaying protocol, the received noise will be amplified and forwarded which will waste more power during the relaying process under the same target secure transmission rate requirement. Then, there will be less power for the transmission of WSN which results in lower transmission rate for AF relaying protocol compared with the DF relaying protocol. As the CJS scheme only considers the cooperation during the relaying process, then the change of the primary power has no effect on the transmission rate of WSN. In addition, the downlink transmission has not been considered in CJS which leads to the lower transmission rate compared with our proposed scheme.Figure 3
The transmission rate of WSN under low SNR regime with different target secure rate requirements (Ps=2dB).In Figure4, we simulate the transmission rate of WSN versus the transmit power Ps of WSN with different Rsectar requirements. Under high Ps, more power can be allocated for the transmission of WSN even under the constraint of primary target secure transmission rate requirement. As the primary transmit power Pp is much less than Ps, the primary transmission has less effect on the transmission of WSN. Then the transmission rate almost linearly increases with the increasing of Ps. As the amplifying and forwarding of the noise variable will cost more power, the performance of DF relaying protocol outperforms the AF relaying protocol. The increasing of Ps also affects the transmission rate of CJS and the transmission rate also linearly increases with the increasing of Ps. However, our scheme still outperforms the CJS scheme due to the two-phase cooperation.Figure 4
The transmission rate of WSN under high SNR regime with different target secure rate requirements (Pp=10dB).In Figure5, we show the transmission rate of WSN versus the transmit power of WSN under different primary target secure transmission rate requirements. Similarly, high Rsectar means more power is allocated to assistant the primary transmission. Then there will be less power for the transmission of WSN which results in low transmission rate. With the increasing of Ps, there will be more power allocated for the transmission of WSN even satisfying the primary secure transmission rate. When Ps is small, there will be more power allocated for the primary transmission which leads to low transmission rate of CRSN. The DF relaying protocol still outperforms the AF relaying protocol due to the forwarding of noise. In addition, Figure 5 shows that our proposed scheme still outperforms the CJS scheme.Figure 5
The transmission rate of WSN as a function ofPs under different target secure rate requirements (Pp=8dB).In Figure6, we show the transmission rate of WSN versus the distance between PT and SN under different primary target secure rate requirements. We assume that the distance between PT and PR is unit and SN will move in the line between PT and PR. When SN nears PT, there will be more power allocated for primary secure transmission during the relaying process. In addition, downlink transmission will experience strong interference from PT; therefore, the transmission rate of WSN increases slowly. When SN nears PR, the received SINR of the primary signal at SN is low. Therefore, the primary transmission will experience more outages which will waste more spectrum opportunities and the transmission of WSN increases slowly. Similarly, the DF relaying protocol still outperforms the AF relaying protocol due to the forwarding of noise. For CJS, the downlink transmission has not been considered in CJS which leads to the lower transmission rate compared with our proposed scheme.Figure 6
The transmission rate of CRSN versus the distance between PT and SN under different primary target secure rate requirements (Ps=6dB and Pp=8dB).In Figure7, we show the transmission rate of WSN versus the distance between SN and EV under different primary target secure rate requirements. From this figure, we can figure out that when the distance between SN and EV is large, the transmission rate will increase. The reason is that when dSN-EV is large, there will be less power allocated for the cooperation and more remaining power allocated for the transmission of WSN. Then the transmission rate of WSN increases. When dSN-EV is very large, the transmit power Ps will limit the increasing of the transmission rate. Then the transmission rate of WSN will increase slowly. Similarly, the DF relaying protocol still outperforms the AF relaying protocol due to the forwarding of noise. For CJS, as it only considers the cooperation during the relaying process, therefore the transmission rate is lower than our proposed scheme.Figure 7
The transmission rate of WSN versus the distance between SN and EV under different primary target secure rate requirements (Ps=6dB and Pp=8dB).


## 6. Conclusion

In this paper, we proposed a CRJS scheme in which SNs will relay primary message and jamming primary eavesdropper during SNs’ downlink and uplink transmission stages to protect the primary message from eavesdropping and acquire some interference-free licensed spectrum opportunities. In addition, both DF and AF relaying protocols were investigated in our proposed CRJS scheme. We investigated the transmission rate maximization problems of SNs and proposed two SPCA based suboptimal algorithms to solve these problem and allocate the relaying power, jamming power, and downlink and uplink transmit power under the target secure transmission rate requirement of the primary system. Furthermore, we analyzed the transmission rate of SNs and allocate the relaying power, jamming power, and downlink and uplink transmit power for the asymptotic scenarios. Simulation results demonstrated the performance superiority of our developed strategy over conventional jamming scheme in terms of the transmission rate of WSN.



---

*Source: 152851-2015-10-27.xml*