betaFeedback

WorksEngineering

Secrecy Sum-Rate Maximization in Finite Blocklength IRS-aided Systems With Perfect and Imperfect CSI

Abstract

The rapid growth of the Internet of Things (IoT) requires efficient and secure communication technologies to enable ultra-reliable low-latency (URLLC) communication applications. Intelligent reflecting surfaces (IRS) have emerged as a promising solution to enhance IoT network secrecy performance by improving signal quality for legitimate devices (Bob), while thwarting the eavesdropper (Eve) interception. However, ensuring secrecy across multiple users, given their diverse channels and locations, is challenging, especially under finite blocklength (FBR) constraints, which are common in IoT networks. This paper investigates the secrecy performance of IRS-aided URLLC systems under three channel state information (CSI) scenarios: perfect CSI, imperfect CSI, and unknown eavesdropper's CSI. We first formulate a non-convex optimization problem to maximize the system's sum secrecy rate (SSR) by jointly optimizing the transmitter's beamforming and the IRS's passive reflective elements, while maintaining FBR-related latency and transmission duration constraints. For imperfect CSI, the semi-infinite uncertainty constraints are transformed into finite linear matrix inequalities (LMIs) via a successive convex approximation (SCA)-based approach, and the proposed algorithm is proven to converge to a locally optimal solution with low computational complexity.

Introduction

Intelligent reflecting surface (IRS) has emerged as a key enabler for IoT networks, garnering significant interest due to its ability to enhance/tailor the passive radio environment. A typical IRS consists of passive reflective elements (PREs) equipped with phase shift controllers, allowing it to intelligently manipulate reflected signals [1]. By optimizing signal reflections, IRSs can enhance signal reception by creating favorable multi-path components at the receivers (Rx/Bob).

Another potential application of IRSs is to enhance the security/privacy of users by purposely manipulating reflected signals from the transmitter to facilitate the signal reception at legitimate users while maximizing the multi-user interference/degrading the signals at potential eavesdroppers. For example, a multi-input-single-output IRS-aided system with the presence of multiple eavesdroppers was considered in [7], where the transmitter introduced artificial noise as a countermeasure to enhance user security. The authors in [8] investigated IRS-aided hybrid satellite-terrestrial relay networks to address blocked user links and proposed an alternating optimization scheme for joint beamforming and IRS phase-shift design, aiming to minimize transmit power under rate constraints. In [9], the authors surveyed space-air-ground integrated networks (SAGIN), outlining key security challenges and introducing wireless endogenous security based on physical-layer attributes. Kang et al. in [10] similarly reviewed SAGIN architectures, highlighted security vulnerabilities in heterogeneous environments, and discussed hybrid frequency-power-spatial domain strategies for enhancing secure and efficient network access. In [11], the authors studied a cell-free IRS-aided network with the aim of enhancing the users’ secrecy by maximizing the weighted sum of the users’ secrecy rate (SR) by jointly optimizing the beamforming vector and the IRS’s PREs. The alternating optimization (AO) algorithm was used to decouple the beamforming factor and the IRS’s PREs. Then, the resulting problem was tackled using semi-definite relaxation (SDR) and continuous convex approximation. When the channel state information (CSI) from the IRS to the users/receivers is unknown or imperfect, the authors in [12] studied an IRS-aided multi-user system, where they formulated a sum secrecy rate (SSR) maximization problem with the eavesdropper’s channel partially known to the Tx/Alice. The IRS was deployed to enhance the uplink transmission and the downlink energy transfer. Then, the authors optimized the SSR by jointly optimizing the transmit beamform vectors, the downlink/uplink time allocation, and the energy transmit covariance matrix.

