nach oben

Wireless Networks

Erschienen in:

Open Access 09.11.2017

Power allocation policy and performance analysis of secure and reliable communication in cognitive radio networks

verfasst von: Truong Xuan Quach, Hung Tran, Elisabeth Uhlemann, George Kaddoum, Quang Anh Tran

Erschienen in: Wireless Networks | Ausgabe 4/2019

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Patentsuche

Aus

Abstract

This paper investigates the problem of secure and reliable communications for cognitive radio networks. More specifically, we consider a single input multiple output cognitive model where the secondary user (SU) faces an eavesdropping attack while being subject to the normal interference constraint imposed by the primary user (PU). Thus, the SU must have a suitable power allocation policy which does not only satisfy the constraints of the PU but also the security constraints such that it obtains a reasonable performance for the SU, without exposing information to the eavesdropper. We derive four power allocation policies for different scenarios corresponding to whether or not the channel state information of the PU and the eavesdropper are available at the SU. Further, we introduce the concept secure and reliable communication probability (SRCP) as a performance metric to evaluate the considered system, as well as the efficiency of the four power allocation policies. Finally, we present numerical examples to illustrate the power allocation polices, and the impact of these policies on the SRCP of the SU.

1 Introduction

A cognitive radio network (CRN) is widely known as a promising solution to enhance spectrum utilization by means of dynamic spectrum access techniques [1‐10]. In a CRN, there are two types of users known as primary user (PU) and secondary user (SU), where the (SU) is allowed to access the spectrum licensed to the (PU) as long as it does not degrade the performance of the (PU). Due to this, the (SU) must be equipped with advanced sensing techniques to detect vacant spectrum (known as a spectrum hole) and the channel state information (CSI) of the PU [6, 11]. This, in turn, implies that the $\hbox {PU}_{\mathrm{s}}$ and $\hbox {SU}_{\mathrm{s}}$ may be exposed to internal or external attackers who pretend to be sensing devices [12‐14]. Furthermore, malicious attackers can abuse the adaptive abilities of the (CRN) causing negative effects to the radio environment, e.g., by generating interference, which may degrade the performance, reveal the secrete communication information, or even cause malfunction to the operations of the legitimate users. Clearly, secure and reliable communication between $\hbox {SU}_{\mathrm{s}}$ can be obtained only if neither the secrecy nor the reliable communication outage events happen. Therefore, solving the security problems from all aspects of the networking architecture becomes one of the most challenging problems with CRN [13, 15].

Recently, physical layer security has emerged as an effective approach to protect the communication of legitimate users from eavesdropping attacks, by e.g., using the characteristics of wireless channels such as multipath fading [16‐18]. It has been proven that if the channel from the source to the destination is better than the one from the source to the eavesdropper, the communication of the legitimate users can be secure and reliable at a non-zero data rate [19]. To quantify the security performance more specifically, Wyner has introduced a secrecy capacity concept [16] which is defined as the difference between the capacity of the main channel and the illegitimate channel. Later on, the secrecy capacity concept was extended to include wireless channels, e.g., Gaussian and multipath fading [17, 20]. It revealed that the secrecy capacity may be reduced due to the effect of multipath fading in wireless channels.

Motivated by all the above works and the references therein, in this paper, we evaluate secure and reliable communication for a single-input multiple-output (SIMO) CRN. More specifically, we assume that the secondary transmitter (STx) and the primary transmitter (p-Tx) are equipped with a single antenna, while the primary receiver (P-Rx), secondary receiver (S-Rx), and the eaversdropper (EAV) have multiple antennas. This system model is considered as an instance of a practical scenario where the P-Tx and S-Tx may be wireless sensors or mobile users, while the P-Rx and S-Rx may be access points or base stations. Here, the EAV tries to overhear the information transmitted by the S-Tx. Thus, the S-Tx must have flexible power control policies to protect its secret information, and not cause harmful interference to the PU. Accordingly, a performance metric in terms of secure and reliable communication probability is introduced to evaluate the considered CRN performance. Our major contributions in this paper are summarised as follows:

Based on the CSI available at the S-Tx, power allocation policies are derived for four scenarios as follows. Scenario 1 ($S_1$): The S-Tx does not have the CSI of both the P-Tx$\rightarrow $P-Rx and the S-Tx$\rightarrow $EAV links; Scenario 2 ($S_2$): The S-Tx has the CSI of the S-Tx$\rightarrow $EAV but not the P-Tx$\rightarrow $P-Rx link; Scenario 3 ($S_3$): The S-Tx has the CSI of the P-Tx$\rightarrow $P-Rx but not the S-Tx$\rightarrow $EAV links; Scenario 4 ($S_4$): The S-Tx has the CSI of both the P-Tx$\rightarrow $P-Rx and the S-Tx$\rightarrow $EAV links. Accordingly, a power allocation algorithm corresponding to the four scenarios is introduced.
Given the four power allocation policies, the the secure and reliable communication probability (SRCP) is introduced to analyse the performance of the considered CRN.
Our numerical results show that the SRCP of Scenario 1 and Scenario 2 (Scenario 3 and Scenario 4) are only different in the low signal-to-noise ratio (SNR) regime of the P-Tx, but they are the same in the high SNR regime of the P-Tx.

To the best of the authors’ knowledge, there are no previous publications addressing this problem.

The remainder of this paper is organized as follows. The related work is introduced in Sect. 2, whereas in Sect. 3 the system model, assumptions, constraints corresponding to four scenarios for the CSI at the S-Tx together with problem statement for a SIMO CRN are introduced. In Sect. 4, power allocation policies corresponding to four scenarios are obtained. Further, a closed-form expression for the SRCP is derived. In Sect. 5, the numerical results and discussions are provided. Finally, conclusions are given in Sect. 6.

The general security performance of the CRN has been studied in [15, 21‐23]. More specifically, in [15], the authors studied the primary user emulation (PUE) attack and proposed a solution to reduce the PUE attack in CRN operating in the frequency digital TV (DTV) band. This approach can effectively mitigate PUE attacks with the addition of a plugin AES chip to the system hardware. In [24], a robust Markov decision process for secure power control schemes of cognitive radios was proposed. In [25], the ergodic secrecy capacity for a CRN under the effects of fast fading channels has been analyzed. More recently, communication protocols and signal processing techniques was proposed to enhance the secrecy performance of the CRN in [13, 26‐30]. In [30], an optimal relay selection scheme to minimize the secrecy outage probability of the cognitive cooperative radio network (CCRN) with decode-and-forward (DF) relays was investigated. In [31], a performance analysis in terms of average secrecy capacity with a CCRN having multiple reactive DF relays was studied, and the obtained results showed that using relay networks can enhance the secrecy performance. Taking advantage of multi-antenna techniques, beamforming and cooperative jamming techniques for $\hbox {CRN}_{\mathrm{s}}$ was studied in [26‐28, 32, 33]. Considering the security for multiple users in the $\hbox {CRN}_{\mathrm{s}}$, a scheduling scheme to enhance the security of communication was proposed in [29]. In [34] and [35], game theory cooperation strategies have been applied to investigate the security for a CRN scenario. Bandwidth assignment strategies and power allocation policies have been proposed to enhance the security of the PU communication. In [27], two secure transmission schemes, termed nonadaptive and adaptive secure transmission strategy, were developed to maximize the throughput for a multiple-input single-out (MISO) CRN over a slow fading channel. An approximation for the optimal rate parameters of the nonadaptive secure transmission strategy was achieved at the high SNR regime. In [36], the impact of secondary user communication on the security of the primary user have been studied. The results showed that the security of the primary network strongly depends on the channel condition of the SU transmitter to the EAV link and the transmit power policy of the S-Tx. Most recently, subject to the maximal tolerable interference threshold of the PU, the secrecy outage probability has been evaluated for various scheduling schemes in [22], in which the S-Tx is overheard by multiple $\hbox {EAV}_{\mathrm{v}}$. However, the impact of the P-Tx$\rightarrow $P-Rx link on the secure performance has not been considered. In [37], the authors have analyzed the intercept behavior of industrial wireless sensor networks with different scheduling schemes. However, this study is only for conventional wireless sensor networks, and thus the security and reliable criteria have not been considered. Up to now, the performance analysis for the physical layer security of $\hbox {CRN}_{\mathrm{s}}$, in terms of non-zero secrecy capacity, probability of outage secrecy capacity, and ergodic secrecy capacity, have obtained great achievements [22, 27, 33, 37‐39]. However, not many publications investigate the performance analysis in terms of reliable and security communication, which is considered as one of the most important criteria in the industry and internet of things (IoT) era.

