arXiv:2006.02555 · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Cooperative Rate-Splitting for Secrecy Sum-Rate Enhancement in Multi-antenna Broadcast Channels

Li Ping, Ming Chen, Yijie Mao, Zhaohui Yang, Bruno Clerckx, Mohammad Shikh‐Bahaei

Published Aug 1, 2020• 60 citations

Abstract

In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and timeslot allocation are jointly optimized by solving the nonconvex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in Multi-antenna BC systems.

DOI: 10.1109/pimrc48278.2020.9217123

Related papers

On the Physical Layer Security of the Cooperative Rate-Splitting-Aided Downlink in UAV Networks

Hamed Bastami, Mehdi Letafati, Majid Moradikia +3 more

Unmanned Aerial Vehicles (UAVs) have found compelling applications in intelligent logistics, search and rescue as well as in air-borne Base Station (BS). However, their communications are prone to both channel errors and eavesdropping. Hence, we investigate the max-min secrecy fairness of UAV-aided cellular networks, in which Cooperative Rate-Splitting (CRS) aided downlink transmissions are employed by each multi-antenna UAV Base Station (UAV-BS) to safeguard the downlink of a two-user Multi-Input Single-Output (MISO) system against an external multi-antenna Eavesdropper (Eve). Realistically, only Imperfect Channel State Information (ICSI) is assumed to be available at the transmitter. Additionally, we consider a realistic total power constraint and guarantee the specific Quality of Service (QoS) requirements of the legitimate users. To handle the worst-case channel uncertainty of the legitimate users and an external Eve, we conceive a robust secure resource allocation algorithm, which maximizes the minimum worst-case secrecy rate of the legitimate users. Based on the CRS principle, the transmitter splits and encodes the messages of legitimate users into common as well as private streams and the user having stronger CSI is asked to help the cell-edge user by opportunistically forwarding its decoded common message. In contrast to the existing schemes adopted in the literature for ensuring secure transmission of the first cooperative phase only, in our proposed solution the common message has a twin-fold mission. Explicitly, apart from serving as the desired message, it also acts as Artificial Noise (AN) for drowning out Eve without consuming extra power. This is in stark contrast to the conventional AN designs. In the second phase, the pure AN is directed towards the Eve, deploying a robust Maximum Ratio Transmitter (MRT) beamformer at the UAV-BS. To solve the resultant non-convex optimization problem we resort to the Sequential Parametric Convex Approximation (SPCA) method together with a bespoke initialization algorithm to avoid any failure due to infeasibility. Our simulation results confirm that the proposed secure transmission scheme outperforms the existing cooperative benchmarkers.

IEEE Transactions on Information Forensics and SecurityJan 1, 202144 citations

Robust Secure Beamforming Design for Two-User Downlink MISO Rate-Splitting Systems

Hao Fu, Suili Feng, Weijun Tang +1 more

In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. Considering the worst-case channel uncertainty for a potential eavesdropper (PE), we study the robust secure beamforming algorithm design which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literatures, we propose a rather unorthodox rate splitting (RS) scheme which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. The algorithm design is formulated as a non-convex optimization problem which is generally intractable. As a compromise approach, we apply the successive convex approximation (SCA) method which facilitates the design of a low-complexity suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of the non-robust counterpart. Moreover, our results also unveil that the proposed RS scheme can achieve a superior performance compared to the existing non-orthogonal multiple access (NOMA) schemes and the traditional scheme.

IEEE Transactions on Wireless CommunicationsSep 14, 2020119 citations

Enhancing Security in RSMA Networks with Cooperative Jamming and Relaying

Haoran Pang, Fei Ji, Zhaolong Ning +2 more

Cooperative rate-splitting multiple access (RSMA) has emerged as a promising solution for increasing spectral efficiency over conventional RSMA. On the other hand, the presence of eavesdroppers seriously compromises secure communication due to the open nature of the wireless channel. In this paper, we study the physical-layer security (PLS) of a two-user downlink cooperative RSMA network in the presence of an eavesdropper. The cooperative jamming and relaying scheme is proposed to enhance diversity and security, where the near user opportunistically generates an artificial noise (AN) and forwards its decoded common message in two transmission phases. Our goal is to maximize the worst-case secrecy rate (SR) of both users by jointly optimizing beamforming vectors and resource allocation. To address the challenges posed by the non-convexity of the optimization problem, we propose a sequential parametric convex approximation (SPCA)-based iterative algorithm, which involves approximating the non-convex objective and constraints with a sequence of convex functions. The effectiveness of the proposed scheme is verified through the simulation results.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)Sep 25, 20235 citations

Weighted Sum-Rate Maximization for Rate-Splitting Multiple Access Based Secure Communication

Huiyun Xia, Yijie Mao, Bruno Clerckx +3 more

As investigations on physical layer security evolve from point-to-point systems to multi-user scenarios, multi-user interference (MUI) is introduced and becomes an unavoidable issue. Different from treating MUI totally as noise in conventional secure communications, in this paper, we propose a rate-splitting multiple access (RSMA)-based secure beamforming design, where user messages are split and encoded into common and private streams. Each user not only decodes the common stream and the intended private stream, but also tries to eavesdrop the private streams of other users. We formulate a weighted sum-rate (WSR) maximization problem subject to the secrecy rate requirements of all users. To tackle the non-convexity of the formulated problem, a successive convex approximation (SCA)-based approach is adopted to convert the original non-convex and intractable problem into a low-complexity suboptimal iterative algorithm. Numerical results demonstrate that the proposed secure beamforming scheme outperforms the conventional multi-user linear precoding (MULP) technique in terms of the WSR performance while ensuring user secrecy rate requirements.

arXiv:2201.08472IEEE Wireless Communications and Networking ConferenceApr 10, 202230 citations

Safeguarding RSMA Networks With Cooperative Jamming and Relaying

Haoran Pang, Fei Ji, Miaowen Wen +4 more

Cooperative rate-splitting multiple access (C-RSMA) has emerged as a promising solution for increasing spectral efficiency over conventional RSMA. On the other hand, the presence of eavesdroppers seriously compromises secure communications due to the open nature of the wireless channel. In this paper, we study a physical-layer security (PLS) problem for a two-user C-RSMA system in the presence of an eavesdropper. The cooperative jamming and relaying scheme is proposed to enhance diversity and security, where the near user opportunistically generates an artificial noise (AN) and forwards its decoded common message in two transmission phases. Our goal is to maximize the minimum secrecy rate (SR) for both users by the joint design of beamforming and resource allocation. To address the challenges arising from the non-convexity of the problem, we propose a sequential parametric convex approximation (SPCA)-based iterative algorithm, which entails approximating the non-convex objective and constraints by utilizing sequences of convex functions. Moreover, we study two SR maximization problems involving two different partial channel state information cases, and then resolve them by applying two novel SPCA-based iterative algorithms. Simulation results verify the effectiveness of the proposed scheme, demonstrating a significant improvement in SR compared to the schemes without jamming or relaying transmission.

IEEE Transactions on Vehicular TechnologyDec 8, 20252 citations

Robust Secure Resource Allocation for Downlink Two-User MISO Rate-Splitting Systems

Hao Fu, Suili Feng, Weijun Tang +1 more

In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. To handle the worst-case channel uncertainty of a potential eavesdropper (PE), we study the robust secure resource allocation algorithm which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literature, we propose a rate-splitting (RS)-based secure transmission scheme, which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. Considering the non-convex resource allocation algorithm design problem, we apply the majorization maximization (MM) method to obtain a suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of several baselines.

IEEE International Conference on Communications workshopsJun 1, 20207 citations