TY - JOUR
T1 - Queue-architecture and stability analysis in cooperative relay networks
AU - Jose, Jubin
AU - Vishwanath, Sriram
AU - Ying, Lei
N1 - Funding Information:
Manuscript received 20 January 2011; revised 20 June 2011. J. Jose and S. Vishwanath were supported in part by the DoD, the ARO Young Investigator Program (YIP) and the NSF grant CNS-0831756. L. Ying was supported in part by CNS-0831756, CNS-0953165 and the DTRA Grants HDTRA1-08-1-0016 and HDTRA1-09-1-0055.
PY - 2012
Y1 - 2012
N2 - An abstraction of the physical-layer coding using bit pipes that are coupled through data-rates is insufficient to capture notions such as node cooperation in cooperative relay networks. Consequently, network-stability analyses based on such abstractions are valid for non-cooperative schemes alone and meaningless for cooperative schemes. Motivated from this, this paper develops a framework that brings the information-theoretic coding scheme together with network-stability analysis. This framework does not constrain the system to any particular achievable scheme, i.e., the relays can use any cooperative coding strategy of its choice such as amplify/compress/quantize or any alter-and-forward scheme. The paper focuses on the scenario when coherence duration is of the same order of the packet/codeword duration, the channel distribution is unknown and the fading state is only known causally. The main contributions of this paper are two-fold: first, it develops a low-complexity queue-architecture to enable stable operation of cooperative relay networks, and, second, it establishes the throughput optimality of a simple network algorithm that utilizes this queue-architecture.
AB - An abstraction of the physical-layer coding using bit pipes that are coupled through data-rates is insufficient to capture notions such as node cooperation in cooperative relay networks. Consequently, network-stability analyses based on such abstractions are valid for non-cooperative schemes alone and meaningless for cooperative schemes. Motivated from this, this paper develops a framework that brings the information-theoretic coding scheme together with network-stability analysis. This framework does not constrain the system to any particular achievable scheme, i.e., the relays can use any cooperative coding strategy of its choice such as amplify/compress/quantize or any alter-and-forward scheme. The paper focuses on the scenario when coherence duration is of the same order of the packet/codeword duration, the channel distribution is unknown and the fading state is only known causally. The main contributions of this paper are two-fold: first, it develops a low-complexity queue-architecture to enable stable operation of cooperative relay networks, and, second, it establishes the throughput optimality of a simple network algorithm that utilizes this queue-architecture.
KW - Cooperative queue-architecture
KW - Stability analysis
KW - Throughput-optimal algorithm
UR - http://www.scopus.com/inward/record.url?scp=84866887339&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84866887339&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2012.121020
DO - 10.1109/JSAC.2012.121020
M3 - Article
AN - SCOPUS:84866887339
SN - 0733-8716
VL - 30
SP - 1754
EP - 1761
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 9
M1 - 6311234
ER -