Cooperative Networks with Channel Uncertainty

In this thesis, cooperative networks are studied under the assumption that the source is uncertain about the channel in operation. In the first chapter, cooperative strategies are developed for simultaneous relay channels (SRC) which consist of a set of two single relay channels out of which the channel in operation is chosen. This is equivalent to the broadcast relay channel (BRC). Bounds on the capacity region of the general BRC with two helper relays are derived. Capacity results are obtained for specific cases of semi-degraded and degraded Gaussian simultaneous relay channels. In the second chapter, the composite relay channel is considered where the channel is randomly drawn from a set of conditional distributions according to a given distribution. The transmission rate is fixed regardless of the current channel and the asymptotic error probability (EP) is characterized. A novel selective coding strategy (SCS) is introduced which enables relays to select –based on their channel measurement– the best coding scheme between Compress-and-Forward (CF) and Decode-and-Forward (DF). Generalized Noisy Network Coding theorems are shown for the case of unicast general networks where the relays use either DF or CF scheme. In the third chapter, the asymptotic behavior of EP is studied for composite multiterminal networks. The asymptotic spectrum of EP is introduced as a novel performance measure for composite networks. It is shown that every code with rate outside cut-set bound, yields EP equal to one and for the networks satisfying strong converse condition, the asymptotic spectrum of EP coincides with the outage probability.

