Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Shahram Mollahasani has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Multi-Agent Team Learning in Virtualized Open Radio Access Networks (O-RAN)

    by Pedro Enrique Iturria-Rivera, Han Zhang, Hao Zhou, Shahram Mollahasani, Melike Erol-Kantarci

    Starting from the concept of the Cloud Radio Access Network (C-RAN), continuing with the virtual Radio Access Network (vRAN) and most recently with the Open RAN (O-RAN) initiative, Radio Access Network (RAN) architectures have significantly evolved in the past decade. In the last few years, the wireless industry has witnessed a strong trend towards disaggregated, virtualized and open RANs, with numerous tests and deployments worldwide. One unique aspect that motivates this paper is the availability of new opportunities that arise from using machine learning, more specifically multi-agent team learning (MATL), to optimize the RAN in a closed-loop where the complexity of disaggregation and virtualization makes well-known Self-Organized Networking (SON) solutions inadequate. In our view, Multi-Agent Systems (MASs) with MATL can play an essential role in the orchestration of O-RAN controllers, i.e., near-real-time and non-real-time RAN Intelligent Controllers (RIC). In this article, we first provide an overview of the landscape in RAN disaggregation, virtualization and O-RAN, then we present the state-of-the-art research in multi-agent systems and team learning as well as their application to O-RAN. We present a case study for team learning where agents are two distinct xApps: power allocation and radio resource allocation. We demonstrate how team learning can enhance network performance when team learning is used instead of individual learning agents. Finally, we identify challenges and open issues to provide a roadmap for researchers in the area of MATL based O-RAN optimization.


  • Open Access

    Energy-Aware Dynamic DU Selection and NF Relocation in O-RAN Using Actor–Critic Learning

    by Shahram Mollahasani, Turgay Pamuklu, Rodney Wilson, Melike Erol-Kantarci

    Open radio access network (O-RAN) is one of the promising candidates for fulfilling flexible and cost-effective goals by considering openness and intelligence in its architecture. In the O-RAN architecture, a central unit (O-CU) and a distributed unit (O-DU) are virtualized and executed on processing pools of general-purpose processors that can be placed at different locations. Therefore, it is challenging to choose a proper location for executing network functions (NFs) over these entities by considering propagation delay and computational capacity. In this paper, we propose a Soft Actor–Critic Energy-Aware Dynamic DU Selection algorithm (SA2C-EADDUS) by integrating two nested actor–critic agents in the O-RAN architecture. In addition, we formulate an optimization model that minimizes delay and energy consumption. Then, we solve that problem with an MILP solver and use that solution as a lower bound comparison for our SA2C-EADDUS algorithm. Moreover, we compare that algorithm with recent works, including RL- and DRL-based resource allocation algorithms and a heuristic method. We show that by collaborating A2C agents in different layers and by dynamic relocation of NFs, based on service requirements, our schemes improve the energy efficiency by 50% with respect to other schemes. Moreover, we reduce the mean delay by a significant amount with our novel SA2C-EADDUS approach.


  • Open Access

    Cost-Optimized Microgrid Coalitions Using Bayesian Reinforcement Learning

    by Mohammad Sadeghi, Shahram Mollahasani, Melike Erol-Kantarci

    Microgrids are empowered by the advances in renewable energy generation, which enable the microgrids to generate the required energy for supplying their loads and trade the surplus energy to other microgrids or the macrogrid. Microgrids need to optimize the scheduling of their demands and energy levels while trading their surplus with others to minimize the overall cost. This can be affected by various factors such as variations in demand, energy generation, and competition among microgrids due to their dynamic nature. Thus, reaching optimal scheduling is challenging due to the uncertainty caused by the generation/consumption of renewable energy and the complexity of interconnected microgrids and their interplay. Previous works mainly rely on modeling-based approaches and the availability of precise information on microgrid dynamics. This paper addresses the energy trading problem among microgrids by minimizing the cost while uncertainty exists in microgrid generation and demand. To this end, a Bayesian coalitional reinforcement learning-based model is introduced to minimize the energy trading cost among microgrids by forming stable coalitions. The results show that the proposed model can minimize the cost up to 23% with respect to the coalitional game theory model.


  • Open Access

    Energy-Efficient and Delay-Guaranteed Joint Resource Allocation and DU Selection in O-RAN

    by Turgay Pamuklu, Shahram Mollahasani, Melike Erol-Kantarci

    The radio access network (RAN) part of the next-generation wireless networks will require efficient solutions for satisfying low latency and high-throughput services. The open RAN (O-RAN) is one of the candidates to achieve this goal, in addition to increasing vendor diversity and promoting openness. In the O-RAN architecture, network functions are executed in central units (CU), distributed units (DU), and radio units (RU). These entities are virtualized on general-purpose CPUs and form a processing pool. These processing pools can be located in different geographical places and have limited capacity, affecting the energy consumption and the performance of networks. Additionally, since user demand is not deterministic, special attention should be paid to allocating resource blocks to users by ensuring their expected quality of service for latency-sensitive traffic flows. In this paper, we propose a joint optimization solution to enhance energy efficiency and provide delay guarantees to the users in the O-RAN architecture. We formulate this novel problem and linearize it to provide a solution with a mixed-integer linear problem (MILP) solver. We compare this with a baseline that addresses this optimization problem using a disjoint approach. The results show that our approach outperforms the baseline method in terms of energy efficiency.


  • Open Access

    Multi Agent Team Learning in Disaggregated Virtualized Open Radio Access Networks (O-RAN)

    by Pedro Enrique Iturria Rivera, Shahram Mollahasani, Melike Erol-Kantarci

    Starting from the Cloud Radio Access Network (C-RAN), continuing with the virtual Radio Access Network (vRAN) and most recently with Open RAN (O-RAN) initiative, Radio Access Network (RAN) architectures have significantly evolved in the past decade. In the last few years, the wireless industry has witnessed a strong trend towards disaggregated, virtualized and open RANs, with numerous tests and deployments world wide. One unique aspect that motivates this paper is the availability of new opportunities that arise from using machine learning to optimize the RAN in closed-loop, i.e. without human intervention, where the complexity of disaggregation and virtualization makes well-known Self-Organized Networking (SON) solutions inadequate. In our view, Multi-Agent Systems (MASs) with team learning, can play an essential role in the control and coordination of controllers of O-RAN, i.e. near-real-time and non-real-time RAN Intelligent Controller (RIC). In this article, we first present the state-of-the-art research in multi-agent systems and team learning, then we provide an overview of the landscape in RAN disaggregation and virtualization, as well as O-RAN which emphasizes the open interfaces introduced by the O-RAN Alliance. We present a case study for agent placement and the AI feedback required in O-RAN, and finally, we identify challenges and open issues to provide a roadmap for researchers.

  • Open Access

    Power Loss-Aware Transactive Microgrid Coalitions under Uncertainty

    by Mohammad Sadeghi, Shahram Mollahasani, Melike Erol-Kantarci

    Peer-to-peer energy trading within microgrid (MG) communities emerges as a key enabler of the future transactive distribution system and the transactive electricity market. Energy trading within MGs refers to the idea that the surplus energy of one MG can be used to satisfy the demand of another MG or a group of MGs that form an MG community. These communities can be dynamically established through time, based on the variations of demand and supply of the interconnected MGs. In many modern MGs, Electric Vehicles (EVs) have been considered as a viable storage option due to their ease of use (plug-and-play) and their growing adoption rates by drivers. On the other hand, the dynamic nature of EVs escalates the uncertainty in the transactive distribution system. In this paper, we study the problem of energy trading among MGs and EVs with the aim of power loss minimization where there is uncertainty. We propose a novel Bayesian Coalition Game (BCG) based algorithm, which allows the MGs and EVs to reduce the overall power loss by allowing them to form coalitions intelligently. The proposed scheme is compared with a conventional coalitional game theory-based approach and a Q-learning based approach. Our results show significant improvement over other compared techniques.


  • Density-aware mobile networks: Opportunities and challenges

    by Shahram Mollahasani, Alperen Eroğlu, Ilker Demirkol, Ertan Onur


  • Open Access

    Density-Aware, Energy- and Spectrum-Efficient Small Cell Scheduling

    by Shahram Mollahasani, Ertan Onur

    Future mobile networks have to be densified by employing small cells to handle the upsurge in traffic load. Although the amount of energy each small cell consumes is low, the total energy consumption of a large-scale network may be enormous. To enhance energy efficiency, we have to adapt the number of active base stations to the offered traffic load. Deactivating base stations may cause coverage holes, degrade quality of service and throughput while redundant base stations waste energy. That is why we have to adapt the network to the effective density. In this paper, we show that achieving an optimal solution for adapting density of base stations to the demand is NP-hard. We propose a solution that consists of two heuristic algorithms: a base station density adaptation algorithm and a cell-zooming algorithm that determines which base stations must be kept active and adapts transmit power of base stations to enhance throughput, energy and spectral efficiency. We employ multi-access edge cloud for taking a snapshot of the network state in nearly real time with a wider perspective and for collecting network state over a large area. We show that the proposed algorithm conserves energy up to 12% while the spectral efficiency and network throughput can be enhanced up to 30% and 26% in comparison with recent works, respectively.


  • Density-aware power allocation in mobile networks using edge computing

    by Shahram Mollahasani, Ertan Onur

    While the main concern in mobile networks was increasing network capacity and expanding coverage in the past, green operation have recently become a major concern. To conserve energy in mobile networks, we employ mobile edge computing to access real-time data and offload processing tasks to the edges for reducing complexity and latency. An edge cloud has a larger view of the network than a base station. Therefore, it can evaluate the probability of coverage by considering the density of base stations to enhance the overall system throughput while preventing coverage holes. This may enhance user experience and decrease response time in the network. We propose a density-adaptive power control algorithm that reduces energy consumption in an LTE network and improves the mean throughput. We show how power allocation and interference may affect system performance. The simulation results show that the proposed algorithm can reduce the energy wastage up to 67% in comparison with the basic model (without any power allocation model) and 28% in comparison with a recent work while the mean throughput can be improved by 22%.


    • 30 October 2017

    10 Simulators, Testbeds, and Prototypes of 5G Mobile Networking Architectures

    by Shahram Mollahasani, Alperen Ero{\u{G}}Lu, {\"o}Mer Yama{\c{C}}, Ertan Onur