Abstract
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose senders transmit at a fixed uniform power level, select a maximum set of independent links. This problem is known to be NP-hard. The existing approximation algorithms which were claimed to have constant approximation bounds are either valid only in the absence of background noise or simply incorrect in the presence of background noise. In this paper, we develop a new approximation algorithm with constant approximation bound regardless of the value of the background noise. In addition, our approximation bound valid in general is significantly smaller than all the known bounds which are only valid under certain special assumptions.
This work was supported in part by NSF of USA under grant CNS-0831831, by the RGC of Hong Kong under Project No. 122807, and by the National Basic Research Program of China Grant 2007CB807900, 2007CB807901.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andrews, M., Dinitz, M.: Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. In: Proc. of the 28th IEEE INFOCOM (April 2009)
Bateman, P., Erdös, P.: Geometrical extrema suggested by a lemma of besicovitch. The American Mathematical Monthly, 306–314 (May 1951)
Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proc. of the 8th ACM MOBIHOC, September 2007, pp. 100–109 (2007)
Goussevskaia, O., Halldorsson, M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: Proc. of the 28th IEEE INFOCOM (April 2009)
Groemer, H.: Über die Einlagerung von Kreisen in einen konvexen Bereich. Math. Zeitschrift. 73, 285–294 (1960)
Xu, X.-H., Tang, S.-J.: A Constant Approximation Algorithm for Link Scheduling in Arbitrary Networks under Physical Interference Model. In: The Second ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing (May 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wan, PJ., Jia, X., Yao, F. (2009). Maximum Independent Set of Links under Physical Interference Model. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)