Date Added: Feb 2012
The authors consider the problem of joint link scheduling and power control for wireless networks with average transmission power constraints. Due to the high computational complexity of the optimal policies, they extend the class of greedy link scheduling policies to handle average power constraints. They develop a greedy link scheduling and power control scheme GECS, with provable performance guarantees. They show that the performance of their greedy scheduler can be characterized 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 wireless networks. They also simulate the performance of GECS on wireless network, and compare its performance to another candidate greedy link scheduling and power control policy.