ATAbbas Taherpour

Abbas Taherpour

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Abbas Taherpour has a total of 29 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Adaptive Learning for IRS-Assisted Wireless Networks: Securing Opportunistic Communications Against Byzantine Eavesdroppers

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab

    This article introduces a unified learning framework for Byzantine-resilient spectrum sensing and secure transmission in intelligent reflecting surface (IRS)-assisted networks under channel state information (CSI) uncertainty. The sensing module employs robust Bayesian belief updates with adversary-resistant aggregation and consensus, guaranteeing reliable primary user (PU) detection even when a bounded fraction of users are malicious. Based on the sensing outcome, the transmission module formulates the downlink design as a sum mean-squared error (MSE) minimization problem under transmit-power and signal-leakage constraints, jointly optimizing the base station (BS) precoder, IRS configuration, and user equalizers. For partial or known CSI, we develop a lightweight alternating optimization algorithm with provable sublinear convergence. For unknown CSI, we integrate constrained Bayesian optimization (BO) within a geometry-aware, low-dimensional latent space. Simulations demonstrate that the proposed framework achieves a higher probability of detection at a fixed false-alarm rate under adversarial attacks compared to state-of-the-art schemes. It also yields substantial reductions in user MSE, strong suppression of eavesdropper signal power, and fast convergence. This work provides a practical, resilient solution for coherent sensing–communication coordination in emerging sixth-generation (6G) applications such as vehicular, uncrewed aerial vehicle (UAV), and Internet of Things (IoT) networks.


  • Open Access

    Secure High-Resolution ISAC via Multi-Layer Intelligent Metasurfaces: A Layered Optimization Framework

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab

    Integrated sensing and communication (ISAC) has emerged as a pivotal technology for next-generation wireless networks, enabling simultaneous data transmission and environmental sensing. However, existing ISAC systems face fundamental limitations in achieving high-resolution sensing while maintaining robust communication security and spectral efficiency. This paper introduces a transformative approach leveraging stacked intelligent metasurfaces (SIM) to overcome these challenges. We propose a multi-functional SIM-assisted system that jointly optimizes communication secrecy and sensing accuracy through a novel layered optimization framework. Our solution employs a multi-objective optimization formulation that balances secrecy rate maximization with sensing error minimization under practical hardware constraints. The proposed layered block coordinate descent algorithm efficiently coordinates sensing configuration, secure beamforming, communication metasurface optimization, and resource allocation while ensuring robustness to channel uncertainties. Extensive simulations demonstrate significant performance gains over conventional approaches, achieving 32-61\% improvement in sensing accuracy and 15-35\% enhancement in secrecy rates while maintaining computational efficiency. This work establishes a new paradigm for secure and high-precision multi-functional wireless systems.

  • Open Access

    IRS-Assisted IoT Activity Detection Under Asynchronous Transmission and Heterogeneous Powers: Detectors and Performance Analysis

    by Amirhossein Taherpour, Somaye Khani, Abbas Taherpour, Tamer Khattab

    This article introduces a unified framework for activity detection in IRS-assisted IoT networks that simultaneously addresses three critical practical challenges: asynchronous transmissions, heterogeneous power levels used by devices to report their local observations, and signal blockage in dynamic environments. The system leverages an intelligent reflecting surface (IRS) to enhance detection reliability, with optional incorporation of a direct line-of-sight (LoS) path. Departing from conventional approaches that handle these challenges in isolation, we formulate a comprehensive detection problem as a binary hypothesis test and develop a structured hierarchy of four detectors: an optimal detector alongside three computationally efficient detectors designed for practical scenarios with different levels of prior knowledge about noise variance, channel state information (CSI), and device transmit powers. This hierarchical approach systematically bridges the gap between theoretical optimality and implementation practicality. For each detector, we derive closed-form expressions for both detection and false alarm probabilities, establishing theoretical performance benchmarks and revealing fundamental scaling laws. Extensive simulations validate our analytical results and extract actionable design guidelines by systematically evaluating the impact of key system parameters, including the number of antennas, samples, users, and IRS elements on detection performance, providing valuable insights for 6G IoT system designers. The proposed framework effectively bridges theoretical optimality with implementation practicality, providing a scalable solution for IRS-assisted IoT networks in emerging 6G systems.

  • Open Access

    Clustered Random Beamforming and Hierarchical Modulation for Large Multi-User MIMO Downlinks

    by Hamidreza Khakzad, Abbas Taherpour, Ahmed El Shafie, Tamer Khattab, Mazen Omar Hasna

    We propose a novel clustered random beamforming (RBF) scheme for multi-user multiple-input multiple-output (MIMO) downlink systems. The objective of this scheme is to maximize the number of served users while ensuring that each user meets a minimum quality of service (QoS) requirement. The system model comprises a base station (BS) equipped with multiple transmit antennas, serving multiple users. Hierarchical modulation (HM) is employed for each beam to improve spectral efficiency. To analyze the performance of the proposed scheme, we develop an analytical model by mapping the symbols of all users within a cluster onto different layers of a HM constellation. We demonstrate that the proposed scheme not only increases the number of served users but also enhances the sum-rate capacity of the system. Additionally, we discuss the selection of the optimal HM parameter based on predefined performance requirements, illustrated through a sample case. Simulation results indicate that the proposed hierarchical random beamforming (HRBF) scheme is highly promising for multi-user massive MIMO downlink systems, particularly in the context of 5G New Radio (NR) and future 6G networks and beyond.


  • Open Access

    Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab

    This paper presents a feature-based Partially Observable Markov Decision Process (POMDP) framework for quantum network routing, combining belief-state planning with Graph Neural Networks (GNNs) to address partial observability, decoherence, and scalability challenges in dynamic quantum systems. Our approach encodes complex quantum network dynamics, including entanglement degradation and time-varying channel noise, into a low-dimensional feature space, enabling efficient belief updates and scalable policy learning. The core of our framework is a hybrid GNN-POMDP architecture that processes graph-structured representations of entangled links to learn routing policies, coupled with a noise-adaptive mechanism that fuses POMDP belief updates with GNN outputs for robust decision making. We provide a theoretical analysis establishing guarantees for belief convergence, policy improvement, and robustness to noise. Experiments on simulated quantum networks with up to 100 nodes demonstrate significant improvements in routing fidelity and entanglement delivery rates compared to state-of-the-art baselines, particularly under high decoherence and nonstationary conditions.

  • Open Access

    RAPID Quantum Detection and Demodulation of Covert Communications: Breaking the Noise Limit with Solid-State Spin Sensors

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab

    We introduce a comprehensive framework for the detection and demodulation of covert electromagnetic signals using solid-state spin sensors. Our approach, named RAPID, is a two-stage hybrid strategy that leverages nitrogen-vacancy (NV) centers to operate below the classical noise floor employing a robust adaptive policy via imitation and distillation. We first formulate the joint detection and estimation task as a unified stochastic optimal control problem, optimizing a composite Bayesian risk objective under realistic physical constraints. The RAPID algorithm solves this by first computing a robust, non-adaptive baseline protocol grounded in the quantum Fisher information matrix (QFIM), and then using this baseline to warm-start an online, adaptive policy learned via deep reinforcement learning (Soft Actor-Critic). This method dynamically optimizes control pulses, interrogation times, and measurement bases to maximize information gain while actively suppressing non-Markovian noise and decoherence. Numerical simulations demonstrate that the protocol achieves a significant sensitivity gain over static methods, maintains high estimation precision in correlated noise environments, and, when applied to sensor arrays, enables coherent quantum beamforming that achieves Heisenberg-like scaling in precision. This work establishes a theoretically rigorous and practically viable pathway for deploying quantum sensors in security-critical applications such as electronic warfare and covert surveillance.

  • Open Access

    Adaptive Learning for IRS-Assisted Wireless Networks: Securing Opportunistic Communications Against Byzantine Eavesdroppers

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab

    We propose a joint learning framework for Byzantine-resilient spectrum sensing and secure intelligent reflecting surface (IRS)--assisted opportunistic access under channel state information (CSI) uncertainty. The sensing stage performs logit-domain Bayesian updates with trimmed aggregation and attention-weighted consensus, and the base station (BS) fuses network beliefs with a conservative minimum rule, preserving detection accuracy under a bounded number of Byzantine users. Conditioned on the sensing outcome, we pose downlink design as sum mean-squared error (MSE) minimization under transmit-power and signal-leakage constraints and jointly optimize the BS precoder, IRS phase shifts, and user equalizers. With partial (or known) CSI, we develop an augmented-Lagrangian alternating algorithm with projected updates and provide provable sublinear convergence, with accelerated rates under mild local curvature. With unknown CSI, we perform constrained Bayesian optimization (BO) in a geometry-aware low-dimensional latent space using Gaussian process (GP) surrogates; we prove regret bounds for a constrained upper confidence bound (UCB) variant of the BO module, and demonstrate strong empirical performance of the implemented procedure. Simulations across diverse network conditions show higher detection probability at fixed false-alarm rate under adversarial attacks, large reductions in sum MSE for honest users, strong suppression of eavesdropper signal power, and fast convergence. The framework offers a practical path to secure opportunistic communication that adapts to CSI availability while coherently coordinating sensing and transmission through joint learning.

  • Open Access

    Large Array Antenna Spectrum Sensing in Cognitive Radio Networks

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab, Xiaodong Wang

    We investigate spectrum sensing in cognitive radios with large antenna arrays. Gigantic MIMO and extra-large array antennas are fundamental technologies in 5G and future 6G networks, as well as other wireless networks like Wi-Fi. In conventional multiple antenna spectrum sensing, the likelihood ratio test is standard when samples outnumber antennas. It relies on covariance matrix estimates from the sample covariance matrix and its eigenvalues. However, in large array contexts where the number of antennas matches or exceeds the number of samples, the likelihood ratio test falters due to challenges in accurately estimating the covariance matrix from the sample covariance matrix. To address this limitation, we propose and derive three detectors based on linear spectral statistics from random matrix theory: the generalized likelihood ratio, Frobenius norm, and Rao tests, similar to conventional multiple antenna spectrum sensing. We compute the Gaussian distribution of these detectors under the noise-only hypothesis using the central limit theorem for high-dimensional random matrices. Performance evaluation examines how antenna and sample numbers influence outcomes, as confirmed by simulation outcomes. Our results illustrate the effectiveness of the proposed detectors in various real-world situations, encompassing correlated or uncalibrated antennas in networks featuring large array antennas. These detectors exhibit notable benefits, including decreased average signal-to-noise ratio and enhanced detection probability. Their versatility extends to multiple domains, including gigantic MIMO wireless communications, radar systems, and astronomical observations.


  • Open Access

    Opportunistic Throughput Optimization in Energy Harvesting Dynamic Spectrum Sharing Wireless Networks

    by Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab, Mohamed Abdallah

    We investigate opportunistic transmissions in a time-slotted wireless network, emphasizing constraints arising from finite durations allocated to various network operations and the availability of energy for these operations. Each time frame (time slot) comprises three sub-frames: sensing, reporting, and either transmission or energy harvesting based on the presence or absence of the primary user. We assume a fixed duration for the transmission sub-frame within each time frame. Utilizing a time division multiple access (TDMA) protocol, we manage local sensing data reporting within each time frame; consequently, the reporting time is contingent on the number of users. As a result, with the total time allocated for sensing and reporting being fixed, a trade-off arises between the number of collaborating users and the number of samples. Additionally, energy limitations and causality lead to two scenarios for wireless network operation: energy-deficit and energy-surplus regimes. To address this complexity, we formulate an optimization problem aimed at maximizing overall network throughput while considering constraints imposed by finite durations for various network operations and energy availability. We provide analytical evidence of the convexity of the optimization problem in both energy-deficit and energy-surplus scenarios. Furthermore, we propose two algorithms designed to achieve optimal throughput for each scenario. The accuracy of our analyses is validated through Monte Carlo simulations. Numerical results demonstrate the effectiveness of our proposed approach.


  • Improving Secrecy Rate and Social Welfare by NOMA Technique in D2D Communications Network

    by Maryam Alibeigi, Abbas Taherpour, Saeed Gazor

    We investigate the advantage of employing the non-orthogonal multiple access (NOMA) in device-to-device (D2D) communications, where D2D pairs are clustered with content demanders. We show that the physical layer security of D2D users who require protection against eavesdropping is improved by employing this NOMA D2D scheme. Moreover, the additional demanders obtain their desired content by participating in a suitable cluster. Hence, we solve this win-win collaborative problem by maximizing the social welfare of the network through in order to optimize user clusters and to assign powers. This optimization turns out to be a mixed-integer non-convex problem. As remedy, we split the original problem into two subproblems. We solve the user clustering subproblem first by using two-sided one-to-one matching theory. Then using the user clustering results, we propose a suboptimal efficient algorithm to solve the power assignment subproblem, which is a non-convex polynomial fractional programming. Our extensive simulations confirm significant advantages our proposed approach.