3 System model

Let us consider a system model as shown in Fig. 1 in which there are three types of user in the same area, termed the SU, PU, and EAV. The PU allows the SU to re-utilize its licensed spectrum provided that the SU does not cause harmful interference to the PU. On the other hand, the EAV wants to eavesdrop the information of the su’s communication over a wiretap channel. In fact, the EAV can overhear the information of both the S-Tx and P-Tx, but in this system model the EAV wants to utilize the interference from the P-Tx to exploit the exchange of information from the SU. Here, we assume that the S-Tx and P-Tx are equipped with a single antenna while the S-Rx, P-Rx, and EAV have $N_s$, $N_p$, and $N_{e}$ antennas, respectively. This system model is considered as an instance of practical scenario where the P-Tx and S-Tx may be mobile users while the P-Rx and S-Rx are base stations or access points. Note that the PU can transmit with an optional power level for its communication without caring about the existence of the SU. On the other hand, the SU should keep the interference inflicted onto the PU below a predefined threshold. Hence, the SU should have channel mean gain of the S-Tx$\rightarrow $P-Rx link (not instantaneous channel gains) to adjust its transmit power. This is based on the fact that the SU and the PU can collaborate using a localization service where the channel mean gains of the PU and SU such as transmission distance, antenna gain, and so on, can be exchanged [40, 41]. Moreover, the S-Tx and P-Tx are assumed to have full CSI of the S-Tx$\rightarrow $S-Rx and P-Tx$\rightarrow $P-Rx links, respectively. This is reasonable due to the fact that both SU and PU are in the same systems and they should have dedicated feedback channels. In addition, the channel mean gain of the S-Tx$\rightarrow $EAV can be selected offline following [42‐44].

Further, all channels are subject to Rayleigh fading and the channel gains are independent random variables distributed following an exponential distribution. Accordingly, the probability density function (PDF) and cumulative distribution function (CDF) of random variables ($\hbox {RV}_{\mathrm{s}}$) having exponential distribution are expressed, respectively, as

$$\begin{aligned} f_{X}(x)&=\frac{1}{\Omega _{X}}\exp \left( - \frac{x}{\Omega _X} \right) , \end{aligned}$$

(1)

$$\begin{aligned} F_{X}(x)&=1- \exp \left( - \frac{x}{\Omega _X} \right) , \end{aligned}$$

(2)

where the RV X refers to the channel gain, and $\Omega _X={{\mathrm{\mathbf {E}}}}[X]$ is the channel mean gain. More specifically, the channel gains, S-Tx$\rightarrow $S-Rx and P-Tx$\rightarrow $P-Rx of communication links, are denoted, respectively, by $g_m$, $h_n$. The channel gains of S-Tx$\rightarrow $P-Rx, P-Tx$\rightarrow $S-Rx, and P-Tx$\rightarrow $EAV interference links are denoted by $\varphi _m,~\beta _n$, and $\rho _{t}$, respectively. The channel gain of the S-Tx$\rightarrow $EAV illegitimate links is denoted by $\alpha _{t}$. Here, m, n, and t ($m \in \{1,\ldots ,N_p\}$, $n \in \{1,\ldots ,N_{e}\}$, and $t \in \{1,\ldots ,N_s\}$), denote the antenna indexes of the S-Rx, EAV, and P-Rx, respectively. In the following, the P-Rx, S-Rx, and EAV are assumed to use SC to process the received signal, i.e., the antenna having the highest signal-to-interference-plus-noise ratio (SINR) will be used to process the received message.

It is a fact that the SU and PU share the same spectrum and thus they may cause mutual interference to each other due to power emission. According to Shannon’s theorem, the PU channel capacity subject to interference of the SU can be expressed

$$\begin{aligned} C_{p}=B\log _2(1+\gamma _{p}), \end{aligned}$$

(3)

where $\gamma _{p}$ is the SINR of the PU defined as

$$\begin{aligned} \gamma _{p}= \max \limits _{m \in \{1,2,\ldots , N_p\}} \left\{ \frac{P^{}_{p}h_m}{P^{}_{s}\varphi _m +N_0}\right\} , \end{aligned}$$

(4)

in which $P^{}_{p}$ and $ P^{}_{s}$ are transmit powers of the P-Tx and S-Tx, respectively. Symbol $N_0$ is the noise power defined by $N_0=B\mathcal {N}_0$; B and $\mathcal {N}_0$ are system bandwidth and noise power spectral density, respectively. Since the SU re-utilizes the PU spectrum band for its communication, the S-Rx suffers from the interference of the P-Tx, and hence the channel capacity of the SU subject to the interference from the P-Tx can be formulated as

$$\begin{aligned} C_{s}=B\log _2(1+\gamma _{s}), \end{aligned}$$

(5)

where

$$\begin{aligned} \gamma _{s}&=\max \limits _{t \in \{1,2,\ldots , N_s\}} \left\{ \frac{P^{}_{s}g_t}{P^{}_{p}\beta _t +N_0}\right\} . \end{aligned}$$

(6)

It should be noted that the EAV overhears the SU information, but it is also subject to interference caused by the P-Tx. Accordingly, the channel capacity of the EAV is given as

$$\begin{aligned} C_{e}=B\log _2(1+\gamma _{e}), \end{aligned}$$

(7)

where SINR at the $\hbox {EAV}_{\mathrm{s}}$ is expressed as

$$\begin{aligned} \gamma _{e}&=\max \limits _{n \in \{1,2,\ldots , N_{e}\}} \left\{ \frac{P^{}_{s}\alpha _{n}}{P^{}_{p}\rho _{n} +N_0}\right\} . \end{aligned}$$

(8)

3.1 Performance Metric for the SU communication

