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

Scheduling in Wireless Networks

  • Pantelidou, Anna 1
  • Ephremides, Anthony 2

[1]Pantelidou, Anna, Renesas Mobile Corporation, Finland, anna.pantelidou@renesasmobile.com [2]Ephremides, Anthony, Institute for Systems Research, Department of Electrical and Computer Engineering, University of Maryland, USA, etony@umd.edu

Published: 15 April 2011 © 2011 A. Pantelidou and A. Ephremides

Short description

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. It 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.

Keywords

Modeling and Analysis

No full text access

Table of contents

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

Foundations and Trends® in Networking

(Vol 4, Issue 4, 2009, pp 421-511)

DOI: 10.1561/1300000030

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.

Buy e-Book
100.00 USD
(Full text PDF)
Buy Book
70.00 USD
(Physical copy)

Table of contents

1. Introduction
2. Minimum-Length Scheduling
3. Utility Maximization
4. Reduction of scheduling complexity
5. Maximum Stable Throughput
6. Conclusions
References
Cover image for Scheduling in Wireless Networks

Scheduling in Wireless Networks

96 pages

DOI: 10.1561/9781601984210

E-ISBN: 978-1-60198-421-0

ISBN: 978-1-60198-420-3

Description

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.