Advertisement
Published in:
2013 | OriginalPaper | Chapter
Maximum Independent Set of Links with a Monotone and Sublinear Power Assignment
Authors : Chao Ma, Fahad Al-dhelaan, Peng-Jun Wan
Published in: Wireless Algorithms, Systems, and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.