Decentralized two-Hop opportunistic relaying with limited channel state information

Shengshan Cui; Alexander M. Haimovich; Oren Somekh; H. Vincent Poor

doi:10.1109/ISIT.2008.4595202

Decentralized two-Hop opportunistic relaying with limited channel state information

Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

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.

Original language	English (US)
Title of host publication	Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages	1323-1327
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2008.4595202
State	Published - 2008
Externally published	Yes
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: Jul 6 2008 → Jul 11 2008

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto, ON
Period	7/6/08 → 7/11/08

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2008.4595202

Cite this

Cui, S., Haimovich, A. M., Somekh, O., & Poor, H. V. (2008). Decentralized two-Hop opportunistic relaying with limited channel state information. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 1323-1327). Article 4595202 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595202

@inproceedings{78005d09036347e9bcc0728f5b43559f,

title = "Decentralized two-Hop opportunistic relaying with limited channel state information",

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.",

author = "Shengshan Cui and Haimovich, {Alexander M.} and Oren Somekh and Poor, {H. Vincent}",

year = "2008",

doi = "10.1109/ISIT.2008.4595202",

language = "English (US)",

isbn = "9781424422579",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1323--1327",

booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

Cui, S, Haimovich, AM, Somekh, O & Poor, HV 2008, Decentralized two-Hop opportunistic relaying with limited channel state information. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595202, IEEE International Symposium on Information Theory - Proceedings, pp. 1323-1327, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 7/6/08. https://doi.org/10.1109/ISIT.2008.4595202

Decentralized two-Hop opportunistic relaying with limited channel state information. / Cui, Shengshan; Haimovich, Alexander M.; Somekh, Oren et al.
Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 1323-1327 4595202 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Decentralized two-Hop opportunistic relaying with limited channel state information

AU - Cui, Shengshan

AU - Haimovich, Alexander M.

AU - Somekh, Oren

AU - Poor, H. Vincent

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=52349087775&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349087775&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595202

DO - 10.1109/ISIT.2008.4595202

M3 - Conference contribution

AN - SCOPUS:52349087775

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1323

EP - 1327

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

Decentralized two-Hop opportunistic relaying with limited channel state information

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this