Computer Science – Information Theory
Scientific paper
2008-01-15
Computer Science
Information Theory
Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008
Scientific paper
A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is shown that, under the practical constraints of single-user encoding-decoding scheme, and partial channel state information (CSI) at the transmitters (via integer-value feedback from the receivers), the maximal throughput scales as $\log n$ even if full relay cooperation is allowed. Furthermore, a novel decentralized opportunistic relaying scheme with receiver CSI, partial transmitter CSI, and no relay cooperation, is shown to achieve the optimal throughput scaling law of $\log n$.
Cui Shengshan
Haimovich Alexander M.
Poor Harold Vincent
Somekh Oren
No associations
LandOfFree
Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-151264