Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Opportunistic Scheduling Using Statistical Information of Wireless Channels (2402.08238v1)

Published 13 Feb 2024 in cs.IT, cs.NI, eess.SP, and math.IT

Abstract: 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\sim10$ times fewer slots to find the optimal weights and achieve $5\sim15\%$ better average rates than the existing methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. P. Viswanath, D. N. C. Tse, and R. Laroia, “Opportunistic beamforming using dumb antennas,” IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1277–1294, 2002.
  2. A. Asadi and V. Mancuso, “A survey on opportunistic scheduling in wireless communications,” IEEE Communications surveys & tutorials, vol. 15, no. 4, pp. 1671–1688, 2013.
  3. W. Ouyang et al., “Exploiting channel memory for joint estimation and scheduling in downlink networks—a whittle’s indexability analysis,” IEEE Transactions on Information Theory, vol. 61, no. 4, pp. 1702–1719, 2015.
  4. M. T. Kawser, H. Farid, A. R. Hasin, A. M. Sadik, and I. K. Razu, “Performance comparison between round robin and proportional fair scheduling methods for LTE,” International Journal of Information and Electronics Engineering, vol. 2, no. 5, pp. 678–681, 2012.
  5. M. J. Neely, “Convergence and adaptation for utility optimal opportunistic scheduling,” IEEE/ACM Transactions on Networking, vol. 27, no. 3, pp. 904–917, 2019.
  6. Z. Zhang, S. Moola, and E. K. Chong, “Approximate stochastic dynamic programming for opportunistic fair scheduling in wireless networks,” in 2008 47th IEEE Conference on Decision and Control.   IEEE, 2008, pp. 1404–1409.
  7. V. S. Borkar et al., “Opportunistic scheduling as restless bandits,” IEEE Transactions on Control of Network Systems, vol. 5, no. 4, pp. 1952–1961, 2017.
  8. I. Kadota et al., “Scheduling policies for minimizing age of information in broadcast wireless networks,” IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637–2650, 2018.
  9. J. Chen, Y. Wang, and T. Lan, “Bringing fairness to actor-critic reinforcement learning for network utility optimization,” in IEEE INFOCOM 2021-IEEE Conference on Computer Communications.   IEEE, 2021, pp. 1–10.
  10. S. Wang et al., “Deep reinforcement learning for dynamic multichannel access in wireless networks,” IEEE Transactions on Cognitive Communications and Networking, vol. 4, no. 2, pp. 257–265, 2018.
  11. Z. Gu et al., “Knowledge-assisted deep reinforcement learning in 5G scheduler design: From theoretical framework to implementation,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 7, pp. 2014–2028, 2021.
  12. D. Tse et al., “Transmitter directed, multiple receiver system using path diversity to equitably maximize throughput,” patent filed, May, vol. 24, 1999.
  13. R. Agrawal and V. Subramanian, “Optimality of certain channel aware scheduling policies,” in Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol. 40, no. 3.   Citeseer, 2002, pp. 1533–1542.
  14. S. Borst and P. Whiting, “Dynamic rate control algorithms for hdr throughput optimization,” in Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No. 01CH37213), vol. 2.   IEEE, 2001, pp. 976–985.
  15. X. Liu, E. K. Chong, and N. B. Shroff, “A framework for opportunistic scheduling in wireless networks,” Computer networks, vol. 41, no. 4, pp. 451–474, 2003.
  16. M. J. Neely, E. Modiano, and C.-P. Li, “Fairness and optimal stochastic control for heterogeneous networks,” IEEE/ACM Transactions On Networking, vol. 16, no. 2, pp. 396–409, 2008.
  17. S. Mandelli et al., “Satisfying network slicing constraints via 5G MAC scheduling,” in IEEE INFOCOM 2019-IEEE Conference on Computer Communications.   IEEE, 2019, pp. 2332–2340.
  18. L. Huang, X. Liu, and X. Hao, “The power of online learning in stochastic network optimization,” in The 2014 ACM international conference on Measurement and modeling of computer systems, 2014, pp. 153–165.
  19. Y. Boussad, M. N. Mahfoudi, A. Legout, L. Lizzi, F. Ferrero, and W. Dabbous, “Evaluating smartphone accuracy for RSSI measurements,” IEEE Transactions on Instrumentation and Measurement, vol. 70, pp. 1–12, 2021.
  20. 3GPP, “Physical layer procedures for data,” 3GPP, TS 38.214, 2018, v15.2.0.
  21. E. Liu, Q. Zhang, and K. K. Leung, “Asymptotic analysis of proportionally fair scheduling in rayleigh fading,” IEEE Transactions on Wireless Communications, vol. 10, no. 6, pp. 1764–1775, 2011.
  22. J. M. Holtzman, “Asymptotic analysis of proportional fair algorithm,” in 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No. 01TH8598), vol. 2.   IEEE, 2001, pp. F–F.
  23. J. Choi et al., “Throughput estimation based distributed base station selection in heterogeneous networks,” IEEE Transactions on Wireless Communications, vol. 14, no. 11, pp. 6137–6149, 2015.
  24. B. Colson, P. Marcotte, and G. Savard, “An overview of bilevel optimization,” Annals of operations research, vol. 153, no. 1, pp. 235–256, 2007.
  25. A. Sinha, P. Malo, and K. Deb, “A review on bilevel optimization: from classical to evolutionary approaches and applications,” IEEE Transactions on Evolutionary Computation, vol. 22, no. 2, pp. 276–295, 2017.
  26. C. D. Kolstad and L. S. Lasdon, “Derivative evaluation and computational experience with large bilevel mathematical programs,” Journal of optimization theory and applications, vol. 65, no. 3, pp. 485–499, 1990.
  27. G. Savard and J. Gauvin, “The steepest descent direction for the nonlinear bilevel programming problem,” Operations Research Letters, vol. 15, no. 5, pp. 265–272, 1994.
  28. P. Popovski, K. F. Trillingsgaard, O. Simeone, and G. Durisi, “5G wireless network slicing for eMBB, URLLC, and mMTC: A communication-theoretic view,” IEEE Access, vol. 6, pp. 55 765–55 779, 2018.
  29. Y.-C. Chen, Y.-s. Lim, R. J. Gibbens, E. M. Nahum, R. Khalili, and D. Towsley, “A measurement-based study of multipath tcp performance over wireless networks,” in Proceedings of the 2013 conference on Internet measurement conference, 2013, pp. 455–468.
  30. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control for communication networks: shadow prices, proportional fairness and stability,” Journal of the Operational Research society, vol. 49, no. 3, pp. 237–252, 1998.
  31. J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 556–567, 2000.
  32. S. Diamond and S. Boyd, “CVXPY: A Python-embedded modeling language for convex optimization,” The Journal of Machine Learning Research, vol. 17, no. 1, pp. 2909–2913, 2016.
  33. D. Serghiou, M. Khalily, T. W. Brown, and R. Tafazolli, “Terahertz channel propagation phenomena, measurement techniques and modeling for 6G wireless communication applications: A survey, open challenges and future research directions,” IEEE Communications Surveys & Tutorials, 2022.
  34. M. Alrabeiah and A. Alkhateeb, “Deep learning for mmwave beam and blockage prediction using sub-6 GHz channels,” IEEE Transactions on Communications, vol. 68, no. 9, pp. 5504–5518, 2020.
  35. A. M. Tulino, G. Caire, S. Shamai, and S. Verdú, “Capacity of channels with frequency-selective and time-selective fading,” IEEE Transactions on Information Theory, vol. 56, no. 3, pp. 1187–1215, 2010.
  36. J. F. Bard and J. T. Moore, “A branch and bound algorithm for the bilevel programming problem,” SIAM Journal on Scientific and Statistical Computing, vol. 11, no. 2, pp. 281–292, 1990.
  37. S. Bubeck et al., “Convex optimization: Algorithms and complexity,” Foundations and Trends® in Machine Learning, vol. 8, no. 3-4, pp. 231–357, 2015.
  38. E. Tanghe et al., “The industrial indoor channel: large-scale and temporal fading at 900, 2400, and 5200 mhz,” IEEE Transactions on Wireless Communications, vol. 7, no. 7, pp. 2740–2751, 2008.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now