Harnessing bursty interference

Interference is a central feature of wireless communication. In many scenarios, interference is bursty: interfering wireless links come and go. Designing the system assuming interference to be always present is very conservative. In this paper, we take a fundamental information theoretic stand point and address the issue of statistical gain associated with bursty interference in the context of a pair of unicast interfering wireless links. Modeling the problem as a “degraded message set” two user Gaussian interference channel, we approximately characterize the symmetric capacity region. Our results demonstrate the fundamental existence of three regimes: one where treating interference as always there is without loss of optimality, another where one can harness as well as if interference was never there and a third where the performance is in between these two regimes.

[1]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[2]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[3]  Vinod M. Prabhakaran,et al.  Opportunistic interference management , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  Suhas N. Diggavi,et al.  Wireless Network Information Flow , 2007, ArXiv.

[5]  Abhay Parekh,et al.  The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels , 2008, IEEE Transactions on Information Theory.

[6]  Hiroshi Sato,et al.  The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.

[7]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.