Low-Complexity Scheduling for Wireless Networks

Designing efficient scheduling and power control algorithms for distributed wireless communication has been a challenging issue, especially in the physical interference model based on SINR constraints. In this paper, the authors discuss the first local distributed scheduling and power control algorithm in the SINR-model that achieves an O(g(L)) approximation factor of the rate region, where O(g(L)) denotes the link diversity. As an intermediate step, they develop a scheduling algorithm in a k-hop interference model, which is used in the analysis of the more general model.

Provided by: Association for Computing Machinery Topic: Mobility Date Added: Jun 2012 Format: PDF

Find By Topic