A Greedy Link Scheduler for Wireless Networks with Fading Channels

We consider the problem of link scheduling for wireless networks with fading channels, where the link rates are varying with time. Due to the high computational complexity of the throughput optimal scheduler, we provide a low complexity greedy link scheduler GFS, with provable performance guarantees. We show that the performance of our greedy scheduler can be analyzed using the Local Pooling Factor (LPF) of a network graph, which has been previously used to characterize the stability of the Greedy Maximal Scheduling (GMS) policy for networks with static channels. We conjecture that the performance of GFS is a lower bound on the performance of GMS for wireless networks with fading channel

Enforcing End-to-End Proportional Fairness with Bounded Buffer Overflow Probabilities

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryNational Science Foundation / NSF CNS 04-3741

Distributed Throughput-optimal Scheduling in Ad Hoc Wireless Networks

In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic schedules by searching for a new basic schedule in a throughput increasing direction. We show that both of the above procedures can be achieved in a distributed manner. Specifically, we propose an average consensus based link contending algorithm to implement the distributed max weight scheduling. Further, we show that the basic schedule update can be implemented using CSMA mechanisms, which is similar to the one proposed by Jiang et al. Compared to the optimal distributed scheduler in Jiang's paper, where schedules change in a random walk fashion, our algorithm has a better delay performance by achieving faster schedule transitions in the steady state. The performance of the algorithm is finally confirmed by simulation results.Comment: 6 pages, 3 figures. A shorter version will appear in the proceedings of IEEE ICC 201

Prioritized maximal scheduling in wireless networks

Abstract-This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified by certain priority. We first analyze the capacity region of a maximal scheduler with fixed priority, where a lower bound is formulated and shown to be tight. Next we propose both centralized and distributed algorithms to search for the optimal priority for a given arrival rate. The algorithms are optimal in the sense that, if the arrival rate is in the lower bound region of any prioritized maximal scheduling, it is stable under the result of our algorithms. Finally, by combining the priority assignment and maximal scheduling, we prove that we can achieve a certain fraction of the optimal capacity region, which is bounded below by a constant for most networks