In the considered system, the transmit power of the SU is subject to its own security constraint and the interference constraint given by the PU. Thus, the SU must have a suitable power allocation policy which does not only satisfy the above constraints but also can obtain a reasonable performance. We assume that the Wyner wiretap code [16] is used for SU communication, and hence a positive rate, $R_{0}>0$, should be maintained to provide secure communication for the SU, which can be defined by [42, 45]

$$\begin{aligned} R_0=R_{s}-R_{e}, \end{aligned}$$

(9)

where $R_s$ and $R_{e}$ are the code word transmission rate and secret information rate of the SU, respectively.

Accordingly, the perfect secrecy communication of the SU may be obtained if the capacity at the EAV is less than $R_0$, i.e., $C_{e} < R_{0}$. In other words, the outage secrecy event of the SU occurs when $C_{e} > R_{0}$, and hence the secrecy outage probability of the SU can be formulated as

$$\begin{aligned} \mathcal {O}_{sec}&= \Pr \left\{ C_{e} > R_{0} \right\} . \end{aligned}$$

(10)

Moreover, due to the randomness of wireless channels and interference caused by the SU, reliable communication of the PU may not be obtained if the code word transmission rate of the PU is greater than the channel capacity, i.e. $R_p >C_{p}$. It implies that the communication outage event of the PU is expressed as

$$\begin{aligned} \mathcal {O}_{p}&= \Pr \left\{ C_{p}< R_p \right\} . \end{aligned}$$

(11)

where $C_{p}$ is defined in (3).

Clearly, secure and reliable communication of the SU can be obtained if and only if both secrecy and reliable communication outage events do not happen. This can be interpreted into secure and reliable communication probability as

$$\begin{aligned} \mathcal {O}_{ss}=\Pr \left\{ C_{s} > R_s, C_{e} \le R_{0} \right\} , \end{aligned}$$

(12)

where $C_{s}$ and $C_{e}$ are formulated in (5) and (7), respectively.

3.2 Constraints for transmit power of the SU

In this section, we adopt a common assumption in the literature of the physical security that the CSI is available, together with the S-Tx$\rightarrow $EAV wiretap link [46]. This can be obtained when the EAV is active in the network and its behavior may be monitored [47]. In the following, we introduce four communication scenarios in which we study the power allocation policy for the SU.

Scenario 1 ($S_1$): S-Tx does not have the CSI of neither P-Tx$\rightarrow $P-Rx nor theS-Tx$\rightarrow $EAV links

In this scenario, the S-Tx transmits its confidential information without knowing the existence of the EAV. Also the S-Tx does not have the CSI of the P-Tx$\rightarrow $P-Rx communication link. Accordingly, the S-Tx only regulates its transmit power on the basis of the interference constraint given by the PU as

$$\begin{aligned}&\mathcal {O}_{I}=\Pr \left\{ \max \limits _{m \in \{1,2,\ldots , N_p\}} \left\{ \frac{P^{}_{s}\varphi _m}{N_0}\right\} \ge Q_{pk} \right\} \le \xi , \end{aligned}$$

(13)

where $Q_{pk}$ is peak interference level that the PU can tolerate. This can be interpreted as that the S-Tx is allowed to cause limited interference to the P-Rx, however, the probability of the interference caused by the S-Tx should be kept below a predefined threshold $\xi $ to not interrupt the PU communication. As a result, the constraints setting on the transmit power of the S-Tx should satisfy two conditions as follows:

$$\begin{aligned}&\mathcal {O}_{I} \le \xi , \end{aligned}$$

(14)

$$\begin{aligned}&0 \le P^{}_{s} \le P^{max}_{s}, \end{aligned}$$

(15)

where $\xi $ and $P^{max}_{s}$ are communication outage threshold given by the PU and the maximal transmit power of the S-Tx, respectively.

Scenario 2 ($S_2$): S-Tx has the CSI of the S-Tx$\rightarrow $EAV but not P-Tx$\rightarrow $P-Rx

In this scenario, the S-Tx knows the existence of the EAV in its coverage range and the CSI of the S-Tx$\rightarrow $S-Rx link is available at the S-Tx. However, the S-Tx does not have the CSI of the P-Tx$\rightarrow $P-Rx link. Consequently, the transmit power of the S-Tx should satisfy three constraints as follows:

$$\begin{aligned}&\mathcal {O}_{I} \le \xi , \end{aligned}$$

(16)

$$\begin{aligned}&\mathcal {O}_{sec} \le \epsilon , \end{aligned}$$

(17)

$$\begin{aligned}&0 \le P^{}_{s} \le P^{max}_{s}, \end{aligned}$$

(18)

where $\epsilon $ is the secrecy outage constraint given by the SU and $\mathcal {O}_{I}$ and $\mathcal {O}_{sec}$ are defined in (10) and (13), respectively.

Scenario 3 ($S_3$): S-Tx has the CSI of the P-Tx$\rightarrow $P-Rx but not S-Tx$\rightarrow $EAV

In this scenario, the S-Tx has the CSI of the P-Tx$\rightarrow $P-Rx communication link. However, it does not know the existence of the EAV. Accordingly, the constraints for the S-Tx is as follows:

$$\begin{aligned}&\mathcal {O}_{p} \le \theta , \end{aligned}$$

(19)

$$\begin{aligned}&0 \le P^{}_{s} \le P^{max}_{s}, \end{aligned}$$

(20)

where $\mathcal {O}_{p}$ is defined in (11), and $\theta $ is the communication outage constraint of the PU. In other words, the transmit power of the S-Tx should keep the outage probability of the PU below a given constraint.

Scenario 4 ($S_4$):S-Tx has the CSI of both the P-Tx$\rightarrow $P-Rx and S-Tx$\rightarrow $EAV

In this scenario, the S-Tx adjust its transmit power to not reveal its confidential information to the EAV and to not cause harmful interference to the P-Rx. Thus, the transmit power of the S-Tx is subject to three constraints as follows:

$$\begin{aligned}&\mathcal {O}_{p} \le \theta , \end{aligned}$$

(21)

$$\begin{aligned}&\mathcal {O}_{sec} \le \epsilon , \end{aligned}$$

(22)

$$\begin{aligned}&0 \le P^{}_{s} \le P^{max}_{s}, \end{aligned}$$

(23)

where $\mathcal {O}_{p}$ and $\mathcal {O}_{sec}$ are defined in (11) and (10).

4 Performance analysis

In this section, we first derive the power allocation policy for the S-Tx, and then use it to calculate the amount of fading, and outage performance of the S-Tx. Let us commence by considering a property as follows.

property 1

Let a, b, and c be positive constants. Random variables $X_i$ and $Y_i$ are independent and exponentially distributed with mean values $\Omega _X$ and $\Omega _Y$, respectively. An RV U defined by

$$\begin{aligned} U&= \max \limits _ {i \in \{1,2,\ldots , N\}} \left( \frac{a X_i}{b Y_i + c} \right) , \end{aligned}$$

(24)

and has the CDF and PDF, respectively, given by

$$\begin{aligned} F_{U} (u)&= \left[ 1- \frac{1}{\frac{b\Omega _Y}{a\Omega _X} u +1} \exp \left( - \frac{uc}{a \Omega _{X}} \right) \right] ^N \nonumber \\&=\sum \limits _{q=0}^{N} \left( {\begin{array}{c}N\\ q\end{array}}\right) \frac{(-1)^q }{(Au+1)^q} \exp \left( - \frac{qu}{D} \right) , \end{aligned}$$

