The Community for Technology Leaders
Green Image
Issue No. 10 - October (2010 vol. 9)
ISSN: 1536-1233
pp: 1391-1406
Nitin Salodkar , General Motors Indian Science Lab, ITPL, Bangalore
Abhay Karandikar , Indian Institute of Technology Bombay, Mumbai
Vivek S. Borkar , Tata Institute of Fundamental Research, Mumbai
In this paper, we consider the problem of energy-efficient uplink scheduling with delay constraint for a multiuser wireless system. We address this problem within the framework of constrained Markov decision processes (CMDPs) wherein one seeks to minimize one cost (average power) subject to a hard constraint on another (average delay). We do not assume the arrival and channel statistics to be known. To handle state-space explosion and informational constraints, we split the problem into individual CMDPs for the users, coupled through their Lagrange multipliers; and a user selection problem at the base station. To address the issue of unknown channel and arrival statistics, we propose a reinforcement learning algorithm. The users use this learning algorithm to determine the rate at which they wish to transmit in a slot and communicate this to the base station. The base station then schedules the user with the highest rate in a slot. We analyze convergence, stability, and optimality properties of the algorithm. We also demonstrate the efficacy of the algorithm through simulations within IEEE 802.16 system.
Multiuser fading channel, constrained Markov decision process, energy-efficient scheduling, learning algorithm.

N. Salodkar, A. Karandikar and V. S. Borkar, "A Stable Online Algorithm for Energy-Efficient Multiuser Scheduling," in IEEE Transactions on Mobile Computing, vol. 9, no. , pp. 1391-1406, 2010.
82 ms
(Ver 3.3 (11022016))