Interference Management in Non-cooperative Networks

Spectrum sharing is known as a key solution to accommodate the increasing number of users and the growing demand for throughput in wireless networks. While spectrum sharing improves the data rate in sparse networks, it suffers from interference of concurrent links in dense networks. In fact, interference is the primary barrier to enhance the overall throughput of the network, especially in the medium and high signal-to-noise ratios (SNRs). Managing interference to overcome this barrier has emerged as a crucial step in developing efficient wireless networks. This thesis deals with optimum and sub-optimum interference management-cancelation in non-cooperative networks. Several techniques for interference management including novel strategies such as interference alignment and structural coding are investigated. These methods are applied to obtain optimum and sub-optimum coding strategies in such networks. It is shown that a single strategy is not able to achieve the maximum throughput in all possible scenarios and in fact a careful design is required to fully exploit all available resources in each realization of the system. This thesis begins with a complete investigation of the capacity region of the two-user Gaussian interference channel. This channel models the basic interaction between two users sharing the same spectrum for data communication. New outer bounds outperforming known bounds are derived using Genie-aided techniques. It is proved that these outer bounds meet the known inner bounds in some special cases, revealing the sum capacity of this channel over a certain range of parameters which has not been known in the past. A novel coding scheme applicable in networks with single antenna nodes is proposed next. This scheme converts a single antenna system to an equivalent Multiple Input Multiple Output (MIMO) system with fractional dimensions. Interference can be aligned along these dimensions and higher multiplexing gains can be achieved. Tools from the field of Diophantine approximation in number theory are used to show that the proposed coding scheme in fact mimics the traditional schemes used in MIMO systems where each data stream is sent along a direction and alignment happens when several streams are received along the same direction. Two types of constellation are proposed for the encoding part, namely the single

[1]  Amir K. Khandani,et al.  Capacity bounds for the Gaussian Interference Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Venugopal V. Veeravalli,et al.  Sum capacity of the Gaussian interference channel in the low interference regime , 2008, 2008 Information Theory and Applications Workshop.

[3]  Amir K. Khandani,et al.  Optimal Order of Decoding for Max-Min Fairness in K-User Memoryless Interference Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[5]  Gerhard Kramer,et al.  Outer bounds on the capacity of Gaussian interference channels , 2004, IEEE Transactions on Information Theory.

[6]  Slawomir Stanczak,et al.  Convexity of some feasible QoS regions and asymptotic behavior of the minimum total power in CDMA systems , 2004, IEEE Transactions on Communications.

[7]  Hiroshi Sato On degraded Gaussian two-user channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[8]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

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

[10]  Erik Ordentlich,et al.  On the Degrees-of-Freedom of the K-user Gaussian interference channel , 2009, 2009 IEEE International Symposium on Information Theory.

[11]  Simon Haykin,et al.  Cognitive radio: brain-empowered wireless communications , 2005, IEEE Journal on Selected Areas in Communications.

[12]  Shlomo Shamai,et al.  A layered lattice coding scheme for a class of three user Gaussian interference channels , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[13]  Max H. M. Costa,et al.  On the Gaussian interference channel , 1985, IEEE Trans. Inf. Theory.

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Gerhard Kramer,et al.  A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels , 2007, IEEE Transactions on Information Theory.

[16]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[17]  H. Boche,et al.  Iterative algorithm for finding optimal resource allocations in symbol-asynchronous CDMA channels with different SIR requirements , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[18]  Amir K. Khandani,et al.  Throughput Scaling Laws for Wireless Networks With Fading Channels , 2007, IEEE Transactions on Information Theory.

[19]  Victor Beresnevich,et al.  A Groshev Type Theorem for Convergence on Manifolds , 2002 .

[20]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.

[21]  Rudolf Mathar,et al.  Capacity regions and optimal power allocation for CDMA cellular radio , 2005, IEEE Transactions on Information Theory.

[22]  Max H. M. Costa,et al.  The capacity region of a class of deterministic interference channels , 1982, IEEE Trans. Inf. Theory.

[23]  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.

[24]  Abhay Parekh,et al.  Spectrum sharing for unlicensed bands , 2005, IEEE Journal on Selected Areas in Communications.

[25]  Amir K. Khandani,et al.  Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis , 2008, IEEE Transactions on Information Theory.

[26]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[27]  Amir K. Khandani,et al.  Real Interference Alignment with Real Numbers , 2009, ArXiv.

[28]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[29]  Henry Herng-Jiunn Liao,et al.  Multiple access channels (Ph.D. Thesis abstr.) , 1973, IEEE Trans. Inf. Theory.

[30]  Amir K. Khandani,et al.  On the Degrees of Freedom of the 3-user Gaussian interference channel: The symmetric case , 2009, 2009 IEEE International Symposium on Information Theory.

[31]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[32]  Emre Telatar,et al.  Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks , 2004, ISIT.

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

[34]  R. Ahlswede The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

[35]  Tie Liu,et al.  An Extremal Inequality Motivated by Multiterminal Information Theoretic Problems , 2006, ISIT.

[36]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[37]  G. A. Margulis,et al.  Khintchine-type theorems on manifolds: the convergence case for standard and multiplicative versions , 2001 .

[38]  Syed Ali Jafar,et al.  Degrees of freedom of wireless X networks , 2008, 2008 IEEE International Symposium on Information Theory.

[39]  Shunsuke Ihara,et al.  On the Capacity of Channels with Additive Non-Gaussian Noise , 1978, Inf. Control..

[40]  David Gesbert,et al.  Joint power control and user scheduling in multicell wireless networks: Capacity scaling laws , 2007, ArXiv.

[41]  Jeffrey G. Andrews,et al.  Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation , 2007, IEEE Transactions on Information Theory.

[42]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[43]  Sriram Vishwanath,et al.  Capacity of Symmetric K-User Gaussian Very Strong Interference Channels , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[44]  Syed Ali Jafar,et al.  Degrees of Freedom of the MIMO Interference Channel With Cooperation and Cognition , 2009, IEEE Transactions on Information Theory.

[45]  Sergio Verdú,et al.  On limiting characterizations of memoryless multiuser capacity regions , 1993, IEEE Trans. Inf. Theory.

[46]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[47]  Syed Ali Jafar,et al.  Approaching the Capacity of Wireless Networks through Distributed Interference Alignment , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[48]  V. Cadambe,et al.  Interference alignment with asymmetric complex signaling , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[49]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[50]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

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

[52]  H. Vincent Poor,et al.  Interference Alignment for Secrecy , 2008, IEEE Transactions on Information Theory.

[53]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[54]  Igal Sason,et al.  On achievable rate regions for the Gaussian interference channel , 2004, IEEE Transactions on Information Theory.

[55]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[56]  Shlomo Shamai,et al.  Degrees of Freedom Region of the MIMO $X$ Channel , 2008, IEEE Transactions on Information Theory.

[57]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[58]  Te Sun Han,et al.  The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources , 1979, Inf. Control..

[59]  Jeffrey G. Andrews,et al.  The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.