We investigate individual secrecy performance in a K -user quasi-static Rayleigh fading homogeneous multiple access wiretap channel (MAC-WT), where a legitimate receiver employs successive interference cancellation (SIC) decoding. We first evaluate individual secrecy performance under an arbitrary SIC order by deriving closed-form expressions with respect to secrecy outage probability and effective secrecy throughput (EST) as main metrics. The resulting closed-form expressions disclose a significant impact on the secrecy performance from the order of SIC decoding. Therefore, we propose three SIC decoding order scheduling schemes: (1) round-robin scheme, absolutely fair and served as a benchmark; (2) suboptimal scheme, based on each user’s main channel condition; and (3) optimal scheme, based on each user’s achievable secrecy rate. Comparison results show that the last two schemes outperform the first one with regard to both the EST and the multi-user diversity gain, whereas the performance of the suboptimal scheme is highly close to that of the optimal scheme which is usually impractical due to a requirement for the eavesdropper’s channel state information (CSI).
We investigate individual secrecy performance in a K -user quasi-static Rayleigh fading homogeneous multiple access wiretap channel (MAC-WT), where a legitimate receiver employs successive interference cancellation (SIC) decoding. We first evaluate individual secrecy performance under an arbitrary SIC order by deriving closed-form expressions with respect to secrecy outage probability and effective secrecy throughput (EST) as main metrics. The resulting closed-form expressions disclose a significant impact on the secrecy performance from the order of SIC decoding. Therefore, we propose three SIC decoding order scheduling schemes: (1) round-robin scheme, absolutely fair and served as a benchmark; (2) suboptimal scheme, based on each user’s main channel condition; and (3) optimal scheme, based on each user’s achievable secrecy rate. Comparison results show that the last two schemes outperform the first one with regard to both the EST and the multi-user diversity gain, whereas the performance of the suboptimal scheme is highly close to that of the optimal scheme which is usually impractical due to a requirement for the eavesdropper’s channel state information (CSI).
In this paper, a decoding method of joint zero-forcing and successive interference cancellation (ZF-SIC) is put forward to assist the study of the individual secrecy in the quasi-static Rayleigh fading single-input multiple-output multiple access wiretap channel. We first evaluate the individual secrecy performance by deriving the closed-form expressions in terms of positive secrecy capacity probability, secrecy outage probability, and effective secrecy throughput (EST). Besides the expected impact of the SIC order, we find, in high signal-to-noise ratio (SNR) regime, the secrecy performance is only determined by the transmitter’s relative distance to eavesdropper over legitimate receiver rather than the SNR. Such a result prompts us to propose an SIC order scheduling scheme (alternative scheme) on basis of the transmitters’ relative distances from the shortest to the longest. It is proved optimal in achieving total maximum EST in high SNR regime. Finally, we also investigate the problem of optimal power allocation to each transmitter under the constraint of the limited total power. An interesting solution to this problem is disclosed with the aid of numerical analysis.
Recently, a new paradigm of multiple access (MAC) along with one eavesdropper to achieve secrecy transmissions has been getting in focus. However, all existing work on such multiple access wiretap channel (MAC-WT) mainly concentrates on the secrecy performance of the system as a whole from an information theoretic perspective. In this work, we investigate the secrecy performance of a single transmitter in the quasi-static Rayleigh fading MAC-WT on basis of two decoding methods, zero-forcing (ZF) and minimum mean-square error (MMSE), jointly with successive interference cancellation (SIC). We evaluate the secrecy performance in three metrics: positive secrecy capacity probability, secrecy outage probability and effective secrecy throughput. The analytical and simulation results show that, 1) the SIC order has great impacts on the secrecy performance for both methods; 2) MMSE-SIC outperforms ZF-SIC, while the performance gap can be overcome via adjusting SIC order, or increasing SNR, or enhancing the spatial diversity gain; 3) in high SNR regime, the secrecy performance is only determined by the relative distance to eavesdropper over legitimate receiver rather than the SNR.
A new paradigm of uplink non-orthogonal multiple access along with multiple eavesdroppers to achieve secrecy transmission is studied in this paper. We investigate the secrecy performance of a single transmitter in both non-colluding- and colluding-eavesdropper scenarios on basis of two decoding methods at the legitimate receiver, zero-forcing (ZF), and minimum mean-square error (MMSE), jointly with successive interference cancellation (SIC). We first evaluate the secrecy performance in three metrics: secrecy outage probability, effective secrecy throughput (EST), and positive secrecy capacity probability. Analytical results show: 1) the collusion of eavesdroppers deteriorates the secrecy performance, which is an affine combination of those regarding each single eavesdropper and 2) MMSE-SIC outperforms ZF-SIC, while the performance gap can be overcome via reducing the number of interferers, or increasing signal-to-noise ratio (SNR), or enhancing the spatial diversity gain. We then analyze the asymptotic behaviors of the secrecy performance, revealing the high-SNR secrecy performance for both ZF-SIC and MMSE-SIC approaches to the same result which is location-dependent only. Furthermore, we study the problem of optimal power allocation to each transmitter subject to limited total transmit power. An interesting solution to this problem is demonstrated with the aid of numerical results. Finally, we propose an SIC order scheduling scheme which is conjectured to be optimal in achieving total maximum EST in a high SNR regime.
This paper investigates secure transmission for non-orthogonal multiple access (NOMA) systems where the imperfect successive interference cancellation (SIC) is considered at both legitimate users and eavesdropper (Eve). A power allocation scheme is designed for the legitimate users to mitigate the effect of the SIC error caused by imperfect SIC. For characterizing the secrecy performance of the NOMA system, the closed-form expressions for connection outage probability (COP), secrecy outage probability (SOP), and effective secrecy throughput (EST) are derived over Nakagami-m fading channels in both NOMA and benchmark orthogonal multiple access (OMA) systems. We also provide security and reliability trade-off results (SRT) for the users in the NOMA and OMA systems. Simulation results verify our analysis and show that the strong users achieve better secrecy performance but worse reliability performance and NOMA outperforms OMA in terms of SRT.
Due to the openness of wireless communication, information transmitted in the multiple access channel is vulnerable to eavesdropping by illegitimate users. Classic artificial noise-assisted schemes can improve security but are not suitable for power-constrained users. To address this problem, we propose a cross-time interference injection scheme in this paper, which improves security by introducing cross-time self-interference and inter-user interference, and does not require artificial noise. The proposed scheme exploits the properties of the Hadamard matrix and the wireless channels, so that the eavesdropping channel suffers from stronger interference than the legitimate channel. We analyze the security performance when both the legitimate receiver and the eavesdropper exploit the successive interference cancellation (SIC) scheme, including the secrecy sum rate, the secrecy capacity, and the secrecy outage probability. We further investigate the effect of the number of eavesdropper’s antennas, the number of legitimate users, and the number of time slots used by the scheme on the security performance, and obtain the corresponding relationship between these parameters when achieving a positive secrecy rate. Finally, simulation results corroborate our theoretical analysis.
It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels. To mitigate such rate losses in multi-user channels, we propose a coding/decoding scheme for multi-user multiple access wiretap channel (MAC-WT), where previously transmitted messages are used as a secret key to enhance the secrecy rates of the transmitting users, until the usual Shannon capacity region of a multiple access channel (MAC) is achieved without the secrecy constraint. With this coding scheme, all messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal, we introduce secret key buffers at both the users and the legitimate receiver. Finally, we consider a fading MAC-WT and show that with this coding/decoding scheme, we can achieve the capacity region of a fading MAC channel (in the ergodic sense).