Network utility maximization in uplink multiuser wireless LANs

Abstract Multiuser Multiple-Input Multiple-Output (MU-MIMO) enables several simultaneous transmission from the stations toward a multiple antennas access point of a WLAN and thereby boosts the network throughput. However, this throughput enhancement greatly depends on which stations are transmitting concurrently, which in turn necessitates the design of an efficient scheduling algorithm. In this paper, we model uplink MU-MIMO scheduling as a network utility maximization problem that is a non-convex problem due to the wideband channel aware transmission rate function and scheduling constraints. Relying on the zero duality gap, a stochastic learning algorithm is designed to solve the dual of that problem. Determination of stochastic subgradient in the stochastic learning algorithm involves an NP- complete problem, hence imperialist competitive algorithm is exploited to solve this problem. The simulation results substantiate significant throughput improvement and airtime fairness superiority of this scheme compared to the existing ones. The results also show the proposed scheme is not able to guarantee the optimal throughput due to employing imperialist competitive algorithm.

[1]  Kin-Nang Lau.  Analytical framework for multiuser uplink MIMO space-time scheduling design with convex utility functions , 2004, IEEE Transactions on Wireless Communications.

[2]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[3]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[4]  Alejandro Ribeiro,et al.  Separation Principles in Wireless Networking , 2010, IEEE Transactions on Information Theory.

[5]  Arne Svensson,et al.  Multi-Rate Convolutional Codes , 1998 .

[6]  Wei Wang,et al.  SAM: enabling practical spatial multiple access in wireless LAN , 2009, MobiCom '09.

[7]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[8]  Martin Heusse,et al.  Performance anomaly of 802.11b , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Kamran Rezaie,et al.  Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm , 2010, Expert Syst. Appl..

[10]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[11]  B.L. Evans,et al.  Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization , 2005, IEEE Transactions on Signal Processing.

[12]  Michael B. Pursley,et al.  Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding , 1985 .

[13]  Hyuncheol Park,et al.  A Closed-Form Expression of Instantaneous Bit Error Rate for BIC-OFDM Systems , 2010, 2010 IEEE International Conference on Communications.

[14]  Mohammad Hassan Moradi,et al.  An efficient hybrid method for solving the optimal sitting and sizing problem of DG and shunt capacitor banks simultaneously based on imperialist competitive algorithm and genetic algorithm , 2014 .

[15]  Kate Ching-Ju Lin,et al.  Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks , 2014, IEEE Transactions on Wireless Communications.

[16]  Majid Ghaderi,et al.  Uplink Scheduling in Wireless Networks with Successive Interference Cancellation , 2014, IEEE Transactions on Mobile Computing.

[17]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Yi Liu,et al.  A low complexity user scheduling algorithm for uplink multiuser MIMO systems , 2008, IEEE Transactions on Wireless Communications.