在长期演进系统中，不确定传输速率的无线资源调度问题是指如何在每一时隙内为用户分配资源块，使得无论资源块传输速率如何变化都保证用户在时延等方面的体验。利用鲁棒优化方法求解，建立不确定无线资源调度问题的鲁棒优化模型，分别选取3种不确定集：盒子不确定集，椭球不确定集和已知部分分布信息不确定集，根据它们各自的特点建立合理等价的鲁棒对应模型。利用实例验证了鲁棒对应模型的有效性。
In the long-term evolution system, the wireless resource scheduling problem with uncertain transmission rate is how to distribute resource blocks to users in each time slot to ensure user experience of time delay no matter how resource block transmission rate changes. The problem is solved by using the robust optimization method in this work. We establish the robust optimization model of uncertain wireless resource scheduling problem, and then select three kinds of special uncertain sets, i.e., box uncertain set, ellipsoid uncertain set, and uncertain set with the distribution information partly known. Based on the feature of the three sets we obtain their reasonable equivalent robust corresponding models. Finally we use a living example to verify the validity of the robust corresponding models.
[1] Capozzi F, Piro G, Grieco L A, et al. Downlink packet scheduling in LTE cellular networks:key design issues and a survey[J]. IEEE Communications Surveys & Tutorials, 2012, 15(2):678-700.
[2] Kanhere S S, Sethu H, Parekh A B. Fair and efficient packet scheduling using elastic round robin[J]. IEEE Transactions on Parallel & Distributed Systems, 2002, 13(13):324-336.
[3] Ericsson N S. Adaptive modulation and scheduling of IP traffic over fading channels[C]//IEEE Vehicular Technology Conference. IEEE, 1999,2:849-853.
[4] Jalali A, Padovani R, Pankaj R. Data throughput of CDMA-HDR:a high efficiency-high data rate personal communication wireless system[C]//Vehicular Technology Conference Proceedings, 2000. Vtc 2000-Spring Tokyo. 2000 IEEE. IEEE Xplore, 2000,3:1854-1858.
[5] 3GPP. TS36.321,evolved universal terrestrial radio access, medium access control protocol specification[S]. Sophia Antipolis:ETSI, 2011.
[6] Seung B, Gustavo De V, Bilal S. Delay-optimal opportunistic scheduling and approximations:the log rule[J]. IEEE/ACM Transactions on Networking, 2011, 19(2):405-418.
[7] Ben-Tal A, Ghaoui L E, Nemirovski A. Robust optimization[M]. Princeton NJ:Princetion University Press, 2009.
[8] Kouvelis P, Yu G. Robust discrete optimization and its applications[M]. Netherlands:Kluwer Academic Publishers, 1997.
[9] Delage E, Ye Y. Distributionally robust optimization under moment uncertainty with application to data-driven problems[J]. Operations Research, 2010, 58(3):595-612.
[10] Li Z, Ding R, Floudas C A. A comparative theoretical and computational study on robust counterpart optimization:I. Robust linear optimization and robust mixed integer linear optimization[J]. Industrial & Engineering Chemistry Research, 2011, 50(18):10567-10603.
[11] Xu H, Caramanis C, Mannor S. Optimization under probabilistic envelope constraints[J]. Operations Research, 2012, 60(3):682-699.
[12] Zymler S, Kuhn D, Rustem B. Distributionally robust joint chance constraints with second-order moment information[J]. Mathematical Programming, 2013, 137(1):167-198.
[13] Sun H, Gao Z, Szeto W Y, et al. A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty[J]. Networks and Spatial Economics, 2014, 14(3):409-433.
[14] Karp R M. Reducibility among combinatorial problems[M]//Miller R E, Thatcher J W, Bohlinger J D(eds). Complexity of Computations. The IBM Research Symposia Series. Boston, MA:Springer, 1972.
[15] Nemirovski A, Shapiro A. Convex approximations of chance constrained programs[J]. Siam Journal on Optimization, 2006, 17(4):969-996.
[16] Calafiore G C, Ghaoui L E. On distributionally robust chance-constrained linear programs[J]. Journal of Optimization Theory and Applications, 2006, 130(1):1-22.
