Channels With Cooperation Links That May Be Absent

It is well known that cooperation between users in a communication network can lead to significant performance gains. A common assumption in past works is that all the users are aware of the resources available for cooperation, and know exactly to what extent these resources can be used. Unfortunately, in many modern communication networks, the availability of cooperation links cannot be guaranteed a priori, due to the dynamic nature of the network. In this paper, a family of models is suggested where the cooperation links may or may not be present. Coding schemes are devised that exploit the cooperation links if they are present, and can still operate (although at reduced rates) if cooperation is not possible.

[1]  Lior Dikstein,et al.  The state-dependent broadcast channel with cooperation , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

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

[4]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.

[5]  Bixio Rimoldi,et al.  Successive refinement of information: characterization of the achievable rates , 1994, IEEE Trans. Inf. Theory.

[6]  R. Yeung,et al.  On the rate-distortion region for multiple descriptions , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[7]  Haim H. Permuter,et al.  Multiple-Access Channel With Partial and Controlled Cribbing Encoders , 2013, IEEE Trans. Inf. Theory.

[8]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

[9]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[10]  Abbas El Gamal,et al.  Achievable rates for multiple descriptions , 1982, IEEE Trans. Inf. Theory.

[11]  Abbas El Gamal,et al.  Relay Networks With Delays , 2007, IEEE Transactions on Information Theory.

[12]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[13]  Lior Dikstein,et al.  On State-Dependent Degraded Broadcast Channels With Cooperation , 2016, IEEE Transactions on Information Theory.

[14]  Shlomo Shamai,et al.  Robust uplink communications over fading channels with variable backhaul connectivity , 2013, ISIT.

[15]  Haim H. Permuter,et al.  Cooperative Binning for Semideterministic Channels , 2016, IEEE Transactions on Information Theory.

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

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

[18]  Wasim Huleihel,et al.  Channels With Cooperation Links That May Be Absent , 2017, IEEE Trans. Inf. Theory.

[19]  Shlomo Shamai,et al.  Cooperative Wireless Cellular Systems: An Information-Theoretic View , 2012, Found. Trends Commun. Inf. Theory.

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

[21]  Wasim Huleihel,et al.  Multiple access channel with unreliable cribbing , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[22]  Ron Dabora,et al.  Broadcast channels with cooperating receivers: a downlink for the sensor reachback problem , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..