SINR diagram with interference cancellation

详细信息    查看全文

• 作者：Chen Avin^a ; ^{avin@cse.bgu.ac.il" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Asaf Cohen^a ; ^{coasaf@cse.bgu.ac.il" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Yoram Haddad^a ; ^b ; ^{yoram.haddad@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Erez Kantor^c ; ^{erez.kantor@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Zvi Lotker¹ ; ^a ; ^{zvilo@cse.bgu.ac.il" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Merav Parter¹ ; ^d ; ^{merav.parter@weizmann.ac.il" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; David Peleg² ; ^d ; ^{david.peleg@weizmann.ac.il" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Interference cancellation ; SINR ; Voronoi diagram
• 刊名：Ad Hoc Networks
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：54
• 期：Complete
• 页码：1-16
• 全文大小：1733 K

文摘

In this paper we study the reception zones of a wireless network in the SINR model with receivers that employ interference cancellation (IC), a 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 some important topological properties of the diagram describing the reception zones and their connections to high-order Voronoi diagrams and other related 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 consequently reception cells), in fact there are much fewer nonempty such cells. We prove a (tight) linear bound on the number of cells and provide a polynomial time algorithm to describe the diagram. Moreover, we introduce a novel measure, referred to as the Compactness Parameter, which influences the tightness of our bounds. We then utilize the properties established for reception diagrams to devise a logarithmic time algorithm for answering point-location queries for networks with IC.