In parallel, URLLC relying on FBR, have been envisioned as key technologies to serve critical missions of IoT. In URLLC applications such as intelligent transportation, leakage information could expose the user’s location or identity, due to the inherently private nature of the IoT transmitted information [13]. As a potential solution to secure URLLC, the use of IRS has recently attracted paramount interest. This stems from the fact that IRS links exhibit low latency, which is beneficial for the FBR strict requirements [14]. For example, Zhao et al. studied the information freshness in a single-user FBR-IRS-aided system with the presence of an eavesdropper in [14]. The authors first derived a closed-form expression for the upper bound secrecy outage probability under statistical CSI. Then, the single user’s secrecy outage is minimized by jointly optimizing the blocklength and the IRS PREs. Differently, the authors in [15] investigated the problem of transmission power minimization in an IRS-aided system under the FBR regime with the presence of multiple eavesdroppers, by jointly optimizing the beamforming vector, the AN, and the IRS PREs. In [16], the authors studied the SSR maximization problem for an FBR-IRS-aided system by jointly optimizing the beamforming vector, the IRS PREs, and the blocklength. The optimization problem was tackled using Riemannian conjugate gradient based algorithm. However, the assumption that Tx/Alice can obtain Eve’s CSI, as stated before, is not practical. In addition, most of the existing studies focused only on single-user systems, and thus their applications are limited. When only partial or erroneous CSI (from the IRS to the users and the eavesdropper) is available, the problem is even more challenging due to the semi-infinite constraints arising from CSI uncertainty, which are embedded within the dispersion term of the FBR-SR expression, which contains both the inverse Q-function and the square-root of the channel dispersion. This structure makes the decoding error probability highly sensitive to channel estimation errors [17], while the square-root term further intensifies the nonlinearity. To address these challenges, we first introduce slack variables to decouple the transmit beamforming vectors and the IRS PREs within the objective function. Then, we employ the successive convex approximation (SCA) framework [18] together with the S-procedure [19] to transform the semi-infinite constraints into linear matrix inequalities (LMIs). Although this transformation yields LMIs, they remain nonconvex. To overcome this, we apply a first-order Taylor expansion to linearize the non-convex parts, resulting in a convex approximation that can be efficiently solved at each iteration. Then, we propose a penalty convex-concave procedure (PCCP) [20] to tackle the unit modulus constraint (UMC) of the IRS. When Alice can’t obtain Eve’s CSI, we propose a power minimization problem to ensure the users’ data rate meets a minimum quality of service (QoS) constraint, while maintain the FBR constraints, namely, the transmission duration and latency. Once the transmission power is minimized, the remaining residual power is allocated as AN to degrade Eve’s signal-to-interference-plus-noise ratio (SINR). The proposed problem is tackled by jointly optimizing the beamforming vectors and the IRS’s PREs. We use SCA and S-procedure to optimize the beamforming vector. Then, we use a PCCP algorithm to optimize the IRS’s PREs, while ensuring the FBR’s constraints and the imperfect IRS to the users’ CSI. Unlike traditional LBR power minimization problems and existing research [21, 22], our method explicitly incorporates the FBR constraints and addresses challenges arising from imperfect channel state information. Extensive simulations with practical settings show that maximizing the SSR of all the users can achieve a better chance of ensuring system secure communications (subject to the location of the eavesdropper) under the FBR constraints, even under imperfect CSI conditions.

Contributions

The main contributions are summarized as follows:

  • We tackle the secrecy maximization problem of the URLLC users in the FBR-IRS-aided system, in which the IRS enhances the users’ SINR and thwarts Eve’s SINR to ensure the system’s SR. To this end, we maximize the SSR by jointly optimizing the beamforming vectors and the IRS’s PREs, while satisfying the FBR latency and transmission duration constraints.

  • When CSI is available, we solve the above non-convex problem by linearizing its objective function with tractable approximation functions, leading to a computationally efficient algorithm. To tackle UMC, unlike traditional methods, i.e., conventional SDR, we directly optimize the PREs arguments to provide a low-complexity solution that can scale with large IRSs. The resulting solution is proved to converge to a locally optimal solution of the original non-convex problem.

  • In the case of imperfect CSI, we transform the semi-infinite constraints imposed by the imperfect CSI constraint into finite LMIs by leveraging the SCA approach for the transformation. We then 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.

  • In scenarios where Eve’s CSI is not accessible, we tackle a power minimization problem within the FBR framework, ensuring that every user’s data rate meets a specified QoS threshold. The remaining transmit power

