On the capacity of erasure relay channel: multi-relay case
- 1 January 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- A New Relaying Scheme for Cheap Wireless Relay NodesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the capacity of wireless erasure relay networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- On the achievability of cut-set bound for a class of erasure relay channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Towards an information theory of large networks: an achievable rate regionIEEE Transactions on Information Theory, 2003
- Elements of Information TheoryPublished by Wiley ,2001
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- About priority encoding transmissionIEEE Transactions on Information Theory, 2000
- Some intersection theorems for ordered sets and graphsJournal of Combinatorial Theory, Series A, 1986
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- A survey of multi-way channels in information theory: 1961-1976IEEE Transactions on Information Theory, 1977