Abstract-We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constantfactor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any nondecreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum set of links that can be simultaneously scheduled without affecting a given set of previously assigned links. Finally, we obtain constantfactor approximation of weighted capacity under linear power assignment.
In REF , the authors aim to find a maximum set of links that can be simultaneously scheduled without affecting a given set of previously assigned links.
Wireless capacity and admission control in cognitive radio
2012 Proceedings IEEE INFOCOM
2012 Proceedings IEEE INFOCOM
Mathematics Computer Science