Abstract
We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white). The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points. In other words, these convex hulls make it safe for white antennas to communicate with each other without any interference with black antennas. We study the problem on three different settings (based on overlapping between different convex hulls) and find hardness results and good approximation algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Federal Communications Commission, Notice of proposed rule making: Unlicensed operation in the TV broadcast bands. ET Docket No. 04-186 (FCC 04-113) (May 2004)
Cardoso, L.S., Debbah, M., Bianchi, P., Najim, J.: Cooperative spectrum sensing using random matrix theory. In: IEEE ISWPC, pp. 334–338 (May 2008)
Abachi, T., Hemmatyar, M.A., Fazli, M.A., Izadi, M.: Centralized Spectrum Sensing Using New Algorithmic Techniques. In: CRNet 2010, Bijing, China, August 25-27 (2010)
Fischer, P.: Finding Maximum Convex Polygons. In: Proceedings of the 9th International Symposium on Fundamentals of Computation Theory, pp. 234–243 (1993)
Fischer, P.: More or less efficient agnostic learning of convex polygons. In: Proceedings of the Eighth Annual Conference on Computational Learning Theory, pp. 337–344 (1995)
Veni Madhavan, C.E.: Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Joseph, M., Shyamasundar, R.K. (eds.) FSTTCS 1984. LNCS, vol. 181, pp. 381–392. Springer, Heidelberg (1984)
de Castro, N., Cobos, F.J., Dana, J.C., Marquez, A., Noy, M.: Triangle-free planar graphs as segment intersection graphs. J. Graph Algorithms Appl. 6(1), 7–26 (2002) (electronic); Graph drawing and representations (Prague, 1999)
Agarwal, P.K., Mustafa, N.H.: Independent Set of Intersection Graphs of Convex Objects in 2D. In: Computational Geometry: Theory and Applications, pp. 83–95. Elsevier Science Publishers, Amsterdam (2006)
Dilworth, P.: A decomposition thorem for partially ordered sets. Annals of Mathematics 51, 161–166 (1950)
Sás, E.: On a certain extremum-property of the ellipse (in Hungarian, English sum- mary). Mat. Fiz. Lapok 48, 533–542 (1941)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehsani, S., Fazli, M., Ghodsi, M., Safari, M., Saghafian, M., Tavakkoli, M. (2011). White Space Regions. In: Černá, I., et al. SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-18381-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18380-5
Online ISBN: 978-3-642-18381-2
eBook Packages: Computer ScienceComputer Science (R0)