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

IEEE Systems Journal

Secure Transmission for Interference Networks: User Selection and Transceiver Design

Nan Zhao, Qiuyi Cao, Guan Gui, Yang Cao, Shun Zhang, Yunfei Chen, Hikmet Sari

Published Jan 21, 2019• 10 citations
Publisher

Abstract

Interference is usually regarded as a detrimental factor that degrades the performance of a wireless network. However, when it is used properly, the security of transmission can be effectively improved. In this paper, user selection and transceiver design are proposed to guarantee the secure transmission in a multiple-input multiple-output interference network with an eavesdropper. First, user selection is performed to select the most suitable user to transmit confidential information according to the topology and path loss in each time slot among all users. Then, based on user selection, the transceivers of the users are jointly designed to maximize the secrecy rate of the selected user while guaranteeing a minimum transmission rate for other users. Due to the nonconvexity of the optimization problem, it is transformed into a convex second-order cone programming with the help of successive approximations. An alternate iteration algorithm is proposed to obtain the optimal solution. The fairness of the user selection is considered, and a modified scheme is proposed to share the opportunity of secure transmission among users. Finally, simulation results are presented to show the effectiveness and efficiency of the proposed schemes.

DOI
10.1109/jsyst.2019.2891641

Related papers

User Selection and Transceiver Design for Secure Transmission in MIMO Interference Networks

Qiuyi Cao, Nan Zhao, Guan Gui +4 more

In this paper, user selection and transceiver design are proposed to guarantee the secure transmission in a multiple-input multiple-output interference network with an eavesdropper. First, user selection is performed to select the most suitable user to transmit confidential information according to the topology and path loss in each time slot. Then, based on user selection, the transceivers are jointly designed to maximize the secrecy rate of the selected user while guaranteeing a minimum transmission rate for other users. Due to the non-convexity of the problem, an alternate iteration algorithm is proposed to obtain the optimal solution with the help of successive approximations. Finally, simulation results are presented to show the effectiveness and efficiency of the proposed schemes.

IEEE Vehicular Technology Conference•Apr 1, 2019•1 citation

Secure transmission for multi-antenna two-way relay cellular networks with no eavesdropper's CSI

Jae‐Hwan Lee, Jae‐Mo Kang, Hyung-Myung Kim

In this paper, we investigate the security of a multi-antenna two-way relay cellular network in the presence of a passive eavesdropper, where a base station and multiple mobile users exchange uplink and downlink information with the assistance of a relay station.We propose a secrecy scheme based on the concepts of the artificial noise scheme for the secure transmission and signal alignment scheme for the suppression of multiuser interference. This paper aims to study transceiver design to minimize the transmit power allocated to the information signal so that the transmit power allocated to the artificial noise signal can be maximized to confuse the eavesdropper, under the constraints of quality of service requirement. We show that transceiver design problems can be converted to a second-order cone programming problem and the optimal solution is obtained efficiently. The performance of the proposed secrecy scheme is evaluated by simulations.

International Conference on Telecommunications•Jan 1, 2015•0 citations

User selection scheme with secrecy capacity in MIMO downlink systems

Yanase Masatoshi, Tomoaki Otsuki Ohtsuki

For multiuser Multiple-Input-Multiple-Output (MIMO) downlink systems where some receivers exist, several user selection schemes have been recently proposed. However, these user selection schemes do not take security into consideration. One possible scenario of wireless communication systems is that a transmitter sends confidential messages to multiple receivers in the presence of eavesdroppers. In this paper, we propose a user selection scheme with secrecy capacity for multiuser MIMO downlink system. We assume a system with a transmitter, some legitimate users and eavesdroppers where the transmitter wants to send data securely against eavesdroppers. In the proposed scheme, the transmitter selects a user set so that their secrecy capacities among legitimate users and eavesdroppers are larger than zero. Thus, the transmitter can send confidential messages to users securely. The proposed scheme can be applied to conventional scheduling schemes, such as maximum capacity (MAX) scheduling and proportional fairness (PF) scheduling. Simulation results show that the proposed scheme provides secure transmissions and has little degradation of performance of system capacity and fairness when applied to the conventional scheduling schemes. Hence, we show that the proposed scheme is an effective user selection scheme to guarantee secrecy of communication.

Procedia - Social and Behavioral Sciences•Jan 1, 2010•4 citations

On the Interference Alignment Designs for Secure Multiuser MIMO Systems

