We first consider a multi-user, single-hop wireless network with arbitrarily varying (and
possibly non-ergodic) arrivals and channels. We design an opportunistic scheduling …

We consider the delay properties of one-hop networks with general interference constraints
and multiple traffic streams with time-correlated arrivals. We first treat the case when arrivals …

As the delay is a critical QoS factor, packet scheduling over a wireless access link that often
becomes congested needs to have the objective of meeting each user's delay requirement …

Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest
Queue First (LQF), has been studied extensively for wireless networks. However, GMS can …

In this paper we introduce and analyze frame-based fair queueing, a novel traffic scheduling
algorithm for packet-switched networks. The algorithm provides end-to-end delay bounds …

Scheduling deadline-constrained packets in multihop networks has received increased
attention recently. However, there is very limited work on this problem for wireless networks …

This doctoral thesis is a collection of six papers preceeded by an introduction. All the papers
are related to design issues and performance analysis for opportunistic scheduling …

Although weighted fair queueing (WFQ) has been regarded as an ideal scheduling
algorithm in terms of its combined delay bound and proportional fairness properties, its …

To promote commercial deployment of multihop wireless networks, the research/industry
communities must develop new theories and protocols for flexible traffic engineering in …

Due to the rapid growth of real-time applications and the ubiquity of IEEE 802.11 MAC as a
layer-2 protocol for wireless local area networks (WLANs), it becomes increasingly important …