{'fraction_non_alphanumeric': 0.04364157564375031, 'fraction_numerical': 0.01186180991449612, 'mean_word_length': 4.167007150153218, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 11, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Mimicking Full-Duplex Secure Communications for Buffer-Aided Multi-Relay Systems

This paper considers secure communication in buffer-aided cooperative wireless networks in the presence of one eavesdropper, which can intercept the data transmission from both the source and relay nodes. A new max-ratio relaying protocol is proposed, in which different relays are chosen for reception and transmission according to the ratio of the legitimate channels to the eavesdropper channels, so that the relay selected for reception and the relay selected for transmission can receive and transmit at the same time. It is worth noting that the relay employs a randomize-and-forward (RF) strategy such that the eavesdropper can only decode the signals received in the two hops independently. Theoretical analysis of the secrecy throughput of the proposed scheme is provided and the approximate closed-form expressions are derived, which are verified by simulations. Through numerical results, it is shown that the proposed scheme achieves a significant improvement in secrecy throughput compared with existing relay selection policies.


I. INTRODUCTION
Wireless communication technologies play an important role in military and civil applications, and their rapid developments have been promoting the evolution into the fifth generation (5G) communication [1], [2]. However, the broadcast nature of wireless medium makes the communication over wireless networks susceptible to the interception attacks from unauthorized users (eavesdroppers), and thus guaranteeing the security of wireless communication is becoming an increasingly urgent demand [3].
Traditionally, security issues are addressed by applying cryptographic methods, which utilize secret keys and encryption/decryption algorithms to provide secure data streams, in the upper layers of the network protocol stack [4]. However, their applications may be limited by the inherent difficulty of secret key management and the increasingly powerful computation capability of the eavesdroppers. In the seminal work [5], Wyner introduced the wiretap channel model and established the possibility of creating perfectly secure communication links without relying on secret keys. A rate at which information can be transmitted securely from the source to its intended destination is termed as achievable secrecy rate, and secrecy capacity is the maximal achievable secrecy rate. The secrecy capacity of the scalar Gaussian wiretap channel was analyzed in [6]. Recently, physical layer (PHY) security techniques have been considered as a promising solution to guarantee everlasting secure communication for wireless networks by exploiting the inherent randomness of wireless channels and noise, and have received a lot of attention [7]- [18].
Of particular interest is the secure communication over relay channels, which is one of the fundamental building blocks of communication systems. In [8], the relayeavesdropper channel was studied and different node cooperation strategies were analyzed. It has been shown that cooperative communication not only significantly improves the transmission capacity for wireless networks, but also provides an effective way to improve the secrecy capacity. On top of that, several relay strategies have been designed in literature [9]- [11]. Moreover, recent works have shown that use of buffers at the relays make it possible to store packets and transmit them in more favorable wireless conditions, which greatly improves the security performance of wireless communications [12]- [18]. For instance, in [12], we have designed the link selection and power control policies for secure communications over a buffer-aided two hop communication link.
Note that a relay usually operates in either full-duplex (FD) or half-duplex (HD) mode. In FD relaying, the relays transmit and receive at the same time and frequency, at the cost of hardware complexity [19], [20]. We consider a bufferaided relay system with multiple HD relays in this paper. Inspired by the space full-duplex max-max relay selection (SFD-MMRS) scheme in [21], which mimics FD relaying with HD relays via link selection, we propose a new maxratio relay selection scheme for secure transmission in HD randomize-and-forward (RF) buffer-aided relay networks in this paper. In the proposed scheme, we select different relays for reception and transmission according to the ratio of the legitimate channels to the eavesdropper channels. We analyze the secrecy throughput of the proposed scheme in independent and identically distributed (i.i.d.) Rayleigh fading channels and derive the approximate closed-form expressions. Numerical results in accordance with theoretical analysis show the superiority of the proposed scheme over the existing relay selection schemes.
The reminder of this paper is organized as follows. The system model and two existing max-ratio relay selection scheme for secure buffer-aided cooperative wireless networks are briefly introduced in Section II. In Section III, the relay selection policy is proposed, comprehensive analysis of the secrecy throughput is presented and the approximate

A. System Model
We consider a two-hop wireless communication system consisting of one source node S, one destination node D, a set of K relays R 1 , ..., R K adopting the RF decoding strategy, and one eavesdropper E which can intercept signals from both the source and relay nodes, as shown in Fig. 1. Under the RF relaying strategy, the source and relay use different codebooks to transmit the secret message, so the eavesdropper cannot combine the data transmitted by source and relay [11], [14]. We assume that each node is equipped with a single antenna and operates in the HD mode. We assume that there is a buffer of infinite length at each relay such that each relay can store the information received from the source and transmit it in later time.
We assume that there is no direct link between the source and destination due to high attenuation, and the communications can be established only via relays. The channel coefficients for S − R k , R k − D, S − E and R k − E links at time t are denoted as h sr k (t), h r k d (t), h se (t) and h r k e (t), respectively. The channel is assumed to be stationary and ergodic. We consider the block fading, in which the channel coefficients remain constant during one time slot and vary independently from one to the other. In addition to fading, all wireless links are impaired by additive white Gaussian noise (AWGN) with variance N 0 . Without loss of generality, we assume that the noise variances at the receiving nodes are equal to one, i.e., N 0 = 1. The source and relays are assumed to transmit with power P S and P R respectively.
Throughout this paper, we consider the case of i.i.d. Rayleigh fading for S − R i , R i − D, and R i − E links, which is a typical assumption to facilitate analysis [21]. We assume that the mean of S − R k , S − E, R k − D and R k − E channel gains are E[|h sr k | 2 ] = γ sr , E[|h se | 2 ] = γ se , E[|h r k d | 2 ] = γ rd and E[|h r k e | 2 ] = γ re , respectively, where E[·] denotes the expectation.

B. Existing Relaying Schemes
In this part, we review two existing relay selection protocols for secure buffer-aided cooperative wireless networks.
1) Max-Min-Ratio Relay Selection: With the RF relaying strategy applied at the relays, the instantaneous secrecy rate for the buffer-aided multi-relay systems is obtained as [8] C k (t) = where [·] + = max{·, 0}. The secrecy throughput is given by If the exact knowledge of the eavesdropping channels are available, the best relay node can be selected with the maximum C k (t). This scheme is termed as the max-minratio relay selection in this paper. For convenience, the time index t is ignored in the rest of the paper unless necessary.

