In this paper, we characterize the performance of an important class of scheduling schemes,
called greedy maximal scheduling (GMS), for multihop wireless networks. While a lower …

We consider the problem of designing distributed scheduling algorithms for wireless
networks. We present two algorithms, both of which achieve throughput arbitrarily close to …

Scheduling is a critical and challenging resource allocation mechanism for multihop
wireless networks. It is well known that scheduling schemes that favor links with larger …

We propose a new class of distributed scheduling policies for ad hoc wireless networks that
can achieve provable capacity regions. Previously known scheduling policies that …

Since the seminal work by Kelly on distributed network resource allocation using the
language of network utility maximisation (NUM) a decade ago, there have been extensive …

This paper proposes a new class of simple, distributed algorithms for scheduling in wireless
networks. The algorithms generate new schedules in a distributed manner via simple local …

In an unreliable single-hop broadcast network setting, we investigate the throughput and
decoding-delay performance of random linear network coding as a function of the coding …

It has been recently suggested by Jiang and Walrand that adaptive carrier sense multiple
access (CSMA) can achieve optimal utility without any message passing in wireless …

This paper considers network control for wireless networks with finite buffers. We investigate
the performance of joint flow control, routing, and scheduling algorithms which achieve high …

We investigate the performance of longest-queue-first (LQF) scheduling (ie, greedy maximal
scheduling) for wireless networks under the SINR interference model. This interference …