VKVaishnavi Kasuluru

Vaishnavi Kasuluru

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Vaishnavi Kasuluru has a total of 4 co-authors. Here are the top co-authors by number of shared publications:

  • Engin Zeydan

    Centre Technologic de Telecomunicacions de Catalunya (CTTC/CERCA) Castelldefels 08860. Barcelona Spain

    3 shared publications
  • Luis Blanco

    Centre Technologic de Telecomunicacions de Catalunya (CTTC/CERCA) Castelldefels 08860. Barcelona Spain

    3 shared publications
  • Cristian J. Vaca-Rubio

    Centre Technologic de Telecomunicacions de Catalunya (CTTC/CERCA) Castelldefels 08860. Barcelona Spain

    2 shared publications
  • Miguel Angel Vazquez

    Centre Technologic de Telecomunicacions de Catalunya (CTTC/CERCA) Castelldefels 08860. Barcelona Spain

    1 shared publication

Latest Publications

  • Open Access

    Minimizing Power Consumption under SINR Constraints for Cell-Free Massive MIMO in O-RAN

    by Vaishnavi Kasuluru, Luis Blanco, Miguel Angel Vazquez, Cristian J. Vaca-Rubio, Engin Zeydan

    This paper deals with the problem of energy consumption minimization in Open RAN cell-free (CF) massive Multiple-Input Multiple-Output (mMIMO) systems under minimum per-user signal-to-noise-plus-interference ratio (SINR) constraints. Considering that several access points (APs) are deployed with multiple antennas, and they jointly serve multiple users on the same time-frequency resources, we design the precoding vectors that minimize the system power consumption, while preserving a minimum SINR for each user. We use a simple, yet representative, power consumption model, which consists of a fixed term that models the power consumption due to activation of the AP and a variable one that depends on the transmitted power. The mentioned problem boils down to a binary-constrained quadratic optimization problem, which is strongly non-convex. In order to solve this problem, we resort to a novel approach, which is based on the penalized convex-concave procedure. The proposed approach can be implemented in an O-RAN cell-free mMIMO system as an xApp in the near-real time RIC (RAN intelligent Controller). Numerical results show the potential of this approach for dealing with joint precoding optimization and AP selection.

  • Open Access

    On the Impact of PRB Load Uncertainty Forecasting for Sustainable Open RAN

    by Vaishnavi Kasuluru, Luis Blanco, Cristian J. Vaca-Rubio, Engin Zeydan

    The transition to sustainable Open Radio Access Network (O-RAN) architectures brings new challenges for resource management, especially in predicting the utilization of Physical Resource Block (PRB)s. In this paper, we propose a novel approach to characterize the PRB load using probabilistic forecasting techniques. First, we provide background information on the O-RAN architecture and components and emphasize the importance of energy/power consumption models for sustainable implementations. The problem statement highlights the need for accurate PRB load prediction to optimize resource allocation and power efficiency. We then investigate probabilistic forecasting techniques, including Simple-Feed-Forward (SFF), DeepAR, and Transformers, and discuss their likelihood model assumptions. The simulation results show that DeepAR estimators predict the PRBs with less uncertainty and effectively capture the temporal dependencies in the dataset compared to SFF- and Transformer-based models, leading to power savings. Different percentile selections can also increase power savings, but at the cost of over-/under provisioning. At the same time, the performance of the Long-Short Term Memory (LSTM) is shown to be inferior to the probabilistic estimators with respect to all error metrics. Finally, we outline the importance of probabilistic, prediction-based characterization for sustainable O-RAN implementations and highlight avenues for future research.

  • Open Access

    On the use of Probabilistic Forecasting for Network Analysis in Open RAN

    by Vaishnavi Kasuluru, Luis Blanco, Engin Zeydan

    Unlike other single-point Artificial Intelligence (AI)-based prediction techniques, such as Long-Short Term Memory (LSTM), probabilistic forecasting techniques (e.g., DeepAR and Transformer) provide a range of possible outcomes and associated probabilities that enable decision makers to make more informed and robust decisions. At the same time, the architecture of Open RAN has emerged as a revolutionary approach for mobile networks, aiming at openness, interoperability and innovation in the ecosystem of RAN. In this paper, we propose the use of probabilistic forecasting techniques as a radio App (rApp) within the Open RAN architecture. We investigate and compare different probabilistic and single-point forecasting methods and algorithms to estimate the utilization and resource demands of Physical Resource Blocks (PRBs) of cellular base stations. Through our evaluations, we demonstrate the numerical advantages of probabilistic forecasting techniques over traditional single-point forecasting methods and show that they are capable of providing more accurate and reliable estimates. In particular, DeepAR clearly outperforms single-point forecasting techniques such as LSTM and Seasonal-Naive (SN) baselines and other probabilistic forecasting techniques such as Simple-Feed-Forward (SFF) and Transformer neural networks.