Rahman Doost-Mohammady

Rahman Doost-Mohammady

Auto-generated profile, based on publicly available information

Rahman Doost-Mohammady

Department of Electrical and Computer Engineering, Rice University, Houston, TX, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
11 September 2023 in IEEE Transactions on Machine Learning in Communications and Networking
Verified
Journal Article
Open access
QAQing An
Qing An
SSSantiago Segarra
Santiago Segarra
CDChris Dick
Chris Dick
ASAshutosh Sabharwal
Ashutosh Sabharwal
RDRahman Doost-Mohammady
Rahman Doost-Mohammady
The large number of antennas in massive MIMO systems allows the base station to communicate with multiple users at the same time and frequency resource with multi-user beamforming. However, highly correlated user channels could drastically impede the spectral efficiency that multi-user beamforming can achieve. As such, it is critical for the base station to schedule a suitable group of users in each time and frequency resource block to achieve maximum spectral efficiency while adhering to fairness constraints among the users. In this paper, we consider the resource scheduling problem for massive MIMO systems with its optimal solution known to be NP-hard. Inspired by recent achievements in deep reinforcement learning (DRL) to solve problems with large action sets, we propose SMART, a dynamic scheduler for massive MIMO based on the state-of-the-art Soft Actor-Critic (SAC) DRL model and the K-Nearest Neighbors (KNN) algorithm. Through comprehensive simulations using realistic massive MIMO channel models as well as real-world datasets from channel measurement experiments, we demonstrate the effectiveness of our proposed model in various channel conditions. Our results show that our proposed model performs very close to the optimal proportionally fair (Opt-PF) scheduler in terms of spectral efficiency and fairness with more than one order of magnitude lower computational complexity in medium network sizes where Opt-PF is computationally feasible. Our results also show the feasibility and high performance of our proposed scheduler in networks with a large number of users and resource blocks.

1 June 2011
Verified
Conference Paper
Closed access
KCKaushik Chowdhury
Kaushik Chowdhury
RDRahman Doost-Mohammady
Rahman Doost-Mohammady
WMWaleed Meleis
Waleed Meleis
MFMarco Di Felice
Marco Di Felice
Luciano BononiLuciano Bononi
Luciano Bononi
Cognitive radio (CR) ad hoc networks are composed of wireless nodes that may opportunistically transmit in licensed frequency bands without affecting the primary users of that band. In such distributed networks, gathering the spectrum information is challenging as the nodes have a partial view of the spectrum environment based on the local sensing range. Moreover, individual measurements are also affected by channel uncertainties and location-specific fluctuations in signal strength. To facilitate the distributed operation, this paper makes the following contributions: (i) First, an experimental study is undertaken to measure the signal characteristics for indoor and outdoor locations for the TV channels 21 - 51, and these results are used to identify the conditions under which nodes may share information. (ii) Second, a Cooperative reinforcement LearnIng scheme for Cognitive radio networKs (CLICK) is designed for combining the spectrum usage information observed by a node and its neighbors. (iii) Finally, CLICK is integrated within a MAC protocol for testing the benefits and overhead of our approach on a higher layer protocol performance. The proposed learning framework and the protocol design are extensively evaluated through a thorough simulation study in ns-2 using experimental traces of channel measurements.

19 June 2020
Verified
Conference Paper
Open access
CSClayton Shepard
Clayton Shepard
JBJosh Blum
Josh Blum
RGRyan E. Guerra
Ryan E. Guerra
RDRahman Doost-Mohammady
Rahman Doost-Mohammady
LZLin Zhong
Lin Zhong
Massive-MIMO technology promises many-fold improvement in the capacity of wireless mobile networks by scaling up the number of base station antennas. Hence, it has become a key technology for upcoming fifth generation (5G) mobile networks. Previous work has mainly focused on building proof-of-concept systems to show the feasibility of massive-MIMO and its benefits. However, much work remains to demonstrate the performance of massive-MIMO in at-scale dense deployments. In this paper, we present our experience in building ArgosNet, a scalable multi-cell campus-wide massive-MIMO testbed. The goal of ArgosNet is to provide scalability, programmability, and ease of deployment for this technology in realistic large-scale environments. We present the design choices we made in architecting ArgosNet and provide details in how they helped us achieve these goals. By characterizing the performance of major components, we discuss how ArgosNet unlocks our ability to do research that is not possible with existing systems.

