"Security for Everyone" in Finite Blocklength IRS-aided Systems With Perfect and Imperfect CSI
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908496583196672 |
|---|---|
| author | Abughalwa, Monir Nguyen, Diep N. Hoang, Dinh Thai Nguyen, Van-Dinh Zeng, Ming Pham, Quoc-Viet Dutkiewicz, Eryk |
| author_facet | Abughalwa, Monir Nguyen, Diep N. Hoang, Dinh Thai Nguyen, Van-Dinh Zeng, Ming Pham, Quoc-Viet Dutkiewicz, Eryk |
| contents | Provisioning secrecy for all users, given the heterogeneity in their channel conditions, locations, and the unknown location of the attacker/eavesdropper, is challenging and not always feasible. The problem is even more difficult under finite blocklength constraints that are popular in ultra-reliable low-latency communication (URLLC) and massive machine-type communications (mMTC). This work takes the first step to guarantee secrecy for all URLLC/mMTC users in the finite blocklength regime (FBR) where intelligent reflecting surfaces (IRS) are used to enhance legitimate users' reception and thwart the potential eavesdropper (Eve) from intercepting. To that end, we aim to maximize the minimum secrecy rate (SR) among all users by jointly optimizing the transmitter's beamforming and IRS's passive reflective elements (PREs) under the FBR latency constraints. The resulting optimization problem is non-convex and even more complicated under imperfect channel state information (CSI). To tackle it, we linearize the objective function, and decompose the problem into sequential subproblems. When perfect CSI is not available, we use the successive convex approximation (SCA) approach to transform imperfect CSI-related semi-infinite constraints into finite linear matrix inequalities (LMI). We prove that our proposed algorithm converges to a locally optimal solution with low computational complexity thanks to our closed-form linearization approach. This makes the solution scalable for large IRS deployments. Extensive simulations with practical settings show that our approach can ensure secure communication for all users while satisfying FBR constraints even with only imperfect CSI. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_05067 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | "Security for Everyone" in Finite Blocklength IRS-aided Systems With Perfect and Imperfect CSI Abughalwa, Monir Nguyen, Diep N. Hoang, Dinh Thai Nguyen, Van-Dinh Zeng, Ming Pham, Quoc-Viet Dutkiewicz, Eryk Signal Processing Provisioning secrecy for all users, given the heterogeneity in their channel conditions, locations, and the unknown location of the attacker/eavesdropper, is challenging and not always feasible. The problem is even more difficult under finite blocklength constraints that are popular in ultra-reliable low-latency communication (URLLC) and massive machine-type communications (mMTC). This work takes the first step to guarantee secrecy for all URLLC/mMTC users in the finite blocklength regime (FBR) where intelligent reflecting surfaces (IRS) are used to enhance legitimate users' reception and thwart the potential eavesdropper (Eve) from intercepting. To that end, we aim to maximize the minimum secrecy rate (SR) among all users by jointly optimizing the transmitter's beamforming and IRS's passive reflective elements (PREs) under the FBR latency constraints. The resulting optimization problem is non-convex and even more complicated under imperfect channel state information (CSI). To tackle it, we linearize the objective function, and decompose the problem into sequential subproblems. When perfect CSI is not available, we use the successive convex approximation (SCA) approach to transform imperfect CSI-related semi-infinite constraints into finite linear matrix inequalities (LMI). We prove that our proposed algorithm converges to a locally optimal solution with low computational complexity thanks to our closed-form linearization approach. This makes the solution scalable for large IRS deployments. Extensive simulations with practical settings show that our approach can ensure secure communication for all users while satisfying FBR constraints even with only imperfect CSI. |
| title | "Security for Everyone" in Finite Blocklength IRS-aided Systems With Perfect and Imperfect CSI |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2504.05067 |