Paper Info
Title
Throughput-constrained scheduling in OFDMA wireless networks
Abstract
Adaptive modulation and coding is an important characteristic of OFDMA based wireless networks. A group of subcarriers and symbols (which we refer to as “allocation unit”) can be assigned to an user equipment (UE) based on its channel conditions. The “allocation units” can have different bandwidths for different UEs depending on the current channel conditions of the UEs. The UEs typically have a minimum throughput requirement. In this article our goal is to design a scheduler that maximizes the number of scheduled UEs while meeting their minimum throughput requirements. First we define an analytical model for scheduling and then propose three algorithms for the optimization problem. We show that, given the sets of “allocation units”, maximizing the number of UEs is equivalent to finding the maximum independent set of a bounded degree graph. We also define the set allocation problem that minimizes the number of intersecting sets subject to certain constraints.
Year
DOI
Venue
2012
10.1109/IWCMC.2012.6314382
Wireless Communications and Mobile Computing Conference
Keywords
Field
DocType
OFDM modulation,adaptive codes,adaptive modulation,frequency division multiple access,graph theory,optimisation,telecommunication network reliability,OFDMA wireless networks,UE,adaptive coding,adaptive modulation,allocation unit,bounded degree graph,channel conditions,maximum independent set,optimization problem,set allocation problem,throughput-constrained scheduling,user equipment,allocation unit,independent set,scheduling,throughput
Link adaptation,Wireless network,Scheduling (computing),Computer science,Computer network,Independent set,Throughput,Frequency-division multiple access,Optimization problem,Orthogonal frequency-division multiplexing,Distributed computing
Conference
ISSN
ISBN
Citations 
2376-6492
978-1-4577-1378-1
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Debalina Ghosh1413.67
Prasant Mohapatra24344304.46