Foundations and Trends® in Networking > Vol 4 > Issue 4

Scheduling in Wireless Networks

Anna Pantelidou, Renesas Mobile Corporation, Finland, anna.pantelidou@renesasmobile.com Anthony Ephremides, Institute for Systems Research, Department of Electrical and Computer Engineering, University of Maryland, USA, etony@umd.edu
 
Suggested Citation
Anna Pantelidou and Anthony Ephremides (2011), "Scheduling in Wireless Networks", Foundations and TrendsĀ® in Networking: Vol. 4: No. 4, pp 421-511. http://dx.doi.org/10.1561/1300000030

Published: 15 Apr 2011
© 2011 A. Pantelidou and A. Ephremides
 
Subjects
Modeling and Analysis
 

Free Preview:

Article Help

Share

Download article
In this article:
1 Introduction
2 Minimum-Length Scheduling
3 Utility Maximization
4 Reduction of Scheduling Complexity
5 Maximum Stable Throughput
6 Conclusions
References

Abstract

We present a review of the problem of scheduled channel access in wireless networks with emphasis on ad hoc and sensor networks as opposed to WiFi, cellular, and infrastructure-based networks. After a brief introduction and problem definition, we examine in detail specific instances of the scheduling problem. These instances differ from each other in a number of ways, including the detailed network model and the objective function or performance criteria. They all share the "layerless" viewpoint that connects the access problem with the physical layer and, occasionally, with the routing layer. This review is intended to provide a reference point for the rich set of problems that arise in the allocation of resources in modern and future networks.

DOI:10.1561/1300000030
ISBN: 978-1-60198-420-3
96 pp. $70.00
Buy book
 
ISBN: 978-1-60198-421-0
96 pp. $100.00
Buy E-book
Table of contents:
1. Introduction
2. Minimum-Length Scheduling
3. Utility Maximization
4. Reduction of scheduling complexity
5. Maximum Stable Throughput
6. Conclusions
References

Scheduling in Wireless Networks

Scheduling in Wireless Networks reviews the problem of scheduled channel access in wireless networks with emphasis on ad hoc and sensor networks as opposed to WiFi, cellular, and infrastructure-based networks. After a brief introduction and problem definition, it examines in detail specific instances of the scheduling problem. These instances differ from each other in a number of ways, including the detailed network model and the objective function or performance criteria. They all share the "layerless" viewpoint that connects the access problem with the physical layer and, occasionally, with the routing layer. Scheduling in Wireless Networks is intended to provide a reference point for the rich set of problems that arise in the allocation of resources in modern and future networks.

 
NET-030