Cognitive radio networks (CRNs) allow coexistence of unlicensed users (UUs) and licensed users (LUs) and hence, mutual interference between UUs and LUs is neither ignored nor considered as Gaussian-distributed quantity. Additionally, exploiting jamming signals to purposely interfere with signal reception of eavesdroppers is a feasible solution to improve security performance of CRNs. This paper analyzes reliability-security trade-off, which accounts for maximum transmit power constraint, interference power constraint, jamming signal, and Rayleigh fading, and considers interference from LUs as non-Gaussian-distributed quantity. Toward this end, exact closed-form expressions of successful detection probability and successful eavesdropping probability, from which reliability-security trade-off is straightforwardly visible, are first suggested and then validated by Monte-Carlo simulations. Various results demonstrate that interference from LUs considerably decreases both probabilities while jamming signal enlarges the difference between them, emphasizing its effectiveness in improving security performance.
National Foundation for Science and Technology Development102.04-2017.011. Introduction
High data rate and strong information security are two among obligatory requirements in designing next generation wireless communication networks (e.g., 5G) [1]. The former can be achieved by cognitive radio technique whose advantage is high spectrum utilization efficiency by permitting both UUs and LUs to operate in the same frequency band primarily allocated to LUs [2]. It is coexistence of both UUs and LUs that causes mutual interference between them [3] and hence, interference from LUs (shortly, licensed interference) is neither ignored nor considered as Gaussian-distributed quantity. On the other hand, physical layer security, which exploits space-time characteristics of wireless channels to secure information transmission, is a feasible solution to satisfy the latter [4–8]. Therefore, physical layer security for CRNs, which can meet simultaneously both above requirements, has recently received a great deal of attention from both academia and industry. Among physical layer security solutions, generating jamming signals, which purposely destroys signal reception of eavesdroppers without degrading quality of service (QoS) of legal receivers, is an effective solution to improve security performance [9, 10]. For a certain physical layer security solution, it is interesting to assess successful detection probability at legal receiver (i.e., probability for legal receiver to successfully restore legitimate signals) and successful eavesdropping probability at eavesdropper (i.e., probability for eavesdropper to successfully decode/steal legitimate signals). Obviously, successful detection probability represents communication reliability while successful eavesdropping probability represents security level. Therefore, reliability-security trade-off is represented by relation between successful detection probability and successful eavesdropping probability. Because the difference (or ratio) between successful detection probability and successful eavesdropping probability has an equivalent physical meanings as the difference (or ratio) between signal power and noise power in communication theory, this difference (or ratio) can represent security performance. This paper analyzes reliability-security trade-off to assess information securing capability of CRNs under both interferences from licensed transmitter and jammer.
1.1. Related Works
This subsection reviews only publications relevant to jamming signal generation to guarantee information transmission securely in underlay CRNs (physical layer security solutions are various. For example, [11] deploys a friendly jammer to interfere with the eavesdropper; [12] proposes a relay selection scheme; [13] implements the joint power control in wiretap interference channels. However, most solutions are proposed for noncognitive radio networks (e.g., [11–13]). Because this paper focuses on jamming signal generation to guarantee information transmission securely in underlay CRNs, literature review on physical layer security solutions for noncognitive radio networks (e.g., [11–13]) should not be further investigated). Such a review is based on typical characteristics such as interference from licensed transmitter, maximum transmit power constraint, interference power constraint, thermal noise, and reliability-security trade-off analysis, and through it, contributions of this paper can be summarized in next subsection.
In [14], an unlicensed source transmits a jamming signal to secure information transmission of LUs in exchange for utilizing licensed spectrum in presence of interference from licensed transmitters. However, [14] does not account for power constraints of unlicensed transmitters such as interference power constraint and maximum transmit power constraint [15, 16]. In [17], cooperative relaying combines jamming signal generation to guarantee information transmission of LUs securely in cognitive two-way networks where one of two UUs sends both jamming signal and legitimate signal while the other UU merely amplifies and forwards the received signal together with its own signal. Optimum power allocation to jamming signal and legitimate signal is proposed there without being subjected to interference power constraint even though both jamming signal and interference from LUs and maximum transmit power constraint are accounted. In [18–21], beamforming vectors for jamming signal and legitimate signal are designed to optimize power allocation to jamming signal and legitimate signal at an unlicensed transmitter subject to maximum transmit power constraint and interference power constraint. Nevertheless, interference from licensed transmitter is not considered there. In [22], a UU transmits both jamming signal and legitimate signal under a simple context, which ignores maximum transmit power constraint and interference from licensed transmitter, to optimize the secrecy throughput of the wiretap channel for CRNs. The same optimization problem as [22] is revisited in [23]. However, [23] considers a different context where interference from licensed transmitter, the connection outage constraint (i.e., the probability for signal-to-interference-plus-noise ratio (SINR) at licensed receiver below a preset level is less than a certain value), and no thermal noise at corresponding receivers, and all randomly located users are investigated. It is noted that the connection outage constraint makes transmit power of UUs unchanged. Therefore, the connection outage constraint together with ignored thermal noise considerably simplifies information securing capability analysis in [23]. The authors in [24] design a beamforming vector at the multiantenna unlicensed source to maximize the minimum secrecy rate of the unlicensed network while guaranteeing the minimum secrecy rate of the licensed network and satisfying maximum transmit power constraint for cognitive multicast communications. Besides beamforming the legitimate signals, the source transmits the jamming signal together with them to further secure information transmission. However, [24] ignores interference power constraint. Table 1 summarizes typical characteristics considered in [14, 17–24] with an emphasis that reliability-security trade-off analysis is not implemented there.
Related works where jamming signal and legitimate signal are combined and simultaneously transmitted by a UU. The characteristic marked with “x” implies that it is considered in the corresponding reference.
Reference
Interference from LUs
Maximum transmit power constraint
Interference power constraint
Thermal noise
Reliability-security trade-off analysis
[14]
x
x
[17]
x
x
x
[18–21]
x
x
x
[22]
x
x
[23]
x
[24]
x
x
x
In contrast to [14, 17–24] where jamming signal and legitimate signal are merged and concurrently broadcasted by an unlicensed transmitter, [25–32] suggest new techniques to prevent eavesdroppers from stealing confidential information in CRNs where jamming signal and legitimate signal are transmitted by two different users. To be more specific, jamming signal and legitimate signal are separately transmitted by two different UUs to guarantee LUs’ communication securely while maintaining QoS of UUs [25]. Nevertheless, [25] neglects interference from licensed transmitter and interference power constraint. The authors in [26] complement the idea in [25] by further considering interference power constraint. Similar to [25, 26] where jamming signal and legitimate signal are transmitted by different UUs, [27] proposes design of a weight vector for jamming signals forwarded by different relays to achieve maximum signal-to-noise ratio (SNR) at legal receiver while restricting SNR at the eavesdropper below a certain level in a context where both interference power constraint and maximum transmit power constraint are accounted. However, [27] ignores interference from licensed transmitter. The authors in [28] complement the work in [27] by accounting for this interference to maximize the secrecy rate. Instead of designing a weight vector for jamming signals forwarded by different relays, each equipped with single antenna as in [27, 28], the authors in [29] implement design of a beamforming vector at a single multiantenna relay. Therefore, [27–29] solve quite similar problems. Furthermore, interference from licensed transmitter is ignored in [29]. In [30], a UU is selected to transmit merely jamming signals not only to deteriorate QoS of the eavesdropper but also to assist secrete communication of another UU. However, power constraints and interference from licensed transmitter are neglected there, which are not reasonable for CRNs where UUs and LUs concurrently operate. For secure transmission of an unlicensed source, [31] adopts two unlicensed relays while [32] chooses an unlicensed relay and an unlicensed destination. However, [31, 32] neglect interference from LUs. Furthermore, [31] does not investigate maximum transmit power constraint. Table 2 summarizes typical characteristics considered in [25–32] with an emphasis that reliability-security trade-off analysis is not implemented there.
Related works where jamming signal and legitimate signal are transmitted by two different users. The characteristic marked with “x” implies that it is considered in the corresponding reference.
Reference
Interference from LUs
Maximum transmit power constraint
Interference power constraint
Thermal noise
Reliability-security trade-off analysis
[25]
x
x
[26]
x
x
x
[27]
x
x
x
[28]
x
x
x
x
[29]
x
x
x
[30]
x
[31]
x
x
[32]
x
x
x
1.2. Contributions
The above literature survey [14, 17–32] shows that reliability-security trade-off analysis of CRNs, where legitimate signal and jamming signal are simultaneously transmitted by two different unlicensed transmitters, under interference from licensed transmitter, maximum transmit power constraint, interference power constraint, and thermal noise, has not been reported in any open literature. We aim to perform this analysis with threefold contributions:
Investigate a physical layer security solution for CRNs where an unlicensed jammer transmits a jamming signal at the same time that an unlicensed transmitter sends its confidential signal to purposely interfere with signal reception of the eavesdropper without degrading the performance of the legal receiver under maximum transmit power constraint, interference power constraint, interference from licensed transmitter, and thermal noise.
Propose exact closed-form expressions of successful detection probability and successful eavesdropping probability, from which reliability-security trade-off is straightforwardly visible for promptly evaluating security performance without the need of time-consuming Monte-Carlo simulations.
Illustrate various results to have useful insights into security performance of underlay cognitive networks such as interference from licensed transmitter adversely decreases successful detection probability and successful eavesdropping probability while jamming signal offers a large difference between them, exposing its effectiveness in securing confidential information.
1.3. Organization
The paper is organized as follows. System model under consideration is described in Section 2. The analysis of successful detection probability and successful eavesdropping probability is presented in Section 3. Numerous results for evaluation and validation of the proposed analysis are presented in Section 4. The paper is concluded in Section 5.
2. System Model
Figure 1 demonstrates a system model for cognitive radio networks under investigation where an unlicensed source US transmits confidential information to an unlicensed destination UD (namely, legal receiver) and this transmission is illegally wire-tapped by an eavesdropper E. Unlicensed users operate in the underlay paradigm [33] and hence, communication between US and UD concurrently takes place with communication between a licensed transmitter LT and a licensed receiver LR, inducing mutual interference to each other. All terminals are assumed to be equipped with single antenna and operated in the half-duplex mode. In order to secure communication between US and UD, an unlicensed jammer UJ transmits a jamming signal Pjvj at the same time that US transmits a legitimate signal Psvs to purposely interfere with signal reception of E where Pj and Ps are transmit powers of UJ and US, respectively; vj and vs are correspondingly a jamming signal and a legitimate signal which are assumed to be Gaussian-distributed and have unity power (i.e., vj~CN(0,1) and vs~CN(0,1) where hab~CN(0,λab) stands for a circular symmetric complex Gaussian random variable (CSCGRV) with zero mean and variance λab). Thus, received signals at UD and E are correspondingly represented as(1)ud=hsdPsvs+hjdPjvj+hpdPpvp+nd,(2)ue=hsePsvs+hjePjvj+hpePpvp+ne,where Pp is power of the licensed transmitter LT; vp is the signal transmitted by LT and is normalized to have unity power and Gaussian-distributed (i.e., vp~CN(0,1)); nd and ne are additive white Gaussian noise at UD and E, correspondingly, each modelled as CN(0,N0); hab stands for a channel coefficient between a transmitter a and a receiver b, which is assumed to be independent, frequency flat, and Rayleigh distributed and hence, hab is modelled as a CSCGRV with zero mean and variance λab, that is, hab~CN(0,λab), a∈US,LT,UJ, and b∈UD,LR,E.
System model.
Since the transmit power of US is Ps, Pshsp2 is the interference power caused by US to LR. Similarly, Pjhjp2 is the interference power caused by UJ to LR. Therefore, the total interference power induced by US and UJ to LR is Pshsp2+Pjhjp2. To guarantee reliable signal reception at LUs, this interference power must be controlled below maximum interference power Im that licensed receivers can tolerate, that is, Pshsp2+Pjhjp2≤Im. In addition, each licensed transmitter is designed with a certain maximum transmit power (i.e., P^s for US and P^j for UJ) and hence, Ps and Pj are limited by P^s and P^j, that is, Ps≤P^s and Pj≤P^j. Briefly, the transmit powers of US and UJ are subjected to the following constraints:(3)Ps≤P^s,(4)Pj≤P^j,(5)Pshsp2+Pjhjp2≤Im,where (3) and (4) are maximum transmit power constraints while (5) is interference power constraint.
From (5), one can select(6)Pshsp2≤αIm,(7)Pjhjp2≤1-αIm,where 0<α≤1 is an interference power distribution factor for US and UJ. α=1 means no jammer. α can be optimally selected not only to control interference to LR but also to increase interference to E.
Combining maximum transmit power constraint in (3) and interference power constraint in (6), transmit power of US must satisfy Ps≤minαIm/hsp2,P^s. For maximum radio coverage, the equality should hold, that is,(8)Ps=minαImhsp2,P^s.
Similarly, to meet both maximum transmit power constraint in (4) and interference power constraint in (7) as well as maximize radio coverage, transmit power of UJ is established as(9)Pj=min1-αImhjp2,P^j.
The jamming signal vj is intentionally generated by UJ to only cause interference to E without inducing performance degradation of UD. This can be achieved by allowing UJ to share vj with UD (e.g., the seed of the jamming signal generator at UJ is shared with UD in a secure manner through a cooperation agreement only between UJ and UD before information transmission starts). Such a jamming signal generation is widely accepted in open literature (e.g., [5, 8, 19–22, 25, 30–32] and references therein). As such, the legal receiver UD can accurately predict the jamming signal and completely eliminate it out of UD’s received signal, ultimately resulting in the jamming-free signal as u~d=hsdPsvs+hpdPpvp+nd. Based on the jamming-free signal, one can infer SINR at UD as(10)βd=EvshsdPsvs2Evp,ndhpdPpvp+nd2=Pshsd2Pphpd2+N0,where EX,Y,…· denotes the expectation operation over random variables X,Y,….
Because the knowledge of the jamming signal vj is only shared between UJ and UD for information securing purpose, the eavesdropper does not know it. Therefore, the SINR at E is inferred from (2) as(11)βe=EvshsePsvs2Evp,vj,nehjePjvj+hpePpvp+ne2=Pshse2Pjhje2+Pphpe2+N0.
It is worth mentioning that the licensed transmitter LT introduces interference powers at UD and E as hpd2Pp and hpe2Pp, respectively, according to (10) and (11). These interference powers are neither ignored nor considered as Gaussian-distributed quantity but rather treated as exponentially distributed random variables. Additionally, UJ deliberately generates jamming power Pjhje2 to the eavesdropper. As such, increasing this jamming power is expected to secure information transmission of US.
Channel capacities at UD and E are, respectively, given by [34](12)Cd=log21+βd,Ce=log21+βe,which are helpful in analyzing successful detection probability of the legal receiver UD and successful eavesdropping probability of the eavesdropper E in next section.
3. Performance Analysis
This section analyzes successful detection probability of the legal receiver UD, Pdet, and successful eavesdropping probability of the eavesdropper E, Peav. According to information theory, Pdet and Peav are correspondingly defined as probabilities for channel capacities of UD and E to be larger than a required level. In other words, successful detection probability of UD and successful eavesdropping probability of E are probabilities for UD and E to successfully decode US’s information, respectively. As such, they are important metrics for evaluating communication reliability and information securing capability. The larger Pdet, the more reliable the signal reception at UD. Meanwhile, the larger Peav, the less secure the information transmission of US. Therefore, the relation between Pdet and Peav represents reliability-security trade-off. Furthermore, the difference (or ratio) between successful detection probability and successful eavesdropping probability has an equivalent physical meanings as the difference (or ratio) between signal power and noise power in communication theory and hence, this difference (or ratio) can represent security performance.
The successful detection probability of UD and the successful eavesdropping probability of E are respectively expressed as(13)Pdet=PrCd≥Cth=Prβd≥x,(14)Peav=PrCe≥Cth=Prβe≥x,where Cth is the threshold for successfully decoding US’s information, x=2Cth-1, and PrQ is the probability of the event Q.
Theorem 1.
The exact closed-form representation of the successful detection probability of the legal receiver UD is given by(15)Pdet=xPpλpdP^sλsd+1-1e-xN0/P^sλsd1-e-αIm/P^sλsp-αImλsdλspPpλpdxeN0/Ppλpd+αImλsd/λspPpλpdxEi-xN0λsd+αImλsp1P^s+λsdPpλpdx,where Eix is the exponential integral function [35].
Proof.
Please see Appendix A.
Before deriving the exact closed-form expression of the successful eavesdropping probability of E, we introduce two special results in the following lemmas.
Lemma 2.
The integrand(16)La,b,c,g=∫a∞e-bzEi-cz-gdzcan be represented in closed form as(17)La,b,c,g=Ei-g-ace-abb+e-gbHa,b+c,gc,where(18)Ha,b,c=-ebcEi-ab-bc.
Proof.
Please see Appendix B.
Lemma 3.
The integrand(19)Ma,b,c,g,l=∫a∞e-bxx+cEi-gx-ldxcan be represented in closed form as(20)Ma,b,c,g,l=-ebl/gCφ1+φ2+∑k=1∞φ3k·k!,where(21)φ1=-Hag+l,bg,cg-l(22)φ2=2eb/g∑k=1∞∑n=02k-1∑s=0n2k-1nns-1s2k-1ζ(23)ζ=Hag+l+1,bg,cg-l-1,s=2k-1θ,s≠2k-1(24)θ=pHag+l+1,bg,cg-l-1+∑v=12k-s-1q2k-s-vBag+l+1,bg,v(25)p=1l+1-cg2k-s-1(26)qm=-1m-1cg-l-1m(27)Ba,b,v=bv-1ab-0.5ve-0.5abW-0.5v,0.51-vab(28)φ3=-1k+1e-b/gl-cgl-cgkHa+cg,bg,0+∑n=1kknl-cgk-nDa+cg,bg,n-1(29)Da,b,n=e-ab∑k=0nn!k!akbn-k+1and C=0.5772156649 is the Euler-Mascheroni constant and Wa,b(c) is the Whittaker function [35, eq. (9.220.4)].
Proof.
Please see Appendix C.
Using the results in Lemmas 2 and 3, one can represent the successful eavesdropping probability of E in closed form as follows.
Theorem 4.
The successful eavesdropping probability of the eavesdropper E has an exact closed form as(30)Peav=1-e-1-αIm/P^jλjpxλjeP^jλseP^s+1-1+e-1-αIm/P^jλjp+xλje1-αImλseλjpP^sexλje1-αIm/λseλjpP^sEi-1-αImP^jλjp-xλje1-αImλseλjpP^sxPpλpeλseP^s+1-11-e-αIm/P^sλspe-xN0/λseP^s+λseαImxλsp1-e-1-αIm/P^jλjpPpλpe-λjeP^j+e-1-αIm/P^jλjpPpλpeHαImP^s,xN0λseαIm+1λsp,λseαImxPpλpe-λseαIm1-e-1-αIm/P^jλjpxλspPpλpe-λjeP^jHαImP^s,xN0λseαIm+1λsp,λseαImxλjeP^j+λje1-αImPpλpeλjpλspLαImP^s,xN0αImλse+1λsp-xλje1-ααλseλjp,xλje1-αλseλjpα,1-αImP^jλjp-λjeλseα1-αxλjpλspImPpλpe2·MαImP^s,xN0αImλse+1λsp-xλje1-ααλseλjp,λseαImxPpλpe,xλje1-αλseλjpα,1-αImP^jλjp.
Proof.
Please see Appendix D.
It is worth mentioning that although the exact closed-form expressions of the successful detection probability of UD and the successful eavesdropping probability of E in (15) and (30), respectively, are relatively long, they are simply computed since they encompass simple built-in functions such as the Whittaker function and the exponential integral function. Therefore, (15) and (30) are helpful in quickly assessing the trade-off between the communication reliability and the information security in underlay CRNs under interference from licensed transmitter, jamming signal, maximum transmit power constraint, and interference power constraint, without exhaustive Monte-Carlo simulations.
4. Results and Discussion
This section provides numerous results to illustrate the trade-off between the communication reliability and the information security in CRNs under interference from licensed transmitter and jamming signal. Theoretical results are obtained from analytical expressions in (15) and (30) while simulation results are generated from Monte-Carlo simulations with 106 channel realizations. The coordinates of LT, LR, US, UD, and E are arbitrarily chosen as (0.1,0.9), (0.8,0.7), (0.0,0.0), (1.0,0.0), and (0.9,0.2), correspondingly, for illustration purpose while UJ is on the straight line connecting US and UD; that is, the coordinate of UJ is (d,0) where 0<d<1. Additionally, the fading power for the a-b channel is modelled as λab=mab-χ according to [36] where χ is the path-loss exponent and mab is the distance between the transmitter a and the receiver b. To limit case-studies, χ=3, and equal maximum transmit powers of unlicensed users (i.e., P^s=P^j=Pm) are investigated throughout this paper.
Figure 2 illustrates the trade-off between the communication reliability and the information security in CRNs with respect to the maximum interference power-to-noise power ratio Im/N0 for the maximum transmit power-to-noise power ratio Pm/N0=20dB, the required channel capacity Cth=0.1 bits/s/Hz, different interference levels from licensed transmitter (Pp/N0=15,18,21dB), the interference power distribution factor α=0.3, and d=0.3. It is observed that the analysis accurately matches the simulation, confirming the validity of (15) and (30). Additionally, both the successful detection probability Pdet and the successful eavesdropping probability Peav are proportional to Im. This is due to the fact that Im upper-bounds the power of unlicensed transmitters according to Ps=minαIm/hsp2,Pm and Pj=min(1-α)Im/hjp2,Pm and hence, the increase in Im raises the transmit power, ultimately increasing βd and βe according to (10) and (11). In other words, the probabilities for βd and βe to be greater than a threshold increase proportionally to Im. The fact that both Pdet and Peav are proportional to Im shows that the communication reliability (i.e., Pdet) trades off the security capability (i.e., Peav). Moreover, interference from licensed transmitter decreases SINRs at both UD and E and hence, the decrease in SINRs at UD and E drastically reduces the successful detection probability and the successful eavesdropping probability. However, the successful detection probability is significantly larger than the successful eavesdropping probability. This signifies that the probability for the legal receiver UD to successfully recover the source information is larger than the probability for the illegal receiver E to do so, creating high security performance.
Successful detection probability and successful eavesdropping probability versus Im/N0.
In the same context as Figure 2 except Im/N0=12dB, Figure 3 demonstrates the trade-off between the communication reliability and the information security in CRNs with respect to the change of Pm/N0. It is seen that the simulation and the analysis are in excellent agreement. This again validates the accuracy of (15) and (30). Additionally, same remarks as Figure 2 can be withdrawn such as the increase in the successful detection probability and the successful eavesdropping probability with respect to the increase in Pm, the degradation of the successful detection probability and the successful eavesdropping probability with respect to the increase in interference level from licensed transmitter, and the superiority of the successful detection probability to the successful eavesdropping probability which indicates a high information securing capability.
Successful detection probability and successful eavesdropping probability versus Pm/N0.
Figure 4 shows the trade-off between the communication reliability and the information security in CRNs with respect to the required channel capacity Cth for d=0.3, Pm/N0=19dB, Im/N0=15dB, α=0.5, and different interference levels from licensed transmitter (Pp/N0=15,18,21dB). It is observed that the analysis coincides with the simulation, confirming the validity of (15) and (30). Moreover, interference from licensed transmitter (i.e., Pp increases) dramatically reduces the successful detection probability and the successful eavesdropping probability. Furthermore, higher required channel capacity lowers these probabilities. This is reasonable because, given operation parameters, channel capacities at UD and E are only achieved at a certain level and hence, more stringent channel capacity requirement reduces the successful detection probability and the successful eavesdropping probability. Nevertheless, the successful detection probability outperforms the successful eavesdropping probability, indicating high security performance.
Successful detection probability and successful eavesdropping probability versus required channel capacity.
Figure 5 illustrates the trade-off between the communication reliability and the information security in CRNs with respect to the jammer’s position (i.e., d) for Pm/N0=Im/N0=15dB, Cth=0.1 bits/s/Hz, α=0.5, and different interference levels from licensed transmitter (Pp/N0=15,18,21dB). It is observed that the simulation accurately matches the analysis, validating (15) and (30). Additionally, interference from licensed transmitter (i.e., Pp increases) significantly decreases the successful detection probability and the successful eavesdropping probability. Moreover, the successful detection probability is independent of the jammer’s position. This is because the jamming signal is to purposely harm the signal reception of E without degrading the performance of UD. However, the successful eavesdropping probability is severely dependent on the jammer’s position. More specifically, because the jammer is located at (0.9,0.2), when the jammer moves toward the eavesdropper (i.e., d increases from 0 to 0.9), the successful eavesdropping probability drops abruptly due to the increase in the receive power of the jamming signal at E. This enlarges the difference between the successful detection probability and the successful eavesdropping probability, securing information transmission of US and emphasizing the role of the jammer in improving security performance. Furthermore, when the jammer moves away from the eavesdropper (i.e., d increases from 0.9 to 1), the successful eavesdropping probability increases significantly owing to the decrease in the receive power of the jamming signal at E, reducing security performance. For all the jammer’s position under consideration in Figure 5, the difference between the successful detection probability and the successful eavesdropping probability is very large, indicating high security performance.
Successful detection probability and successful eavesdropping probability versus jammer’s position.
Figure 6 demonstrates the trade-off between the communication reliability and the information security in CRNs with respect to the interference power distribution factor (i.e., α) for Pm/N0=15dB, Im/N0=12dB, Cth=0.1 bits/s/Hz, d=0.7, and different interference levels from licensed transmitter (Pp/N0=15,18,21dB). It is seen that the simulation and the analysis are in a perfect agreement, validating (15) and (30). Moreover, interference from licensed transmitter (i.e., Pp increases) considerably reduces the successful detection probability and the successful eavesdropping probability. Furthermore, the successful detection probability (or the successful eavesdropping probability) slowly (or quickly) increases with the increase of α, making the difference between them inversely proportional to α. The large difference between them represents the dominance of the successful detection probability to the successful eavesdropping probability (equivalently, high security capability). Therefore, Figure 6 shows that small values of α are good for information security.
Successful detection probability and successful eavesdropping probability versus the interference power distribution factor.
5. Conclusions
The successful detection probability and the successful eavesdropping probability in underlay cognitive networks are analyzed in this paper under interferences from licensed transmitter and jammer, the maximum transmit power constraint, the interference power constraint, and Rayleigh fading to assess the communication reliability and the information security of CRNs without exhaustive simulations. Exact closed-form expressions of the successful detection probability and the successful eavesdropping probability are derived and verified by Monte-Carlo simulations. Numerous results illustrate that interference from licensed transmitter considerably reduces both probabilities while interference from the jammer makes the successful detection probability significantly larger than the successful eavesdropping probability, demonstrating the jammer’s efficacy in enhancing security performance.
AppendixA. Proof of Theorem 1
Because Ps=minαIm/hsp2,P^s, Ps is a random variable. Hence, (13) can be computed indirectly through conditional probability as(A.1)Pdet=Ehsp2Prβd≥x∣Ps︸η,where η can be computed by inserting the explicit form of βd in (10) into (A.1) and after some manipulations, one obtains(A.2)η=PrPshsd2Pphpd2+N0≥x∣Ps=Prhsd2≥xPphpd2+N0Ps∣Ps=Ehpd2Prhsd2≥xPphpd2+N0Ps∣hpd2,Ps.
Because hab~CN0,λab, hab2 is exponentially distributed with mean of 1/λab; that is, Prhab2≥y=e-y/λab and the probability density function (PDF) of hab2 is fhab2y=e-y/λab/λab, y≥0. Based on this result, (A.2) is further simplified as(A.3)η=Ehpd2e-xPphpd2+N0/Psλsd∣hpd2,Ps=∫0∞e-xPpy+N0/Psλsdfhpd2ydy=∫0∞e-xPpy+N0/Psλsd1λpde-y/λpddy=1λpde-xN0/Psλsd∫0∞e-xPp/Psλsd+1/λpdydy=PpλpdxPsλsd+1-1e-xN0/Psλsd.
Plugging Ps=minαIm/hsp2,P^s into (A.3) and then averaging η over hsp2, one can rewrite (A.1) as(A.4)Pdet=Ehsp2xPpλpdminαIm/hsp2,P^sλsd+1-1e-xN0/minαIm/hsp2,P^sλsd=∫0∞xPpλpdminαIm/hsp2,P^sλsd+1-1e-xN0/minαIm/hsp2,P^sλsdfhsp2ydy.
By dividing minαIm/hsp2,P^s into two cases, (A.4) is further simplified as(A.5)Pdet=P~det+P¯det,where(A.6)P~det=∫0αIm/P^sxPpλpdP^sλsd+1-1e-xN0/P^sλsdfhsp2ydy=xPpλpdP^sλsd+1-1e-xN0/P^sλsd1-e-αIm/P^sλsp,P¯det=∫αIm/P^s∞xPpλpdαIm/yλsd+1-1e-xN0/αIm/yλsdfhsp2ydy=∫αIm/P^s∞PpλpdxαImλsdy+1-1e-xN0/αImλsdy1λspe-y/λspdy=-αImλsdλspPpλpdxeN0/Ppλpd+αImλsd/λspPpλpdxEi-xN0λsd+αImλsp1P^s+λsdPpλpdx.
Inserting (A.6) into (A.5), it is apparent that (A.5) exactly becomes (15), completing the proof.
B. Proof of Lemma 2
Performing the integral by part on (16), one obtains(B.1)La,b,c,g=-Ei-g-cze-bzba∞+∫a∞e-bzbce-g-czg+czdz=-Ei-g-cze-bzba∞+e-gb∫a∞e-b+czz+g/cdz.
By denoting(B.2)Ha,b,c=∫a∞e-bxx+cdx,it is straightforward to express the integrand in (B.2) in terms of the Ei(·) function as (18). Given the Ha,b,c function in (B.2), one can express (B.1) as (17), completing the proof.
C. Proof of Lemma 3
Performing the variable change and then applying the series representation of Ei(x) in [35, eq. (8.214.1)] to (19) result in(C.1)Ma,b,c,g,l=-1g∫-ag-l-∞eby+l/g-y+l/g+cEiydy=-ebl/g∫-∞-ag-leb/gyy+l-cgC+ln-y+∑k=1∞ykk·k!dy.
By denoting(C.2)φ1=∫-∞-ag-leb/gyy+l-cgdy,(C.3)φ2=∫-∞-ag-leb/gyy+l-cgln-ydy,(C.4)φ3=∫-∞-ga-lyky-cg+leb/gydy,it is apparent that (C.1) perfectly matches (20). Therefore, the proof is completed after representing integrands in (C.2), (C.3), and (C.4) as (21), (22), and (28), correspondingly.
Start with φ1. Performing the variable change, one can rewrite φ1 as(C.5)φ1=-∫∞ag+le-b/gx-x-cg+ldx=-∫ag+l∞e-b/gxx+cg-ldx.
Using (B.2), one can express (C.5) as (21).
Performing the variable change and then applying the series representation of lnx in [35, eq. (1.512.2)], one can simplify φ2 as(C.6)φ2=-∫∞ag+le-b/gx-x-cg+llnxdx=-∫ag+l∞e-b/gxx+cg-l2∑k=1∞12k-1x-1x+12k-1dx=-∑k=1∞22k-1∫ag+l∞e-b/gxx+cg-lx-1x+12k-1dx.
Applying the binomial expansion in [35, eq. (1.111)] to (x-1)2k-1 of (C.6), one obtains(C.7)φ2=-∑k=1∞22k-1∫ag+l∞e-b/gxx+cg-l∑n=02k-12k-1nxn-12k-1-nx+12k-1dx=-∑k=1∞22k-1∑n=02k-12k-1n-12k-1-n∫ag+l∞xne-b/gxx+cg-lx+12k-1dx,where the notation 2k-1n=2k-1!/n!2k-1-n! is the binomial coefficient.
Again perform the variable change and then apply the binomial expansion to simplify (C.7) as(C.8)φ2=-∑k=1∞22k-1∑n=02k-12k-1n-12k-1-n∫ag+l+1∞y-1ne-b/gy-1y-1+cg-ly2k-1dy=-∑k=1∞eb/g22k-1∑n=02k-12k-1n-12k-1-n·∫ag+l+1∞e-b/gyy+cg-l-1y2k-1∑s=0nnsys-1n-sdy=2eb/g∑k=1∞∑n=02k-1∑s=0n2k-1nns-1s2k-1∫ag+l+1∞yse-b/gyy+cg-l-1y2k-1dy.
By denoting(C.9)ζ=∫ag+l+1∞yse-b/gyy+cg-l-1y2k-1dy,it is apparent that (C.8) perfectly matches (22). Hence, we must prove that the integrand in (C.9) can be represented as (23) to complete the proof of (22). Toward this end, we divide the problem into two cases: s=2k-1 (Case 1) and s≠2k-1 (Case 2). For Case 1, ζ is rewritten as ∫ag+l+1∞e-b/gy/y+cg-l-1dy, which becomes Hag+l+1,b/g,cg-l-1 as shown in (23). For Case 2, we denote θ=∫ag+l+1∞e-b/gy/y+cg-l-1y2k-s-1dy. Combining two cases shows that (C.9) coincides with (23). Therefore, the remaining work is to prove that θ is given by (24).
Applying the partial fraction decomposition, θ can be simplified as(C.10)θ=p∫ag+l+1∞e-b/gxy+cg-l-1dy+∑v=12k-s-1q2k-s-1-v+1∫ag+l+1∞e-b/gyyvdy,where p and qm are defined in (25) and (26), respectively.
By denoting(C.11)Ba,b,v=∫a∞e-bxxvdx,and noting that the first integrand of (C.10) can be represented in terms of the H(·) function in (B.2), it is obvious that (C.10) becomes (24). The Ba,b,v function can be represented as (27) by firstly performing the variable change and then using [35, eq. (3.381.6)].
Finally, we process φ3. By performing the variable change and applying the binomial expansion, (C.4) is simplified as(C.12)φ3=-∫∞ag+l-xk-x-cg+le-b/gxdx=-1k+1∫ag+l+cg-l∞y+l-cgkye-b/gy+l-cgdy=-1k+1e-b/gl-cg∫ag+cg∞∑n=0kknynl-cgk-n1ye-b/gydy=-1k+1e-b/gl-cg∑n=0kknl-cgk-n∫a+cg∞yn-1e-b/gydy=-1k+1e-b/gl-cgl-cgk∫a+cg∞e-b/gyydy+∑n=1kknl-cgk-n∫a+cg∞yn-1e-b/gydy.
By denoting(C.13)Da,b,n=∫a∞yne-bydy,whose exact closed form is given by (29) with the aid of [35, eq. (3.351.2)], it is apparent that the first integral in (C.12) is Ha+cg,b/g,0 and the second integral in (C.12) is Da+cg,b/g,n-1. As such, (C.12) exactly matches (28), completing the proof.
D. Proof of Theorem 4
Plugging (11) into (14) and after some simplification, one obtains(D.1)Peav=PrPshse2Pjhje2+Pphpe2+N0≥x=Prhse2≥xPsPjhje2+Pphpe2+N0=Ehsp2,hjp2,hje2,hpe2e-xPjhje2+Pphpe2+N0/Psλse=Ehsp2,hjp2e-xN0/Psλseκμ,where(D.2)κ=Ehje2e-xPj/Psλsehje2,μ=Ehpe2e-xPp/Psλsehpe2.
Applying the definition of the expectation, one obtains the closed form of κ as(D.3)κ=∫0∞e-xPj/Psλseyfhje2ydy=∫0∞e-xPj/Psλsey1λjee-y/λjedy=xPjλjePsλse+1-1.
Following the derivation of κ, one can also infer(D.4)μ=xPpλpePsλse+1-1.
Inserting (D.3) and (D.4) into (D.1), one can simplify (D.1) as(D.5)Peav=Ehsp2,hjp2e-xN0/PsλsexPjλjePsλse+1-1xPpλpePsλse+1-1=Ehsp2e-xN0/PsλsexPpλpePsλse+1-1ρ,where(D.6)ρ=Ehjp2xPjλjePsλse+1-1.
By plugging (9) into (D.6), one can decompose ρ as(D.7)ρ=Ehjp2xλjePsλsemin1-αImhjp2,P^j+1-1=ρ~+ρ¯,where(D.8)ρ~=∫01-αIm/P^jxλjeP^jPsλse+1-1fhjp2ydy=xλjeP^jPsλse+1-11-e-1-αIm/P^jλjp,ρ¯=∫1-αIm/P^j∞xλjePsλse1-αImy+1-1fhjp2ydy=∫1-αIm/P^j∞xλjePsλse1-αImy+1-11λjpe-y/λjpdy=1λjp∫1-αIm/P^j∞1-xλje1-αImPsλsey+xλje1-αImPsλse-1e-y/λjpdy=e-1-αIm/P^jλjp+xλje1-αImPsλseλjpexλje1-αIm/PsλseλjpEi-1-αImP^jλjp-xλje1-αImPsλseλjp.
By substituting (D.8) into (D.7) and then plugging the result together with (8) into (D.5), one can partition Peav into two terms as(D.9)Peav=Ehsp2e-xN0/PsλsexPpλpePsλse+1-1xλjeP^jPsλse+1-11-e-1-αIm/P^jλjp+e-1-αIm/P^jλjp+xλje1-αImPsλseλjpexλje1-αIm/PsλseλjpEi-1-αImP^jλjp-xλje1-αImPsλseλjp=Ehsp21-e-1-αIm/P^jλjpxPpλpeλseminαIm/hsp2,P^s+1-1xλjeP^jλseminαIm/hsp2,P^s+1-1·e-xN0/λseminαIm/hsp2,P^s+e-1-αIm/P^jλjpxPpλpeλseminαIm/hsp2,P^s+1-1e-xN0/λseminαIm/hsp2,P^s+xλje1-αImλseλjpxPpλpeλse+minαImhsp2,P^s-1eλje1-αIm/λseλjp-N0/λsex/minαIm/hsp2,P^s·Ei-1-αImP^jλjp-xλje1-αImλseλjpminαIm/hsp2,P^s=P~eav+P¯eav,where(D.10)P~eav=∫0αIm/P^s1-e-1-αIm/P^jλjpxPpλpeλseP^s+1-1xλjeP^jλseP^s+1-1e-xN0/λseP^s+xλje1-αImλseλjpxPpλpeλse+P^s-1eλje1-αIm/λseλjp-N0/λsex/P^sEi-1-αImP^jλjp-xλje1-αImλseλjpP^s+e-1-αIm/P^jλjpxPpλpeλseP^s+1-1e-xN0/λseP^sfhsp2ydy,(D.11)P¯eav=∫αIm/P^s∞1-e-1-αIm/P^jλjpxPpλpeλseαIm/y+1-1xλjeP^jλseαIm/y+1-1e-xN0/λseαIm/y+xλje1-αImλseλjpxPpλpeλse+αImy-1eλje1-αIm/λseλjp-N0/λsex/αIm/yEi-1-αImP^jλjp-xλje1-αImλseλjpαIm/y+e-1-αIm/P^jλjpxPpλpeλseαIm/y+1-1e-xN0/λseαIm/yfhsp2ydy.
Plugging fhsp2y=e-y/λsp/λsp into (D.10) and after some simplification, one obtains the exact closed-form representation of P~eav as(D.12)P~eav=1-e-1-αIm/P^jλjpxλjeP^jλseP^s+1-1+e-1-αIm/P^jλjp+xλje1-αImλseλjpP^sexλje1-αIm/λseλjpP^sEi-1-αImP^jλjp-xλje1-αImλseλjpP^sxPpλpeλseP^s+1-11-e-αIm/P^sλspe-xN0/λseP^s.
Substituting fhsp2y=e-y/λsp/λsp into (D.11) and performing the partial fraction decomposition, one can simplify (D.11) as(D.13)P¯eav=λseαImxλsp1-e-1-αIm/P^jλjpPpλpe-λjeP^j+e-1-αIm/P^jλjpPpλpe∫αIm/P^s∞e-xN0/λseαIm+1/λspyy+λseαIm/xPpλpedy-λseαIm1-e-1-αIm/P^jλjpxλspPpλpe-λjeP^j∫αIm/P^s∞e-xN0/λseαIm+1/λspyy+λseαIm/xλjeP^jdy+λje1-αImPpλpeλjpλsp∫αIm/P^s∞exλje1-α/αλseλjp-xN0/αImλse-1/λspyEi-1-αImP^jλjp-xλje1-αλseλjpαydy-λjeλseα1-αxλjpλspImPpλpe2∫αIm/P^s∞exλje1-α/αλseλjp-xN0/αImλse-1/λspyy+λseαIm/xPpλpeEi-1-αImP^jλjp-xλje1-αλseλjpαydy.
Representing the integrals in (D.13) in terms of L(·) in (17), H(·) in (18), and M(·) in (20), one obtains the exact closed-form expression of P¯eav as(D.14)P¯eav=λseαImxλsp1-e-1-αIm/P^jλjpPpλpe-λjeP^j+e-1-αIm/P^jλjpPpλpeHαImP^s,xN0λseαIm+1λsp,λseαImxPpλpe-λseαIm1-e-1-αIm/P^jλjpxλspPpλpe-λjeP^jHαImP^s,xN0λseαIm+1λsp,λseαImxλjeP^j+λje1-αImPpλpeλjpλspLαImP^s,xN0αImλse+1λsp-xλje1-ααλseλjp,xλje1-αλseλjpα,1-αImP^jλjp-λjeλseα1-αxλjpλspImPpλpe2MαImP^s,xN0αImλse+1λsp-xλje1-ααλseλjp,λseαImxPpλpe,xλje1-αλseλjpα,1-αImP^jλjp.
Inserting (D.12) and (D.14) into (D.9) results in (30), completing the proof.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.04-2017.01.
PanwarN.SharmaS.SinghA. K.A survey on 5G: The next generation of mobile communication20161864842-s2.0-8495810245810.1016/j.phycom.2015.10.006TavanaM.RahmatiA.Shah-MansouriV.MahamB.Cooperative sensing with joint energy and correlation detection in cognitive radio networks20172111321352-s2.0-8500987696910.1109/LCOMM.2016.2613858DarsenaD.GelliG.VerdeF.An opportunistic spectrum access scheme for multicarrier cognitive sensor networks2017178259626062-s2.0-8501730627110.1109/JSEN.2017.2674181LiuY.ChenH. H.WangL.Physical layer security for next generation wireless networks: Theories, technologies, and challenges201719134737610.1109/COMST.2016.2598968ShuZ.QianY.CiS.On physical layer security for cognitive radio networks2013273283310.1109/MNET.2013.65238052-s2.0-84879072350LiJ.FengZ.FengZ.ZhangP.A survey of security issues in Cognitive Radio Networks20151231321502-s2.0-8492812477510.1109/CC.2015.70843717084371ZouY.ZhuJ.YangL.LiangY.-C.YaoY.-D.Securing physical-layer communications for cognitive radio networks201553948542-s2.0-8495956878310.1109/MCOM.2015.7263345SharmaR. K.RawatD. B.Advances on security threats and countermeasures for cognitive radio networks: A survey20151721023104310.1109/COMST.2014.23809982-s2.0-84930508485ZhengT.-X.WangH.-M.Optimal power allocation for artificial noise under imperfect CSI against spatially random eavesdroppers201665108812881710.1109/TVT.2015.2513003HuJ.CaiY.YangN.ZhouX.YangW.Artificial-Noise-Aided Secure Transmission Scheme with Limited Training and Feedback Overhead20171611932052-s2.0-8500981178910.1109/TWC.2016.2621040DingX.SongT.ZouY.ChenX.Security-Reliability Tradeoff for Friendly Jammer Assisted User-Pair Selection in the Face of Multiple Eavesdroppers201648386839310.1109/ACCESS.2016.26077832-s2.0-84988458355LiM.DongZ.WangG.Security versus Reliability Analysis for Multi-Eavesdropper Cooperation Wireless Networks with Best RelayProceedings of the 2017 IEEE International Conference on Energy Internet (ICEI)April 2017Beijing, China24424910.1109/ICEI.2017.50KalantariA.MalekiS.ZhengG.ChatzinotasS.OtterstenB.Joint power control in wiretap interference channels2015147381038232-s2.0-8493713203110.1109/TWC.2015.2412531WangC.WangH.-M.On the secrecy throughput maximization for MISO cognitive radio network in slow fading channels2014911181418272-s2.0-8490753375010.1109/TIFS.2014.2356339Ho-VanK.Outage analysis in cooperative cognitive networks with opportunistic relay selection under imperfect channel information201569111700170810.1016/j.aeue.2015.08.0042-s2.0-84941733307Ho-VanK.Exact outage probability analysis of proactive relay selection in cognitive radio networks with MRC receivers20161832882982-s2.0-8499022633610.1109/JCN.2016.0000447575795WangD.RenP.DuQ.SunL.WangY.Cooperative relaying and jamming for primary secure communication in cognitive two-way networksProceedings of the 83rd IEEE Vehicular Technology Conference, VTC Spring 2016May 2016Nanjing, China10.1109/VTCSpring.2016.75041772-s2.0-84979732331FangB.QianZ.ZhongW.ShaoW.AN-Aided Secrecy Precoding for SWIPT in Cognitive MIMO Broadcast Channels2015199163216352-s2.0-8494209386710.1109/LCOMM.2015.2449315NguyenV.-D.DuongT. Q.DobreO. A.ShinO.-S.Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks20161111260926232-s2.0-8498653877610.1109/TIFS.2016.2594131FangB.QianZ.ShaoW.ZhongW.Precoding and Artificial Noise Design for Cognitive MIMOME Wiretap Channels2016658675367582-s2.0-8498231135910.1109/TVT.2015.2477305WuY.ChenX.ChenX.Secure beamforming for cognitive radio networks with artificial noiseProceedings of the 2015 International Conference on Wireless Communications & Signal Processing (WCSP)October 2015Nanjing, China1510.1109/WCSP.2015.7341139HuX.ZhangX.HuangH.LiY.Secure transmission via jamming in cognitive radio networks with possion spatially distributed eavesdroppersProceedings of the 27th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2016September 2016Spain2-s2.0-8501004211210.1109/PIMRC.2016.7794918CaiY.XuX.YangW.Secure transmission in the random cognitive radio networks with secrecy guard zone and artificial noise20161015190419132-s2.0-8499002651610.1049/iet-com.2016.0117NguyenV.DuongT. Q.ShinO.NallanathanA.KaragiannidisG. K.Enhancing PHY Security of Cooperative Cognitive Radio Multicast Communications201710.1109/TCCN.2017.2748132LiZ.JingT.ChengX.HuoY.ZhouW.ChenD.Cooperative jamming for secure communications in MIMO Cooperative Cognitive Radio NetworksProceedings of the IEEE International Conference on Communications, ICC 2015June 2015London, UK7609761410.1109/ICC.2015.72495432-s2.0-84953744679LiuW.GuoL.KangT.ZhangJ.LinJ.Secure cognitive radio system with cooperative secondary networksProceedings of the 2015 22nd International Conference on Telecommunications, ICT 2015April 2015Sydney, Australia61010.1109/ICT.2015.71246482-s2.0-84938800832HeT.ChenH.LiuQ.QoS-based beamforming with cooperative jamming in Cognitive Radio NetworksProceedings of the 2013 International Conference on Communications, Circuits and Systems, ICCCAS 2013November 2013Chengdu, China424510.1109/ICCCAS.2013.67652822-s2.0-84898820397LiuW.SarkarM. Z. I.RatnarajahT.On the security of cognitive radio networks: Cooperative jamming with relay selectionProceedings of the 2014 European Conference on Networks and Communications, EuCNC 2014June 2014Bologna, Italy10.1109/EuCNC.2014.68826742-s2.0-84906969171LiuW.SarkarM. Z. I.RatnarajahT.DuH.Securing cognitive radio with a combined approach of beamforming and cooperative jamming2017111192-s2.0-8500698222610.1049/iet-com.2016.0114ZouY.Physical-Layer Security for Spectrum Sharing Systems2017162131913292-s2.0-8501494202810.1109/TWC.2016.2645200LiuY. W.WangL. F.DuyT. T.ElkashlanM.DuongT. Q.Relay selection for security enhancement in cognitive relay networks201541464910.1109/lwc.2014.2365808ChakrabortyP.PrakriyaS.Secrecy Performance of an Idle Receiver Assisted Underlay Secondary Network201766109555956010.1109/TVT.2017.2698162Ho-VanK.SofotasiosP. C.FreearS.Underlay cooperative cognitive networks with imperfect Nakagami-m fading channel information and strict transmit power constraint: Interference statistics and outage probability analysis201416110172-s2.0-8489788261110.1109/JCN.2014.000004BiglieriE.ProakisJ.ShamaiS.Fading channels: information-theoretic and communications aspects199844626192692MR165891010.1109/18.7205512-s2.0-0032183888GradshteynI. S.RyzhikI. M.20006thSan Diego, CA, USAAcademic PressAhmedN.KhojastepourM. A.AazhangB.Outage minimization and optimal power control for the fading relay channelProceedings of the 2004 IEEE Information Theory Workshop - Proceedings, ITWOctober 2004San Antonio, TX, USA4584622-s2.0-19544391399