(25)

$$\begin{aligned} f_{U}(u)&=N\sum \limits _{q=0}^{N-1} \left( {\begin{array}{c}N-1\\ q\end{array}}\right) (-1)^q\nonumber \\ \end{aligned}$$

(26)

$$\begin{aligned}&\times \left[ \frac{A \exp \left( - \frac{(1+q)u}{D} \right) }{(1+A u)^{q+2}} + \frac{\exp \left( - \frac{(1+q)u}{D} \right) }{D(1+A u)^{q+1}} \right] , \end{aligned}$$

(27)

where $A=\frac{b\Omega _Y}{a\Omega _X}$ and $\frac{1}{D}=\frac{c}{a\Omega _X}$.

Proof

The proof is given in [48, Lemma 1]. $\square $

4.1 Transmission power allocation policies

To derive the power allocation policies for the S-Tx, we need to calculate the secrecy outage probability of the SU given in (10), the outage probability of the PU given in (11), and the outage probability given in (13), respectively.

4.1.1 The transmit power of S-Tx under the interference threshold of the PU

From (14), we can calculate $\mathcal {O}_{I}$ as follows

$$\begin{aligned} \mathcal {O}_{I}&= \Pr \left\{ \max \limits _{m \in \{1,2,\ldots , N_p\}} \left\{ \frac{P^{}_{s}\varphi _m}{N_0}\right\} \ge Q_{pk} \right\} \le \xi \nonumber \\&= 1- \Pr \left\{ \max \limits _{m \in \{1,2,\ldots , N_p\}} \left\{ \varphi _m \right\} < \frac{Q_{pk} N_0 }{P^{}_{s}} \right\} \le \xi \nonumber \\&=1- \left\{ 1- \exp \left( -\frac{Q_{pk} N_0 }{ \Omega _{\varphi } P^{}_{s} } \right) \right\} ^{N_p}\le \xi . \end{aligned}$$

(28)

After some mathematical manipulations, it can be concluded that the transmit power of the S-Tx should satisfy the following constraint

$$\begin{aligned} P^{}_{s} \le \frac{Q_{pk}N_0}{\Omega _{\varphi }} \left( \log _e \frac{1}{1-\root N_p \of {1-\xi }}\right) ^{-1}. \end{aligned}$$

(29)

4.1.2 The transmit power of the S-Tx under the secrecy outage constraint

Here, we assume that the EAV may have an advanced background noise filter, and the EAV is only interfered by the outburst transmit power from the P-Tx. In other words, we consider the worst case where the background noise is cancelled significantly and the outburst interference from the P-Tx to the EAV is much higher than the background noise. Therefore, the SINR of the EAV given in (8) can be rewritten as

$$\begin{aligned} \gamma _e= \max \limits _{n \in \{1,2,\ldots , N_{e}\}} \left\{ \frac{P^{}_{s}\alpha _{n}}{P^{}_{p}\rho _{n} +N_0}\right\} \approx \max \limits _{n \in \{1,2,\ldots , N_{e}\}} \left\{ \frac{P^{}_{s}\alpha _{n}}{P^{}_{p}\rho _{n}}\right\} . \end{aligned}$$

(30)

Accordingly, we can derive the secrecy outage probability of the SU as follows

$$\begin{aligned} \mathcal {O}_{sec}=1-\Pr \left\{ \max \limits _{n \in \{1,2,\ldots , N_{e}\}} \left\{ \frac{\alpha _n}{\rho _n}\right\} \le \frac{P^{}_{p}}{P^{}_{s}} \gamma ^{e}_{th} \right\} \le \epsilon , \end{aligned}$$

(31)

where $\gamma ^{e}_{th}=2^\frac{R_{0}}{B}-1$. Further, we can derive the outage probability by using order statistics theory as follows

$$\begin{aligned} \mathcal {O}_{sec}&=1- \prod \limits _{n=1}^{N_e} \int \limits _{0}^{\infty } \Pr \left\{ \alpha _n \le \frac{P^{}_{p}}{P^{}_{s}} \gamma ^{E}_{th} x \right\} f_{\rho _n} (x)dx\nonumber \\&=1-\left( 1- \frac{1}{\frac{P^{}_{p}\Omega _{\rho } }{P^{}_{s}\Omega _{\alpha }}\gamma ^{e}_{th} +1} \right) ^{N_e} \le \epsilon . \end{aligned}$$

(32)

After some manipulation, we obtain the maximum transmission power of the S-Tx under its own secrecy capacity constraint as follows

$$\begin{aligned} P^{}_{s} \le \frac{P^{}_{p} \Omega _{\rho }\gamma ^{E}_{th}}{\Omega _{\alpha }}\left( \frac{1}{\root N_e \of {1-\epsilon }}- 1\right) . \end{aligned}$$

(33)

4.1.3 The transmission power of the S-Tx under the outage probability constraint of the PU

From (11), we can calculate the outage probability of the PU as follows

$$\begin{aligned} \mathcal {O}_{p}&= \Pr \left\{ \max \limits _{m \in \{1,2,\ldots , N_p\}} \left\{ \frac{P^{}_{p}h_m}{P^{}_{s}\varphi _m +N_0}\right\} \le \gamma ^{p}_{th} \right\} \le \theta , \end{aligned}$$

(34)

where $\gamma ^{p}_{th}=2^{\frac{R_p}{B}}-1$. Using the help of (25) in Property 1 for (34) by setting $a=P^{}_{p}$, $b=P^{}_{s}$, $c=N_0$, $\Omega _X=\Omega _h$, $\Omega _Y=\Omega _{\varphi }$, and $u=\gamma ^{p}_{th}$, a closed-form expression for PU is obtained as

$$\begin{aligned} \mathcal {O}_{p}= \left[ 1- \frac{1}{\frac{P^{}_{s}\Omega _{\varphi }}{P^{}_{p}\Omega _{h}}\gamma ^{p}_{th}+1}\exp \left( - \frac{\gamma ^{p}_{th}N_0}{P^{}_{p}\Omega _{h}} \right) \right] ^{N_{p}} \le \theta . \end{aligned}$$

(35)

After some manipulations, we obtain the maximal transmission power of the S-Tx as follows

$$\begin{aligned} P^{}_{s} \le \frac{P^{}_{p}\Omega _{h} }{\gamma ^{p}_{th}\Omega _{\varphi }} \Xi , \end{aligned}$$

(36)

where $\Xi $ is defined as

$$\begin{aligned} \Xi&= \max \left\{ 0, \frac{1}{1-\root N_p \of {\theta }}\exp \left[ - \frac{\gamma ^{p}_{th}N_0}{P^{}_{p}\Omega _{h}} \right] -1 \right\} . \end{aligned}$$

(37)

4.1.4 Power allocation policy for the considered scenarios

Now, we can obtain the transmit power allocation polices for four considered scenarios as follows:

