A cross-layer view of optimal scheduling

Authors:
Anna Pantelidou;Anthony Ephremides
Affiliations:
Centre for Wireless Communications, University of Oulu, Oulu, Finland;Institute for Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 8
Cited 1

Convex Optimization

Convex Optimization
Wireless Communications

Wireless Communications
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

Operations Research
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Minimum-length scheduling and rate control for time-varying wireless networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A framework for routing and congestion control for multicast information flows

IEEE Transactions on Information Theory
Wireless Link Scheduling With Power Control and SINR Constraints

IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications

Scheduling in Wireless Networks

Foundations and Trends® in Networking

Quantified Score

Hi-index	754.84

Visualization

Abstract

The problem of joint scheduling and rate control for multicast traffic in wireless networks is considered under the performance objectives of sum throughput maximization and proportional fairness. Our results are also valid for the special cases of unicast and broadcast traffic. First, the problem of maximizing the sum throughput of the network is studied and an optimal scheduling and rate control policy is obtained. Given the combinatorial complexity of providing an optimal policy, a simple, polynomial-time, suboptimal alternative scheme is introduced that restricts the space of scheduling and rate control decisions to operation one at a time or all together. The optimal policy to the problem of maximizing the sum throughput of the network with respect to this restricted action space is found. Next, the objective of proportional fairness is considered. Under this restricted space of actions, the resulting scheduling and rate control policy is explicitly characterized analytically and the effects of the current channel conditions are incorporated into the scheduling decisions. Furthermore, it is shown that the policy under this restricted action space is of threshold type. Finally, our analytical results are verified through a set of numerical experiments.