TY - GEN
T1 - Throughput of two-hop wireless networks with relay cooperation
AU - Niu, Bo
AU - Haimovich, Alexander M.
AU - Somekh, Oren
PY - 2007
Y1 - 2007
N2 - In this paper, we consider the throughput problem of a wireless fading network with two-hop relaying, where n single antenna source-destination pairs communicate through a set of single antenna relays using amplify-and-forward strategy Two different cooperation schemes at the relay nodes are considered, where the relays share either channel state information (CSI) or both CSI and received signals. The high level of cooperation is justified for a case where the relaying role is fulfilled by infrastructure nodes that can communicate through a wired backbone without an overhead on the wireless channel. We show that in the first case, at least n2 relays are needed to achieve linear scaling of the system throughput versus n. In the second case, exchanging the received signals at the relays can reduce the needed number of relays to n in order to achieve linear scaling. It is also shown that the second cooperation scheme achieves a strictly positive per node throughput, where the total number of nodes accounted for includes the relays.
AB - In this paper, we consider the throughput problem of a wireless fading network with two-hop relaying, where n single antenna source-destination pairs communicate through a set of single antenna relays using amplify-and-forward strategy Two different cooperation schemes at the relay nodes are considered, where the relays share either channel state information (CSI) or both CSI and received signals. The high level of cooperation is justified for a case where the relaying role is fulfilled by infrastructure nodes that can communicate through a wired backbone without an overhead on the wireless channel. We show that in the first case, at least n2 relays are needed to achieve linear scaling of the system throughput versus n. In the second case, exchanging the received signals at the relays can reduce the needed number of relays to n in order to achieve linear scaling. It is also shown that the second cooperation scheme achieves a strictly positive per node throughput, where the total number of nodes accounted for includes the relays.
UR - http://www.scopus.com/inward/record.url?scp=77958104142&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77958104142&partnerID=8YFLogxK
M3 - Conference contribution
T3 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007
SP - 206
EP - 211
BT - 45th Annual Allerton Conference on Communication, Control, and Computing 2007
PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
T2 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007
Y2 - 26 September 2007 through 28 September 2007
ER -