Minimum-length scheduling for multicast traffic under channel uncertainty

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:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 0

Introduction to algorithms

Introduction to algorithms
Dynamic Programming and Optimal Control, Vol. II

Dynamic Programming and Optimal Control, Vol. II
Probabilistic robot navigation in partially observable environments

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Minimum-length scheduling and rate control for time-varying wireless networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Wireless Link Scheduling With Power Control and SINR Constraints

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all traffic, i.e., to obtain schedules of minimum length. We consider time-varying wireless networks with imperfect side information at the sources. We model the minimum-length scheduling problem through partially observable stochastic shortest paths and provide an optimal solution. Due to the high complexity of computing the optimal solution, we finally provide a set of heuristics and illustrate their performance through numerical experiments.