Alireza Vahid

Alireza Vahid

Auto-generated profile, based on publicly available information

Alireza Vahid

Rochester Institute of Technology

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 2024 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
THTiep M. Hoang
Tiep M. Hoang
AVAlireza Vahid
Alireza Vahid
HTHoang Duong Tuan
Hoang Duong Tuan
LHLajos Hanzo
Lajos Hanzo
Security at the physical layer (PHY) is a salient research topic in wireless systems, and machine learning (ML) is emerging as a powerful tool for providing new data-driven security solutions. Therefore, the application of ML techniques to the PHY security is of crucial importance in the landscape of more and more data-driven wireless services. In this context, we first summarize the family of bespoke ML algorithms that are eminently suitable for wireless security. Then, we review the recent progress in ML-aided PHY security, where the term “PHY security” is classified into two different types: i) PHY authentication and ii) secure PHY transmission. Moreover, we treat NNs as special types of ML and present how to deal with PHY security optimization problems using NNs. Finally, we identify some major challenges and opportunities in tackling PHY security challenges by applying carefully tailored ML tools.

15 October 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
ISIlan Shomorony
Ilan Shomorony
AVAlireza Vahid
Alireza Vahid
We consider the problem of communicating over a channel that randomly “tears” the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\mathrm{ Geometric}}(p_{n})$ , we characterize the capacity as $C = e^{-\alpha }$ , where $\alpha = \lim _{n\to \infty } p_{n} \log n$ . Our results show that the case of ${\mathrm{ Geometric}}(p_{n})$ -length fragments and the case of deterministic length- $(1/p_{n})$ fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity.

31 March 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
THTiep M. Hoang
Tiep M. Hoang
CXChao Xu
Chao Xu
AVAlireza Vahid
Alireza Vahid
HTHoang Duong Tuan
Hoang Duong Tuan
Trung Q. DuongTrung Q. Duong
Trung Q. Duong
LHLajos Hanzo
Lajos Hanzo
The physical layer security (PLS) of a space-ground communication system is examined. To improve the security performance, a pair of reconfigurable intelligent surfaces (RISs) is integrated into the system and benchmarked against a scheme, where there is only a single RIS close to the ground station. As for the double-RIS scenario, we formulate a secrecy rate maximization problem, and then propose an alternating optimization (AO) algorithm for jointly optimizing three vectors, namely the beamformer of the ground station and the reflecting vectors of two different RISs. Similarly, as for the single-RIS case, we also propose another AO algorithm for optimizing a pair of vectors, namely the beamformer of the ground station and the reflecting vector of the single RIS. Both the double-RIS and the single-RIS AO algorithms are developed on the basis of the first-order Taylor expansion and the Dinkelbach’s method, which allow us to approximate non-convex optimization problems by convex ones. Our results demonstrate that the proposed double-RIS scheme outperforms the single-RIS benchmark scheme in terms of its security.

25 August 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Minh-Sang Van NguyenMinh-Sang Van Nguyen
Minh-Sang Van Nguyen
DDDinh-Thuan Do
Dinh-Thuan Do
AVAlireza Vahid
Alireza Vahid
Sami MuhaidatSami Muhaidat
Sami Muhaidat
DSDouglas Sicker
Douglas Sicker
As potential solutions to empower transmissions among the Internet of Things (IoT) devices, ambient radio frequency (RF) backscatter technology and reconfigurable intelligent surfaces (RISs) have recently attracted a lot of attention. To improve energy and spectrum efficiency, we design a system with a transmit antenna selection (TAS)-aided base station (BS) relying on nonorthogonal multiple access (NOMA), RIS, and backscatter communications (BackCom) with robust transmission links, allowing more users to be served effectively. We adopt the two-user grouping model in the coverage of main BS associated with a particular RIS and interference from coordinate BS is also considered to showcase differences among the performance of the two different kinds of users (i.e., the IoT user with and the IoT user without a dedicated RIS). To exhibit the system performance, we derive closed-form expressions for two main system performance metrics, namely, outage probability and ergodic capacity. A degraded performance is also considered for the case of imperfect successive interference cancellation (SIC). The benefits of the BackCom RIS-aided NOMA system are then demonstrated by comparing its performance to that of traditional orthogonal multiple access (OMA) RIS-aided backscatter systems. We then introduce analytical models to characterize the impact of the main factors on the outage performance and characterize the optimal performance in specific cases. Together with extensive simulations, our analysis shows that the system performance can be adjusted by controlling factors, including power allocation coefficients, the number of metasurfaces of RIS, and target rates.

27 July 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AVAlireza Vahid
Alireza Vahid
RCRobert Calderbank
Robert Calderbank
We study the capacity region of two-user erasure interference channels with local delayed channel state information at the transmitters. In our model, transmitters have local mismatched outdated knowledge of the channel gains. We propose a transmission strategy that only relies on the delayed knowledge of the outgoing links at each transmitter and achieves the outer bound for the scenario in which transmitters learn the entire channel state with delay. Our result reveals the subset of the channel state information that affects the capacity region the most. We also identify cases in which local delayed knowledge of the channel state does not provide any gain over the zero knowledge assumption. To do so, we revisit a long-known intuition about interference channels that as long as the marginal distributions at the receivers are conserved, the capacity remains the same. We take this intuition and impose a certain spatial correlation among channel gains such that the marginal distributions remain unchanged. Then, we provide an outer bound on the capacity region of the channel with correlation that matches the capacity region when transmitters do not have access to channel state information.

31 January 2025 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
MMMobasshir Mahbub
Mobasshir Mahbub
MSMir Md. Saym
Mir Md. Saym
SJSarwar Jahan
Sarwar Jahan
APAnup Kumar Paul
Anup Kumar Paul
AVAlireza Vahid
Alireza Vahid
TTTarik Taleb
Tarik Taleb