Random access for elastic and inelastic traffic in WLANs

Authors:
Man Hon Cheung;Amir-Hamed Mohsenian-Rad;Vincent W. S. Wong;Robert Schober
Affiliations:
Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 8
Cited 1

Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
A utility-based power-control scheme in wireless cellular systems

IEEE/ACM Transactions on Networking (TON)
Convex Optimization

Convex Optimization
Downlink power allocation for multi-class wireless systems

IEEE/ACM Transactions on Networking (TON)
Distributed rate allocation for inelastic flows

IEEE/ACM Transactions on Networking (TON)
Utility-Optimal Random-Access Control

IEEE Transactions on Wireless Communications
Utility-based radio resource allocation for QoS traffic in wireless networks

IEEE Transactions on Wireless Communications
Reverse-Engineering MAC: A Non-Cooperative Game Model

IEEE Journal on Selected Areas in Communications

Downlink user selection and resource allocation for semi-elastic flows in an OFDM cell

Wireless Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the problem of random access in wireless local area networks (WLANs) with each station generating either elastic or inelastic traffic. Elastic traffic is usually non-real-time, while inelastic traffic is usually coming from real-time applications. We formulate a network utility maximization (NUM) problem, where the optimization variables are the persistent probabilities of the stations and the utilities are either concave or sigmoidal functions. Sigmoidal utility functions can better represent inelastic traffic sources compared to concave utility functions commonly used in the existing random access literature. However, they lead to non-convex NUM problems which are not easy to solve in general. By applying the dual decomposition method, we propose a subgradient algorithm to solve the formulated NUM problem. We also develop closedform solutions for the dual subproblems involving sigmoidal functions that have to be solved in each iteration of the proposed algorithm. Furthermore, we obtain a sufficient condition on the link capacities which guarantees achieving the global optimal solution when our proposed algorithm is being used. If this condition is not satisfied, then we can still guarantee that the optimal value of the objective function is within some lower and upper bounds. We perform various simulations to validate our analytical models when the available link capacities meet or do not meet the sufficient optimality condition.