25 November 2024 in Proceedings of the ACM on Networking
Verified
Journal Article
Open access
QAQing An
Qing An
DPDivyanshu Pandey
Divyanshu Pandey
RDRahman Doost-Mohammady
Rahman Doost-Mohammady
ASAshutosh Sabharwal
Ashutosh Sabharwal
SSSrinivas Shakkottai
Srinivas Shakkottai
An important aspect of 5G networks is the development of Radio Access Network (RAN) slicing, a concept wherein the virtualized infrastructure of wireless networks is subdivided into slices (or enterprises), tailored to fulfill specific use-cases. A key focus in this context is the efficient radio resource allocation to meet various enterprises' service-level agreements (SLAs). In this work, we introduce Helix: a channel-aware and SLA-aware RAN slicing framework for massive multiple input multiple output (MIMO) networks where resource allocation extends to incorporate the spatial dimension available through beamforming. Essentially, the same time-frequency resource block (RB) can be shared across multiple users through multiple antennas. Notably, certain enterprises, particularly those operating critical infrastructure, necessitate dedicated RB allocation, denoted as private networks, to ensure security. Conversely, some enterprises would allow resource sharing with others in the public network to maintain network performance while minimizing capital expenditure. Building upon this understanding, Helix comprises scheduling schemes under both scenarios: where different slices share the same set of RBs, and where they require exclusivity of allocated RBs. We validate the efficacy of our proposed schedulers through simulation by utilizing a channel data set collected from a real-world massive MIMO testbed. Our assessments demonstrate that resource sharing across slices using our approach can lead up to 60.9% reduction in RB usage compared to other approaches. Moreover, our proposed schedulers exhibit significantly enhanced operational efficiency, with significantly faster running time compared to exhaustive greedy approaches while meeting the stringent 5G sub-millisecond-level latency requirement.

2 October 2023
Verified
Conference Paper
Open access
ZLZhecun Liu
Zhecun Liu
KDKeerthi Priya Dasala
Keerthi Priya Dasala
DMDi Mu
Di Mu
RDRahman Doost-Mohammady
Rahman Doost-Mohammady
EKEdward W. Knightly
Edward W. Knightly
Wireless channels are vulnerable to eavesdroppers due to their broadcast nature. One approach to thwart an eavesdropper (Eve) is to decrease her SNR, e.g., by reducing the signal in her direction. Unfortunately, such methods are vulnerable to (1) a highly directional Eve that can increase her received signal strength and (2) Eve that is close to the receiver, Bob, or close to the transmitter, Alice. In this paper, we design and experimentally evaluate Multipath Multicarrier Misinformation to Adversaries (M3A), a system for Alice to send data to Bob while simultaneously sending misinformation to Eve. Our approach does not require knowledge of Eve's channel or location and, with multipath channels, randomly transforms Eve's symbols even if Eve is located one wavelength-scale distance from Bob (approximately 10 cm) or if Eve is located between Alice and Bob in their direct path (Eve is approximately 1/3 closer to Alice). In particular, our approach is to move each of Eve's received symbols (over time and across subcarriers), to an independently random transformation as compared to Bob, without Alice or Bob knowing Eve's location or channel. We realize this by modulating Alice's per-subcarrier beamforming weights with an i.i.d. random binary sequence, as if Alice had a separate antenna array for each subcarrier, and could randomly turn antennas in each array on and off. We implement M3A on a real-time Massive MIMO testbed and show that M3A can increase Eve's bit error rate more than two hundredfold compared to beamforming, even if she is positioned approximately a wavelength away, whether above, below, or beside Bob. Finally, to ensure reliability at Bob, we show that with M3A, Bob's bit error rate is approximately an order of magnitude lower than achieved with prior work.

4 December 2024
Verified
Conference Paper
Open access
QAQing An
Qing An
RDRahman Doost-Mohammady
Rahman Doost-Mohammady
RYRoy Yang
Roy Yang
KSKamakshi Sridhar
Kamakshi Sridhar
In the rapidly evolving field of wireless communication, Multiple Input Multiple Output (MIMO) networks have emerged as a pivotal technology, offering enhanced data rates and spectral efficiency by leveraging multiple antennas at both the transmitter and receiver. The introduction of Open Radio Access Network (O-RAN) architecture has further revolutionized this domain, enabling greater flexibility, scalability, and interoperability through its open interfaces and software-defined approach. This paper presents DRAGON, a novel Deep Reinforcement Learning (DRL)-based framework for joint Layer and Modulation and Coding Scheme (MCS) selection, tailored for downlink single-user MIMO networks under the O-RAN framework. Our approach is designed to be highly scalable, capable of efficiently managing a large number of configuration options in one-shot prediction, including up to 25 MCS and 4 layer choices. The proposed solution has been rigorously evaluated using an O-RAN-based simulation environment, demonstrating up to an 18% performance improvement over the state-of-the-art (SOTA) methods and achieving a best throughput of 87.4% when compared to the collected ground-truth dataset. Furthermore, our method supports real-time prediction, making it viable for practical deployment. In addition to these advancements, we explore the potential integration of our DRL-based solution with real-world platforms and discuss the extension of our approach to handle multi-user (MU) MIMO scenarios, paving the way for broader applications in next-generation wireless networks.