论文标题
加权总和率最大化,用于分拆基于多访问的安全通信
Weighted Sum-Rate Maximization for Rate-Splitting Multiple Access Based Secure Communication
论文作者
论文摘要
随着对物理层安全性的调查从点对点系统到多用户方案,引入了多用户干扰(MUI),并成为不可避免的问题。不同于将MUI完全视为常规安全通信中的噪声,在本文中,我们提出了一个基于速率的多个访问(RSMA)的安全波束形式设计,在该设计中,用户消息被拆分并编码为通用和私人流。每个用户不仅解码了公共流和预期的私有流,而且还试图窃听其他用户的私人流。我们根据所有用户的保密率要求提出加权总和(WSR)最大化问题。为了解决该法式问题的非跨性别性,采用了连续的凸近似(SCA)的方法,以将原始的非凸和棘手的问题转换为低复杂性次优迭代算法。数值结果表明,所提出的安全边界方案的表现优于传统的多用户线性预码(MULP)技术,而WSR性能则可以确保用户保密率要求。
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.