Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Ubiquitous and Future Networks

On the Secrecy Sum-Rate of Uplink Multiuser Networks with Potential Eavesdroppers

Inkyu Bang, Seong Ho Chae, Bang Chul Jung

Published Jul 2, 2024• 0 citations
Publisher

Abstract

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 where$N$transmitters (users), a single desired receiver (i.e., base station), and$K$potential 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 with$M$antennas. The main results show that the proposed scheduling scheme achieves the optimal secrecy sum-rate scaling indicating that the achievable secrecy sum-rate scales as$M$log (SNR log N) in a high signal-to-noise ratio (SNR) regime when a certain user scaling condition.

DOI
10.1109/icufn61752.2024.10625531

Related papers

On the Secrecy Sum-Rate of Internet of Things Networks: Scheduling and Power Control

Inkyu Bang, Seong Ho Chae, Bang Chul Jung

Physical-layer security (PLS) has attracted much attention in wireless communications and has been considered one of the main candidates for enhancing wireless security in future 6G networks. Recent studies in the PLS area have focused on investigating and analyzing the characteristics of secure transmissions in multiuser networks (e.g., the massive number of Internet of Things (IoT) devices in 6G networks). Due to the difficulty of obtaining the exact secrecy capacity region in wireless multiuser networks, several alternative methods are used to characterize the secrecy performance of multiuser networks. For example, we can analyze the secrecy sum-rate scaling in terms of the number of users based on multiuser diversity (MUD). In this paper, we propose an opportunistic user scheduling scheme that achieves optimal MUD gain, combined with a power control mechanism for reducing information leakage to multiple eavesdroppers in wireless networks. The proposed scheme considers multiuser transmissions in one scheduling time slot by adopting orthogonal random beamforming at the receiver to exploit the full degrees-of-freedom gain with an assumption that each user (or IoT device) is equipped with a single antenna, and base station and eavesdroppers have multiple antennas. The main contribution of this paper is to derive the analytic result of the achievable secrecy sum-rate scaling in a high signal-to-noise ratio (SNR) regime. We evaluate the performance of the proposed scheduling scheme with a power control mechanism through simulations with both internal and external eavesdropping scenarios. We further discuss the extensibility of our analysis to various applications such as satellite communications and IoT networks.

Electronics•May 27, 2024•0 citations

Secure Communication in Uplink Transmissions: User Selection and Multiuser Secrecy Gain

Hao Jiang Deng, Hui‐Ming Wang, Jinhong Yuan +2 more

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.

arXiv:1608.05473•IEEE Transactions on Communications•Jun 27, 2016•17 citations

Robust Beamforming Design for Sum Secrecy Rate Optimization in MU-MISO Networks

Pu Zhao, Meng Zhang, Hui Yu +2 more

This paper studies the beamforming design problem of a multiuser downlink network, assuming imperfect channel state information known to the base station. In this scenario, the base station is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the base station employs transmit beamforming with a given requirement on sum transmitting power. The objective is to maximize the sum secrecy rate of the network. Due to the uncertainty of the channel, it is difficult to calculate the exact sum secrecy rate of the system. Thus, the maximum of lower bound of sum secrecy rate is considered. The optimization of the lower bound of sum secrecy rate still makes the considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation and first-order approximation technique based on Taylor expansion. In addition, with the advantage of low complexity, a zero-forcing-based beamforming method is presented in the case that base station is able to nullify the eavesdroppers' rate. When the base station does not have the ability, user selection algorithm would be in use. Numerical results show that the former strategy achieves better performance than the latter one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the signal-to-leakage-and-noise ratio-based algorithm.

arXiv:2003.10676•IEEE Transactions on Information Forensics and Security•Apr 15, 2015•58 citations

Artificial Noise-Aided User Scheduling for Optimal Secrecy Multiuser Diversity

Inkyu Bang, Su Min Kim, Dan Keun Sung

In this letter, we propose a user scheduling scheme, which enables non-scheduled users to generate artificial noise in order to enhance wireless security in a multiuser wiretap network, where there exist N users, a single desired receiver, and K eavesdroppers. Our proposed scheme can achieve the optimal multiuser diversity gain (i.e., log log N) by adopting appropriate threshold values for scheduling feedback, which is also able to significantly reduce signaling overhead. We mathematically prove the achievability based on the derivation of a secure user-scaling law. Simulation results demonstrate that the proposed scheme achieves a better average secrecy rate than the conventional scheme in a finite N case, even if both schemes obtain the same secure user-scaling law as N → ∞.

IEEE Communications Letters•Nov 16, 2016•24 citations

Secrecy Outage Probability Analysis of Friendly Jammer Selection Aided Multiuser Scheduling for Wireless Networks

