Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks

被引:0
作者
Pablo Adasme
Abdel Lisser
机构
[1] Universidad de Santiago de Chile,Departamento de Ingeniería Eléctrica
[2] Université Paris-Sud XI,Laboratoire de Recherche en Informatique
来源
Journal of Scheduling | 2016年 / 19卷
关键词
Second-order cone programming; Integer linear programming; Variable neighborhood search metaheuristic; Resource allocation in wireless OFDMA–TDMA networks;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we present a deterministic resource allocation model for a hybrid uplink wireless orthogonal frequency and time division multiple access network. Since the input data of the model may be affected by uncertainty, we further consider a stochastic formulation of the problem which we transform into an equivalent deterministic binary second-order conic program (SOCP). Subsequently, we use this binary SOCP to derive an equivalent integer linear programming formulation. The proposed models are aimed at maximizing the total bandwidth channel capacity subject to user power and sub-carrier assignment constraints while simultaneously scheduling users in time. As such, the models are best suited for non-real-time applications where sub-channel multiuser diversity can be further exploited simultaneously in frequency and time domains. Finally, in view of the large execution times required by CPLEX to solve the proposed models, we propose a variable neighborhood search metaheuristic procedure. Our numerical results show tight bounds and near optimal solutions for most of the instances when compared to the optimal solution of the problem. Moreover, we obtain better feasible solutions than CPLEX in the stochastic case. Finally, these bounds are obtained at a very low computational cost.
引用
收藏
页码:349 / 366
页数:17
相关论文
共 49 条
[1]  
Adasme P(2014)Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks Journal of Scheduling 17 445-469
[2]  
Lisser A(2011)Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme Computers and Operations Research 38 1377-1399
[3]  
Adasme P(2007)Cross-layer QoS analysis of opportunistic OFDM-TDMA and OFDMA networks IEEE Journal on Selected Areas in Communications 25 657-666
[4]  
Lisser A(2014)Distributionally robust stochastic knapsack problem SIAM Journal on Optimization 24 1485-1506
[5]  
Soto I(2012)A second-order cone programming approach for linear programs with joint probabilistic constraints Operations Research Letters 40 325-328
[6]  
Chang Y(2010)Distributionally robust optimization under moment uncertainty with application to data-driven problems Operations Research 58 596-612
[7]  
Chien F(1960)Applications de lálgebre de boole en recherche operationelle Revue Francaise de Recherche Operationelle 4 17-26
[8]  
Kuo C(2011)Knapsack problem with probability constraints Journal of Global Optimization 49 397-413
[9]  
Cheng J(2001)Variable neighborhood search: Principles and applications European Journal of Operational Research 130 449-467
[10]  
Delage E(2001)Variable neighborhood decomposition search Journal of Heuristics 7 335-350