Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 159 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 352 tok/s Pro
Claude Sonnet 4.5 33 tok/s Pro
2000 character limit reached

Securing NOMA Networks by Exploiting Intelligent Reflecting Surface (2104.03460v3)

Published 8 Apr 2021 in cs.IT, cs.SY, eess.SY, and math.IT

Abstract: This paper investigates the security enhancement of an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network, where a distributed IRS enabled NOMA transmission framework is proposed to serve users securely in the presence of a passive eavesdropper. Considering that eavesdropper's instantaneous channel state information (CSI) is challenging to acquire in practice, we utilize secrecy outage probability (SOP) as the security metric. A problem of maximizing the minimum secrecy rate among users, subject to the successive interference cancellation (SIC) decoding constraints and SOP constraints, by jointly optimizing transmit beamforming at the BS and phase shifts of IRSs, is formulated. For special case with a single-antenna BS, we derive the exact closed-form SOP expressions and propose a novel ring-penalty based successive convex approximation (SCA) algorithm to design power allocation and phase shifts jointly. While for the more general and challenging case with a multi-antenna BS, we adopt the Bernstein-type inequality to approximate the SOP constraints by a deterministic convex form. To proceed, an efficient alternating optimization (AO) algorithm is developed to solve the considered problem. Numerical results validate the advantages of the proposed algorithms over the baseline schemes. Particularly, two interesting phenomena on distributed IRS deployment are revealed: 1) the secrecy rate peak is achieved only when distributed IRSs share the reflecting elements equally; and 2) the distributed IRS deployment does not always outperform the centralized IRS deployment, due to the tradeoff between the number of IRSs and the reflecting elements equipped at each IRS.

Citations (50)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.