Bin Li, Yulong Zou, Jianjiang Zhou +3 more

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.

IEEE Transactions on Communications•Jan 24, 2019•65 citations

On Ergodic Secrecy Rate for MISO Wiretap Broadcast Channels with Opportunistic Scheduling

Minyan Pei, Arnold Lee Swindlehurst, Dongtang Ma +1 more

In this letter, we study on-off opportunistic beamforming for the multiuser downlink channel with a passive eavesdropper. Two opportunistic scheduling schemes exploiting multiuser diversity are investigated which require limited feedback of the effective signal-to-noise ratio (SNR) from the legitimate users. For the two scheduling schemes, we derive new closed-form expressions for the ergodic secrecy rate with on-off beamforming over Rayleigh fading channels. Numerical results are provided to verify our analytical results and illustrate the impact of multiuser diversity on the secrecy performance.

IEEE Communications Letters•Jan 1, 2014•21 citations
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 whereNNNtransmitters (users), a single desired receiver (i.e., base station), andKKKpotential 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 withMMMantennas. The main results show that the proposed scheduling scheme achieves the optimal secrecy sum-rate scaling indicating that the achievable secrecy sum-rate scales asMMMlog (SNR log N) in a high signal-to-noise ratio (SNR) regime when a certain user scaling condition.
Physical-layer security (PLS) has attracted much attention in wireless communications and has been considered one of the main candidates for enhancing wireless security in future 6G networks. Recent studies in the PLS area have focused on investigating and analyzing the characteristics of secure transmissions in multiuser networks (e.g., the massive number of Internet of Things (IoT) devices in 6G networks). Due to the difficulty of obtaining the exact secrecy capacity region in wireless multiuser networks, several alternative methods are used to characterize the secrecy performance of multiuser networks. For example, we can analyze the secrecy sum-rate scaling in terms of the number of users based on multiuser diversity (MUD). In this paper, we propose an opportunistic user scheduling scheme that achieves optimal MUD gain, combined with a power control mechanism for reducing information leakage to multiple eavesdroppers in wireless networks. The proposed scheme considers multiuser transmissions in one scheduling time slot by adopting orthogonal random beamforming at the receiver to exploit the full degrees-of-freedom gain with an assumption that each user (or IoT device) is equipped with a single antenna, and base station and eavesdroppers have multiple antennas. The main contribution of this paper is to derive the analytic result of the achievable secrecy sum-rate scaling in a high signal-to-noise ratio (SNR) regime. We evaluate the performance of the proposed scheduling scheme with a power control mechanism through simulations with both internal and external eavesdropping scenarios. We further discuss the extensibility of our analysis to various applications such as satellite communications and IoT networks.
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.
This paper studies the beamforming design problem of a multiuser downlink network, assuming imperfect channel state information known to the base station. In this scenario, the base station is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the base station employs transmit beamforming with a given requirement on sum transmitting power. The objective is to maximize the sum secrecy rate of the network. Due to the uncertainty of the channel, it is difficult to calculate the exact sum secrecy rate of the system. Thus, the maximum of lower bound of sum secrecy rate is considered. The optimization of the lower bound of sum secrecy rate still makes the considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation and first-order approximation technique based on Taylor expansion. In addition, with the advantage of low complexity, a zero-forcing-based beamforming method is presented in the case that base station is able to nullify the eavesdroppers' rate. When the base station does not have the ability, user selection algorithm would be in use. Numerical results show that the former strategy achieves better performance than the latter one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the signal-to-leakage-and-noise ratio-based algorithm.
In this letter, we propose a user scheduling scheme, which enables non-scheduled users to generate artificial noise in order to enhance wireless security in a multiuser wiretap network, where there exist N users, a single desired receiver, and K eavesdroppers. Our proposed scheme can achieve the optimal multiuser diversity gain (i.e., log log N) by adopting appropriate threshold values for scheduling feedback, which is also able to significantly reduce signaling overhead. We mathematically prove the achievability based on the derivation of a secure user-scaling law. Simulation results demonstrate that the proposed scheme achieves a better average secrecy rate than the conventional scheme in a finite N case, even if both schemes obtain the same secure user-scaling law as N → ∞.
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 letter, we study on-off opportunistic beamforming for the multiuser downlink channel with a passive eavesdropper. Two opportunistic scheduling schemes exploiting multiuser diversity are investigated which require limited feedback of the effective signal-to-noise ratio (SNR) from the legitimate users. For the two scheduling schemes, we derive new closed-form expressions for the ergodic secrecy rate with on-off beamforming over Rayleigh fading channels. Numerical results are provided to verify our analytical results and illustrate the impact of multiuser diversity on the secrecy performance.