With Fair Queueing or Round-Robin-based scheduling algorithms, flows are isolated from
misbehaving users. At the same time, packets that arrive for a particular flow in a burst are …

This paper studies wireless networks consisting of multiple real-time flows that impose hard
delay bounds for all packets. In contrast to most current studies that focus on the long-term …

Developing scheduling mechanisms that can simultaneously achieve throughput optimality
and good delay performance often require solving the Maximum Independent Weighted Set …

In this paper, we consider the problem of link scheduling in multihop wireless networks
under general interference constraints. Our goal is to design scheduling schemes that do not …

We consider protocols that serve communication requests arising over time in a wireless
network that is subject to interference. Unlike previous approaches, we take the geometry of …

Deficit Round-Robin (DRR) is a scheduling algorithm devised for providing fair queueing in
the presence of variable length packets. The main attractive feature of DRR is its simplicity of …

Chapter 8 identifies key issues in wireless fair queuing, defines a wireless fair service
model, and surveys algorithms. Fairness implies that the allocated channel bandwidth is in …

Recently, there has been widespread interest in the extension of data networks to the
wireless domain. However, scheduling results from the wireline domain do not carry over to …

In wireless networks, opportunistic scheduling is used to increase system throughput by
exploiting multi‐user diversity. Although recent advances have increased physical layer data …

As embedded systems are being networked, often wirelessly, an increasingly larger share of
their total energy budget is due to the communication. This necessitates the development of …