Title :
A Constant-Approximation for Maximum Weight Independent Set of Links under the SINR Model
Author :
Wang, Lixin ; Abubucker, C.P. ; Lawless, Williams F. ; Baker, Anthony J.
Author_Institution :
Dept. of Math., Sci. & Technol., Paine Coll., Augusta, GA, USA
Abstract :
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.
Keywords :
approximation theory; optimisation; radio links; radiofrequency interference; set theory; NP-hard problem; SINR model; communication link; constant approximation algorithm; independent link; link weight-to-length ratio; logarithmic factor approximation; maximum weight independent set; optimization problem; physical interference model; plane multihop wireless network; positive link weight function; power assignment; power control; Algorithm design and analysis; Approximation algorithms; Approximation methods; Interference; Noise; Spread spectrum communication; Wireless networks; Physical interference model; approximation algorithm; link scheduling; maximum independent set;
Conference_Titel :
Mobile Ad-hoc and Sensor Networks (MSN), 2011 Seventh International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4577-2178-6
