Motivated by the Internet of Things (IoT) and Cyber-Physical Systems (CPS), we consider
dynamic wireless fading networks, where each incoming flow has a random service demand …

Round robin and its variants are well known scheduling policies that are popular in wireline
networks due to their throughput optimality, delay insensitivity to file size distributions and …

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not
addressed effectively by most contemporary wireline fair-scheduling algorithms because of …

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not
addressed effectively by most contemporary wireline fair scheduling algorithms because of …

With the explosive increase in the number of mobile devices and applications, it is
anticipated that wireless traffic will increase exponentially in the coming years. Moreover …

We consider a one-hop wireless network with independent time varying ON/OFF channels
and N users, such as a multi-user uplink or downlink. We first show that general classes of …

Wireless channels are characterized by more serious bursty and location-dependent errors.
Many packet scheduling algorithms have been proposed for wireless networks to guarantee …

Fair queueing in the wireless domain poses significant challenges due to the unique issues
in the wireless channel such as location-dependent and bursty channel error. In this paper …

Due to the rapid growth of wireless data services, the issues of providing different quality of
services and fair channel access have become more and more crucial. In wireline networks …

We propose two multipath rate control algorithms that guarantee bounded end-to-end delay
in multihop wireless networks. Our work extends the previous research on optimal rate …