Cooperative Interference Management in Wireless Networks

With the growing number of users along with ever-increasing demand for higher data rates and better quality of service in modern wireless networks, interference has become the major barrier against efficient utilization of limited resources. On the other hand, opportunities for cooperation among radios also increase with the growing number of users, which potentially lead to better interference management. In traditional wireless system design, however, such opportunities are usually neglected and only basic interference management schemes are employed, mainly due to lack of fundamental understanding of interference and cooperation. In this dissertation, we study the fundamental aspects of cooperative interference management through the lens of network information theory. In the first and the second part, we characterize both qualitatively and quantitatively how limited cooperation between transmitting or receiving terminals helps mitigate interference in a canonical two-transmitter-two-receiver wireless system. We identify two regions regarding the gain from limited cooperation: linear and saturation regions. In the linear region cooperation is efficient and provides a degrees-of-freedom gain, which is either one cooperation bit buys one bit over the air or two cooperation bits buy one bit over the air until saturation. In the saturation region cooperation is inefficient and only provides a bounded power gain. The conclusions are drawn from the approximate characterization of the capacity regions.In the third part, we investigate how intermediate relay nodes help resolve interference in delivering information from two sources to their respective destinations in multi-hop wireless networks. We focus on a linear deterministic approximate model for wireless networks, and when the minimum cut value between each source-destination pair is constrained to be 1, we completely characterize the capacity region. One of the interesting findings is that, at most four nodes need to take special coding operations so that interference can be canceled over-the-air or within-a-node, while other nodes can take oblivious operations. We also develop a systematic approach to identify these special nodes.

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

[2]  Brendan J. Frey,et al.  Interactive Decoding of a Broadcast Message , 2003 .

[3]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[4]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[5]  Young-Han Kim,et al.  Coding Techniques for Primitive Relay Channels , 2008 .

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

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

[9]  Anders Høst-Madsen,et al.  Capacity bounds for Cooperative diversity , 2006, IEEE Transactions on Information Theory.

[10]  Ness B. Shroff,et al.  Pairwise Intersession Network Coding on Directed Networks , 2010, IEEE Transactions on Information Theory.

[11]  David Tse,et al.  Quantize-map-and-forward relaying: Coding and system design , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[13]  Wei Yu,et al.  Gaussian Z-Interference Channel With a Relay Link: Achievability Region and Asymptotic Sum Capacity , 2010, IEEE Transactions on Information Theory.

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

[15]  Shlomo Shamai,et al.  Communication via decentralized processing , 2005, ISIT.

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

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

[18]  Sae-Young Chung,et al.  Aligned interference neutralization and the degrees of freedom of the 2 × 2 × 2 interference channel , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[19]  David Tse,et al.  Interference mitigation through limited transmitter cooperation , 2010, 2010 IEEE International Symposium on Information Theory.

[20]  Shlomo Shamai,et al.  Compound Multiple-Access Channels With Partial Cooperation , 2008, IEEE Transactions on Information Theory.

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

[22]  Young-Han Kim,et al.  Capacity of a Class of Deterministic Relay Channels , 2006, 2007 IEEE International Symposium on Information Theory.

[23]  Muriel Médard,et al.  Algebraic network coding approach to deterministic wireless relay networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[24]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[25]  Wei Wu,et al.  Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets , 2007, IEEE Transactions on Information Theory.

[26]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[27]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[28]  David Tse,et al.  Two unicast information flows over linear deterministic networks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[30]  Vinod M. Prabhakaran,et al.  Interference Channels With Source Cooperation , 2009, IEEE Transactions on Information Theory.

[31]  Andrea J. Goldsmith,et al.  On the capacity of the interference channel with a relay , 2008, 2008 IEEE International Symposium on Information Theory.

[32]  Ilan Shomorony,et al.  Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom , 2011, IEEE Transactions on Information Theory.

[33]  David Tse,et al.  Interference Mitigation Through Limited Receiver Cooperation , 2009, IEEE Transactions on Information Theory.

[34]  Amir K. Khandani,et al.  On the Symmetric Gaussian Interference Channel with Partial Unidirectional Cooperation , 2009, ArXiv.

[35]  Ron Dabora,et al.  Broadcast Channels With Cooperating Decoders , 2006, IEEE Transactions on Information Theory.

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

[37]  David Tse,et al.  The two-user Gaussian interference channel: a deterministic view , 2008, Eur. Trans. Telecommun..

[38]  Suhas N. Diggavi,et al.  Approximate Capacity of a Class of Gaussian Interference-Relay Networks , 2011, IEEE Transactions on Information Theory.

[39]  V. Anantharam,et al.  Generalized Network Sharing Outer Bound and the Two-Unicast Problem , 2011, 2011 International Symposium on Networking Coding.

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

[41]  Pramod Viswanath,et al.  Cognitive Radio: An Information-Theoretic Perspective , 2009, IEEE Transactions on Information Theory.

[42]  Vinod M. Prabhakaran,et al.  Interference Channels With Destination Cooperation , 2009, IEEE Transactions on Information Theory.

[43]  Amos Lapidoth,et al.  The Gaussian MAC with conferencing encoders , 2008, 2008 IEEE International Symposium on Information Theory.

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

[45]  Wei Yu,et al.  Universal relaying for the interference channel , 2010, 2010 Information Theory and Applications Workshop (ITA).

[46]  Gerhard Fettweis,et al.  Coordinated Multi-Point in Mobile Communications: From Theory to Practice , 2011 .

[47]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[48]  Slawomir Stanczak,et al.  Coding theorems for the restricted half-duplex two-way relay channel with joint decoding , 2008, 2008 IEEE International Symposium on Information Theory.

[49]  Venugopal V. Veeravalli,et al.  Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region , 2008, IEEE Transactions on Information Theory.

[50]  Elza Erkip,et al.  Interference channel with a relay: Models, relaying strategies, bounds , 2009, 2009 Information Theory and Applications Workshop.

[51]  Vinod M. Prabhakaran,et al.  Reciprocity in linear deterministic networks under linear coding , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[52]  Zhen Zhang,et al.  An outer bound for multisource multisink network coding with minimum cost consideration , 2006, TNET.

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

[54]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[55]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[56]  Yi Cao,et al.  An Achievable Rate Region for Interference Channels with Conferencing , 2007, 2007 IEEE International Symposium on Information Theory.

[57]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[58]  Daniela Tuninetti,et al.  State of the cognitive interference channel: a new unified inner bound, and capacity to within 1.87 bits , 2009, ArXiv.

[59]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.