TY - GEN

T1 - Relay assignment schemes for multiple source-destination cooperative networks

AU - Zhang, Xuehua

AU - Ghrayeb, Ali

AU - Hasna, Mazen

PY - 2010

Y1 - 2010

N2 - In this paper, we consider cooperative networks comprising multiple simultaneous transmitting sourcedestination pairs. Specifically, we propose two relay assignment schemes whereby one relay is assigned to one pair at any given time. It is assumed that the number of relays equals or exceeds the number of pairs. This assumption is practical because in future wireless networks, any node in the network can serve as a relay. Both assignment schemes are based on the quality of the subchannels, implying that estimates of the subchannels should be available before the relays are assigned to the pairs. The first assignment scheme is optimal since it considers all possible relay assignment permutations. The second one is suboptimal since it considers only a subset of the possible permutations. The advantages of the latter is that it makes the performance analysis more tractable and reduces the complexity of the assignment process. We derive closed-form expressions for the end-to-end bit error rate performance and show that the full diversity is maintained in both schemes, which equals the number of relays (assuming no direct path between the source and destination nodes). We give several numerical examples that validate the theoretical results.

AB - In this paper, we consider cooperative networks comprising multiple simultaneous transmitting sourcedestination pairs. Specifically, we propose two relay assignment schemes whereby one relay is assigned to one pair at any given time. It is assumed that the number of relays equals or exceeds the number of pairs. This assumption is practical because in future wireless networks, any node in the network can serve as a relay. Both assignment schemes are based on the quality of the subchannels, implying that estimates of the subchannels should be available before the relays are assigned to the pairs. The first assignment scheme is optimal since it considers all possible relay assignment permutations. The second one is suboptimal since it considers only a subset of the possible permutations. The advantages of the latter is that it makes the performance analysis more tractable and reduces the complexity of the assignment process. We derive closed-form expressions for the end-to-end bit error rate performance and show that the full diversity is maintained in both schemes, which equals the number of relays (assuming no direct path between the source and destination nodes). We give several numerical examples that validate the theoretical results.

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

U2 - 10.1109/ICTEL.2010.5478645

DO - 10.1109/ICTEL.2010.5478645

M3 - Conference contribution

AN - SCOPUS:77954545979

SN - 9781424452477

T3 - ICT 2010: 2010 17th International Conference on Telecommunications

SP - 147

EP - 152

BT - ICT 2010

T2 - 2010 17th International Conference on Telecommunications, ICT 2010

Y2 - 4 April 2010 through 7 April 2010

ER -