On the capacity of erasure relay channel: multi-relay case

We consider here a single sender-destination multi-relay channel. The links connecting the nodes are supposed to be erasure where symbols are received correctly without any error, or lost. We consider that the nodes are not able to use any interference cancellation mechanism. The interference might be suppressed through using separated physical channel or thought a time-sharing mechanism. This model is realistic for many practical scenarios in the context of wireless networks. In previous works, the capacity region of broadcast erasure channels as well as the capacity of the single-sender relay channel (under degraded and non-degraded hypothesis) has been derived. This paper extends the previous results to the more general case of multi-relay channels. We derive the cut-set bound for a general (stationary ergodic) multi-relay erasure channel, and we show that it can be reached through a practical linear coding scheme based on MDS codes.

[1]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[2]  R. Khalili,et al.  On the achievability of cut-set bound for a class of erasure relay channels , 2004, International Workshop on Wireless Ad-Hoc Networks, 2004..

[3]  Panganamala Ramana Kumar,et al.  Towards an information theory of large networks: an achievable rate region , 2003, IEEE Trans. Inf. Theory.

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

[5]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Kavé Salamatian,et al.  A new relaying scheme for cheap wireless relay nodes , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[7]  Abbas El Gamal,et al.  Capacity theorems for relay channels , 1979 .

[8]  Ramin Khalili,et al.  On the achievability of cut-set bound for a class of relay channels , 2004 .

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

[10]  Ashutosh Sabharwal,et al.  Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints , 2003, IPSN.

[11]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[12]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[13]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[14]  van der MeulenE..  A Survey of Multi-Way Channels in Information Theory: , 1977 .

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

[16]  Madhu Sudan,et al.  Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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