[1]  S. Shamai,et al.  Compound relay channel with informed relay and destination , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[3]  Suguru Arimoto,et al.  On the converse to the coding theorem for discrete memoryless channels (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[4]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[5]  Hesham El Gamal,et al.  The three-node wireless network: achievable rates and Cooperation strategies , 2005, IEEE Transactions on Information Theory.

[6]  Amir K. Khandani,et al.  A new achievable rate for the Gaussian parallel relay channel , 2009, 2009 IEEE International Symposium on Information Theory.

[7]  Abbas El Gamal,et al.  Bounds on capacity and minimum energy-per-bit for AWGN relay channels , 2006, IEEE Transactions on Information Theory.

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[10]  Mohammad Reza Aref,et al.  The capacity of the semideterministic relay channel , 1982, IEEE Trans. Inf. Theory.

[11]  Abbas El Gamal,et al.  An Outer Bound to the Capacity Region of the Broadcast Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[12]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[13]  Chandra Nair A note on outer bounds for broadcast channel , 2011, ArXiv.

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

[15]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[16]  Zhen Zhang,et al.  Partial converse for a relay channel , 1988, IEEE Trans. Inf. Theory.

[17]  Yuval Kochman,et al.  Rematch and forward for parallel relay networks , 2008, 2008 IEEE International Symposium on Information Theory.

[18]  R. Gallager Information Theory and Reliable Communication , 1968 .

[19]  Philippe Piret Binary codes for compound channels , 1985, IEEE Trans. Inf. Theory.

[20]  Edward C. van der Meulen,et al.  A proof of Marton's coding theorem for the discrete memoryless broadcast channel , 1981, IEEE Trans. Inf. Theory.

[21]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[22]  Abbas El Gamal,et al.  An outer bound to the capacity region of the broadcast channel , 2006, ISIT.

[23]  Gerhard Kramer,et al.  On message lengths for noisy network coding , 2011, 2011 IEEE Information Theory Workshop.

[24]  Shlomo Shamai,et al.  Oblivious Cooperation in Colocated Wireless Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[25]  Kenneth Rose,et al.  Graph capacities and zero-error transmission over compound channels , 2005, IEEE Transactions on Information Theory.

[26]  Te Sun Han The capacity region for the deterministic broadcast channel with a common message , 1981, IEEE Trans. Inf. Theory.

[27]  Federico Kuhlmann,et al.  Achievability proof of some multiuser channel coding theorems using backward decoding , 1989, IEEE Trans. Inf. Theory.

[28]  Sudhir Dixit,et al.  Wireless relays for broadband access [radio communications series] , 2008, IEEE Communications Magazine.

[29]  Patrick Mitran,et al.  On compound channels with side information at the transmitter , 2006, IEEE Transactions on Information Theory.

[30]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[31]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

[32]  Aria Nosratinia,et al.  Outage analysis of coded cooperation , 2006, IEEE Transactions on Information Theory.

[33]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.

[34]  Shlomo Shamai,et al.  Cooperative Schemes for a Source and an Occasional Nearby Relay in Wireless Networks , 2009, IEEE Transactions on Information Theory.

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

[36]  Gerhard Fettweis,et al.  Relay-based deployment concepts for wireless and mobile broadband radio , 2004, IEEE Communications Magazine.

[37]  Wei Yu,et al.  Capacity of a Class of Modulo-Sum Relay Channels , 2007, IEEE Transactions on Information Theory.

[38]  Shlomo Shamai,et al.  Variable-Rate Channel Capacity , 2010, IEEE Transactions on Information Theory.

[39]  Gerhard Kramer,et al.  The multicast capacity of deterministic relay networks with no interference , 2006, IEEE Transactions on Information Theory.

[40]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[41]  Yingbin Liang,et al.  Cooperative relay broadcast channels , 2005 .

[42]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[43]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[44]  John C. Kieffer,et al.  $\epsilon$-Capacity of Binary Symmetric Averaged Channels , 2007, IEEE Transactions on Information Theory.

[45]  Charalambos D. Charalambous,et al.  Information Theoretic Bounds for Compound MIMO Gaussian Channels , 2009, IEEE Transactions on Information Theory.

[46]  J. Nicholas Laneman,et al.  Window decoding for the multiaccess channel with generalized feedback , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[47]  Amiel Feinstein,et al.  A new basic theorem of information theory , 1954, Trans. IRE Prof. Group Inf. Theory.

[48]  Yingbin Liang,et al.  The impact of relaying on the capacity of broadcast channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[50]  Lawrence H. Ozarow,et al.  An achievable region and outer bound for the Gaussian broadcast channel with feedback , 1984, IEEE Trans. Inf. Theory.

[51]  Robert B. Ash,et al.  A simple example of a channel for which the strong converse fails (Corresp.) , 1965, IEEE Transactions on Information Theory.

[52]  Aydano B. Carleial,et al.  Multiple-access channels with different generalized feedback signals , 1982, IEEE Trans. Inf. Theory.

[53]  H. Vincent Poor,et al.  On the Sum-Capacity of Degraded Gaussian Multiple-Access Relay Channels , 2008, IEEE Transactions on Information Theory.

[54]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

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

[56]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

[57]  Sae-Young Chung,et al.  Noisy network coding , 2010 .

[58]  Vinod M. Prabhakaran,et al.  The Two-User Compound Interference Channel , 2009, IEEE Transactions on Information Theory.

[59]  Rudolf Ahlswede,et al.  The weak capacity of averaged channels , 1968 .

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

[61]  Yingbin Liang,et al.  Gaussian orthogonal relay channels: optimal resource allocation and capacity , 2005, IEEE Transactions on Information Theory.

[62]  Arash Behboodi,et al.  On the asymptotic error probability of composite relay channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[63]  Arash Behboodi,et al.  Capacity of a class of broadcast relay channels , 2010, 2010 IEEE International Symposium on Information Theory.

[64]  Arash Behboodi,et al.  On the simultaneous relay channel with informed receivers , 2009, 2009 IEEE International Symposium on Information Theory.

[65]  Andrea J. Goldsmith,et al.  The impact of CSI and power allocation on relay channel capacity and cooperation strategies , 2007, IEEE Transactions on Wireless Communications.

[66]  J. Wolfowitz Simultaneous channels , 1959 .

[67]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[68]  Gerhard Kramer,et al.  Offset Encoding for Multiple-Access Relay Channels , 2007, IEEE Transactions on Information Theory.

[69]  Xiugang Wu,et al.  On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.

[70]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[71]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[72]  Panganamala Ramana Kumar,et al.  Multisource, Multidestination, Multirelay Wireless Networks , 2007, IEEE Transactions on Information Theory.

[73]  Andrea J. Goldsmith,et al.  Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels , 2010, IEEE Transactions on Information Theory.

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

[75]  Thomas M. Cover,et al.  Open Problems in Communication and Computation , 2011, Springer New York.

[76]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[77]  Abbas El Gamal,et al.  The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

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

[79]  Shlomo Shamai,et al.  Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel , 2006, IEEE Transactions on Information Theory.

[80]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.

[81]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

[82]  Andrea J. Goldsmith,et al.  Capacity of Time-Varying Channels With Causal Channel Side Information , 1997, IEEE Transactions on Information Theory.

[83]  A.J. van Wijngaarden,et al.  On the white Gaussian multiple-access relay channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[84]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[85]  János Körner,et al.  Images of a set via two channels and their role in multi-user communication , 1977, IEEE Trans. Inf. Theory.

[86]  Mohammad Reza Aref,et al.  Information flow in relay networks , 1981 .

[87]  Emre Telatar,et al.  The Compound Channel Capacity of a Class of Finite-State Channels , 1998, IEEE Trans. Inf. Theory.

[88]  Arash Behboodi,et al.  Broadcasting over the relay channel with oblivious cooperative strategy , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[89]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

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

[91]  H. Vincent Poor,et al.  Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution , 2007, IEEE Transactions on Information Theory.

[92]  Shlomo Shamai,et al.  Transmitting to colocated users in wireless ad hoc and sensor networks , 2005, IEEE Transactions on Information Theory.

[93]  Sanjeev R. Kulkarni,et al.  Broadcast-relay channel: capacity region bounds , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[94]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

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

[96]  Haim H. Permuter,et al.  Feedback Capacity of the Compound Channel , 2007, IEEE Transactions on Information Theory.

[97]  Abbas El Gamal,et al.  The capacity of the physically degraded Gaussian broadcast channel with feedback , 1981, IEEE Trans. Inf. Theory.

[98]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[99]  Shlomo Shamai,et al.  The Capacity Region of the Degraded Multiple-Input Multiple-Output Compound Broadcast Channel , 2009, IEEE Transactions on Information Theory.

[100]  Ron Dabora,et al.  On the rates for the general broadcast channel with partially cooperating receivers , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[101]  Chi Wan Sung,et al.  The multiuser Gaussian parallel relay network , 2008, 2008 International Symposium on Information Theory and Its Applications.

[102]  Yingbin Liang,et al.  Rate Regions for Relay Broadcast Channels , 2006, IEEE Transactions on Information Theory.

[103]  Te Sun Han,et al.  An Information-Spectrum Approach to Capacity Theorems for the General Multiple-Access Channel , 1998, IEEE Trans. Inf. Theory.

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

[105]  Mehul Motani,et al.  Generalized Backward Decoding Strategies for the Relay Channel , 2007, IEEE Transactions on Information Theory.

[106]  Roy D. Yates,et al.  Forwarding strategies for Gaussian parallel-relay networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[107]  Gerald Matz,et al.  Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors , 2007, IEEE Transactions on Information Theory.

[108]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[109]  Abbas El Gamal,et al.  The capacity of a class of broadcast channels , 1979, IEEE Trans. Inf. Theory.

[110]  Aria Nosratinia,et al.  CTH13-2: Relay Channel with Private Messages , 2006, IEEE Globecom 2006.

[111]  Sibi Raj Bhaskaran Gaussian Degraded Relay Broadcast Channel , 2008, IEEE Transactions on Information Theory.

[112]  Shlomo Shamai,et al.  Fading channels (invited paper): information-theoretic and communications aspects , 2000 .

[113]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.