The random access NUM with multiclass traffic
Department of Computer Engineering, Kyung Hee University, Seoul, Korea
EURASIP Journal on Wireless Communications and Networking 2012, 2012:242 doi:10.1186/1687-1499-2012-242Published: 6 August 2012
In this article, we consider the network utility maximization (NUM) problem for the random access network with multiclass traffic. The utilities associated with the users are not only concave, but also nonconcave functions. Consequently, the random access NUM problem becomes more difficult to solve. Based on the successive approximation method, we propose an algorithm that jointly controls the rate and the persistent probability of the users. The proposed algorithm converges to a suboptimal solution to the original problem which also satisfies the Karush–Kuhn–Tucker conditions. We also generalize the framework so that a broader choice of utility functions can be applied.