TY - GEN
T1 - Resource allocation for multicast services in multicarrier wireless communications
AU - Suh, Changho
AU - Mo, Jeonghoon
PY - 2006
Y1 - 2006
N2 - In multicast wireless communications, the difference in link conditions of users due to fading limits the capacity of multicast data. In this paper, we confirm this by proving that in wireless fading channel, multicast capacity is saturated as the number of users increases. However, if we assume that the multicast data are separated into layers and any combination of the layers can be decoded at the receiver, the network throughput can be increased by performing subcarrier/bit allocation. In this paper, we develop the optimum subcarrier/bit allocation methods for not only maximum throughput (MT) but also proportional fairness (PF) by employing integer programming (IP) which is NP-hard problem. To reduce the complexity, suboptimum two-step algorithms are also proposed separating subcarrier allocation and bit loading. Numerical results show that the proposed resource allocation schemes for both MT and PF significantly outperform the conventional multicast transmission technique depending on the lowest channel gain. Additionally, it is shown that the performance difference between the optimum and suboptimum algorithms for both MT and PF is within about 5%.
AB - In multicast wireless communications, the difference in link conditions of users due to fading limits the capacity of multicast data. In this paper, we confirm this by proving that in wireless fading channel, multicast capacity is saturated as the number of users increases. However, if we assume that the multicast data are separated into layers and any combination of the layers can be decoded at the receiver, the network throughput can be increased by performing subcarrier/bit allocation. In this paper, we develop the optimum subcarrier/bit allocation methods for not only maximum throughput (MT) but also proportional fairness (PF) by employing integer programming (IP) which is NP-hard problem. To reduce the complexity, suboptimum two-step algorithms are also proposed separating subcarrier allocation and bit loading. Numerical results show that the proposed resource allocation schemes for both MT and PF significantly outperform the conventional multicast transmission technique depending on the lowest channel gain. Additionally, it is shown that the performance difference between the optimum and suboptimum algorithms for both MT and PF is within about 5%.
UR - http://www.scopus.com/inward/record.url?scp=39049136089&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39049136089&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2006.246
DO - 10.1109/INFOCOM.2006.246
M3 - Conference contribution
AN - SCOPUS:39049136089
SN - 1424402212
SN - 9781424402212
T3 - Proceedings - IEEE INFOCOM
BT - Proceedings - INFOCOM 2006
T2 - INFOCOM 2006: 25th IEEE International Conference on Computer Communications
Y2 - 23 April 2006 through 29 April 2006
ER -