TY - GEN

T1 - SINR diagram with interference cancellation

AU - Avin, Chen

AU - Cohen, Asaf

AU - Haddad, Yoram

AU - Kantor, Erez

AU - Lotker, Zvi

AU - Parter, Merav

AU - Peleg, David

N1 - Funding Information:
Dr. Erez Kantor is a postdoc fellow at the CSAIL, MIT, Cambridge, MA. Previously he was a postdoc fellow at the Electrical Engineering departmentat the Technion - Israel Institute of Technology. He is a recipient of Eshkol postdoc fellowship from the Ministry of Science and Technology, Israel. Erez received its Ph.D. and M.Sc. from the Weizmann Institute of Science in Israel.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84860186709&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973099.43

DO - 10.1137/1.9781611973099.43

M3 - Conference contribution

AN - SCOPUS:84860186709

SN - 9781611972108

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 502

EP - 515

BT - Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012

PB - Association for Computing Machinery

T2 - 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012

Y2 - 17 January 2012 through 19 January 2012

ER -