Opportunistic Scheduling Using Statistical Information of Wireless Channels

被引:1
作者
Gu, Zhouyou [1 ]
Hardjawana, Wibowo [1 ]
Vucetic, Branka [1 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
基金
澳大利亚研究理事会;
关键词
Opportunistic scheduling; max-weight schedulers; optimization; FRAMEWORK; FAIRNESS;
D O I
10.1109/TWC.2024.3366402
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper considers opportunistic scheduler (OS) design using statistical channel state information (CSI). We apply max-weight schedulers (MWSs) to maximize a utility function of users' average data rates. MWSs schedule the user with the highest weighted instantaneous data rate every time slot. Existing methods require hundreds of time slots to adjust the MWS's weights according to the instantaneous CSI before finding the optimal weights that maximize the utility function. In contrast, our MWS design requires few slots for estimating the statistical CSI. Specifically, we formulate a weight optimization problem using the mean and variance of users' signal-to-noise ratios (SNRs) to construct constraints bounding users' feasible average rates. Here, the utility function is the formulated objective, and the MWS's weights are optimization variables. We develop an iterative solver for the problem and prove that it finds the optimal weights. We also design an online architecture where the solver adaptively generates optimal weights for networks with varying mean and variance of the SNRs. Simulations show that our methods effectively require 4 similar to 10 times fewer slots to find the optimal weights and achieve 5 similar to 15% better average rates than the existing methods.
引用
收藏
页码:9810 / 9825
页数:16
相关论文
共 45 条
[1]  
3GPP, 2018, 3GPP TR 38.214 v15.1.0
[2]   Deep Learning for mmWave Beam and Blockage Prediction Using Sub-6 GHz Channels [J].
Alrabeiah, Muhammad ;
Alkhateeb, Ahmed .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (09) :5504-5518
[3]   Convex Optimization: Algorithms and Complexity [J].
不详 .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2015, 8 (3-4) :232-+
[4]  
[Anonymous], NONLINEAR MULTIOBJEC, DOI DOI 10.1186/1472-6807-14-3.OLITIAN)93:2020-02-28
[5]   A Survey on Opportunistic Scheduling in Wireless Communications [J].
Asadi, Arash ;
Mancuso, Vincenzo .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2013, 15 (04) :1671-1688
[6]   A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
MOORE, JT .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292
[7]   Opportunistic Scheduling as Restless Bandits [J].
Borkar, Vivek S. ;
Kasbekar, Gaurav S. ;
Pattathil, Sarath ;
Shetty, Priyesh Y. .
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2018, 5 (04) :1952-1961
[8]  
Borst S, 2001, IEEE INFOCOM SER, P976, DOI 10.1109/INFCOM.2001.916290
[9]   Evaluating Smartphone Accuracy for RSSI Measurements [J].
Boussad, Yanis ;
Mahfoudi, Mohamed Naoufal ;
Legout, Arnaud ;
Lizzi, Leonardo ;
Ferrero, Fabien ;
Dabbous, Walid .
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2021, 70
[10]  
Boyd S., 2004, CONVEX OPTIMIZATION