Ha Hoang Kha, Thanh Tung Vu, Trung Q. Duong +1 more

In this paper, we propose two secure multiuser multiple-input multiple-output (MIMO) transmission approaches based on interference alignment (IA) in the presence of an eavesdropper. To deal with the information leakage to the eavesdropper as well as the interference signals from undesired transmitters (Txs) at desired receivers (Rxs), our approaches aim to design the transmit precoding and receive subspace matrices to minimize both the total inter-main-link interference and the wiretapped signals (WSs). The first proposed IA scheme focuses on aligning the WSs into proper subspaces while the second one imposes a new structure on the precoding matrices to force the WSs to zero. In each proposed IA scheme, the precoding matrices and the receive subspaces at the legitimate users are alternatively selected to minimize the cost function of a convex optimization problem for every iteration. We provide the feasible conditions and the proofs of convergence for both IA approaches. The simulation results indicate that our two IA approaches outperform the conventional IA algorithm in terms of the average secrecy sum rate.

arXiv:1508.00349•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2017•5 citations

Physical Layer Security Aided Wireless Interference Networks in the Presence of Strong Eavesdropper Channels

Zhichao Sheng, Hoang Duong Tuan, Ali A. Nasir +2 more

Under both long (infinite) and short (finite) blocklength transmissions, this paper considers physical layer security for a wireless interference network of multiple transmitter-user pairs, which is overheard by multiple eavesdroppers (EVs). The EVs are assumed to have better channel conditions than the legitimate users (UEs), making the conventional transmission unsecured. The paper develops a novel time-fraction based transmission, under which the information is transmitted to the UEs within a fraction of the time slot and artificial noise (AN) is transmitted within the remaining fraction to counter the strong EVs' channels. Based on channel distribution information of UEs and EVs, the joint design of transmit beamforming, time fractions and AN power allocation to maximize the worst users' secrecy rate is formulated in terms of nonconvex problems. Path-following algorithms of low complexity and rapid convergence are proposed for their solution. Simulations are provided to demonstrate the viability of the proposed methodology.

IEEE Transactions on Information Forensics and Security•Jan 1, 2021•25 citations

Secure beamforming and artificial noise design for simultaneous wireless information and power transfer in interference networks

Weichen Wang, Ruohan Cao, Hui Gao +2 more

We study a secure communication of a two-user interference network. In this network, two transmitters send information and artificial noise simultaneously to two users and energy receivers (ERs), and ERs are likely to perform as eavesdroppers. We propose a joint beamforming and artificial noise design to maximize the total energy harvested by ERs subject to the secrecy sum rate requirement and power constraints. The proposed design constitutes an optimization problem, which is non-convex yet can be further transformed into a two-stage problem. In the first stage, by introducing an auxiliary variable, we can reformulate the non-convex as a second-order cone program (SOCP) problem, and the constrained concave convex procedure based algorithm is proposed to make this SOCP problem tractable. In the second stage, the auxiliary variable is obtained by the one-dimensional line search. Numerical results demonstrate the effectiveness of the proposed algorithm.

