University of Oulu

M. NaseriTehrani and S. Farahmand, "Resource Allocation for IRS-Enabled Secure Multiuser Multi-Carrier Downlink URLLC Systems," 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC), Oulu, Finland, 2022, pp. 1-5, doi: 10.1109/SPAWC51304.2022.9833996

Resource allocation for IRS-enabled secure multiuser multi-carrier downlink URLLC systems

Saved in:
Author: NaseriTehrani, Mohammad1; Farahmand, Shahrokh2
Organizations: 1Center for Wireless Communication (CWC), University of Oulu, Oulu, Finland
2Iran University of Science and Technology (IUST), Tehran, Iran
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 1.2 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2023021026819
Language: English
Published: IEEE, 2022
Publish Date: 2023-02-10
Description:

Abstract

Secure ultra-reliable low-latency communication (URLLC) has been recently investigated with the fundamental limits of finite block length (FBL) regime in mind. Analysis has revealed that when eavesdroppers outnumber BS antennas or enjoy a more favorable channel condition compared to the legitimate users, base station (BS) transmit power should increase exorbitantly to meet quality of service (QoS) constraints. Channel-induced impairments such as shadowing and/or blockage pose a similar challenge. These practical considerations can drastically limit secure URLLC performance in FBL regime. Deployment of an intelligent reflecting surface (IRS) can endow such systems with much-needed resiliency and robustness to satisfy stringent latency, availability, and reliability requirements. We address this problem and propose to minimize the total BS transmit power by simultaneously designing the beamformers and artificial noise at the BS and phase-shifts at the IRS, while guaranteeing the required number of securely transmitted bits with the desired packet error probability, information leakage, and maximum affordable delay. The proposed optimization problem is non-convex and we apply block coordinate descent and successive convex approximation to iteratively solve a series of convex sub-problems instead. The proposed algorithm converges to a sub-optimal solution in a few iterations and attains substantial power saving and robustness compared to baseline schemes.

see all

ISBN: 978-1-6654-9455-7
ISBN Print: 978-1-6654-9456-4
Pages: 1 - 5
DOI: 10.1109/spawc51304.2022.9833996
OADOI: https://oadoi.org/10.1109/spawc51304.2022.9833996
Host publication: 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)
Conference: IEEE International Workshop on Signal Processing Advances in Wireless Communication
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Copyright information: © 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.