Abstract
In this work, we focus on the secure transmission in reconfigurable intelligent surface (RIS) aided ultrareliable lowlatency communications (URLLC) network. Specifically, we investigate the average effective secrecy rate (AESR) optimization via jointly designing the transmit beamforming, the artificial noise covariance at the transmitter (Tx), and the phase shifter at the RIS. Particulary, the AESR in URLLC network contains not only the commonly used information rate expression based on long codewords but also two penalty terms about the decoding error probability introduced by finite blocklength coding. Thus, the AESR is a nonconcave objective. In addition, the unit modulus constraint of the reflecting coefficient at the RIS is nonconvex, which makes the formulated problem difficult to handle. To solve the formulated highly nonconvex problem, we first decouple the complicated objective into a linear function by introducing several slack variables. Then, we address the nonconvex constraints by the firstorder expression and the penalty concaveconvex procedure (PCCP) technique. Thus, an alternating optimization (AO) technique is proposed to solve the reformulated problem, where the convergence can be guaranteed by rigorous proof, and the computational complexity is a polynomial function of the main system parameters. Simulation results demonstrated the performance of the proposed design as well as the superiority of RIS in improving the secrecy performance when comparing with other baselines.
1. Introduction
Recently, ultrareliable and lowlatency communications (URLLC) has emerged as an important aspect for the InternetofThings (IoT) networks to enable critical applications, which require ultralow transmission latency (less than ms) and extremely high reliability (packet error probability (PEP) less than ) with relatively low data rate [1]. Different from conventional communications that based on long codewords, URLLC generally relies on the ultrashortpacket transmission, which is introducing the decoding error probability [2]. However, the main challenge to ensure high reliability in URLLC transmission is the random nature of the propagation channel due to multipath fading [3].
Recently, the newly proposed reconfigurable intelligent surfaces (RIS) has drawn great attention in industry and academia. Fundamentally, an RIS is a kind of metasurface consisting of an array of passive elements, each of which can adjust the phaseshift and amplitude of the incident signals [4]. Thus, by controlling the parameters of the electromagnetic (EM) waves that impinge on the surface, RIS can generate passive reflection beamforming (BF) and create a favorable propagation environment to expand the coverage, improve transmission quality, and enhance security. Moreover, since the processing is only reflecting the received signal with no decoding and encoding operation, RIS consumes much less power than the active transmitter (Tx) or relay [5].
With these above advantages, RIS has attract great research attention. To be specific, the authors in [6] investigated the resource allocation technique for RISassisted wireless powered systems. In [7], the authors studied the RISassisted mobile edge computing (MEC) networks, where a joint design of the downlink/uplink phase beamforming, transmission power, time slot assignment, and the local computing frequencies was proposed to maximize the total computation bits. Then, the authors in [8] studied the RISassisted IoT network. Moreover, in [9, 10], the authors investigated the multilayer RIS structure and suggest that multilayer RIS can further improve the communication performance. Nowadays, RISassisted transmission has been investigated in various scenarios such as the simultaneous wireless information and power transfer (SWIPT) network [11], the physical layer security network [12, 13], the millimeterwave (mmWave) networks [14, 15], the nonorthogonal multiple access (NOMA) networks [16], wireless cashing network [17], hybrid terrestrialaerial networks [18], and the antijamming communication scenario [19].
Meanwhile, some works have studied the RISaided URLLC networks. Specifically, [20] studied the user grouping and reflecting BF for RISaided URLLC multiuser network. Then, [21] investigated the joint BF and phase shift optimization in RISaided orthogonal frequency division multiple access (OFDMA) URLLC networks. Also, [22] studied the average rate of RISaided short packet communication in URLLC systems. While [23] studied the RISaided URLLC in a factory automation scenario. Furthermore, RIS has been demonstrated to reduce the latency for MECURLLC networks by improving the channel gain for the users that are far away from the MEC node [24]. While in [25], a deep reinforcement learning based method was proposed in a RISassisted URLLC network. These works suggest the huge potential of RIS in URLLC networks.
On the other hand, security is an important aspect in wireless network, since the confidential information sent to the legitimate user (Bob) maybe eavesdropped by the eavesdropper (Eve). The physical layer security (PLS) technique, which exploits the random characteristic of wireless channel such as fading and noise, has been considered as a promising technique to improve the security in wireless networks [26]. Moreover, [27, 28] studied the secrecy beamforming (BF) and precoding design in RISaided multipleinput singleoutput (MISO) and multipleinput multipleoutput (MIMO) network, where an alternating direction method of multipliers (ADMM) technique and a majorizationminimization (MM) optimization method were developed, respectively. Then, in [29], the authors proposed an RISassisted secure wireless communications in MIMO network, where an element wise optimization algorithm was developed to optimize the reflecting coefficient (RC). In [30], the authors investigated the RISassisted secure MEC networks, where the maxmin computation efficiency problem under the secure computation rate requirements was solved by the Dinkelbachtype method and block coordinate descent technique.
However, most work about PLS assume that the confidential information have infinite blocklength. In particular, the confidential information may have finite blocklength and need to meet the reliability and latency requirements. Thus, [31] investigated the nonasymptotic fundamental limits of wiretap channel, while [32] studied the secure shortpacket communication for IoT application. However, the secrecy transmission design in RISassisted URLLC network has not been studied yet. Motivated by this observation, in this work, we exploit the potential of RIS in improving the security in URLLC network. The main contributions are summarized as follows: (i)We propose a secrecy URLLC network with the assistance of a RIS, where the RIS reflect the incident signal to multiple Bobs, under the eavesdropping threat of an Eve. Specifically, we formulate the average effective secrecy rate (AESR) maximization problem, via jointly optimizing the BF, the artificial noise covariance, as well as the phase shifters. In fact, the AESR in URLLC network contains not only the difference of the logarithmic functions but also two terms about the decoding error probability introduced by finite blocklength coding. Thus, the AESR is a nonconcave objective, which is difficult to address(ii)To solve the formulated highly nonconvex problem, we first decouple the complicated objective into a linear function by introducing several slack variables. Then, we approximate the nonconvex constraints by the first order expression and formulate two subproblems with respect to the BF/AN, and the phase shifters. Moreover, we handle the nonconvex unit modulus constraint (UMC) for the phase shifters by using the penalty concaveconvex procedure (PCCP) technique. Finally, an alternating optimization (AO) technique was proposed to solve the reformulated problem. In fact, the PCCP method can be utilized to other problems with respect to the phase shifters, with just some necessary modification about the objective and some constraints(iii)We proof the convergence of the proposed AO scheme by rigorous derivation and show that the proposed algorithm enjoys polynomial time computational complexity with respect to the main system parameters, which is beneficial to implementation. Finally, the simulation results show that our proposed scheme achieves better AESR performance than other schemes and provide some insights: (1) RIS can significantly improve the AESR of secure URLLC network; (2) RIS plays more important role than AN in enhancing the secure performance; (3) it is beneficial to deploy the RIS closer to the Tx or Bobs to improve the secure performance
The rest of this work is organized as follows. A system model and problem formulation is given in Section 2. Section 3 investigates the joint design problem, where an AO approach is established. Simulation results are illustrated in Section 4. Section 5 concludes this work.
Notations: throughout this work, boldface lowercase and uppercase letters denote vectors and matrices, respectively. The superscripts , , and denote the conjugate, transpose, and conjugate transpose, respectively. is a diagonal matrix with diagonal elements , while denotes a vector consists of the main diagonal elements of , respectively. indicates that is a positive semidefinite matrix. denotes the Frobenius norm. is an identity matrix with proper dimension. and denote the real part and the modulus of a complex variable , respectively. In addition, denotes a circularly symmetric complex Gaussian random vector with mean and covariance .
2. System Model and Problem Formulation
2.1. System Model
Let us consider a RISaided secure URLLC system as shown in Figure 1, which consists of one Tx, one RIS, Bobs, and one Eve. The Tx has antennas, and the RIS has elements, respectively. In addition, each Bob and Eve is equipped with single antenna, and the set of the Bobs is denoted as . In the th slot, the channel between Tx and the th Bob and the Eve is denoted by and , respectively. Besides, the channel between Tx and the RIS is denoted as , between the RIS and the th Bob, and the Eve is denoted by and , respectively. All channels are assumed to be frequencyflat, and the channelstateinformation (CSI) is perfectly obtained by the Tx. Different from the common used uniform linear array (ULA), we utilize the uniform plane array (UPA) at Tx since the Bobs/Eve maybe not move on a line in practice. Therefore, a UPA may be a better choice.
Let be the information symbol sent to the th Bob in the th slot. The transmit signal can be written as , where is the transmit BF for the th Bob in the th slot, and denotes the artificial noise (AN) which is modeled as a circularly symmetric complex Gaussian (CSCG) vector with , where is the covariance matrix of the AN. In the following part, we replace by to simplify the natation.
The phase shifter matrix of the RIS in the th slot is denoted by , with denoting the RC of the th reflection element in the th slot. Since only the phase of the received signal is changed, the strength of the reflection signal is thus maximized, i.e., .
Hence, the signals received by the th Bob and Eve in the th slot are, respectively, given by where and denote the antenna noise at the th Bob and Eve with and , respectively.
In fact, by defining , we have
Similarly, we have
Thus, the signaltointerferencenoiseratio (SINR) for the th Bob can be rewritten as
Similarly, when Eve try to eavesdrop the confidential information sent to the th Bob, the SINR at Eve is given by
According to [31, 32], for the given total information block length , the constraint on the decoding error probability of at the th Bob, and the secrecy constraint on the information leakage of , a lower bound on the secrecy rate for the th Bob in the th time slot can be approximated expressed as where and denote the channel dispersions for the th Bob and Eve in the th time slot, respectively, given by and is the inverse of the Gaussian Qfunction .
It should be noted that and measure the stochastic variability of the channel relative to a deterministic channel with the same capacity. In addition, (6) implies that when compared with the traditional secrecy capacity, and incur two penalty terms on the achievable secrecy rate with finite blocklength coding. Besides, when the information blocklength approaches infinity, these penalty terms diminish, and the achievable secrecy rate in (6) asymptotically coincides with the secrecy capacity. Thus, the AESR over all time slots is given by
2.2. Problem Formulation
Here, we aim to maximize the AESR via jointly designing and , subject to the Tx power budget and the UMC of the RC. Mathematically, the problem is formulated as where denotes the power budget for Tx at the th time slot. It should be noted that (9a), (9b), and (9c) are nonconvex due to the coupled variables and multiple nonconvex constraints [33]. In the following, we will propose an effective way to convert (9a), (9b), and (9c) into a solvable problem. To simplify the notation, we neglect the slot index in related variables in the rest part.
3. An AOPCCPBased Approach to the AESR Maximization Problem
In this section, we will propose an AO and PCCPbased iterative algorithm to solve (9a), (9b), and (9c).
3.1. Optimization of
Firstly, via introducing several slack variables , we transform (9a), (9b), and (9c) into the following reformulation where the logarithm objective is linearized due to the monotonically property of exponential function.
In the following, we propose an AO method to solve (10a), (10b), (10c), (10d), (10e), and (10f). We first reformulate (10a), (10b), (10c), (10d), (10e), and (10f) into an approximated with respect to (w.r.t) , with fixed . Then, we optimize with fixed .
Firstly, (10b) and (10c) can be rewritten as
It is known that the righthand side of (11a) is a quadraticoverlinear function [33], which is convex. Thus, (11a) is nonconvex. Following the idea of the PCCP [33], we approximate the term with the corresponding firstorder Taylor expansion. Then, (19) can be approximated as where and are given points achieved by the previous iteration.
Similarly, (11b) can be approximated as where is a given point achieved by the previous iteration.
Similarly, the nonconvex (10e) can be approximated as where is a given point achieved by the previous iteration.
Then, we turn our attention to (10d). In fact, the term is in the form of two superlevels of convex functions, which can be approximated as [32] where and are the fixed points achieved by the previous iteration. It is easily known that can be handled in a similar way.
At last, combining these steps, we obtain the following approximated problem around given point : which is convex and can be effectively solved by available optimization solvers such as CVX [34].
3.2. Optimization of
Then, we focus on the optimization of with fixed . Firstly, by denoting , we have . Thus, we have the following approximations:
Then, the only nonconvex constraint in (16a) is the UMC. To handle this, a PCCP method is utilized. The constraint of (9c) is equivalent to and , where the former is convex and the latter is not convex. Since the global lowerbound of a convex function can be expressed by the firstorder Taylor expansion at any feasible point, then nonconvex constraint can be transformed into an affine constraint. Thus, (16a) and (16b) become where are slack variables introduced for the UMC, is the penalty term, and is employed as the regularization factor to control the feasibility of the constraints [35].
3.3. Convergence and Computational Complexity
Combining the above steps, we obtain the integrated AO approach in Algorithm 1.