Firstly, the power allocation policy for the scenario S$_1$ is obtained by combining (15) with (29) as
$$\begin{aligned} \mathcal {P}_{S_1}=\min&\left\{ \frac{Q_{pk}N_0}{\Omega _{\varphi }} \left( \log _e \frac{1}{1-\root N_p \of {1-\xi }}\right) ^{-1}, P^{max}_{s} \right\} . \end{aligned}$$

(38)
Secondly, we obtain the power allocation policy for scenario S$_2$ by combining (18), (29), with (33) as
$$\begin{aligned} \mathcal {P}_{S_2}=\min&\left\{ \frac{Q_{pk}N_0}{\Omega _{\varphi }} \left( \log _e \frac{1}{1-\root N_p \of {1-\xi }}\right) ^{-1} \right. \nonumber \\&\left. ,\frac{P^{}_{p} \Omega _{\rho }\gamma ^{e}_{th} }{\Omega _{\alpha }}\left( \frac{1}{\root N_e \of {1-\epsilon }}- 1\right) , P^{max}_{s} \right\} . \end{aligned}$$

(39)
Thirdly, the transmit power of the S-Tx for scenario $S_3$ is achieved by combining (20) with (36) as
$$\begin{aligned} \mathcal {P}_{S_3}=\min&\left\{ \frac{P^{}_{p}\Omega _{h} }{\gamma ^{p}_{th}\Omega _{\varphi }}\Xi , P^{max}_{s} \right\} , \end{aligned}$$

(40)
where $\Xi $ is defined in (37) as
$$\begin{aligned} \Xi&= \max \left\{ 0, \frac{1}{1-\root N_p \of {\theta }}\exp \left[ - \frac{\gamma ^{p}_{th}N_0}{P^{}_{p}\Omega _{h}} \right] -1 \right\} . \end{aligned}$$

(41)
Note that this power allocation is exactly the one reported in [48, Eq. (9)].
Finally, the transmit power policy of the S-Tx for scenario $S_4$ is established by combining (20), (36) with (33) as
$$\begin{aligned} \mathcal {P}_{S_4}=\min&\left\{ \frac{P^{}_{p} \Omega _{\rho }\gamma ^{e}_{th} }{\Omega _{\alpha }}\left( \frac{1}{\root N_e \of {1-\epsilon }}- 1\right) \right. \nonumber \\&\left. ,\frac{P^{}_{p}\Omega _{h} }{\gamma ^{p}_{th}\Omega _{\varphi }}\Xi , P^{max}_{s} \right\} . \end{aligned}$$

(42)

Accordingly, the power allocation algorithm corresponding to four scenarios is given in Algorithm 1.

4.2 Secure and reliable communication probability

Recall that the safe and secure communication probability is defined as the probability that the S-Tx can communicate with the S-Rx without exposing the information to the EAV. Given the obtained power allocation policies and mutually independent channels, we can rewrite the safe and secure communication probability in (12) as

$$\begin{aligned} \mathcal {O}_{ss}&=\Pr \left\{ C_{s} > R_{s}\right\} \Pr \left\{ C_{e} \le R_{0}\right\} \nonumber \\&=(1-\mathcal {O}_{s})(1-\mathcal {O}_{sec}), \end{aligned}$$

(43)

where $\mathcal {O}_{s}$ and $\mathcal {O}_{sec}$ are obtained, respectively, by using the help of Property 1 according to

$$\begin{aligned}&\mathcal {O}_{s}=\sum \limits _{i=0}^{N_s} \left( {\begin{array}{c}N_s\\ i\end{array}}\right) \frac{(-1)^{i}}{(A_s\gamma ^{s}_{th}+1)^{i}} \exp \left( -\frac{i \gamma ^{s}_{th}}{D_s} \right) \end{aligned}$$

(44)

$$\begin{aligned}&\mathcal {O}_{sec}=1- \sum \limits _{j=0}^{N_e} \left( {\begin{array}{c}N_e\\ j\end{array}}\right) \frac{(-1)^{j}}{(A_e\gamma ^{e}_{th} +1)^j} \end{aligned}$$

(45)

where $\gamma ^{s}_{th} = 2^\frac{R_s}{B}-1$, $A_s=\frac{P_p \Omega _{\beta }}{\mathcal {P}_{}{} \Omega _{g}}$, $A_e=\frac{P^{}_{p}\Omega _{\rho } }{\mathcal {P}_{}{}\Omega _{\alpha }}$,and $\frac{1}{D_s}=\frac{N_0}{\mathcal {P}_{}{} \Omega _{g}}$.

Finally, a closed-form expression of the safe and secure communication probability is obtained by substituting (44) and (45) into (43), where $\mathcal {P}_{}$$\in $$\left\{ \mathcal {P}_{S_1},\mathcal {P}_{S_2}, \mathcal {P}_{S_3},\mathcal {P}_{S_4}\right\} $ is the transmit power allocation policy of the S-Tx.

5 Numerical results

In this section, we present numerical examples to examine the power allocation policies and the SRCP for the considered model. To gain more insights, we make comparisons between the scenario S$_1$ and the scenario S$_2$, the scenario S$_3$ and the scenario S$_4$. In this work, we assume that S-Tx, S-Rx, P-Rx, EAV, and P-Tx are located at (0, 0), $(-1,2)$, (0.5, 1), (0, 2.5), and (0, 2) on the 2D plane, respectively. Unless otherwise stated, the parameter settings used in the numerical results are derived from existing wireless networks such [49, 50] as follows:

System bandwidth: B= 5 MHz;
SU target rate: $R_s$=128 Kbps;
PU target rate: $R_p$=64 Kbps;
SU secrecy information rate: $R_{e}$=64 Kbps;
Pathloss exponent $\nu =4$;
Outage probability constraints of the PU and SU: $\theta =\xi =0.01$;
Outage probability constraint of the EAV: $\epsilon =0.1$;
The maximal transmit SNR of the S-Tx: $\gamma ^{\max }_{s}=10$ (dB);
Peak interference level of the PU: $Q_{pk}=-5$ (dB)

Without loss generality, we denote $\bar{\gamma }_{s}=\frac{\mathcal {P}_{}}{N_0}$ and $\bar{\gamma }_{p}=\frac{P_p}{N_0}$ as the transmit SNR of the S-Tx and P-Tx, respectively.

