Shahram Mollahasani

Dr. Shahram Mollahasani

University of Ottawa
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
19 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
Pedro Enrique Iturria RiveraPedro Enrique Iturria Rivera
Pedro Enrique Iturria Rivera
HZHan Zhang
Han Zhang
HZHao Zhou
Hao Zhou
Shahram MollahasaniShahram Mollahasani
Shahram Mollahasani
Melike Erol-KantarciMelike Erol-Kantarci
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.

1 October 2021
Verified
Conference Paper
Open access
Turgay PamukluTurgay Pamuklu
Turgay Pamuklu
Shahram MollahasaniShahram Mollahasani
Shahram Mollahasani
Melike Erol-KantarciMelike Erol-Kantarci
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.

3 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
Shahram MollahasaniShahram Mollahasani
Shahram Mollahasani
Turgay PamukluTurgay Pamuklu
Turgay Pamuklu
RWRodney Wilson
Rodney Wilson
Melike Erol-KantarciMelike Erol-Kantarci
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.

1 April 2016
Verified
Conference Paper
Closed access
Shahram MollahasaniShahram Mollahasani
Shahram Mollahasani
EOErtan Onur
Ertan Onur
Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in a data center as a complementary technology, the performance of the data center can be enhanced and substantial savings in cabling costs can be achieved without any throughput concession. Terahertz (THz) band can overcome bandwidth limitations and satisfy a wide range of applications from classical networking to board-to-board communication. In this paper, we evaluate the terahertz channel in data centers by considering atmospheric absorption. Based on the results, we recommend employing 190-310 GHz range with a bandwidth of 120 GHz. Keeping the relative humidity level at 40% will reduce atmospheric absorption while proving a healthy environmental regime for the equipment in a data center.

20 May 2019 in IEEE Access
Verified
Journal Article
Open access
Shahram MollahasaniShahram Mollahasani
Shahram Mollahasani
EOErtan Onur
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.

1 July 2020 in Computer Networks
Verified
Journal Article
Closed access
Shahram MollahasaniShahram Mollahasani
Shahram Mollahasani
AEAlperen Eroğlu
Alperen Eroğlu
IDIlker Demirkol
Ilker Demirkol
EOErtan Onur
Ertan Onur