Papers
Topics
Authors
Recent
2000 character limit reached

Joint Optimization on Uplink OFDMA and MU-MIMO for IEEE 802.11ax: Deep Hierarchical Reinforcement Learning Approach

Published 3 Apr 2024 in eess.SY, cs.IT, cs.SY, and math.IT | (2404.02486v2)

Abstract: This letter tackles a joint user scheduling, frequency resource allocation (USRA), multi-input-multi-output mode selection (MIMO MS) between single-user MIMO and multi-user (MU) MIMO, and MU-MIMO user selection problem, integrating uplink orthogonal frequency division multiple access (OFDMA) in IEEE 802.11ax. Specifically, we focus on \textit{unsaturated traffic conditions} where users' data demands fluctuate. In unsaturated traffic conditions, considering packet volumes per user introduces a combinatorial problem, requiring the simultaneous optimization of MU-MIMO user selection and RA along the time-frequency-space axis. Consequently, dealing with the combinatorial nature of this problem, characterized by a large cardinality of unknown variables, poses a challenge that conventional optimization methods find nearly impossible to address. In response, this letter proposes an approach with deep hierarchical reinforcement learning (DHRL) to solve the joint problem. Rather than simply adopting off-the-shelf DHRL, we \textit{tailor} the DHRL to the joint USRA and MS problem, thereby significantly improving the convergence speed and throughput. Extensive simulation results show that the proposed algorithm achieves significantly improved throughput compared to the existing schemes under various unsaturated traffic conditions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. “Wireless LAN medium access control (MAC) and physical layer (PHY) specifications,” IEEE Std 802.11ax-2021 (Amendment to IEEE Std 802.11-2020), pp. 1–767, 2021.
  2. K. Wang and K. Psounis, “Scheduling and resource allocation in 802.11ax,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), 2018, pp. 279–287.
  3. P. K. Sangdeh and H. Zeng, “DeepMux: Deep-learning-based channel sounding and resource allocation for IEEE 802.11ax,” IEEE J. Sel. Areas Commun., vol. 39, no. 8, pp. 2333–2346, 2021.
  4. D. Bankov et al., “OFDMA uplink scheduling in IEEE 802.11ax networks,” in Proc. IEEE Int. Conf. Commun. (ICC), 2018, pp. 1–6.
  5. V. N. Ha, G. Kaddoum, and G. Poitau, “Joint radio resource management and link adaptation for multicasting 802.11ax-based WLAN systems,” IEEE Trans. Wireless Commun., vol. 20, no. 9, pp. 6122–6138, 2021.
  6. K.-H. Lee, “Using OFDMA for MU-MIMO user selection in 802.11ax-based Wi-Fi networks,” IEEE Access, vol. 7, pp. 186 041–186 055, 2019.
  7. Z. Xie and W. Chen, “A joint channel and queue aware scheduling method for multi-user massive MIMO systems,” in Proc. IEEE Int. Conf. Commun. (ICC), 2019, pp. 1–6.
  8. Y.-H. Liu and K. C.-J. Lin, “Traffic-aware resource allocation for multi-user beamforming,” IEEE Trans. Mob. Comput., vol. 22, no. 6, pp. 3677–3690, 2023.
  9. S. Bhattarai, G. Naik, and J.-M. J. Park, “Uplink resource allocation in IEEE 802.11ax,” in IEEE Int. Conf. Commun. (ICC), 2019, pp. 1–6.
  10. R. Balakrishnan et al., “Deep reinforcement learning based traffic- and channel-aware OFDMA resource allocation,” in IEEE Global Commun. Conf. (GLOBECOM), 2019, pp. 1–6.
  11. D. Kotagiri, K. Nihei, and T. Li, “Distributed convolutional deep reinforcement learning based OFDMA MAC for 802.11ax,” in IEEE Int. Conf. Commun., 2021, pp. 1–6.
  12. T. D. Kulkarni et al., “Hierarchical deep reinforcement learning: Integrating temporal abstraction and intrinsic motivation,” in Proc. Neural Information Processing Systems, vol. 29, 2016.
  13. K. Frans, J. Ho, X. Chen, P. Abbeel, and J. Schulman, “Meta learning shared hierarchies,” in Proc. Int. Conf. Learn. Represent. (ICLR), 2018.
  14. T. Yoo and A. Goldsmith, “On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming,” IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 528–541, 2006.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.