Figure 2 shows the transmit SNR of the S-Tx as a function of the P-Tx transmit SNR. Firstly, we observe the behavior of the transmit SNR of the S-Tx in the scenarios $S_1$ and $S_2$, and can see that the transmit SNR of the S-Tx in scenario $S_1$ is constant for the entire range of the P-Tx SNR. This result matches (38) where the transmit SNR of the S-Tx does not depend on the transmit SNR of the P-Tx. In contrast to scenario $S_1$, the S-Tx linearly increases with an increase of the S-Tx transmit SNR in scenario $S_2$,. However, when the transmit SNR of the P-Tx increases beyond 10 dB ($A_1$), the transmit SNR of the S-Tx is saturated. This can be explained by the fact that the transmit SNR of the S-Tx is allocated using Eq. (39). Thus, in the regime $[-16,10]$ dB, the transmit SNR of the S-Tx is controlled by the constraint of the EAV. However, if the transmit SNR of the P-Tx increases further, the transmit SNR of the S-Tx is subject to the minimum value of the first term and third term in Eq. (39), i.e., in the high regime of the transmit SNR of P-Tx, the transmit SNR of the S-Tx is similar to the one in Scenario 1. It is easy to understand that the transmit SNR of the S-Tx in scenario $S_1$ is always less than or equal to the one in scenario $S_2$ since the transmit SNR S-Tx in $S_2$ is subject to a additional constraint, i.e., the outage constraint of the EAV. Secondly, we observe the behavior of the transmit SNR of the S-Tx in scenarios $S_3$ and $S_4$. It can be seen that the transmit SNR of the S-Tx in the scenario $S_4$ is always less than the one of the scenario $S_3$. However, in the high regime of the transmit SNR of the P-Tx, e.g. $\bar{\gamma }_p \ge 16$ dB, they are equal and saturated at $A_2$. This is because the transmit SNR of the S-Tx in scenario $S_4$ endures more constraints than the one of scenario $S_3$, i.e., the constraint of the EAV. Finally, we can conclude that the appearance of the EAV leads to that the power allocation policy for the S-Tx is more complicated and may degrade the performance of the SU.

Figure 3 plots the transmit SNR of the S-Tx as a function of the P-Rx antennas, $N_p$. We can see that the transmit SNR of the S-Tx in scenarios $S_1$ and $S_3$ is much higher than the one in scenarios $S_2$ and $S_4$. This happens for the same reason as in Fig. 2, i.e., when the S-Tx is subject to the additional constraint of the EAV, the transmit SNR of the S-Tx is degraded. In addition, when the number of antennas of the P-Rx increases, the transmit SNR of the S-Tx in scenario $S_1$ decreases slightly. It is due to the fact that increasing the number of antennas of the P-Rx leads to increase in the constraints for the S-Tx. Thus, the S-Tx must decrease its transmit SNR to not cause harmful interference to the P-Rx (see Eq.(13)). It is interesting to see that the transmit SNR of scenarios $S_2$ and $S_4$ are the same for the whole considered range of $N_p$. This is due to the fact that the constraint of the EAV is the strongest one (see Eq. (33)). Accordingly, the transmit SNR of the S-Tx under the constraint of the EAV becomes the minimum value in both (39) and (42) in the considered range of $N_p$, i.e.,

$$\begin{aligned} \mathcal {P}_{S_2}=\mathcal {P}_{S_4}=\frac{P^{}_{p} \Omega _{\rho }\gamma ^{E}_{th}}{\Omega _{\alpha }}\left( \frac{1}{\root N_e \of {1-\epsilon }}- 1\right) . \end{aligned}$$

Figure 4 shows the impact of the number of antennas on the EAV on the transmit SNR of the S-Tx. Firstly, we observe the behavior of the transmit SNR of the S-Tx in scenarios $S_1$ and $S_3$ and see that the transmit SNR of the S-Tx does not change following the change of $N_e$. This is because the S-Tx does not know the existence of the EAV. However, when the S-Tx knows the existence of the EAV as in scenarios $S_2$ and $S_4$, the transmit SNR degrades significantly as the number of antennas of the EAV increases. This is due to the fact that increasing the number of antennas of the EAV leads to an improvement its eavesdropping probability. As a result, the S-Tx in scenarios $S_2$ and $S_4$ must reduce its transmit SNR to secure the communication information.

In Fig. 5, we show the impact of the P-Tx transmit SNR on the SRCP of the SU. It can be observed that the SRCP of the scenario $S_2$ (scenario $S_4$) is always better than the one in scenario $S_1$ (scenario $S_3$) in the low regime of the P-Tx SNR $\bar{\gamma }_{p}\le -4$ dB ($\bar{\gamma }_{p}\le 2$ dB). However, when the P-Tx SNR is increased further, the SRCP of scenarios $S_1$ and $S_2$ (scenarios $S_3$ and $S_4$) are identical. This is because when the P-Tx transmit SNR is in the low regime, the S-Tx transmit SNR in scenario $S_1$ (scenario $S_3$) is greater than the one of scenario $S_2$ (scenario $S_4$). Accordingly, the secure probability of the SU degrades significantly, while the safe communication probabilities are not much different. As a result, the SRCP of scenario $S_1$ (scenario $S_3$) is smaller than the one of scenario $S_2$ (scenario $S_4$) (see (43)). When the P-Tx SNR increases further, e.g. 2 (dB) $\le \bar{\gamma }_{p} \le 14$ (dB), the S-Tx can adjust its transmit power to the maximal value in all scenarios. This leads to the SRCP for scenarios $S_1$ and $S_2$ (scenarios $S_3$ and $S_4$) being identical. Most interestingly, in the high regime of the P-Tx SNR, the SRCP for scenarios $S_1$ and $S_2$ (scenarios $S_3$ and $S_4$), e.g $\bar{\gamma }_{p} \ge 6$ (dB) or $ \bar{\gamma }_{p} \ge 14$ (dB) are degraded. This is due to the fact that in the low regime of the P-Tx SNR, the S-Tx can regulate its transmit SNR to satisfy the given constraints. However, when the transmit SNR of P-Tx increases further, it becomes a strong interference source to S-Rx, which leads to degrade the SRCP of the SU.

In Fig. 6, we show the impact of number of antennas of the P-Rx on the SRCP of the SU. The $\hbox {SRCP}_{\mathrm{s}}$ are identical and slight increasing for scenarios $S_1$ and $S_2$. This can be explained as the P-Rx can tolerate more interference from the S-Tx as its number of antennas increases. Consequently, the S-Tx can increase its transmit power to enhance the SRCP. However, under the constraints of peak interference level $Q_{pk}$, outage probability constraint $\xi $, as well as secrecy outage constraint $\epsilon $, the transmit power of the S-Tx is identical for both scenarios $S_1$ and $S_2$. Thus, the SRCP are identical. In contrast to scenarios $S_1$ and $S_2$, the SRCP in scenario $S_4$ outperforms the one of the scenario $S_3$. This is because that the S-Tx in the scenario $S_3$ does not care about the existence of the EAV, thus it can transmit with maximal transmit power and its information communication may be revealed to the EAV. Alternatively, in scenario $S_4$, the S-Tx knows the existence of the EAV, thus it adjusts its transmit power to not reveal information to the EAV. Accordingly, the SRCP in scenario $S_4$ outperforms the one in the scenario $S_3$.

Finally, we examine the impact of the number of antennas of the EAV on the SRCP of the SU as shown in Fig. 7. It can be seen that the SRCP for scenarios $S_1$ and $S_3$, where the secure constraint are not considered, are degraded rapidly. Alternatively, the SRCP in scenarios $S_2$ and $S_4$, where the secure constraint is integrated, degrade gradually. Clearly, the scenarios with the CSI of the EAV can make the information communication of the SU more secure and reliable.

6 Conclusions

In this paper, we have investigated how to obtain secure and reliable communication in a CRN in which the SU transmitter is subject to eavesdropping. Given the constraints of the PU, EAV, and SU, we derive four power allocation polices corresponding to four different scenarios depending on which type of CSI that is available. Accordingly, a performance measure in terms of secure and reliable communication probability is introduced to evaluate the considered system. Our results show that the security constraint only effects the SRCP of the SU in the low regime of the transmit SNR of the P-Tx. Further, the system performance degrades significantly when the security constraints are not considered and the number of antennas of the EAV increases. Finally, simulations validate our analytical results.

