Departmental Papers (ESE)

Document Type

Journal Article

Date of this Version

January 2007

Comments

Copyright 2007 IEEE. Reprinted from IEEE Transactions on Vehicular Technology, Volume 56, Issue 1, January 2007, pages 230-244.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Abstract

This paper considers a wireless system in which different sessions may use different channels with different transmission characteristics. A general framework for admission control and scheduling that provides stochastic delay and packet drop guarantees in this error-prone wireless system is proposed. By "general," the authors mean that the scheduling policies from a large class can be plugged in this framework and that admission control conditions can be obtained for different arrival processes. This enables the use of many scheduling policies that have not been considered so far for error-prone wireless systems. Using large deviation bounds and renewal theory, the authors prove that once a session i is admitted, irrespective of the scheduling policy and the channel errors experienced by other sessions, i obtains its desired quality of service. The admission control algorithm uses only individual channel statistics of sessions and not joint statistics, and the scheduling does not require any knowledge of instantaneous channel states.

Keywords

Admission control, delay guarantee, scheduling, wireless

Share

COinS

Date Posted: 14 March 2007

This document has been peer reviewed.