2) Max-Link-Ratio Relay Selection:
This protocol chooses the best link with the highest gain ratio among all available source-to-relay and relay-to-destination links [17]. If the exact knowledge of all channels, including the eavesdropping channels h se and h r k e , are available, the max-link-ratio selects the best relay R k as

III. FULL CSI AT THE TRANSMITTERS
In this section, we assume the instantaneous channel state information (CSI) of legitimate channels (i.e., |h sr k | 2 and |h r k d | 2 ) are always known. Regarding the knowledge of eavesdropper CSI, we consider the perfect CSI case where the instantaneous eavesdropper CSI (i.e., |h se | 2 and |h r k e | 2 ) are available in this paper.
Note however that, when the eavesdropper is passive and its behavior can not be monitored, the assumption of the exact CSI of the eavesdroppers link might be unrealistic. We also consider the partial CSI case where only the average gains of the eavesdropping channels are available. Since the derivations are similar, they are omitted in this paper due to the limit of space.

A. Link Selection Policy
Inspired by the SFD-MMRS scheme, if the channel gains of both the legitimate receiver and the eavesdropper are known at the transmitter, the best and the second best relay for reception R r1 and R r2 are selected respectively based on r1 = arg max k∈{1,...,K} and the best and the second best relay for transmission R t1 and R t2 are selected respectively according to Denote Let Then, in the proposed imitating full-duplex max-max-ratio relay selection (IFD-MRRS) policy, the relays selected for reception Rr 1 and transmission Rt 1 are chosen as which means if the best S − R and the best R − D channels do not share the same relay, i.e., r 1 = t 1 , we select the relay with the best S −R channel for reception and the relay with the best R − D channel for transmission. However, if the same relay has the best S − R and R − D channel, i.e., r 1 = t 1 , we choose the best bottleneck link, i.e., if Q > 0, and select the relay with the best S − R channel for reception and the relay with the second best R − D channel for transmission. Conversely, if Q < 0, we select the relay with the second best S − R channel for reception and the relay with the best R − D channel for transmission. Note that the use of buffers make virtual full duplex operations at the relays possible when two different relays are selected for the reception and transmission (see, e.g., [17] and [21]).

