Imperfect randomized algorithms for the optimal control of wireless networks

We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the randomized scheduler to account for potential errors in its operation. These imperfections enable the design of a large class of low-complexity and distributed implementations for different interference models. We study the effect of such imperfections on the stability and fairness characteristics of the system, and explicitly characterize the degree of fairness achieved as a function of the level of imperfections. Our results also reveal the relative importance of different types of errors on the performance of the system, and provide valuable insight to the design of distributed controllers with favorable fairness characteristics.