Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pedro Enrique Iturria-Rivera has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Sum Secrecy Rate Maximization for Cascaded Far-to-Near-Field Communications

    by Tingnan Bao, Pedro Enrique Iturria-Rivera, Yigit Ozcan, Medhat Elsayed, Majid Bavand, Melike Erol-Kantarci

    This paper investigates secure communications in a reconfigurable intelligent surface (RIS)-assisted system with a movable pinching antenna (PA). A cascaded far-to-near-field architecture is considered, where the RIS controls far-field propagation and the waveguide-fed PA provides a relocatable near-field radiator. We maximize the sum secrecy rate by jointly optimizing base station (BS) beamforming, RIS phases, and PA position. To handle the resulting nonconvex and non-smooth problem, a damped alternating optimization (DAO) framework is proposed, which decomposes the problem into three tractable subproblems and ensures monotonic convergence via adaptive damping. Simulation results confirm that the DAO algorithm achieves significant secrecy rate improvements over benchmark schemes, demonstrating the effectiveness of joint far-to-near-field optimization for secure wireless communications.


  • Intelligent Discrete RIS Phase Configuration in Secure Non-Terrestrial Networks: A Heuristic Conditional GAN Approach

    by Tingnan Bao, Medhat Elsayed, Pedro Enrique Iturria-Rivera, Yigit Ozcan, Majid Bavand, Melike Erol-Kantarci

    This paper addresses the challenging problem of discrete phase configuration for reconfigurable intelligent surfaces (RISs) in secure non-terrestrial networks (NTNs). The combination of discrete hardware constraints and secrecy-driven objectives creates a highly non-convex and combinatorial optimization problem. To address this challenge, we propose a novel heuristic conditional generative adversarial network (cGAN) framework that enables efficient and secure RIS phase control through a data-driven approach. Our approach employs heuristic algorithms, such as greedy optimization, to generate high-quality training labels that guide the conditional learning process. To enable differentiable learning over discrete phase values, we integrate a Gumbel-Softmax-based quantization mechanism into the generator architecture. Additionally, we introduce a multi-sample inference and selection strategy that enhances generalization and stability by generating multiple candidate RIS configurations and selecting the optimal one based on secrecy rate maximization. Extensive simulation results demonstrate that the proposed framework achieves near-optimal secrecy rate performance while significantly reducing computational complexity and inference latency compared to exhaustive search and traditional greedy methods. The framework exhibits strong robustness across various channel conditions and quantization levels, confirming its practical viability for real-time applications. This work demonstrates the potential of integrating heuristic principles with generative learning for scalable and secure RIS configuration in dynamic NTN environments, thereby providing a foundation for future research in learning-based wireless optimization and intelligent network control.

  • Generative AI for Intent-Driven Network Management in 6G RAN: A Case Study on the Mamba Model

    by Arafat Habib, Medhat Elsayed, Yigit Ozcan, Pedro Enrique Iturria-Rivera, Majid Bavand, Melike Erol-Kantarci

    With the emergence of 6G, mobile networks are becoming increasingly heterogeneous and dynamic, necessitating advanced automation for efficient management. Intent-Driven Networks (IDNs) address this by translating high-level intents into optimization policies. Large Language Models (LLMs) can enhance this process by understanding complex human instructions, enabling adaptive and intelligent automation. Given the rapid advancements in Generative AI (GenAI), a comprehensive survey of LLM-based IDN architectures in disaggregated Radio Access Network (RAN) environments is both timely and critical. This article provides such a survey, along with a case study on a selective State-Space Model (SSM)-enabled IDN architecture that integrates GenAI across three key stages: intent processing, intent validation, and intent execution. For the first time in the literature, we propose a hierarchical framework built on Mamba-SSM that introduces GenAI across all stages of the IDN pipeline. We further present a case study demonstrating that the proposed Mamba architecture significantly improves network performance through intelligent automation, surpassing existing IDN approaches. In a multi-cell 5G/6G scenario, the proposed architecture reduces quality of service drift by up to 70%, improves throughput by up to 80 Mbps, and lowers inference time to 60–70 ms, outperforming GenAI, reinforcement learning, and non-machine learning baselines.


  • Hierarchical Decision Mamba Meets Agentic AI: A Novel Approach for RAN Slicing in 6G

    by Arafat Habib, Medhat Elsayed, Majid Bavand, Pedro Enrique Iturria Rivera, Yigit Ozcan, Melike Erol-Kantarci

    Radio Access Network (RAN) slicing enables multiple logical networks to exist on top of the same physical infrastructure by allocating resources to distinct service groups, where radio resource scheduling plays a key role in ensuring compliance with slice-specific Service-Level Agreements (SLAs). Existing configuration-based or intent-driven Reinforcement Learning (RL) approaches usually rely on static mappings and SLA conversions. The current literature does not integrate natural language understanding with coordinated decision-making. To address these limitations, we propose an Agentic AI framework for 6G RAN slicing, driven by a super agent built using Hierarchical Decision Mamba (HDM) controllers and a Large Language Model (LLM). The super agent interprets operator intents and translates them into actionable goals using the LLM, which are used by HDM to coordinate inter-slice, intra-slice, and self-healing agents. Compared to transformer-based and reward-driven baselines, the proposed Agentic AI framework demonstrates consistent improvements across key performance indicators, including higher throughput, improved cell-edge performance, and reduced latency across different slices.

  • GenAI-Enabled Residual Motion Estimation for Energy-Efficient Semantic Video Communication

    by Shavbo Salehi, Pedro Enrique Iturria-Rivera, Medhat Elsayed, Majid Bavand, Yigit Ozcan, Melike Erol-Kantarci

    Semantic communication addresses the limitations of the Shannon paradigm by focusing on transmitting meaning rather than exact representations, thereby reducing unnecessary resource consumption. This is particularly beneficial for video, which dominates network traffic and demands high bandwidth and power, making semantic approaches ideal for conserving resources while maintaining quality. In this paper, we propose a Predictability-aware and Entropy-adaptive Neural Motion Estimation (PENME) method to address challenges related to high latency, high bitrate, and power consumption in video transmission. PENME makes per-frame decisions to select a residual motion extraction model, convolutional neural network, vision transformer, or optical flow, using a five-step policy based on motion strength, global motion consistency, peak sharpness, heterogeneity, and residual error. The residual motions are then transmitted to the receiver, where the frames are reconstructed via motion-compensated updates. Next, a selective diffusion-based refinement, the Latent Consistency Model (LCM-4), is applied on frames that trigger refinement due to low predictability or large residuals, while predictable frames skip refinement. PENME also allocates radio resource blocks with awareness of residual motion and channel state, reducing power consumption and bandwidth usage while maintaining high semantic similarity. Our simulation results on the Vimeo90 K dataset demonstrate that the proposed PENME method handles various types of video, outperforming traditional communication, hybrid, and adaptive bitrate semantic communication techniques, achieving 40% lower latency, 90% less transmitted data, and 35% higher throughput. For semantic communication metrics, PENME improves peak signal-to-noise ratio (PSNR) by about 40%, increases multi-scale structural similarity (MS-SSIM) by roughly 19%, and reduces learned perceptual image patch similarity (LPIPS) by nearly 35%, compared with the baseline methods.

  • Open Access

    Explainable Multi-Agent Reinforcement Learning for Extended Reality Codec Adaptation

    by Pedro Enrique Iturria-Rivera, Raimundas Gaigalas, Medhat Elsayed, Majid Bavand, Yigit Ozcan, Melike Erol-Kantarci

    Extended Reality (XR) services are set to transform applications over 5th and 6th generation wireless networks, delivering immersive experiences. Concurrently, Artificial Intelligence (AI) advancements have expanded their role in wireless networks, however, trust and transparency in AI remain to be strengthened. Thus, providing explanations for AI-enabled systems can enhance trust. We introduce Value Function Factorization (VFF)-based Explainable (X) Multi-Agent Reinforcement Learning (MARL) algorithms, explaining reward design in XR codec adaptation through reward decomposition.We contribute four enhancements to XMARL algorithms. Firstly, we detail architectural modifications to enable reward decomposition in VFF-based MARL algorithms: Value Decomposition Networks (VDN), Mixture of Q-Values (QMIX), and Q-Transformation (Q-TRAN). Secondly, inspired by multi-task learning, we reduce the overhead of vanilla XMARL algorithms. Thirdly, we propose a new explainability metric, Reward Difference Fluctuation Explanation (RDFX), suitable for problems with adjustable parameters. Lastly, we propose adaptive XMARL, leveraging network gradients and reward decomposition for improved action selection. Simulation results indicate that, in XR codec adaptation, the Packet Delivery Ratio reward is the primary contributor to optimal performance compared to the initial composite reward, which included delay and Data Rate Ratio components. Modifications to VFF-based XMARL algorithms, incorporating multi-headed structures and adaptive loss functions, enable the best-performing algorithm, Multi-Headed Adaptive (MHA)-QMIX, to achieve significant average gains over the Adjust Packet Size baseline up to 10.7%, 41.4%, 33.3%, and 67.9% in XR index, jitter, delay, and Packet Loss Ratio (PLR), respectively.


  • Harnessing the Power of LLMs, Informers and Decision Transformers for Intent-Driven RAN Management in 6G

    by Arafat Habib, Pedro Enrique Iturria-Rivera, Yigit Ozcan, Medhat Elsayed, Majid Bavand, Raimundas Gaigalas, Melike Erol-Kantarci

    Intent-driven network management is critical for managing the complexity of 5G and 6G networks. It enables adaptive, on-demand management of the network based on the objectives of the network operators. In this paper, we propose an innovative three-step framework for intent-driven network management based on Generative AI (GenAI) algorithms. First, we fine-tune a Large Language Model (LLM) on a custom dataset using a Quantized Low-Rank Adapter (QLoRA) to enable memory-efficient intent processing within limited computational resources. A Retrieval Augmented Generation (RAG) module is included to support dynamic decision-making. Second, we utilize a transformer architecture for time series forecasting to predict key parameters, such as power consumption, traffic load, and packet drop rate, to facilitate intent validation proactively. Lastly, we introduce a Hierarchical Decision Transformer with Goal Awareness (HDTGA) to optimize the selection and orchestration of network apPlications in Radio Access Network (RAN). Our intent guidance and processing approach improves BERTScore by 6%, and the semantic similarity score by 9% compared to the base LLM model. Again, the proposed predictive intent validation approach can successfully rule out the performance-degrading intents with an average of 88% accuracy. Finally, compared to the baselines, the proposed HDTGA algorithm improves RAN performance by increasing throughput by at least 19.3%, reducing delay by 48.5%, and boosting energy efficiency by 54.9%.


  • Open Access

    Explainable Multi-Agent Reinforcement Learning for Extended Reality Codec Adaptation

    by Pedro Enrique Iturria-Rivera, Raimundas Gaigalas, Medhat Elsayed, Majid Bavand, Yigit Ozcan, Melike Erol-Kantarci

    Extended Reality (XR) services are set to transform applications over 5th and 6th generation wireless networks, delivering immersive experiences. Concurrently, Artificial Intelligence (AI) advancements have expanded their role in wireless networks, however, trust and transparency in AI remain to be strengthened. Thus, providing explanations for AI-enabled systems can enhance trust. We introduce Value Function Factorization (VFF)-based Explainable (X) Multi-Agent Reinforcement Learning (MARL) algorithms, explaining reward design in XR codec adaptation through reward decomposition. We contribute four enhancements to XMARL algorithms. Firstly, we detail architectural modifications to enable reward decomposition in VFF-based MARL algorithms: Value Decomposition Networks (VDN), Mixture of Q-Values (QMIX), and Q-Transformation (Q-TRAN). Secondly, inspired by multi-task learning, we reduce the overhead of vanilla XMARL algorithms. Thirdly, we propose a new explainability metric, Reward Difference Fluctuation Explanation (RDFX), suitable for problems with adjustable parameters. Lastly, we propose adaptive XMARL, leveraging network gradients and reward decomposition for improved action selection. Simulation results indicate that, in XR codec adaptation, the Packet Delivery Ratio reward is the primary contributor to optimal performance compared to the initial composite reward, which included delay and Data Rate Ratio components. Modifications to VFF-based XMARL algorithms, incorporating multi-headed structures and adaptive loss functions, enable the best-performing algorithm, Multi-Headed Adaptive (MHA)-QMIX, to achieve significant average gains over the Adjust Packet Size baseline up to 10.7%, 41.4%, 33.3%, and 67.9% in XR index, jitter, delay, and Packet Loss Ratio (PLR), respectively.

  • Open Access

    Meta-Bandit: Spatial Reuse Adaptation via Meta-Learning in Distributed Wi-Fi 802.11ax

    by Pedro Enrique Iturria-Rivera, Marcel Chenier, Bernard Herscovici, Burak Kantarci, Melike Erol-Kantarci

    IEEE 802.11ax introduces several amendments to previous standards with a special interest in spatial reuse (SR) to respond to dense user scenarios with high demanding services. In dynamic scenarios with more than one Access Point, the adjustment of joint Transmission Power (TP) and Clear Channel Assessment (CCA) threshold remains a challenge. With the aim of mitigating Quality of Service (QoS) degradation, we introduce a solution that builds on meta-learning and multi-arm bandits. Simulation results show that the proposed solution can adapt with an average of 1250 fewer environment steps and 72% average improvement in terms of fairness and starvation than a transfer learning baseline.


  • Deep Reinforcement Learning-Based Joint User Association and CU–DU Placement in O-RAN

    by Roghayeh Joda, Turgay Pamuklu, Pedro Enrique Iturria-Rivera, Melike Erol-Kantarci

    Open Radio Access Networks (O-RAN) architecture is based on disaggregation, virtualization, openness, and intelligence. These features allow the RAN network functions (NFs) to be split into Central Unit (CU), Distributed Unit (DU), and Radio Unit (RU); and deployed on open hardware and cloud nodes as Virtualized Network Functions (VNFs) or Containerized Network Functions (CNFs). In this paper, we propose strategies for the placement of CU and DU network functions in the regional and edge O-Cloud nodes while jointly associating the users to RUs. The aim is to minimize the end-to-end delay of users and minimize the cost of O-RAN deployment. Thus, we first formulate the end-to-end delay, the cost, and the constraints. We then model the problem as a multi-objective optimization problem The optimization formulation consists of a huge number of constraints and variables. To provide a solution to the problem, we develop the corresponding Markov Decision Problem (MDP) and propose a Deep Q-Network (DQN)-based algorithm. The simulation results demonstrate that our proposed scheme reduces the average user delay up to 40% and the deployment cost up to 20% with respect to our baselines.