This letter proposes a novel dual user selection scheme for uplink transmission with multiple users, where a jamming user and a served user are jointly selected to improve the secrecy performance. Specifically, the jamming user transmits jamming signal with a certain rate, so that the base station (BS) can decode the jamming signal before detecting the secret information signal. By carefully selecting the jamming user and the served user, it makes the eavesdropper to decode the jamming signal with a low probability; meanwhile the BS can achieve a high receive signal-to-noise ratio. Therefore, the uplink transmission achieves the dual secrecy improvement by jamming and scheduling. It is shown that the proposed scheme can significantly improve the security of the uplink transmission.
This letter proposes a novel dual user selection scheme for uplink transmission with multiple users, where a jamming user and a served user are jointly selected to improve the secrecy performance. Specifically, the jamming user transmits jamming signal with a certain rate, so that the base station (BS) can decode the jamming signal before detecting the secret information signal. By carefully selecting the jamming user and the served user, it makes the eavesdropper to decode the jamming signal with a low probability; meanwhile the BS can achieve a high receive signal-to-noise ratio. Therefore, the uplink transmission achieves the dual secrecy improvement by jamming and scheduling. It is shown that the proposed scheme can significantly improve the security of the uplink transmission.
In this paper, we investigate secure communications uplink transmissions, where there are a base station (BS) with M receive antennas, K mobile users each with a single antenna, and an eavesdropper with N receive antennas. The closed-form expressions of the achievable ergodic secrecy sum rates (ESSRs) for a random k users selection scheme in the high and low signal-to-noise ratio regimes are presented. It is shown that the scaling behavior of ESSR with respect to the number served users k can be quite different under different system configurations, determined by the numbers of the BS antennas and that of the eavesdropper antennas. In order to achieve multiuser gain, two low-complexity user selection schemes are proposed under different assumptions on the eavesdropper's channel state information. The closed-form expressions of the achievable ESSRs and the multiuser secrecy gains of the two schemes are also presented in both low and high SNR regimes. observe that, as k increases, the multiuser secrecy gain increases, while the ESSR may decrease. Therefore, when N much larger than M, serving one user with the strongest channel (Time Division Multiple Address-like) is a favorable secrecy scheme, where the ESSR scales with √2 log K.
In this paper, we study a multiuser uplink network consisting of one base station (BS), multiple users and one eavesdropper (E), where the users are intended to transmit their confidential messages to BS, while the eavesdropper attempts to tap their transmissions. To improve the transmission secrecy, we propose two friendly jammer selection-aided multiuser scheduling schemes, namely, the random jammer selection-aided multiuser scheduling (RJS-MUS) without knowing the eavesdropper's channel state information (CSI) and the optimal jammer selection-aided multiuser scheduling (OJS-MUS), where the CSIs of eavesdropper are available. For comparison purposes, the conventional non-jammer selection-aided multiuser scheduling (NJS-MUS) scheme is considered as a benchmark. We derive exact and asymptotic closed-form secrecy outage probability expressions for the conventional NJS-MUS as well as proposed RJS-MUS and OJS-MUS schemes. The numerical results show that the proposed RJS-MUS and OJS-MUS schemes with equal power allocation between the selected friendly jammer and scheduled user perform worse than the conventional NJS-MUS approach in terms of the secrecy outage probability in the low signal-to-noise ratio (SNR) region. As the SNR increases, the secrecy outage performance of RJS-MUS and OJS-MUS schemes substantially improves, which is, in turn, better than that of conventional NJS-MUS approach. Moreover, the secrecy advantage of RJS-MUS and OJS-MUS over NJS-MUS becomes more significant with an increasing SNR. Also, it is shown that for both the RJS-MUS and OJS-MUS schemes, a better secrecy performance can be achieved through an optimal power allocation (OPA) between the scheduled user and friendly jammer. In addition, the proposed RJS-MUS and OJS-MUS schemes with OPA strictly outperform the conventional NJS-MUS approach in terms of the secrecy outage probability.
In this paper, we investigate achievable secrecy sumrate in uplink multiuser networks where some base stations are compromised to operate as potential eavesdroppers. Due to the difficulty of analyzing the exact secrecy capacity region in multiuser networks, we focus on analyzing the secrecy sumrate scaling in terms of the number of transmitters based on multiuser diversity (MUD). We propose an opportunistic user scheduling scheme able to achieve optimal MUD gain in uplink multiuser networks whereNtransmitters (users), a single desired receiver (i.e., base station), andKpotential eavesdroppers (i.e., compromised base stations) are assumed. The proposed scheme enables multiuser transmissions in one scheduling time slot by employing orthogonal random beamforming at the receiver. In addition, the proposed scheme can fully exploit the degrees-of-freedom (DoF) gain when each transmitter is equipped with a single antenna, and base station and potential eavesdroppers are equipped withMantennas. The main results show that the proposed scheduling scheme achieves the optimal secrecy sum-rate scaling indicating that the achievable secrecy sum-rate scales asMlog (SNR log N) in a high signal-to-noise ratio (SNR) regime when a certain user scaling condition.
We investigate physical layer security of an uplink NOMA system consisting of one base station, multiple users and one eavesdropper. During each uplink transmission, two users are paired to perform NOMA and another user is opportunistically selected from the remaining idle users to act as a friendly jammer to emit artificial noise for confusing the eavesdropper. To enhance the transmission security for the system, we propose two friendly jammer selection aided uplink NOMA transmission schemes, namely random jammer selection aided uplink NOMA transmission (RJS-UNT) scheme without knowing the eavesdropper's channel state information (CSI), and optimal jammer selection aided uplink NOMA transmission (OJS-UNT) scheme where the eavesdropper's CSI is available. For comparison purpose, a non-jammer selection aided uplink NOMA transmission (NJS-UNT) scheme is also considered. Analytical closed-form expressions for the secrecy outage probability (SOP) are derived to evaluate the secrecy performance achieved by the proposed schemes. Also, the asymptotic SOPs are provided to obtain further insights. The analysis and simulation results indicate that the schemes converge to SOP floors with the increasing SNR, while the floors achieved by the RJS-UNT and OJS-UNT schemes are significantly lower than that achieved by the NJS-UNT scheme, showing the security advantage of the proposed schemes.
Cooperative jamming for multiuser multiple input multiple output (MIMO) broadcast channel is studied to enhance the physical layer security with the help of a friendly jammer. We assume the base station transmits multiple independent data streams to multiple legitimate users. During the transmission, however, there are multiple eavesdroppers with multiple antennas that have interests in the streams from the base station. In order to wiretap the desired streams, the eavesdroppers may collude or not, and maximize the signal-to-interference-plus-noise ratio (SINR) of the desired streams using receive beamforming. The optimal cooperative jammer is designed to keep the achieved SINR at eavesdroppers below a threshold to guarantee that the transmission from the base station to legitimate users is confidential. One main advantage of the proposed cooperative jamming scheme is that no modification is needed for the existing precoding schemes at the base station and decoding schemes at legitimate users. Thus, any existing practical precoding/decoding schemes for multiuser MIMO broadcast channel can be applied directly with the help of a friendly jammer using the proposed cooperative jamming.
In this paper, we investigate the physical-layer security for a wireless communications network comprised of multiple users and a common base station (BS) in the presence of an eavesdropper. We propose a joint user-jammer selection scheme for preventing the eavesdropper from intercepting the confidential user-BS transmission. Specifically, a user is first selected to transmit its message to the BS, while another user is chosen to act as a friendly jammer for emitting the artificial noise to interfere with the eavesdropper. We also consider the conventional multiuser scheduling as a benchmark. Closed-form intercept probability expressions are derived for the conventional multiuser scheduling and proposed joint user-jammer selection schemes over Rayleigh fading channels. Numerical results show that the proposed joint user-jammer selection significantly outperforms the conventional multiuser scheduling in terms of the intercept probability, especially with an increasing number of users.