European Signal Processing Conference (EUSIPCO)•Aug 1, 2016•3 citations
Interference is usually regarded as a detrimental factor that degrades the performance of a wireless network. However, when it is used properly, the security of transmission can be effectively improved. In this paper, user selection and transceiver design are proposed to guarantee the secure transmission in a multiple-input multiple-output interference network with an eavesdropper. First, user selection is performed to select the most suitable user to transmit confidential information according to the topology and path loss in each time slot among all users. Then, based on user selection, the transceivers of the users are jointly designed to maximize the secrecy rate of the selected user while guaranteeing a minimum transmission rate for other users. Due to the nonconvexity of the optimization problem, it is transformed into a convex second-order cone programming with the help of successive approximations. An alternate iteration algorithm is proposed to obtain the optimal solution. The fairness of the user selection is considered, and a modified scheme is proposed to share the opportunity of secure transmission among users. Finally, simulation results are presented to show the effectiveness and efficiency of the proposed schemes.
In this paper, user selection and transceiver design are proposed to guarantee the secure transmission in a multiple-input multiple-output interference network with an eavesdropper. First, user selection is performed to select the most suitable user to transmit confidential information according to the topology and path loss in each time slot. Then, based on user selection, the transceivers are jointly designed to maximize the secrecy rate of the selected user while guaranteeing a minimum transmission rate for other users. Due to the non-convexity of the problem, an alternate iteration algorithm is proposed to obtain the optimal solution with the help of successive approximations. Finally, simulation results are presented to show the effectiveness and efficiency of the proposed schemes.
In this paper, we investigate the security of a multi-antenna two-way relay cellular network in the presence of a passive eavesdropper, where a base station and multiple mobile users exchange uplink and downlink information with the assistance of a relay station.We propose a secrecy scheme based on the concepts of the artificial noise scheme for the secure transmission and signal alignment scheme for the suppression of multiuser interference. This paper aims to study transceiver design to minimize the transmit power allocated to the information signal so that the transmit power allocated to the artificial noise signal can be maximized to confuse the eavesdropper, under the constraints of quality of service requirement. We show that transceiver design problems can be converted to a second-order cone programming problem and the optimal solution is obtained efficiently. The performance of the proposed secrecy scheme is evaluated by simulations.
For multiuser Multiple-Input-Multiple-Output (MIMO) downlink systems where some receivers exist, several user selection schemes have been recently proposed. However, these user selection schemes do not take security into consideration. One possible scenario of wireless communication systems is that a transmitter sends confidential messages to multiple receivers in the presence of eavesdroppers. In this paper, we propose a user selection scheme with secrecy capacity for multiuser MIMO downlink system. We assume a system with a transmitter, some legitimate users and eavesdroppers where the transmitter wants to send data securely against eavesdroppers. In the proposed scheme, the transmitter selects a user set so that their secrecy capacities among legitimate users and eavesdroppers are larger than zero. Thus, the transmitter can send confidential messages to users securely. The proposed scheme can be applied to conventional scheduling schemes, such as maximum capacity (MAX) scheduling and proportional fairness (PF) scheduling. Simulation results show that the proposed scheme provides secure transmissions and has little degradation of performance of system capacity and fairness when applied to the conventional scheduling schemes. Hence, we show that the proposed scheme is an effective user selection scheme to guarantee secrecy of communication.
In this paper, we propose two secure multiuser multiple-input multiple-output (MIMO) transmission approaches based on interference alignment (IA) in the presence of an eavesdropper. To deal with the information leakage to the eavesdropper as well as the interference signals from undesired transmitters (Txs) at desired receivers (Rxs), our approaches aim to design the transmit precoding and receive subspace matrices to minimize both the total inter-main-link interference and the wiretapped signals (WSs). The first proposed IA scheme focuses on aligning the WSs into proper subspaces while the second one imposes a new structure on the precoding matrices to force the WSs to zero. In each proposed IA scheme, the precoding matrices and the receive subspaces at the legitimate users are alternatively selected to minimize the cost function of a convex optimization problem for every iteration. We provide the feasible conditions and the proofs of convergence for both IA approaches. The simulation results indicate that our two IA approaches outperform the conventional IA algorithm in terms of the average secrecy sum rate.
Under both long (infinite) and short (finite) blocklength transmissions, this paper considers physical layer security for a wireless interference network of multiple transmitter-user pairs, which is overheard by multiple eavesdroppers (EVs). The EVs are assumed to have better channel conditions than the legitimate users (UEs), making the conventional transmission unsecured. The paper develops a novel time-fraction based transmission, under which the information is transmitted to the UEs within a fraction of the time slot and artificial noise (AN) is transmitted within the remaining fraction to counter the strong EVs' channels. Based on channel distribution information of UEs and EVs, the joint design of transmit beamforming, time fractions and AN power allocation to maximize the worst users' secrecy rate is formulated in terms of nonconvex problems. Path-following algorithms of low complexity and rapid convergence are proposed for their solution. Simulations are provided to demonstrate the viability of the proposed methodology.
We study a secure communication of a two-user interference network. In this network, two transmitters send information and artificial noise simultaneously to two users and energy receivers (ERs), and ERs are likely to perform as eavesdroppers. We propose a joint beamforming and artificial noise design to maximize the total energy harvested by ERs subject to the secrecy sum rate requirement and power constraints. The proposed design constitutes an optimization problem, which is non-convex yet can be further transformed into a two-stage problem. In the first stage, by introducing an auxiliary variable, we can reformulate the non-convex as a second-order cone program (SOCP) problem, and the constrained concave convex procedure based algorithm is proposed to make this SOCP problem tractable. In the second stage, the auxiliary variable is obtained by the one-dimensional line search. Numerical results demonstrate the effectiveness of the proposed algorithm.