is deliberately used as AN to decrease the eavesdropper’s SINR. The UMC is handled using the PCCP framework while maintaining the QoS criteria. The proposed algorithm is demonstrated to converge to a locally optimal solution, effectively ensuring system-level secrecy under strict FBR conditions.

  • Finally, we perform extensive simulations with practical settings. The simulation results show that our approach can ensure secure communication for all users while satisfying FBR constraints even under imperfect CSI. In addition, the impact of the imperfect CSI of the reflected channel on the system is also evaluated.

The remainder of this paper is organized as follows. The system model is discussed in Section II. Then, Sections III and IV present the problem and corresponding solutions under perfect and imperfect CSI, respectively. Section V further extends the formulation to the scenario where the eavesdropper’s CSI is unavailable. The extensive simulations and discussion are provided in Section VI. Finally, Section VII concludes the paper.

Notations: This paper uses the following notations. The bold letters denote vectors and matrices. IMI_M denotes the identity matrix of dimension MM. Diag⁡(n1,…,nn)\operatorname{Diag}(n_1,\ldots,n_n) denotes the diagonal matrix with diagonal entries of {n1,…,nn}\{n_1,\ldots,n_n\}. The symbols R\mathbb{R} and C\mathbb{C} represent the real and the complex field, respectively. C(0,zˉ)\mathcal{C}(0,\bar{z}) denotes the circular Gaussian random variable with zero mean and variance zˉ\bar{z}. For matrices C\mathbf{C} and D\mathbf{D}, ⟨C,D⟩≜trace⁡(CHD)\langle\mathbf{C},\mathbf{D}\rangle\triangleq\operatorname{trace}(\mathbf{C}^{H}\mathbf{D}). For matrix A\mathbf{A}, R{A}\mathfrak{R}\{\mathbf{A}\} denotes the real part, ⟨A⟩≜trace⁡(A)\langle\mathbf{A}\rangle\triangleq\operatorname{trace}(\mathbf{A}), the symbol ∥A∥1\lVert\mathbf{A}\rVert_1 denotes the 1-norm, ∥A∥\lVert\mathbf{A}\rVert denotes the Frobenius norm, A∗\mathbf{A}^{*} denotes the conjugate, AH\mathbf{A}^{H} denotes the Hermitian (conjugate transpose), λmax⁡(A)\lambda_{\max}(\mathbf{A}) denotes the maximal eigenvalue, ∠(A)\angle(\mathbf{A}) denotes its argument, and A⪰0\mathbf{A}\succeq0 means positive semi-definite. Lastly, the notations used in this paper are shown in Table 1.

SymbolDescription
KKSet of legitimate users
k,ek,eUser index and Eve index
MMNumber of antennas at Alice (base station)
NNNumber of IRS reflecting elements (PREs)
GAR\mathbf{G}_{AR}Channel from Alice to the IRS
ui\mathbf{u}_iChannel from IRS to user/Eve, i∈{k,e}i\in\{k,e\}
hi(θ)\mathbf{h}_i(\boldsymbol{\theta})Cascaded channel gain from Alice to ii
h~i(θ)\tilde{\mathbf{h}}_i(\boldsymbol{\theta})Imperfect cascaded channel gain
Φ\boldsymbol{\Phi}IRS reflection matrix
θ\boldsymbol{\theta}IRS phase shift vector
u^i\hat{\mathbf{u}}_iEstimated channel vector
Δui\Delta\mathbf{u}_iChannel estimation error
Ωi\Omega_iRadius of the CSI uncertainty region
ωi\omega_iSet of all possible channel estimation errors
wk\mathbf{w}_kBeamforming vector for user kk
σi2\sigma_i^2Noise power at receiver ii
γi\gamma_iSINR at user/Eve i∈{k,e}i\in\{k,e\}
C^i(w,θ)\hat{C}_i(\mathbf{w},\boldsymbol{\theta})Achievable rate/eavesdropping rate
SkF\mathcal{S}_k^FFinite blocklength secrecy rate (FBR-SR)
SkL\mathcal{S}_k^LLong blocklength secrecy rate (LBR-SR)
BBSystem bandwidth
TTTransmission duration
NtN_tPacket length
sks_kDecoding error probability of user kk
ses_eInformation leakage probability at Eve
Q−1(⋅)Q^{-1}(\cdot)Inverse Gaussian QQ-function
ξi\xi_iFinite blocklength factor
ViV_iChannel dispersion factor
PTP_TTransmit power at Alice
PtotP_{\mathrm{tot}}Total available transmit power
PJP_JResidual power allocated as artificial noise (AN)
V\mathbf{V}Artificial noise projection matrix
r\mathbf{r}Artificial noise vector

