2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks (2011)
Dec. 16, 2011 to Dec. 18, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MSN.2011.1
In this paper we study the following optimization problem in a plane multihop wireless network under the physical interference model. Given a multihop wireless network and a positive link weight (or demand) function, select a set of independent links whose total weight is maximized. This problem is known to be NP-hard. The best known approximation algorithm for this problem achieves logarithmic factor approximation with power control. In this work, we present a constant-approximation algorithm for the problem with the power assignment specified in this paper when the link weight-to-length ratio is bounded. Moreover, our constant-approximation bound is valid regardless of the value of the noise power and the lengths of the communication links.
Physical interference model, approximation algorithm, maximum independent set, link scheduling
L. Wang, W. F. Lawless, A. J. Baker and C. Abubucker, "A Constant-Approximation for Maximum Weight Independent Set of Links under the SINR Model," 2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks(MSN), Beijing, China, 2011, pp. 9-14.