Stochastic primal-dual scheduling subject to rate constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

In this paper we derive a stochastic primal-dual (SPD) algorithm for downlink/uplink scheduling of multiple connections with rate requirements, where each connection transmits using adaptive modulation and coding over a wireless fading channel. Based on quantized channel state information at the transmitters, we derive the information-theoretic optimal downlink and uplink resource allocation/scheduling strategies. When the fading statistics are not known a priori, we develop an SPD algorithm which can dynamically adapt the scheduling policy online. We established analytically and confirm by simulations that with affordable complexity, this SPD algorithm asymptotically converges to the optimal scheduling strategies from any initial value.

Original languageEnglish (US)
Title of host publication2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
Pages1529-1533
Number of pages5
DOIs
StatePublished - Nov 27 2007
Event2007 IEEE Wireless Communications and Networking Conference, WCNC 2007 - Kowloon, China
Duration: Mar 11 2007Mar 15 2007

Other

Other2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
CountryChina
CityKowloon
Period3/11/073/15/07

Fingerprint Dive into the research topics of 'Stochastic primal-dual scheduling subject to rate constraints'. Together they form a unique fingerprint.

Cite this