Wireless random scheduling protocol with realistic channel conditions

Authors:
Minkui Liu;Laurence B. Milstein;Ramesh Rao
Affiliations:
University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Year:
2003

Citing 4
Cited 0

Adaptive filter theory

Adaptive filter theory
Fair scheduling in wireless packet networks

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Enhancing throughput over wireless LANs using channel state dependent packet scheduling

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a novel scheduling protocol for wireless communications over time-varying channels with memory. We incorporate a realistic channel model to study the impact of the changes in the physical layer on the performance of a scheduling protocol at the data link layer; and consider imperfect estimation of the channel conditions, based upon which the scheduling decision is made. We present our analysis results as well as comparisons with other wireless scheduling protocols. In addition to the system throughput study, we develop a new notion on the definition of "fairness": fairness across all the users instead of any individual user. Simulations are provided to illustrate the results.