Maximum independent set of links with a monotone and sublinear power assignment

Authors:
Chao Ma;Fahad Al-dhelaan;Peng-Jun Wan
Affiliations:
Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL
Venue:
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Year:
2013

Citing 5
Cited 0

Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Maximum Independent Set of Links under Physical Interference Model

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Maximizing capacity with power control under physical interference model in simplex mode

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless capacity with oblivious power in general metrics

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A constant-factor approximation for wireless capacity maximization with power control in the SINR model

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of selecting a maximum independent set of links with a fixed monotone and sublinear power assignment under the physical interference model. The best-known approximation bound for this problem is a very large constant. In this paper, we present an approximation algorithm for this problem, which not only has a much smaller approximation bound but also produces an independent set of links with a stronger property, i.e., strong independence.