Hard deadline constrained multiuser scheduling for random arrivals
Butt MM, Kansanen K, Müller R (2011)
Publication Status: Published
Publication Type: Conference contribution, Conference Contribution
Publication year: 2011
Pages Range: 1540-1545
Article Number: 5779359
Event location: Cancun
ISBN: 9781612842547
DOI: 10.1109/WCNC.2011.5779359
Abstract
In this work, an opportunistic scheduling scheme for a large multiuser system is proposed. A group of users with good channels are scheduled simultaneously for data transmission and separated by means of superposition coding. The proposed scheduling scheme is analyzed in the large system limit. Random packet arrivals are modeled as constant arrivals with random content size. Transmission thresholds are optimized in such a way that the system energy is minimized while obeying a strict upper bound on the packet delay. We find that the state space representations of systems with either constant or random arrivals are equivalent. Thus, the thresholds optimized for constant arrivals in earlier work are valid for systems with random arrivals as well. © 2011 IEEE.
Authors with CRIS profile
Involved external institutions
Norway (NO)How to cite
APA:
Butt, M.M., Kansanen, K., & Müller, R. (2011). Hard deadline constrained multiuser scheduling for random arrivals. In Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011 (pp. 1540-1545). Cancun.
MLA:
Butt, M. Majid, Kimmo Kansanen, and Ralf Müller. "Hard deadline constrained multiuser scheduling for random arrivals." Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011, Cancun 2011. 1540-1545.
BibTeX: Download