Robust Communication via Decentralized Processing With Unreliable Backhaul Links

A source communicates with a remote destination via a number of distributed relays. Communication from source to relays takes place over a (discrete or Gaussian) broadcast channel, while the relays are connected to the receiver via orthogonal finite-capacity links. Unknowns to the source and relays, link failures may occur between any subset of relays and the destination in a nonergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures, assuming the relays to be oblivious to the source codebook. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques. Numerical results show that lower and upper bounds are quite close over most operating regimes, and provide insight into optimal transmission design choices for the scenario at hand. Extension to the case of nonoblivious relays is also discussed.

[1]  Anthony Ephremides,et al.  Multiple description coding in networks with congestion problem , 2001, IEEE Trans. Inf. Theory.

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

[3]  Andrea J. Goldsmith,et al.  Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[5]  Shlomo Shamai,et al.  The two-tap input-earasure Gaussian channel and its application to cellular communications , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[6]  Brett Schein,et al.  Distributed coordination in network information theory , 2001 .

[7]  Toby Berger,et al.  The CEO problem [multiterminal source coding] , 1996, IEEE Trans. Inf. Theory.

[8]  Andrea J. Goldsmith,et al.  Capacity Definitions of General Channels with Receiver Side Information , 2007, 2007 IEEE International Symposium on Information Theory.

[9]  E. Erkip,et al.  Source and Channel Coding for Quasi-Static Fading Channels , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[10]  Shlomo Shamai,et al.  Oblivious relaying for primitive interference relay channels , 2010 .

[11]  Vinod M. Prabhakaran,et al.  Rate region of the quadratic Gaussian CEO problem , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[12]  David Tse,et al.  Optimal power allocation over parallel Gaussian broadcast channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[14]  Kannan Ramchandran,et al.  n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes , 2004, IEEE Transactions on Information Theory.

[15]  A. Sridharan.  Broadcast Channels , 2022 .

[16]  Suhas N. Diggavi,et al.  Successive Refinement Via Broadcast: Optimizing Expected Distortion of a Gaussian Source Over a Gaussian Fading Channel , 2008, IEEE Transactions on Information Theory.

[17]  Shlomo Shamai,et al.  Communication Via Decentralized Processing , 2005, IEEE Transactions on Information Theory.

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

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

[20]  Michelle Effros,et al.  On the achievable region for multiple description source codes on Gaussian sources , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[21]  Jeffrey G. Andrews,et al.  Rethinking information theory for mobile ad hoc networks , 2007, IEEE Communications Magazine.

[22]  Michael Gastpar,et al.  The Wyner-Ziv problem with multiple sources , 2004, IEEE Transactions on Information Theory.

[23]  Abdel R. El Gamal,et al.  On information flow in relay networks , 1981 .

[24]  Toby Berger,et al.  Robust Distributed Source Coding , 2006, IEEE Transactions on Information Theory.

[25]  Kannan Ramchandran,et al.  On rate-constrained distributed estimation in unreliable sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[26]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[27]  Kannan Ramchandran,et al.  n-channel symmetric multiple descriptions-part II:An achievable rate-distortion region , 2005, IEEE Transactions on Information Theory.

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