SINR diagram with interference cancellation

  • Authors:

  • Chen Avin;Asaf Cohen;Yoram Haddad;Erez Kantor;Zvi Lotker;Merav Parter;David Peleg

  • Affiliations:

  • Ben Gurion University, Beer-Sheva, Israel;Ben Gurion University, Beer-Sheva, Israel;Ben Gurion University, Beer-Sheva, Israel, and Jerusalem College of Technology, Jerusalem, Israel;The Technion, Haifa, Israel;Ben Gurion University, Beer-Sheva, Israel;The Weizmann Institute of Science, Rehovot, Israel;The Weizmann Institute of Science, Rehovot, Israel

  • Venue:
  • Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
  • Year:
  • 2012

  • Student poster session

    WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the reception zones of a wireless network in the SINR model with receivers that employ interference cancellation (IC). IC is a recently developed technique that allows a receiver to decode interfering signals, and cancel them from the received signal in order to decode its intended message. We first derive the important topological properties of the reception zones and their relation to high-order Voronoi diagrams and other geometric objects. We then discuss the computational issues that arise when seeking an efficient description of the zones. Our main fundamental result states that although potentially there are exponentially many possible cancellation orderings, and as a result, reception zones, in fact there are much fewer nonempty such zones. We prove a linear bound (hence tight) on the number of zones and provide a polynomial time algorithm to describe the diagram. Moreover, we introduce a novel parameter, the Compactness Parameter, which influences the tightness of our bounds. We then utilize these properties to devise a logarithmic time algorithm to answer point-location queries for networks with IC.