Scalable multiple channel scheduling with optimal utility for wireless local area networks

Document Type

Conference Proceeding

Publication Date

12-1-2003

Abstract

This paper studies the scheduling problem for multiple channels in a wireless local area network environment, where the resource unit assumes to be fixed length slot. The common assumption is: each user can transmits or receive through different channels sequentially, but not simultaneously. In this paper, three scheduling algorithms are proposed. Among them, CSSA schedules each station in contiguous mode. so each station occupies a single channel. The two algorithms, NCSRRA and NCRRA, schedule stations in non-contiguous mode, in that some stations will occupy at least two channels. The CSSA achieves the highest scheduling efficiency, but with relatively high scheduling complexity. The NCSRRA and NCRRA achieve in high efficiency with significantly low complexity. © 2003 IEEE.

Publication Source (Journal or Book title)

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

First Page

2988

Last Page

2992

This document is currently not available here.

Share

COinS