Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information
| dc.creator | Cui, Shengshan | |
| dc.creator | Haimovich, Alexander M. | |
| dc.creator | Somekh, Oren | |
| dc.creator | Poor, H. Vincent | |
| dc.date | 2008-01-15 | |
| dc.date | 2008-04-29 | |
| dc.date.accessioned | 2026-07-07T09:35:26Z | |
| dc.date.available | 2026-07-07T09:35:26Z | |
| dc.description | 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$. | |
| dc.description | Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008 | |
| dc.identifier | https://arxiv.org/abs/0801.2323 | |
| dc.identifier | http://arxiv.org/abs/0801.2323 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/159830 | |
| dc.subject | Information Theory | |
| dc.title | Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information | |
| dc.type | text |