Recently, IEEE 802.11ax Task Group has proposed new guidelines for the use of OFDMA-based medium access control. In this new framework, it has been decided that the transmission for all the users in an multi-user OFDMA should end end at the same time , and the users with insufficient data should transmit null data (i.e. padding) to fill the duration. While this scheme offers strong features such as resilience to Overlapping Basic Service Set (OBSS) interference and ease of synchronization, it also poses major side issues of degraded throughput performance and waste of devices' energy. We investigate resource allocation problems where the scheduling duration (i.e., time ) is optimized through Lyapunov optimization techniques by taking into account the padding overhead, airtime fairness and energy consumption of the users. Also, being aware of the complexity of the existing OFDMA solutions, we propose lightweight and agile algorithms with the consideration of their overhead and implementation issues. We show that our resource allocation  algorithms are arbitrarily close to the optimal performance at the price of reduced convergence rate  .
Recently, IEEE 802.11ax Task Group has adapted OFDMA as a new technique for enabling multi-user transmission. It has been also decided that the scheduling duration should be same for all the users in a multi-user OFDMA so that the transmission of the users should end at the same time . In order to realize that condition, the users with insufficient data should transmit null data (i.e. padding) to fill the duration. While this scheme offers strong features such as resilience to Overlapping Basic Service Set (OBSS) interference and ease of synchronization, it also poses major side issues of degraded throughput performance and waste of devices' energy. In this work, for OFDMA based 802.11 WLANs we first propose practical algorithm in which the scheduling duration is fixed and does not change from time to time. In the second algorithm the scheduling duration is dynamically determined in a resource allocation framework by taking into account the padding overhead, airtime fairness and energy consumption of the users. We analytically investigate our resource allocation problems through Lyapunov optimization techniques and show that our algorithms are arbitrarily close to the optimal performance at the price of reduced convergence rate . We also calculate the overhead of our algorithms in a realistic set-up and propose solutions for the implementation issues .
R
proposed new guidelines for the use of OFDMA-based medium access control. In this new framework, it has been
adapted OFDMA as a new technique for enabling multi-user transmission. It has been also
R
transmission
scheduling duration should be same
R
an
a
R
should end end
so that the transmission of the users should end
R
, and
. In order to realize that condition,
R
We investigate resource allocation problems where
In this work, for OFDMA based 802.11 WLANs we first propose practical algorithm in which
R
(i.e., time ) is optimized through Lyapunov optimization techniques
is fixed and does not change from time to time. In the second algorithm the scheduling duration is dynamically determined in a resource allocation framework
R
Also, being aware of the complexity of the existing OFDMA solutions, we propose lightweight and agile algorithms with the consideration of their overhead and implementation issues. We show that
We analytically investigate
A
problems through Lyapunov optimization techniques and show that our
A
. We also calculate the overhead of our algorithms in a realistic set-up and propose solutions for the implementation issues