Table 1. List of Notations

System Model

We consider an FBR-IRS-aided downlink system as depicted in Figure 1, in which an MM-antenna BS (Alice) transmits confidential information to KK single antenna IoT-users under the presence of a single antenna eavesdropper (Eve). Here, we assume that direct radio links between Alice and users are severely blocked1. This scenario is usually the case in highly populated areas with high-rise buildings. An IRS with NN PREs is thus deployed (e.g., at the facade of a building) to support the transmission between Alice and the users. Let K≜{1,2,…,K}\mathcal{K}\triangleq\{1,2,\ldots,K\} denote the set of legitimate users, and ee denote Eve in the system. Let GAR=βARGˉAR∈CN×M\mathbf{G}_{AR}=\sqrt{\beta_{AR}}\bar{\mathbf{G}}_{AR}\in\mathbb{C}^{N\times M} denote the channel from Alice to the IRS, where GˉAR\bar{\mathbf{G}}_{AR} is modeled by Rician fading, and βAR\sqrt{\beta_{AR}} is the large scale fading factor of the Alice-to-IRS link. The channel from the IRS to user-kk and to Eve is modeled by ui=βRiuˉiRRi1/2∈C1×N\mathbf{u}_i=\sqrt{\beta_{Ri}}\bar{\mathbf{u}}_i\mathbf{R}_{Ri}^{1/2}\in\mathbb{C}^{1\times N}, where i∈{k,e}i\in\{k,e\}, βRi\beta_{Ri} is the large-scale fading factor of the IRS-to-ii link [23], uˉi\bar{\mathbf{u}}_i is modeled by Rician fading, and RRi∈CN×N\mathbf{R}_{Ri}\in\mathbb{C}^{N\times N} is the IRS elements’ spatial correlation matrix [24]. For the confidential message intended for user-kk, i.e., sks_k, the signal received by user-kk and Eve corresponding to the intended user, can be respectively expressed by:

System model showing an FBR-IRS-aided downlink system with Alice, an IRS, users, and Eve

Figure 1. System model.

yi≜hi(θ)∑k=1Kwksk+ni, i∈{k,e},(1)y_i \triangleq\mathbf{h}_i(\boldsymbol{\theta})\sum_{k=1}^{K}\mathbf{w}_k s_k+n_i,\ i\in\{k,e\}, \tag*{(1)}

where hi(θ)∈C1×M\mathbf{h}_i(\boldsymbol{\theta})\in\mathbb{C}^{1\times M} is the cascaded channel gain from Alice to i∈{k,e}i\in\{k,e\}, wk∈CM×1\mathbf{w}_k\in\mathbb{C}^{M\times1} is the beamforming vector applied for user-kk, θ=(θ1,…,θN)T∈[0,2π)N\boldsymbol{\theta}=(\theta_1,\ldots,\theta_N)^T\in[0,2\pi)^N denotes the phase shift vector of the IRS’s PREs, nin_i is the zero-mean additive white Gaussian noise (AWGN) with power density σi2\sigma_i^2 for i∈{k,e}i\in\{k,e\}. The cascade channel gain hi(θ)\mathbf{h}_i(\boldsymbol{\theta}) from Alice to i∈{k,e}i\in\{k,e\}, can be written in terms of the channel gain from Alice to the IRS and the channel gain from the IRS to the user or Eve as follows:

