Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/4925
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVerma, Richa-
dc.contributor.authorKumar, Pawan-
dc.date.accessioned2025-01-10T09:59:30Z-
dc.date.available2025-01-10T09:59:30Z-
dc.date.issued2024-12-
dc.identifier.citationIEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), IIT Guwahati, Assam, 15–18 December 2024en_US
dc.identifier.urihttp://hdl.handle.net/2080/4925-
dc.descriptionCopyright belongs to the proceeding publisher.en_US
dc.description.abstractIn this paper, we consider a system comprising of a source node, two reconfigurable intelligent surface (RIS) nodes, a legitimate destination, and an eavesdropper. One of the two RIS sides supports the legitimate destination in enhancing its data detection capability. The second RIS side is malicious and assists the eavesdropper in overhearing legitimate communication. The system is affected under Nakagami-m fading. We analyze the secrecy performance of the system in terms of secrecy outage probability (SOP), probability of strictly positive secrecy capacity (PSPSC), secrecy ergodic capacity (SEC), and intercept probability (IP). We opt for generalized-K (KG) and mixture gamma (MG)-based approximation methods to provide an accurate analysis for an arbitrary number of RIS-reflecting elements and fading parameters. We also derive the asymptotic SOP expression to provide a simplified analysis at high signal to- noise ratios (SNRs). The analytical results are validated with the simulated results. We also highlight some observations drawn based on the analysis.en_US
dc.subjectReconfigurable intelligent surfaceen_US
dc.subjectSecrecy outage probabilityen_US
dc.titleSecrecy Performance Analysis of RIS-assisted System Under Nakagami-m Fadingen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2024_ANTS_RVerma_Secrecy.pdf454.21 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.