Here, we provide a brief proof for the convergence of Algorithm 1. Firstly, we note that the convergence of the PCCP method can be guaranteed by the rigorous analysis in [36]. As for the whole AO procedure, we denote the objective value sequence of (9a), (9b), and (9c) as , and the objective function of (10a), (10b), (10c), (10d), (10e), and (10f) and (18a), (18b), (18c), and (18d) as , and , respectively. Then, we have
From (19), we can see that Algorithm 1 generates a monotonic increasing sequence . In addition, is upper bounded due to the power constraint (9c), thus is guaranteed to converge.
We now analyze the complexity of Algorithm 1, which is determined by the complexities of each subproblem and the number of iterations. According to [33], for problems (16a), (16b) and (18a), (18b), (18c), and (18d), the complexities are given by and , respectively. Thus, the total computational complexity of Algorithm 1 is with being the number of iterations. Therefore, Algorithm 1 has the polynomial time complexity.
In contrast, when adopting the semidefinite relaxation (SDR) method to solve (10a), (10b), (10c), (10d), (10e), and (10f) and then select the optimal through Gaussian randomization (GR), according to [33], the complexity of SDR at each iteration is , and the GR has the complexity of . Similarly, when using the SDR and GR methods to optimize , the complexity is +. Thus, the SDRGR method leads to higher complexity than the proposed method.
4. Simulation Results
The simulation deployment is shown in Figure 2, where there exist one Tx, one RIS, Bobs, and one Eve. The coordinates of Tx and the RIS are , , respectively. Then, the coordinate for Eve is , while each Bob is randomly placed in a circle centered at the Eve, with radius of , respectively.
Unless otherwise specified, the simulation settings are assumed as follows: , , , , , , and . The largescale path loss is given by , where is the path loss at the reference distance , is the link distance, and is the path loss exponent. Similar to [27], the path loss exponent between Tx and the Bobs/Eve is given by , and the smallscale fading is assumed to be Rayleigh fading. The path loss exponents of the RISrelated links is set as . As for the smallscale fading, take as example, which is modeled as , where is the Rician factor, is the lineofsight (LoS) component, and is the nonLoS (NLoS) component that is Rayleigh fading. Since we assume that UPA is employed at Tx, is given by , and the transmit array response vectors is given as where represents the azimuth and (elevation) angles of departures, is the signal wavelength, is the distance between the antennas or RIS elements, and and denote the horizontal and vertical antenna element indices of the antenna plane, respectively. Besides, the whole antenna array size is . Other array response vectors can be similarly defined. In the following, we set .
Firstly, we assess the convergence behavior of the proposed algorithm, the results are shown in Figure 3. From this figure, we can see that the propose method always converge in iteration, which confirm the practice of the proposed design.
Moreover, we compare our design with the following benchmarks: (1) the proposed design in the case of infinite blocklength, which can be seen as the upper bound of the proposed design; (2) the proposed design in the case of no AN; (3) the random RIS case, e.g., choose the RC randomly; (4) no RISaided case. These methods are labelled as “Proposed method,” “Infinite case,” “No AN,” “Random RIS,” and “No RIS,” respectively.
Firstly, we compare the AESR of different schemes versus ; the result was shown in Figure 4. From this figure, we can see that the AESR of all these methods increase with , while the proposed method outperforms the other benchmarks, and the performance gap between the proposed method and the infinite case is relatively small, which suggests the superiority of the proposed design. In addition, by comparing the curves of the proposed design with the no AN case and the no RIS case, we can find that RIS plays a more important role than AN in improving the AESR.
Then, we compare the AESR of different schemes versus ; the result was shown in Figure 5. As expected, we can see that with the increase of , the gap between the AESR and secrecy capacity tends to become small. Besides, the performance gap between the finite and infinite is not negligible for relatively small , which further confirms the illustration below (6).
Next, we compare the AESR of different schemes versus ; the result was shown in Figure 6. From this figure, we can see that for all these methods, higher AESR can be achieved with more elements. The performance gain mainly comes from the fact that with larger , more signals can reach the RIS, and the sum of the reflected signals increases, provided that the phase shifts are appropriately optimized. This result shows that a larger RIS can further improve the secrecy performance when optimizing the phase shifts properly.
Finally, to show the impact of the location of the RIS on the AESR performance, Figure 7 illustrates the obtained AESR for these schemes versus different TxRIS horizontal distances. It is observed that for all RISaided methods, when RIS moves along the axis from the Tx to the BobEve area (about ), the AESR first decreases than increases. Then, when RIS moves away from the BobEve area (about ), the AESR decreases obviously due to the severe channel fading. Actually, the largescale channel gain of the cascaded link can be estimated by , where and denote the distances from Tx to the RIS, and that from Tx to the center of the Bob/Eve area, respectively. Thus, the cascaded channel gain obtains the minimum value when , e.g., the RIS is located close to the middle point. Hence, to improve the performance, it is beneficial to deploy the RIS close to Tx or Bobs.
5. Conclusion
In this work, we have studied the transmission design in secure URLLC network aided by a RIS. Specifically, we aimed to maximize the AESR by jointly designing the active BF, the AN covariance and the phase shifter, subjected to the constraint of Tx power and the UMC. An AO and PCCPbased method was proposed to obtain the solution. Simulation results verified the performance of the proposed algorithm and showed the effectiveness of RIS in improving the security in URLLC network.
Data Availability
Data are available on request.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this article.
Acknowledgments
This work was supported in part by the Natural Science Foundation of China under grant no. 61673108, in part by the Colleges and Universities Natural Science Foundation in Jiangsu Province under grant no. 19KJA110002, in part by the IndustryUniversityResearch Cooperation Project of Jiangsu Province nos. BY2020335 and BY2020358.