IEEE Transactions on Wireless Communications · 2005 · 56 citations · 9 references
EngineeringComputer EngineeringOptimizationQueuing TheoryWireless CommunicationsChannel CapacityCommunication NetworksCommunication SchedulingPerformance OptimizationQueueing TheoryWireless Channel ModelingAnalytic ApproximationsBandwidthBandwidth AllocationComputational Complexity Of AlgorithmsDownlink SchedulingHeuristic SchedulingPower AllocationUpper Bounds
We formulate and analyze the problem of optimal downlink scheduling with instantaneous channel and queue size information when both power and bandwidth may be adaptively split among multiple users. We derive optimal solutions of low computational complexity, as well as faster and simpler approximations, to various versions of this problem when the power, rate, and bandwidth allocations to the users can all take continuous values. For this case, we show that the optimal scheme requires transmission to no more than two users during each time slot when users can receive at arbitrary rates, even when the user rate per unit of bandwidth is upper bounded by the best available modulation scheme. Our methods also extend easily to incorporate other intuitive constraints such as upper limits on user rates to improve frame fill efficiency. Simulation results suggest that the simple approximations work nearly as well as the throughput optimal schemes when continuous bandwidth and power partitions are allowed. In practice, the rate and bandwidth assignments to users take discrete values, and we present heuristic methods motivated by the continuous optimum to this discrete case.
9
Introduction to linear and nonlinear programming
E. Polak · IEEE Transactions on Automatic Control · 1974 · 2.1K citations
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
Paul Bender, Peter Black, M. Grob et al. · IEEE Communications Magazine · 2000 · 1.2K citations