hi(θ)≜uiΦGAR≜ui∑n=1Nexp⁡(jθn)EnGAR,(2)\mathbf{h}_i(\boldsymbol{\theta})\triangleq\mathbf{u}_i\boldsymbol{\Phi}\mathbf{G}_{AR}\triangleq\mathbf{u}_i\sum_{n=1}^{N}\exp(j\theta_n)\mathbf{E}_n\mathbf{G}_{AR}, \tag*{(2)}

References

  1. [1]T. V. Nguyen, D. N. Nguyen, M. D. Renzo, and R. Zhang, “Leveraging secondary reflections and mitigating interference in multi-IRS/RIS aided wireless networks,” IEEE Transactions on Wireless Communications, vol. 22, no. 1, pp. 502–517, 2023.
  2. [3]M. Abughalwa, H. D. Tuan, D. N. Nguyen, H. V. Poor, and L. Hanzo, “Finite-blocklength RIS-aided transmit beamforming,” IEEE Transactions on Vehicular Technology, vol. 71, no. 11, pp. 12 374–12 379, 2022.arxiv.org/abs/2207.11444
  3. [7]S. Hong, C. Pan, H. Ren, K. Wang, K. K. Chai, and A. Nallanathan, “Robust transmission design for intelligent reflecting surface-aided secure communication systems with imperfect cascaded CSI,” IEEE Transactions on Wireless Communications, vol. 20, no. 4, pp. 2487–2501, 2020.
  4. [8]Z. Lin, H. Lin, N. Liu, K. An, Y. Wang, G. Zheng, S. Chatzinotas, and Y. Hu, “Refracting RIS-aided hybrid satellite-terrestrial relay networks: Joint beamforming design and optimization,” IEEE Transactions on Aerospace and Electronic Systems, vol. 58, no. 4, pp. 3717–3742, 2022.
  5. [9]Z. Lin, M. Guo, C. Han, Y. Sun, R. Ma, K. An, Y. He, and N. Al-Dhahir, “Wireless endogenous security for SAGINs: Achieving ubiquitous access and secure communication in symbiosis,” IEEE Network, pp. 1–1, 2025.
  6. [10]K. An, Y. Sun, Z. Lin, Y. Zhu, W. Ni, N. Al-Dhahir, K.-K. Wong, and D. Niyato, “Exploiting multi-layer refracting RIS-assisted receiver for hap-swipt networks,” IEEE Transactions on Wireless Communications, vol. 23, no. 10, pp. 126382–12657, 2024.
  7. [11]W. Hao, J. Li, G. Sun, M. Zeng, and O. A. Dobre, “Securing reconfigurable intelligent surface-aided cell-free networks,” IEEE Transactions on Information Forensics and Security, vol. 17, pp. 3720–3733, 2022.
  8. [12]W. Li, W. Yu, H. Liu, and H. Hou, “Robust secrecy rate maximization for IRS-aided MISO communication systems,” in 2023 IEEE 13th International Conference on CYBER Technology in Automation, Control, and Intelligent Systems (CYBER), 2023, pp. 604–609.
  9. [13]C. Feng, H.-M. Wang, and H. V. Poor, “Reliable and secure short-packet communications,” IEEE Transactions on Wireless Communications, vol. 21, no. 3, pp. 1913–1926, 2021.
  10. [14]W. Zhao, J. Ni, S. Hao, B. Li, and T. Zhang, “Joint physical layer security and information freshness of RIS-assisted SPC system: Analysis and optimization,” IEEE Transactions on Vehicular Technology, pp. 1–13, 2025.
  11. [15]M. NaseriTehrani and S. Farahmand, “Resource allocation for IRS-enabled secure multiuser multi-carrier downlink URLLC systems,” in 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC), 2022, pp. 1–5.
  12. [16]W. Gao, C. Wang, J. Wang, and Y. Hu, “Joint resource allocation and beamforming design for secure short packet communication in RIS-aided MISO systems: Invited paper,” in 2024 18th European Conference on Antennas and Propagation (EuCAP), 2024, pp. 1–5.
  13. [17]G. Durisi, T. Koch, and P. Popovski, “Toward massive, ultrareliable, and low-latency wireless communication with short packets,” Proceedings of the IEEE, vol. 104, no. 9, pp. 1711–1726, 2016.
  14. [18]F. Fang, Y. Xu, Q.-V. Pham, and Z. Ding, “Energy-efficient design of IRS-NOMA networks,” IEEE Transactions on Vehicular Technology, vol. 69, no. 11, pp. 14088–14092, 2020.
  15. [19]S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear matrix inequalities in system and control theory. SIAM, 1994.
  16. [20]H. Niu, Z. Chu, F. Zhou, and Z. Zhu, “Simultaneous transmission and reflection reconfigurable intelligent surface assisted secrecy MISO networks,” IEEE Communications Letters, vol. 25, no. 11, pp. 3498–3502, 2021.
  17. [21]H.-M. Wang, J. Bai, and L. Dong, “Intelligent reflecting surfaces assisted secure transmission without eavesdropper’s CSI,” IEEE Signal Processing Letters, vol. 27, pp. 1300–1304, 2020.
  18. [22]H. Niu, X. Lei, Y. Xiao, M. Xiao, and S. Mumtaz, “On the efficient design of RIS-assisted secure MISO transmission,” IEEE Wireless Communications Letters, vol. 11, no. 8, pp. 1664–1668, 2022.
  19. [23]A. Al-Rimawi and A. Al-Dweik, “On the performance of RIS-assisted communications with direct link over κ-μ shadowed fading,” IEEE Open Journal of the Communications Society, vol. 3, pp. 2314–2328, 2022.
  20. [24]Q.-U.-A. Nadeem, A. Kammoun, A. Chaaban, M. Debbah, and M.-S. Alouini, “Asymptotic Max-Min SINR analysis of reconfigurable intelligent surface assisted MISO systems,” IEEE Transactions on Wireless Communications, vol. 19, no. 12, pp. 7748–7764, 2020.
  21. [25]G. Zhou, C. Pan, H. Ren, K. Wang, M. D. Renzo, and A. Nallanathan, “Robust beamforming design for intelligent reflecting surface aided MISO communication systems,” IEEE Wireless Communications Letters, vol. 9, no. 10, pp. 1658–1662, 2020.
  22. [26]C. Pan, H. Ren, M. Elkashlan, A. Nallanathan, and L. Hanzo, “Robust beamforming design for ultra-dense user-centric C-RAN in the face of realistic pilot contamination and limited feedback,” IEEE Transactions on Wireless Communications, vol. 18, no. 2, pp. 780–795, 2019.
  23. [27]Z. Zhang, L. Lv, Q. Wu, H. Deng, and J. Chen, “Robust and secure communications in intelligent reflecting surface assisted NOMA networks,” IEEE Communications Letters, vol. 25, no. 3, pp. 739–743, 2021.
  24. [28]X. Guan, Q. Wu, and R. Zhang, “Anchor-assisted channel estimation for intelligent reflecting surface aided multiuser communication,” IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 3764–3778, 2022.
  25. [29]X. Yang, R. F. Schaefer, and H. V. Poor, “Wiretap channels: Nonsymptotic fundamental limits,” IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4069–4093, 2019.
  26. [30]M. Bloch, J. Barros, M. R. D. Rodrigues, and S. W. McLaughlin, “Wireless information theoretic security,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2515–2534, 2008.
  27. [31]H. H. M. Tam, H. D. Tuan, and D. T. Ngo, “Successive convex quadratic programming for quality-of-service management in full-duplex MU-MIMO multicell networks,” IEEE Transactions on Communications, vol. 64, no. 6, pp. 2340–2353, 2016.
  28. [32]H. Niu, Z. Lin, Z. Chu, Z. Zhu, P. Xiao, H. X. Nguyen, I. Lee, and N. Al-Dhahir, “Joint beamforming design for secure RIS-assisted IoT networks,” IEEE Internet of Things Journal, vol. 10, no. 2, pp. 1628–1641, 2023.
  29. [33]M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” 2014.
  30. [34]Y. Labit, D. Peaucelle, and D. Henrion, “SeDuMi interface 1.02: a tool for solving LMI problems with sedumi,” in Proceedings. IEEE International Symposium on Computer Aided Control System Design, 2002, pp. 272–277.
  31. [35]T. Lipp and S. Boyd, “Variations and extension of the convex–concave procedure,” Optimization and Engineering, vol. 17, pp. 263–287, 2016.
  32. [36]S. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2004.
  33. [37]Y. Eldar, A. Ben-Tal, and A. Nemirovski, “Robust mean-squared error estimation in the presence of model uncertainties,” IEEE Transactions on Signal Processing, vol. 53, no. 1, pp. 168–181, 2005.
  34. [38]W. Wang, W. Ni, H. Tian, Z. Yang, C. Huang, and K.-K. Wong, “Safeguarding NOMA networks via reconfigurable dual-functional surface under imperfect CSI,” IEEE Journal of Selected Topics in Signal Processing, vol. 16, no. 5, pp. 950–966, 2022.
  35. [39]Y. Chen, Y. Wang, and L. Jiao, “Robust transmission for reconfigurable intelligent surface aided millimeter wave vehicular communications with statistical CSI,” IEEE Transactions on Wireless Communications, vol. 21, no. 2, pp. 928–944, 2022.
  36. [40]G. Zhou, C. Pan, H. Ren, K. Wang, and A. Nallanathan, “A framework of robust transmission design for IRS-aided MISO communications with imperfect cascaded channels,” IEEE Transactions on Signal Processing, vol. 68, pp. 5092–5106, 2020.
  37. [41]A. D. Wyner, “The wire-tap channel,” The Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1387, 1975.
  38. [42]L. Dong, H.-M. Wang, and H. Xiao, “Secure cognitive radio communication via intelligent reflecting surface,” IEEE Transactions on Communications, vol. 69, no. 7, pp. 4678–4690, 2021.
  39. [43]E. Björnson, Ö. Özdogan, and E. G. Larsson, “Intelligent reflecting surface versus decode-and-forward: How large surfaces are needed to beat relaying?” IEEE Wireless Communications Letters, vol. 9, no. 2, pp. 244–248, 2020.
  40. [44]M. Bennis, M. Debbah, and H. V. Poor, “Ultrareliable and low-latency wireless communication: Tail, risk, and scale,” Proc. IEEE, vol. 106, no. 10, pp. 1834–1853, 2018.
  41. [45]C. She, C. Yang, and T. Q. Quek, “Cross-layer optimization for ultrareliable and low-latency radio access networks,” IEEE Trans. Wirel. Commun., vol. 17, no. 1, pp. 127–141, 2017.
  42. [46]D. N. Nguyen and M. Krunz, “A cooperative MIMO framework for wireless sensor networks,” ACM Trans. Sen. Netw., vol. 10, no. 3, May 2014. [Online]. Available: https://doi.org/10.1145/2499381
  43. [47]G. Scutari, F. Facchinei, L. Lampariello, and P. Song, “Parallel and distributed methods for nonconvex optimization,” in 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2014, pp. 840–844.

Paper details

vlnc:W_pbes29s3
Version
v1 · latest
Published
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents