SearcharxivSearch

arXiv subjects

Mohammad Naseri Tehrani

Publications and source records attributed to Mohammad Naseri Tehrani.

2 recordsLinked to original sources

Resource Allocation for IRS-Enabled Secure Multiuser Multi-Carrier Downlink URLLC Systems

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 a joint design of IRS platform and secure URLLC network. We 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.

eess.SP

IoT Random Access in Massive MIMO: Exploiting Diversity in Sensing Matrices

Recently, non-orthogonal codes have been advocated for IoT massive access. Activity detection has been demonstrated to entail common support recovery in a jointly sparse multiple measurement vector (MMV) problem and MMV algorithms have been successfully applied offering various degrees of complexity-performance trade-off. Targeting the small measurement per antenna but large number of antennas setup, independent sensing matrices do offer significant performance advantages. Unfortunately, the IoT random access problem can not readily benefit from this concept as code matrix is fixed over all receiving antennas. Our contributions towards addressing this challenge are as follows. First, independent small-scale fading across antennas and users is established as a possible source of sensing matrix decorrelation. Secondly, two novel algorithms are proposed which exploit this partial de-correlation and collect sensing matrix diversity. Enjoying a low-complexity, these methods do offer great practical advantages as they target small measurement size, which is indeed severely constrained due to limited coherence time/bandwidth, but instead compensate for it by using a large array of antennas. Thirdly, probability of failure (PoF) for these methods are rigorously derived and corresponding measurement inequalities are presented. Fourthly, extensive simulations are conducted to confirm the superior performance of these methods versus state of the art.

eess.SP