Acknowledgements

The research leading to these results has been performed in the research project of Ministry of Education and Training, Vietnam (No. B2017-TNA-50), and the SafeCOP project which is funded from the ECSEL Joint Undertaking under grant agreement n$^{0}$ 692529, and from National funding.

Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Vorheriger Artikel Anonymous three-factor authenticated key agreement for wireless sensor networks

Nächster Artikel A new technique of frequency domain watermarking based on a local ring

Haykin, S. (2005). Cognitive radio: Brain-empowered wireless communications. IEEE Journal on Selected Areas in Communications, 23(2), 201–220.CrossRef

Datla, D., Wyglinski, A . M., & Minden, G . J. (2009). A spectrum surveying framework for dynamic spectrum access networks. IEEE Transactions on Vehicular Technology, 58(8), 4158–4168.CrossRef

Gastpar, M. (2007). On capacity under receive and spatial spectrum-sharing constraints. IEEE Transactions on Information Theory, 53(2), 471–487.MathSciNetCrossRefMATH

Tran, H. (2013). Performance analysis of cognitive radio networks with interference constraints. Dissertation, Blekinge Institute of Technology, Karlskrona.

Musavian, L., & Aissa, S. (2009). Fundamental capacity limits of cognitive radio in fading environments with imperfect channel information. IEEE Transactions on Communications, 57(11), 3472–3480.CrossRef

Mitola, J. (Nov. 1999). Cognitive radio for flexible mobile multimedia communications. In Proceedings of IEEE international workshop mobile multimedia communication, San Diego (pp. 3–10).

Jovicic, A., & Viswanath, P. (2006). Cognitive radio: An information-theoretic perspective. In Proceedings of IEEE ISIT, Seattle (pp. 2413–2417).

Akhtar, F., Rehmani, M. H., & Reisslein, M. (2016). White space: Definitional perspectives and their role in exploiting spectrum opportunities. Telecommunications Policy, 40(4), 319 – 331. http://www.sciencedirect.com/science/article/pii/S0308596116000124

Abdelhadi, A., Shajaiah, H., & Clancy, C. (2015). A multitier wireless spectrum sharing system leveraging secure spectrum auctions. IEEE Transactions on Cognitive Communications and Networking, 1(2), 217–229.CrossRef

10.

Khan, A. A., Rehmani, M. H., & Reisslein, M. (2016). Cognitive radio for smart grids: Survey of architectures, spectrum sensing mechanisms, and networking protocols. IEEE Communications Surveys Tutorials, 18(1), 860–898.CrossRef

11.

Saleem, Y. & Rehmani, M. H. (2014). Primary radio user activity models for cognitive radio networks: A survey, Journal of Network and Computer Applications, 43, 1 – 1. http://www.sciencedirect.com/science/article/pii/S1084804514000848

12.

Fragkiadakis, A. G., Tragos, E. Z., & Askoxylakis, I. G. (2013). A survey on security threats and detection techniques in cognitive radio networks. IEEE Communications Surveys & Tutorials, 15(1), 428–445.CrossRef

13.

Zou, Y., Zhu, J., Yang, L., Liang, Y. C., & Yao, Y. D. (2015). Securing physical-layer communications for cognitive radio networks. IEEE Communications Magazine, 53(9), 48–54.CrossRef

14.

Sanyal, S. Bhadauria, R. & Ghosh, C. (2009) Secure communication in cognitive radio networks. In Proceedings of international conference on computers and devices for communication (pp. 1–4).

15.

Alahmadi, A., Abdelhakim, M., Ren, J., & Li, T. (2013). Mitigating primary user emulation attacks in cognitive radio networks using advanced encryption standard. In Proceeedings of IEEE global communications conference (pp. 3229–3234).

16.

Wayner, A. D. (1975). The wire-tap channel. Bell Systems Technical Journal, 54(8), 1355–1387.MathSciNetCrossRefMATH

17.

Bloch, M., Barros, J., Rodrigues, M., & McLaughlin, S. (2008). Wireless information-theoretic security. IEEE Transactions on Information Theory, 54(6), 2515–2534.MathSciNetCrossRefMATH

18.

Mavoungou, S., Kaddoum, G., Taha, M., & Matar, G. (2016). Survey on threats and attacks on mobile networks. IEEE Access, 4, 4543–4572.CrossRef

19.

Fragkiadakis, A., Tragos, E., & Askoxylakis, I. (2013). A survey on security threats and detection techniques in cognitive radio networks. IEEE Communications Surveys & Tutorials, 15(1), 428–445

20.

Leung-Yan-Cheong, S. K., & Hellman, M. E. (1978). The gaussian wiretap channel. IEEE Transactions on Information Theory, 24(1), 451–456.MathSciNetCrossRefMATH

21.

Pei, Y., Liang, Y.-C., Zhang, L., Teh, K., & Li, K. H. (2010). Secure communication over MISO cognitive radio channels. IEEE Transactions on Wireless Communications, 9(4), 1494–1502.CrossRef

22.

Zou, Y., Li, X., & Liang, Y.-C. (2014). Secrecy outage and diversity analysis of cognitive radio systems. EEE Journal on Selected Areas in Communications, 32(11), 2222–2236.CrossRef

23.

Attar, A., Tang, H., Vasilakos, A. V., Yu, F. R., & Leung, V. C. M. (2012). A survey of security challenges in cognitive radio networks: Solutions and future research directions. IEEE Communications Surveys & Tutorials, 100(12), 31723186.

24.

Xiao, H., Yang, K., Wang, X., & Shao, H. (2012). A robust MDP approach to secure power control in cognitive radio networks. In Proceedings of IEEE international conference on communications, Ottawa (pp. 4642–4647).

25.

Pei, Y., Liang, Y.-C., Zhang, L., Teh, K. C., & Li, K. H. (2009). Achieving cognitive and secure transmissions using multiple antennas. In Proceedings of IEEE personal indoor mobile radio communication, Singapore (pp. 1–5).

26.

Pei, Y., Liang, Y.-C., Zhang, L., Teh, K. C., & Li, K. H. (2011) Increasing secrecy capacity via joint design of cooperative beamforming and jamming. In Proceedings IEEE personal indoor mobile radio communication, Toronto, ON (p. 12741278).

27.

Wang, C., & Wang, H.-M. (2014). On the secrecy throughput maximization for MISO cognitive radio network in slow fading channels. IEEE Transactions on Information Forensics and Security, 9(11), 1814–1827.CrossRef

28.

Gabry, F., Zappone, A., Thobaben, R., Jorswieck, E. A., & Skoglund, M. (2015). A survey of security challenges in cognitive radio networks: Solutions and future research directions. IEEE Wireless Communications Letters, 4(4), 437440.CrossRef

29.

Zou, Y., Wang, X., & Shen, W. (2013). Physical-layer security with multiuser scheduling in cognitive radio networks. IEEE Transactions on Communications, 61(12), 5103–5113.CrossRef

30.