B. Secrecy Throughput Analysis
Considering that we employ the RF relaying strategy [10], the eavesdropper cannot combine the data transmitted by source and relay at each time slot. Therefore, when either the source wishes to transmit confidential information to the relay or the relay sends private message to the destination, we can view as a single hop transmission in the presence of the interference from the other hop. Assuming that the eavesdropper employs decoding with successful interference cancellation and the decoding order at the eavesdropper is not known at the source or the relays, the maximum eavesdropping data rate is assumed to be upperbounded by log 2 (1 + P S |h se | 2 ) for the link S − E, and log 2 (1 + P R |h r k e | 2 ) for the link R k − E. If the relay R k is selected for the data transmission, the instantaneous secrecy rate of the first and second hop are lowerbounded by respectively. In the following, we adopt the lowerbound for the analysis, which represents the worst case and specifies the minimum throughput achievable. Then the secrecy throughput for the buffer-aided multirelay system is given by [22] where E[C SR ] and E[C RD ] denote the average secrecy throughput of the S − R and R − D links, respectively. The average secrecy rate of the first and second hop, C k , k ∈ {SR, RD}, can be expressed as [21, (9)] where p s denote the probability that r 1 = t 1 , C k,1 is the average throughput of the best channel of the first and second hop, k ∈ {SR, RD}, C k,21 and C k,22 denote the average throughput of the best channel and the second best channel of the first and second hop when Q > 0 and Q < 0, respectively.
Note that our selection policy involves eight independent channel coefficients, and hence finding the closed-form expressions is very tricky, if not intractable. So we derive the approximate closed-form expressions for the average secrecy throughput of the proposed scheme.
Proposition 1: The average secrecy rate of the first hop E[C SR ] can be approximately expressed as where p s denotes the probability that r 1 = r 2 , p 12 denotes the probability that Q > 0, p 21 denotes the probability that Q < 0, E[C SR,1 ] and E[C SR,2 ] denote the average secrecy capacity of the best and the second best S − R channel, respectively. Similarly, the average secrecy rate of the second hop E[C RD ] can be approximately expressed as where E[C RD,1 ] and E[C RD,2 ] denote the average secrecy capacity of the best and the second best R − D channel, respectively. Proof: Based on (7), we can divide the time index t into three cases correspondingly. If r 1 = t 1 , we select the relay with the best S − R channel for reception and the relay with the best R − D channel for transmission. We denote such indices as t ∈ Ω 1 . If r 1 = t 1 , we need to determine whether Q is positive or negative, if Q > 0, we select the relay with the best S − R channel for reception and the relay with the second best R − D channel for transmission. We denote such time indices as t ∈ Ω 2 . Inversely, if Q < 0, we select the relay with the second best S − R channel for reception and the relay with the best R − D channel for transmission, and denote such time indices as t ∈ Ω 3 . Let N 1 denote the number of times in N transmissions that r 1 = t 1 , and hence N 12 denote the number of time instances in N 1 transmissions that Q > 0, and N 21 denote the number of time instances in N 1 transmissions that Q > 0, i.e., p s = N1 N , p 12 = N12 N1 , and p 21 = N21 N1 . Consider the first hop. The average secrecy rate is given by The average secrecy rate of the second hop can be proved by the same logic.
Proposition 2: Assume that full CSI of the eavesdropper's channels are known. Given P S and P R , the detailed expressions for the terms in (11) and (12) can be expressed as follows: where fZ r 2 (z) = Remark 1: Note that E[C SR ] can be obtained by substituting the above equations into (11).
Similarly, we can obtained the expressions for E[C RD ].
Proof: The probability that the best S − R and the best R − D channels share the same relay is p s = 1 K [21], it follows directly from the fact that the channels for both S−R and R − D links are i.i.d. And it is obvious that we have p 21 = 1 − p 12 . So, to compute the secrecy throughput of IFD-MRRS, we need to find Computation of E[C SR,1 ]: In this case, we denote where x (e −t /t)dt, x > 0 is the exponential integral function. See Appendix A for the derivation of (18).
Computation of E[C RD,1 ]: In this case, we denote z t1 = max k∈{1,2,...,K} we first compute the CDF of z k , then we can calculate the CDF of z t1 . E[C RD,1 ] is given by See Appendix B for the derivation of (19).

Computation of E[C SR,2 ] and E[C RD,2 ]:
To compute E[C SR,2 ] and E[C RD,2 ], we need to compute the CDF of z r2 and z t2 , so we consider the following theorem of order statistics: Theorem 1 ( [23]): Let Z 1 , ..., Z n be n independent variates, each with cdf F (z). Let Z 1 , ..., Z n denote the increasing order of Z 1 , ..., Z n , i.e., Z (1) ≤ Z (2) ≤ Z (n) . Let F (r) (z), (r = 1, ..., n) denote the cdf of the r th order statistic Z (r) . Then the cdf of Z (r) is given by Based on (20), we obtain Since And E[C RD,2 ] can be obtained as Computation of p 12 : Given that z r1 > z r2 , z t1 > z t2 , we have Since we have obtained the CDF of z r2 and z t2 , we can express the probability of Q > 0 , i.e., p 12 , as an integral form and calculate its value numerically.
Note that E[C SR ] can be obtained by substituting (18), (23) and p 12 into (11), E[C RD ] can be obtained by substituting (19), (24) and p 12 into (12). Finally, the approximate closed-form expression of the secrecy throughput of the proposed scheme is obtained by substituting (11) and (12) into (9).
Given the total power constraint SNR of the network, we can allocate the total power to the source and relays to achieve the best performance.
Regarding IFD-MRRS scheme, we need to allocate transmit energy to source and K relays. The sources works for all time slots, therefore, we should have (P S + KP R ) ≤ SNR. For max-link-ratio scheme, we should allocate transmit power to the source and K relays for each time slot to enable each link to be capable of being selected for reception or transmission, so we should have (P S + KP R ) ≤ SNR as well. With max-min-ratio scheme, similarly, we should allocate transmit energy to the source and K relays, albeit the data transmission occupies two time slots, so we should have 1 2 (P S + KP R ) ≤ SNR. Consider the derived expressions of secrecy throughput, once given the total power SNR, it is obvious that when P S is small, the throughput is limited by first hop. On the other hand, when P R is small, the second hop will be the bottleneck of the system. Therefore, there is always an optimal power allocation that maximizes the secrecy throughput.
Definition 1: The maximum secrecy throughput of IFD-

MRRS is given by
Similarly, we can define the maximum secrecy throughput for max-min-ratio scheme and max-link-ratio scheme.

IV. NUMERICAL RESULTS
In this section, simulation results are given to verify the secrecy throughput for the proposed IFD-MRRS scheme. We assume that γ sr = γ rd = γ se = γ re = 2, unless specified otherwise. Fig. 2 plots the secrecy throughput versus P S /P R for each scheme, where the relay number is set as K = 3. We assume SNR = 10 dB. We can find that the secrecy throughput always has a peak value as P S /P R varies, and the proposed scheme achieves the largest throughput. It is interesting that, each scheme does not achieve the maximum secrecy throughput when PS PR = 1, i.e., P S = P R . This is because, the distribution of the channels for the two hops is not symmetric, which can also be seen from the selection strategy (5). We also note that the analytical results obtained based on the derivation in Section III are very close to the simulation results, which verifies the approximate closedform expressions.
In Fig. 3, we compare the maximum secrecy throughput of the proposed scheme with that of two existing max-ratio schemes as SNR varies, where the relay number is set as K = 3. We can find that the proposed scheme achieves the best performance with power allocation. Also, we can find that the approximate expression holds for a wide range of SNR values. Fig. 4 plots the maximum secrecy throughput of each scheme versus the number of relays for SNR = 10 dB. We can find that the proposed scheme achieves the best performance in all cases. It is clearly shown that, the increase of the relay number can significantly improve the secrecy throughput performance.

V. CONCLUSION
In this paper, we have proposed an IFD-MRRS protocol for secure communications over buffer-aided cooperative relay networks. Notice that we considers the RF strategy such that the eavesdropper can only independently decode the signals received in the two hops. With the help of buffers at the relays, different relays for reception and transmission have been selected with the largest or the second largest ratio among S − R and R − D links. Approximate closedform expressions for the secrecy throughput were derived. Numerical results in consistence with the analytical expressions show that the distribution of the channels of the two hop is not symmetric, and the proposed IFD-MRRS scheme achieves significantly higher secrecy throughput compared with two existing relay selection protocols for secure bufferaided cooperative wireless networks.

APPENDIX
A. Proof of expression (18) We first compute the CDF of x, the CDF of x can be obtained as Since x is independent of y, we have f XY (x, y) = f X (x)f Y (y). Then the CDF of z r1 can be calculated as where E 1 (x) = ∞ x (e −t /t)dt, x > 0 is the exponential integral function.

B. Proof of expression (19)
The CDF of z k can be obtained as Then the CDF of z t1 can be calculated as (32)