Minimum-length scheduling and rate control for time-varying wireless networks

Authors:
Anna Pantelidou;Anthony Ephremides
Affiliations:
Centre for Wireless Communications, University of Oulu, Finland;Institute for Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD
Venue:
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Year:
2009

Citing 4
Cited 2

Introduction to Algorithms

Introduction to Algorithms
Wireless Communications

Wireless Communications
Dynamic Programming and Optimal Control, Vol. II

Dynamic Programming and Optimal Control, Vol. II
Wireless Link Scheduling With Power Control and SINR Constraints

IEEE Transactions on Information Theory

Minimum-length scheduling for multicast traffic under channel uncertainty

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A cross-layer view of optimal scheduling

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We study the problem of minimum-length scheduling in time-varying, single-hop wireless networks where each source of traffic has a finite amount of data to deliver to its corresponding destination. Our objective is to obtain a joint scheduling and rate control policy that minimizes the overall time required to deliver all the data to its intended destinations. We incorporate the physical layer into the scheduling decisions through the Signal to Interference plus Noise Ratio (SINR) criterion. We show that the minimum-length scheduling problem can be formulated as a stochastic shortest path. We provide an optimal policy by employing principles of dynamic programming. Finally, we discuss the applicability of our results for solving the minimum-length scheduling problem in general multi-hop wireless networks.