Decentralized two-Hop opportunistic relaying with limited channel state information

Document Type

Conference Proceeding

Publication Date

9-29-2008

Abstract

A network consisting of n source-destination pairs and m relays with no direct link between source and destination nodes, 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 joint scheduling among relays is allowed. Furthermore, a novel opportunistic relaying scheme with receiver CSI, partial transmitter CSI, and decentralized relay scheduling, is shown to achieve the optimal throughput scaling law of log n. © 2008 IEEE.

Identifier

52349087775 (Scopus)

ISBN

[9781424422579]

Publication Title

IEEE International Symposium on Information Theory Proceedings

External Full Text Location

https://doi.org/10.1109/ISIT.2008.4595202

ISSN

21578101

First Page

1323

Last Page

1327

Grant

0625637

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS