TY - GEN
T1 - A high-efficiency semi-distributed resource allocation in OFDMA-based wireless relay networks
AU - Zhang, Shengbo
AU - Xia, Xiang Gen
PY - 2013
Y1 - 2013
N2 - In this paper, the problem of semi-distributed resource allocation is considered in an orthogonal frequency division multiple access (OFDMA) downlink transmission of wireless relay networks, where subcarriers are allocated to the relay stations at the base station (BS) only with a small part of channel state information (CSI), and afterwards subcarrier and power are allocated to the users at the relay stations with perfect CSI. A high-efficiency semi-distributed algorithm of linear complexity is proposed to address the joint resource allocation, which observably reduces the computational complexity of the subcarrier allocation at the BS and alleviates the uplink transmission of CSI feedback from the relay stations. It is shown through numerical evaluation that the performance of the proposed semi-distributed algorithm is close to the optimal joint subcarrier and power allocation, which is of exponential complexity and requires entire CSI at the BS.
AB - In this paper, the problem of semi-distributed resource allocation is considered in an orthogonal frequency division multiple access (OFDMA) downlink transmission of wireless relay networks, where subcarriers are allocated to the relay stations at the base station (BS) only with a small part of channel state information (CSI), and afterwards subcarrier and power are allocated to the users at the relay stations with perfect CSI. A high-efficiency semi-distributed algorithm of linear complexity is proposed to address the joint resource allocation, which observably reduces the computational complexity of the subcarrier allocation at the BS and alleviates the uplink transmission of CSI feedback from the relay stations. It is shown through numerical evaluation that the performance of the proposed semi-distributed algorithm is close to the optimal joint subcarrier and power allocation, which is of exponential complexity and requires entire CSI at the BS.
UR - http://www.scopus.com/inward/record.url?scp=84881596389&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2013.6555088
DO - 10.1109/WCNC.2013.6555088
M3 - Conference contribution
AN - SCOPUS:84881596389
SN - 9781467359399
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 3277
EP - 3281
BT - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
T2 - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
Y2 - 7 April 2013 through 10 April 2013
ER -