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 …

The scheduling problem in multi-hop wireless networks has been extensively investigated.
Although throughput optimal scheduling solutions have been developed in the literature …

We study the problem of learning channel statistics in order to efficiently schedule
transmissions in wireless networks subject to interference constraints. In particular, we focus …

This study takes on the challenge of learning and scheduling in a Multi-Hop Wireless
Network (MHWN) without having any prior knowledge of connection charges. Earlier …

We consider the problem of throughput-optimal cross-layer design of wireless networks. We
propose a joint congestion control and scheduling algorithm that achieves a fraction 1/d I (G) …

We consider a class of wireless networks with general interference constraints on the set of
links that can be served simultaneously at any given time. We restrict the traffic to be single …

Greedy maximal matching (GMM) is an important scheduling scheme for multi-hop wireless
networks. It is computationally simple, and has often been numerically shown to achieve …

We address the problem of jamming-resistant broadcast communications under an internal
threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the …

We consider the problem of throughput-optimal scheduling in wireless networks subject to
interference constraints. We model the interference using a family of-hop interference …

We study the problem of distributed scheduling in multi-hop MIMO networks. We first
develop a``MIMO-pipe" model that provides the upper layers a set of rates and SINR …