Sakran, H., Shokair, M., Nasr, O., El-Rabaie, S., & El-Azm, A. (2012). Proposed relay selection scheme for physical layer security in cognitive radio networks. IET Communications, 6(16), 2676–2687.MathSciNetCrossRef

31.

Ha, D. B., Vu, T. T., Duy, T. T., & Bao, V. N. Q. (2015). Secure cognitive reactive decode-and-forward relay networks with and without eavesdroppers. Springer Wireless Personal Communications, 85(4), 2619–2641.CrossRef

32.

Sibomana, L., Zepernick, H. J., & Tran, H. (2014). On physical layer security for reactive DF cognitive relay networks. In Proceedings of IEEE GLOBECOM, Austin, TX (pp. 1290–1295).

33.

Nguyen, V. D., Duong, T. Q., Dobre, O., & Shin, O. S. (2016). Joint information and jamming beamforming for secrecy rate maximization in cognitive radio networks. IEEE Transactions on Information Forensics and Security, 11(99), 1.

34.

Wu, Y., & Liu, K. (2011). An information secrecy game in cognitive radio networks. IEEE Transactions on Information Forensics and Security, 6(3), 831–842.CrossRef

35.

Stanojev, I., & Yener, A. (2013). Improving secrecy rate via spectrum leasing for friendly jamming. IEEE Transactions on Wireless Communications, 12(1), 134–145.CrossRef

36.

Sibomana, L., Tran, H., & Tran, Q. A. (2015). Impact of secondary user communication on security communication of primary user. Security and Communication Networks, Journal of Wiley, 41774190(99), 1–1.

37.

Zou, Y., & Wang, G. (2016). Intercept behavior analysis of industrial wireless sensor networks in the presence of eavesdropping attack. IEEE Transactions on Industrial Informatics, 12(2), 780–787.CrossRef

38.

Ha, D. B., Vu, T. T., Duy, T. T., & Bao, V. N. Q. (2015). Secure cognitive reactive decode-and-forward relay networks: With and without eavesdroppers. Springer Wireless Personal Communications, 85(4), 2619–2641.CrossRef

39.

Liu, Y., Wang, L., Duy, T. T., Elkashlan, M., & Duong, T. Q. (2015). Relay selection for security enhancement in cognitive relay networks. IEEE Wireless Communications Letters, 4(1), 46–49.CrossRef

40.

Zou, Y., Zhu, J., Zheng, B., & Yao, Y. D. (2010). An adaptive cooperation diversity scheme with best-relay selection in cognitive radio networks. IEEE Transactions on Signal Processing, 58(10), 5438–5445.MathSciNetCrossRefMATH

41.

Bahrak, B., Bhattarai, S., Ullah, A., Park, J. M. J., Reed, J., & Gurney, D. (2014). Protecting the primary users’ operational privacy in spectrum sharing. In Proceedings of IEEE international symposium on dynamic spectrum access networks, McLean, VA, pp. 236–247.

42.

Zhou, X., McKay, M. R., Maham, B., & Hjorungnes, A. (2011). Rethinking the secrecy outage formulation: A secure transmission design perspective. IEEE Communications Letters, 15(3), 302–304.CrossRef

43.

Liu, W., Zhou, X., Durrani, S., & Popovski, P. (2016). Secure communication with a wireless-powered friendly jammer. IEEE Transactions on Wireless Communications, 15(1), 401–415.CrossRef

44.

Duy, T. T., Duong, T. Q., Thanh, T. L., & Bao, V. N. Q. (2015). Secrecy performance analysis with relay selection methods under impact of co-channel interference. IET Communications, 9(11), 1427–1435.CrossRef

45.

Xu, X., He, B., Yang, W., Zhou, X., & Cai, Y. (2016). Secure transmission design for cognitive radio networks with poisson distributed eavesdroppers. IEEE Transactions on Information Forensics and Security, 11(2), 373–387.CrossRef

46.

Zou, Y., & Zhu, J. (2016). Physical-layer security for cooperative relay networks. Berlin: Springer.CrossRef

47.

Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008). Wireless information-theoretic security. IEEE Transactions on Information Theory, 54(6), 2515–2534.MathSciNetCrossRefMATH

48.

Tran, H., Hagos, M. A., Mohamed, M., & Zepernick, H.-J. (2013) Impact of primary networks on the performance of secondary networks. In Proceedings of international conference on computing, management and telecommunications, Ho Chi Minh City (pp. 43–48).

49.

ITU-R (2008). Requirements related to technical performance for IMT-advanced radio interface(s), Technical Report ITU-R M.2134.

50.

Garg, V . K. (2011). LTE-The UMTS long term evolution: From theory to practice. New York: Wiley.

Titel: Power allocation policy and performance analysis of secure and reliable communication in cognitive radio networks
verfasst von: Truong Xuan Quach
Hung Tran
Elisabeth Uhlemann
George Kaddoum
Quang Anh Tran
Publikationsdatum: 09.11.2017
Verlag: Springer US
Erschienen in: Wireless Networks / Ausgabe 4/2019
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI: https://doi.org/10.1007/s11276-017-1605-z

Neuer Inhalt

Bildnachweise

VDI-Icon, Profil Icon, inhalt2, Springer Professional Modul/© Springer Fachmedien Wiesbaden GmbH, Nachhaltigkeitsaward Key Visual/© Cometis AG/Global ESG Monitor | Daniel Rupp | Generiert mit KI, Search Icon, Banner Hanser, Beijing Auto Show 2024: Deutsche Hersteller wollen angreifen./© EKH-Pictures / Generated with AI / Stock.adobe.com, Buchstaben, die aus einem Megaphon kommen/© MicroStockHub/Getty Images/iStock, Digitale Lieferkette/© zapp2photo / stock.adobe.com, Zeitschrift Wissensmanagement Cover, PatentFit-Logo/© Springer Fachmedien Wiesbaden GmbH, Zukunftswerkstatt Sales Excellence 2024/© AndreyPopov / Getty Images / iStock, 2023_Antrieb/© supervisuell, ATZ-Webinar: Prototypenfreie Entwicklung durch Offline- und Driver-in-the-Loop-HiL-Tests /© (c) VI-grade

Springer Professional

Abstract

1 Introduction

2 Related work

3 System model

3.1 Performance Metric for the SU communication

3.2 Constraints for transmit power of the SU

4 Performance analysis

4.1 Transmission power allocation policies

4.1.1 The transmit power of S-Tx under the interference threshold of the PU

4.1.2 The transmit power of the S-Tx under the secrecy outage constraint

4.1.3 The transmission power of the S-Tx under the outage probability constraint of the PU

4.1.4 Power allocation policy for the considered scenarios

4.2 Secure and reliable communication probability

5 Numerical results

6 Conclusions

Acknowledgements

Weitere Artikel der Ausgabe 4/2019

Effective multi-stage error control algorithms for robust 3D video transmission over wireless networks

Infrastructure-aided hybrid routing in CR-VANETs using a Bayesian Model

A hierarchical binary quadtree index for spatial queries

Optimal throughput performance in full-duplex relay assisted cognitive networks

Movement prediction models for vehicular networks: an empirical analysis

Game based incentive mechanism for cooperative spectrum sensing with mobile crowd sensors

Neuer Inhalt

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.