Bitmask Dynamic Programming for User Scheduling in Multi-User MIMO mmWave Systems

Thuan Van Le; Kyungchun Lee; Nguyen Cong Luong

doi:10.1109/LCOMM.2023.3327764

Bitmask Dynamic Programming for User Scheduling in Multi-User MIMO mmWave Systems

Thuan Van Le, Kyungchun Lee, Nguyen Cong Luong

Dept. of Electrical and Information Engineering

Phenikaa University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

In this work, we propose a novel bitmask dynamic programming (BDP) algorithm for user scheduling in multi-user mmWave systems. Unlike traditional greedy schemes that provide suboptimal solutions, the proposed BDP algorithm aims to find the optimal solution for maximizing the sum of the proportional fair-metric (PF-metric) problem. Simulation results demonstrate that the BDP algorithm outperforms the greedy schemes in terms of sum throughput and system fairness. The computational complexity of the proposed BDP algorithm is further analyzed, and simulation results show that its computational complexity remains favorable even with the increase in the number of mobile stations (MSs).

Original language	English
Pages (from-to)	3365-3369
Number of pages	5
Journal	IEEE Communications Letters
Volume	27
Issue number	12
DOIs	https://doi.org/10.1109/LCOMM.2023.3327764
State	Published - 1 Dec 2023

Keywords

Bitmask dynamic programming
adaptive perturbation
mmWave systems
opportunistic hybrid beamforming
user scheduling

Access to Document

10.1109/LCOMM.2023.3327764

Cite this

@article{43896a4d08394bc7b9fe7dbba35b2b84,

title = "Bitmask Dynamic Programming for User Scheduling in Multi-User MIMO mmWave Systems",

abstract = "In this work, we propose a novel bitmask dynamic programming (BDP) algorithm for user scheduling in multi-user mmWave systems. Unlike traditional greedy schemes that provide suboptimal solutions, the proposed BDP algorithm aims to find the optimal solution for maximizing the sum of the proportional fair-metric (PF-metric) problem. Simulation results demonstrate that the BDP algorithm outperforms the greedy schemes in terms of sum throughput and system fairness. The computational complexity of the proposed BDP algorithm is further analyzed, and simulation results show that its computational complexity remains favorable even with the increase in the number of mobile stations (MSs).",

keywords = "Bitmask dynamic programming, adaptive perturbation, mmWave systems, opportunistic hybrid beamforming, user scheduling",

author = "Le, \{Thuan Van\} and Kyungchun Lee and \{Cong Luong\}, Nguyen",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2023",

month = dec,

day = "1",

doi = "10.1109/LCOMM.2023.3327764",

language = "English",

volume = "27",

pages = "3365--3369",

journal = "IEEE Communications Letters",

issn = "1089-7798",

number = "12",

}

TY - JOUR

T1 - Bitmask Dynamic Programming for User Scheduling in Multi-User MIMO mmWave Systems

AU - Le, Thuan Van

AU - Lee, Kyungchun

AU - Cong Luong, Nguyen

PY - 2023/12/1

Y1 - 2023/12/1

N2 - In this work, we propose a novel bitmask dynamic programming (BDP) algorithm for user scheduling in multi-user mmWave systems. Unlike traditional greedy schemes that provide suboptimal solutions, the proposed BDP algorithm aims to find the optimal solution for maximizing the sum of the proportional fair-metric (PF-metric) problem. Simulation results demonstrate that the BDP algorithm outperforms the greedy schemes in terms of sum throughput and system fairness. The computational complexity of the proposed BDP algorithm is further analyzed, and simulation results show that its computational complexity remains favorable even with the increase in the number of mobile stations (MSs).

AB - In this work, we propose a novel bitmask dynamic programming (BDP) algorithm for user scheduling in multi-user mmWave systems. Unlike traditional greedy schemes that provide suboptimal solutions, the proposed BDP algorithm aims to find the optimal solution for maximizing the sum of the proportional fair-metric (PF-metric) problem. Simulation results demonstrate that the BDP algorithm outperforms the greedy schemes in terms of sum throughput and system fairness. The computational complexity of the proposed BDP algorithm is further analyzed, and simulation results show that its computational complexity remains favorable even with the increase in the number of mobile stations (MSs).

KW - Bitmask dynamic programming

KW - adaptive perturbation

KW - mmWave systems

KW - opportunistic hybrid beamforming

KW - user scheduling

UR - https://www.scopus.com/pages/publications/85180345783

U2 - 10.1109/LCOMM.2023.3327764

DO - 10.1109/LCOMM.2023.3327764

M3 - Article

AN - SCOPUS:85180345783

SN - 1089-7798

VL - 27

SP - 3365

EP - 3369

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 12

ER -

Bitmask Dynamic Programming for User Scheduling in Multi-User MIMO mmWave Systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this