TY - GEN
T1 - Joint optimization in multi-user MIMO-OFDMA relay-enhanced cellular networks
AU - Zu, Lijun
AU - Ji, Yusheng
AU - Wang, Liping
AU - Zhong, Lei
AU - Liu, Fuqiang
AU - Wang, Ping
AU - Xu, Jing
PY - 2011
Y1 - 2011
N2 - MIMO, OFDMA and cooperative relaying are the key technologies in future wireless communication systems. However, under the usage of these technologies, resource allocation becomes a more crucial and challenging task. In multi-user MIMO-OFDMA relay-enhanced cellular networks, we formulate the optimal instantaneous resource allocation problem including user group selection, path selection, power allocation, and subchannel scheduling to maximize system capacity. We first propose a low-complex resource allocation algorithm named CP-CP under constant uniform power allocation and then use a water-filling method named CP-AP to allocate power among transmitting antennas. Moreover, we solve the original optimization problem efficiently by using the Jensen's inequality and propose a modified iterative water-filling algorithm named AP-CP. Based on AP-CP, the AP-AP algorithm is proposed to allocate power adaptively not only among subchannels but also among multiple transmitting. Finally, we compare the performance of the four schemes. Our results show that allocating power among subchannels is more effective than among transmitting antennas if the average signal-to-noise radio of users is low, and vice versa. Furthermore, the AP-AP algorithm achieves the highest throughout especially for users near the cell edge.
AB - MIMO, OFDMA and cooperative relaying are the key technologies in future wireless communication systems. However, under the usage of these technologies, resource allocation becomes a more crucial and challenging task. In multi-user MIMO-OFDMA relay-enhanced cellular networks, we formulate the optimal instantaneous resource allocation problem including user group selection, path selection, power allocation, and subchannel scheduling to maximize system capacity. We first propose a low-complex resource allocation algorithm named CP-CP under constant uniform power allocation and then use a water-filling method named CP-AP to allocate power among transmitting antennas. Moreover, we solve the original optimization problem efficiently by using the Jensen's inequality and propose a modified iterative water-filling algorithm named AP-CP. Based on AP-CP, the AP-AP algorithm is proposed to allocate power adaptively not only among subchannels but also among multiple transmitting. Finally, we compare the performance of the four schemes. Our results show that allocating power among subchannels is more effective than among transmitting antennas if the average signal-to-noise radio of users is low, and vice versa. Furthermore, the AP-AP algorithm achieves the highest throughout especially for users near the cell edge.
UR - https://www.scopus.com/pages/publications/79959299869
U2 - 10.1109/WCNC.2011.5779131
DO - 10.1109/WCNC.2011.5779131
M3 - 会议稿件
AN - SCOPUS:79959299869
SN - 9781612842547
T3 - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
SP - 13
EP - 18
BT - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
T2 - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
Y2 - 28 March 2011 through 31 March 2011
ER -