Author
Listed:
- Afshin Souzani
(Science and Research Branch, Islamic Azad University)
- Mohammad Ali Pourmina
(Science and Research Branch, Islamic Azad University)
- Paeiz Azmi
(Tarbiat Modares University)
- Mohammad Naser Moghadasi
(Science and Research Branch, Islamic Azad University)
Abstract
A fundamental issue in the non-orthogonal multiple access (NOMA) technique is the ranking of users for appropriate successive interference cancellation (SIC). This depends on the available user channel gain. However, in networks that use intelligent reflecting surfaces (IRS) for communication, continuous phases at the IRS are not feasible and channel gain is changed by adjusting the phase shift matrix. In this paper, our goal is to increase the sum secrecy rate (SSR) of the physical layer security in downlink by assuming the channel state information of all the network components to be known and also considering the requirements of power-domain NOMA (PD-NOMA) and IRS. To this end, we formulate a joint optimization problem and divide it into four sub-problems; resource allocation, user decoding order or ranking, power allocation, and phase shift matrix design. Since the proposed optimization problems are non-convex, the solution was carried out using a recursive algorithm known as the alternative search method and the mesh adaptive direct search algorithm. As well as the network performance is illustrated for resource allocation scenarios using the random method, exhaustive search algorithm, and the proposed method. Numerical results indicated that the proposed scheme considerably improved the SSR compared to the case when the power and subcarrier allocation is performed randomly and the case when the phase shift matrix is considered constant.
Suggested Citation
Afshin Souzani & Mohammad Ali Pourmina & Paeiz Azmi & Mohammad Naser Moghadasi, 2025.
"Secrecy rate optimization for intelligent reflecting surface assisted PD-NOMA system,"
Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 88(4), pages 1-20, December.
Handle:
RePEc:spr:telsys:v:88:y:2025:i:4:d:10.1007_s11235-025-01371-2
DOI: 10.1007/s11235-025-01371-2
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:88:y:2025:i:4:d:10.1007_s11235-025-01371-2. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.