Loading...

White space regions

Ehsani, S ; Sharif University of Technology | 2011

511 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-18381-2_19
  3. Publisher: 2011
  4. Abstract:
  5. 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
  6. Keywords:
  7. Classical problems ; Convex hull ; Hardness result ; White point ; White space ; Antennas ; Communication ; Computational geometry ; Computer science ; Thermal stress ; Approximation algorithms
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 22 January 2011 through 28 January 2011, Novy Smokovec ; Volume 6543 LNCS , 2011 , Pages 226-237 ; 03029743 (ISSN) ; 9783642183805 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-18381-2_19