Adaptive Multicast Scheme for OFDMA-based

Multicast Wireless Systems Using Layered Coding

Lei Chen
1
*, Xiaoxiang Wang
1
, Yinglei Teng
1
, Gaoning He
2

1
Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and
Telecommunications, 100876, Beijing, P. R. China
2
Alcatel Lucent Shanghai Bell, 201206, Shanghai, P. R. China
Email: chenleikb@gmail.com
1
*

AbstractIn conventional multicast scheme (CMS), the total
throughput of multicast group is constrained by the user with
the worst channel quality. In order to overcome this problem of
limited throughput, we consider a resource allocation algorithm
based on layered coding, when a limited feedback scheme is
considered. A novel subcarrier and power algorithm is exploited
for targeting the maximum throughput (MT) of enhancement
layers while at the same time guaranteeing the quality of services
(QoS) requirements of all users. In this paper, a three-step
subcarrier allocation algorithm and two power allocation
algorithms are proposed. Simulation results show that the
proposed algorithm significantly outperforms CMS. Moreover, it
obtains more throughput than another existing algorithm.
KeywordsMulticast, Resource Allocation, Layered Coding,
QoS
I. INTRODUCTION
Orthogonal Frequency Division Multiplexing Access
(OFDMA) has recently received considerable attention as one
of the most promising techniques for reliable and high-rate
date transmission over wireless channels. The principle of the
OFDMA technique is to divide the entire transmission
bandwidth into many orthogonal narrowband subcarriers and
transmit data over one or more orthogonal subcarriers to many
users. Along with recent advances in communications,
networking and signal processing technologies, multicast and
broadcast services become a trend of the next-generation
mobile cellular networks. MBMS (Multimedia Broadcast and
Multicast Service) [1] introduced by 3GPP in Release 6 and
MBS (Multicast and Broadcast Service) [2] defined in
IEEE802.16e are the representative mechanisms support
multicast and broadcast services, which adopt multicast
transmissions to efficiently utilize radio resources. In CMS, in
order to guarantee that all users have similar data rates, the
transmission rate is dictated by the rate of the worst-channel
user in the multicast group [3]. Since CMS only exploits the
multicast gain, neglecting the multi-user diversity gain, it
usually leads to throughput limitation. In order to overcome
this problem, layered coding is introduced to multicast
transmission algorithms. In the layered coding transmission
mechanisms [4], the original multicast data is first encoded
into a base layer and several enhancement layers. The base
layer data includes the most essential information that can
guarantee the minimum service quality level. Moreover, at the
beginning of transmitting data, the base layer data should be
sent to all users with the highest priority. The enhancement
layers data contains additional information that is able to
improve the service quality in proportion to the amount of the
correctly received data. More layers can be received by users
who have better channel conditions. Therefore, the algorithm
based layered coding can obtain more throughput than CMS.
Currently, many research interests have been focused on
dynamic resource allocation for multiple multicast groups
[5-7]. In [5], a resource allocation scheme has been introduced
to obtain the MT of all multicast groups. However, it has not
considered the fairness problem among multicast groups. In
[6], an efficient resource allocation scheme has been
introduced to balance the tradeoff between MT and fairness
among multicast groups. In [7], two proportional fair
multicast scheduling algorithms have been proposed among
groups and users, respectively.
A few research efforts have been dedicated on the resource
allocation problem within one multicast group [8-9]. In [8], a
dynamic subcarrier and bit allocation method has been
proposed to solve the MT problem by assuming that the
multicast data has been separated into layers and any
combination of layers can be decoded at the receiver side.
However, users QoS requirement has not been considered in
the algorithm. In [9], an optimal subcarrier allocation
algorithm has been proposed to maximize the global
throughput considering QoS constrains, but with high
computational complexity. Moreover, the data rates of each
subcarrier have been the limited number of constant values.
Therefore, the overall throughput has been limited because the
algorithm has not made full use of multi-user diversity on
each subcarrier.
In this paper, in order to overcome the shortcomings in [9],
we study the problem of dynamic subcarrier and power
allocation for a whole multicast group considering layered
coding. At the same time, the proposed algorithm shall
guarantee the QoS requirements for all users in each multicast
service group. We show that the considered problem can be
formulated into an optimization problem. However, the
computational complexity of the optimization problem shall
increase exponentially with the number of subcarriers and
users. To reduce the complexity, suboptimal algorithms are
proposed, when we adopt limited feedback scheme to reduce
the feedback load of uplink. In subcarrier allocation phase, it
is composed of three steps: base algorithm, QoS guarantee
algorithm and enhancement algorithm. In power allocation
phase, a modified water-filling power allocation is exploited.
To further reduce the complexity of modified water-filling
algorithm, we also proposed a power allocation algorithm
with increasing fixed power.
2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC)
978-1-4673-2569-1/12/$31.00 2012 IEEE 321
This paper is organized as follows. In section , we
describe the multicast system model and then we formulate
the optimum resource allocation algorithm for MT of
enhancement layers while at the same time guaranteeing QoS
requirements of all the users. In section , we propose a
suboptimum algorithm. Finally, we present numerical results
in sections and conclusions in sections , respectively.
II. SYSTEM MODEL AND PROBLEM FORMULATION
Fig. 1. Model of OFDMA-based wireless multicast with layered coding.

In this paper, we consider the downlink of single cell
OFDMA multicast system where one base station (BS) sends
information towards multiple users in one multicast group.
Fig. 1 shows the model of the system. The total frequency
band B of the system is divided into N subcarriers, shared by
K

users in one multicast group. Therefore, the bandwidth of
each subcarrier is B
0
=B/N. In order to reduce the load of
feedback, we adopt the limited feedback scheme. Assume
users feed average channel state information (ACSI) and QoS
requirement to the BS through an errorless feedback channel
dedicated to the user. BS allocates the subcarriers and power
to each user, by using a resource allocation algorithm. The
links between the users and the BS are assumed to be
frequency selective fading channels. The power constraint of
BS is P
T
. BS needs to determine the transmit power p(n)

for
each subcarrier n. Let R
k
(n) and R
k
rcq
denote the rate of the
user k over the subcarrier n and QoS rate requirement,
respectively. Then the channel gain between user k and BS
over subcarrier n is given by 0
k
(n) = b
k

|g
k
(n)|
2
, where b
k

denotes the average channel gain and g
k
(n) = r
k
(n) +
]i
k
(n) for Gaussian random variables r
k
(n) and i
k
(n)
have zero-mean and variance 1/2. N
0
represents the
single-sided power spectral density of the white noise. Then
the rate of user k over subcarrier n can be written as
( )
0 2
0 0
( ) ( )
log (1 )
k
k
p n G n
R n B
N B
= +
(1)

The rate of subcarrier n can be expressed as
( ) ( ) min
k
k K
R n R n
e
=

(2)
The rate of user k can be expressed as
,
1
( )
N
k k n
n
R w R n
=
=

(3)
w
k,n
is a binary value indicating whether subcarrier n is
allocated to transmit the data of user k or not. w
k,n
is equal to
1 if subcarrier n is allocated, otherwise, w
k,n
is equal to 0.
We exploit FGS video coding to divide the original
multicast data into one base layer and multiple enhancement
layers [10]. The base layer rate is denoted as R
bos
. The QoS
requirement of each user is assumed to be different and is no
less than the rate of base layer data. Therefore, we have
R
k
rcq
R
bos

for all users. Then, the enhancement layers
throughput over subcarrier n can be expressed by
( ) ( )
1
1( ( ) ( ))
K
enh
l k l
k
T n R n R n R n
=
= >

(4)
where 1(A) is an indicator function that becomes 1 when the
condition A is met and 0 otherwise. Eq. (4) can be explained
that the optimal transmission rate of the enhancement layers
over subcarrier n, R
l
-(n) is determined such that I
l
-
cnb
(n)
can be maximized, i.e., l
-
= org mox
leK
I
l
cnb
(n). In this
case, I
cnb
(n) can be I
l
-
cnb
(n) . We consider resource
allocation problem can be modeled as an optimization
problem with power constraint at BS and the different
requirements of QoS among multiple users. Therefore, the
problem can be formulated as follows:
,
,
1
( ),
max ( )
enh
k n
N
enh enh
k n
n
p n w
w T n
=

(5.a)
s.t.
, ,
1
[ ] ( , )
N
bas enh req
k n k n k k
n
w w R n R k K
=
+ > e

, (5.b)
1
( )
N
T
n
p n P
=
s
(5.c)

{ }
, , , , , ,
, 0,1 , ,
bas enh bas enh bas enh
k n k n k n k n k n k n
w w w w w w N = = C =
(5.d)

w
k,n
bos
is a binary value indicating whether subcarrier n is
allocated to transmit the data of base layers in user k or not.
w
k,n
bos
is equal to 1 if subcarrier n is allocated, otherwise,
w
k,n
bos
is equal to 0. This similarity as w
k,n
cnb
.
III. SUBOPTIMAL RESOURCE ALLOCATION
ALGORITHMS
The optimization problem can be solved by subcarrier and
power should be allocated jointly. The full feedback is
necessary. However, this optimal solution has high
computational complexity. To reduce the complexity and the
number of feedback load. Firstly, we propose a limited
feedback scheme. Secondly, we propose one suboptimal
subcarrier allocation algorithm with proportional fairness
suboptimal subcarrier. After that, two power allocation
algorithms that modified water-filling power allocation
algorithm and increasing fixed power allocation algorithm are
proposed.
A. Limited Feedback Scheme
The large-scale fading has a great effect on the users
channel gain. Therefore, we can rewrite the users channel
gain. 0
k
(n) = J
k
-o
|g
k
(n)|
2
, where J
k
is the distance
between the user k and BS and o is pathloss exponent.
Because FGS Video coding divided the original multicast data
into base layer and enhancement layers, so we adopt the
two-phase feedback scheme. The first and second phase
scheme is exploited before BS transmits the data of base layer
and enhancement layers, respectively. So, we set a threshold
interval |0
tb.l
, 0
tb,b
], user k can measure the channel gains
of all subcarriers from BS through pilot symbols. According
to the feedback scheme, user can feedback its ACSI of
FGS video
coding
Multicast traffic flow1
OFDM
Transmitter
BS
Limited feedback scheme and subcarrier and power allocation for each user
OFDM Receiver1
OFDM Receiver2
OFDM Receiver3
OFDM Receiver4
OFDM ReceiverK

K users with different QoS

in the same multicast group

Subcarrier and power

allocation
Feedback ACSI from some users
Multicast traffic flow1
Multicast traffic flow1
Multicast traffic flow1
Multicast traffic flow1
Multicast traffic flow1

322
subcarrier n to BS when his gain in the interval |0
tb.l
, 0
tb,b
].
A.1 Feedback scheme of transmitting base layer data
When BS transmits the data of base layer, the threshold
initialization is chosen by maximizing the probability that the
worst user has his gain within the threshold interval
|0
tb.l
, 0
tb,b
] and the other users have their gains above 0
tb,b
.
The gain of each user as independent and identically
distributed (i.i.d) with a continuous probability density
function (PDF)
0
(0) and a cumulative distribution function
(CDF) F
0
(0). When base layer data is transmitted, the PDF
of the worst user k is
1
( ) (1 ( )) ( )
k k k
K
G k G k G k
f G K F G f G
-
= (6)
The choice of 0
tb.l
: We assume the R is the cell radius. BS
locates on the center of cell. The probability that the channel
gain between a user and BS is more than 0
tb.l
as p
l.
. We
know the g
k
(n) is a zero-mean circularly symmetric
complex Gaussian random variable with unit variance, so
|g
k
(n)|
2
follows a exponential distribution which parameter
is 1/2. Then we can obtain

,
1
0
1 1
exp( ) ( )
2 2
k
th l
l G k k
R G
p t f G dtdG
o

-
=
} }

,
1
exp( )
2
th l
C R G
o
= (7)

C is the constant associated with the gain of worst user.
The choice of 0
tb.b
: We assume the {(r
k
, 0
k
, 0
k
)} is the
location and gain of user k in the cell. Users uniformly
distributed over the cell. (r
k
, 0
k
)

is the users distribution
function. Since, the PDFs of user k is the mutual independent.
So, the united PDF (r
k
, 0
k
, 0
k
) of user k is the product of
independent PDF of user k who has the PDF of (r
k
, 0
k
) and

0
k
-
(0
k
). Then the probability that the channel gain between
the user and BS is less than 0
tb.b
is given by
( ) { }
2 1
,
0 0 0
[ ( ) | , , ] ( , )
R
h R k th h k k k k k
p P G n G r G f r
t
u u = s
} } }

2
,
,
2 1 2
( ) 1 ( ) ( , )
k
G k k k k th h
th h
f G d dr dG C R G
R G
o
o
u t
o o
-
= (8)
A.2 Feedback scheme of transmitting enhancement layer data
When the data of enhancement layers is transmitted, BS
chooses the best [ users in each transmission until all users
are served. The data rate used in each transmission is the one
of the worst user among the best [ users. Therefore, the
threshold initialization maximizes the probability that
([K - 1) users have their gains above 0
tb,b
, one user has his
gain within the interval |0
tb.l
, 0
tb,b
] and the (1 - [)K
users have their gains under 0
tb.l
. The PDF of the worst user
k can be denoted as
1 (1 )
1
( ) (1 ( )) ( ( )) ( )
1
k k k k
K K
G k G k G k G k
K
f G K F G F G f G
K
| |
|
--
| |
=
|

\ .

(9)
Threshold interval initialization is chosen the same scheme as
the base layer.
B. Suboptimal Subcarrier Allocation Algorithm
We propose a subcarrier allocation algorithm with
proportional fairness based on FGS video coding (PF-F).
Under the assumption that the transmit power allocated for
each subcarrier is equal. In PF-F algorithm, subcarriers are
distributed to different users, proportional to their ACSI and
the different requirements of QoS among multiple users.
Therefore, we can formulate the PF-F algorithm as follow.
1. base layer algorithm
Base layer data must be firstly allocated to all the users by
using as few subcarriers as possible.
1) Initialization:
Set A={1,2,..,N}, if R
bos
_ R(n)
N
n=1
go to 2), otherwise,
go to b) of 3).
2) while A =
a) find a subcarrier n
-
= org mox
neA
R(n); b) update
R
bos
= R
bos
- R(n
-
)

, A=A-{n
*
}, N
k
bos
= N
k
bos
+ {n
-
} ,
k e K; c) if R
bos
0, go to a) of 3); otherwise, return.
3) a) the set of remaining subcarriers is A
*
={1,2,}, b)
claim the infeasibility of the requirement
2. QoS guarantee algorithm
The QoS requirement of each user is different in one
multicast service group, so the service priority of each user is
different. Subcarriers are distributed to different users,
proportional to their channel conditions and service priorities
until required rate of each user is satisfied. Therefore, we
formulate the proportional subcarrier allocation problem as:

R
1
R
1
rcq
=
R
2
R
2
rcq
= =
R
k
R
k
rcq
= =
R
K
R
K
rcq where R
k
is the
actual achieved rate of user k.
PF
k
=
R
k
R
k
rcq .
1) Initialization: N
k
cnb
= {} denotes the set of subcarriers
is allocated to transmit the data of enhancement in user k.
R
k
= R
bos
, k e K . A
*
={1,2,} denotes the set of free
subcarriers.
2) While ( R
k
R
k
rcq
). a) find a user k
-
satisfying
k
-
= org min
keK
PF
k
; b) find a n
-
satisfying n
-
=
org mox
neA
- I
k
-
cnb
(n) ; c) update R
k
- = R
k
- +R
k
-(n
-
) ,
N
k
-
cnb
= N
k
-
cnb
+ {n
-
}, A
-
= A
-
- {n
-
}, return to a).
3. enhancement layers algorithm
1) Initialization: B=A
*
={1, 2, , N

} denotes the set of

remaining free subcarriers from the QoS guarantee algorithm.
2) While ( B = ). a) find n
-
, k
-
satisfying (n
-
, k
-
) =
org mox
neB
I
k
cnb
(n); c) update R
k
- = R
k
- + R
k
-(n
-
), return
to a).
C. Suboptimal Power Allocation Algorithm
The subcarrier allocation algorithm with equal power
distribution cannot effectively utilize the limited power.
Therefore, we propose a modified water-filling algorithm
(MWF-Q) which can allocate power to multiple users with
different requirements of QoS. To further reduce the
computational complexity of water-filling algorithm, we also
proposed a power allocation algorithm with increasing fixed
power (IFP-Q).
C.1 Modified water-filling algorithm with QoS guarantees
323
We study the power algorithms under assuming that
subcarrier allocation is completed. Then the optimal problem
(5) can be rewritten as:
1
( )
max ( )
N
enh
n
p n
T n
=

(10.a)
s.t.
1
( )
N
T
n
p n P
=
s

(10.b)
The solution to the power allocation problem can be found
by using Lagrange multiplier method. We define the Lagrange
function as
1 1
( ) ( ( ) )
N N
enh
T
n n
L T n p n P
= =
=

(11)
where

is a Lagrange multiplier and the solution of problem
(11) can be obtained by solving oI op(n) = 0 / .
Consequently, the transmission power for each subcarrier
should satisfy
0 0
( )
1
( ) ln 2 ( ) ( )
k
k
G n
L
p n N B G n p n

-
-
c
=
c +
(12)
where 0
k
-(n) is the least gain among users who can receive
the optimal transmission rate of the enhancement layers over
subcarrier n. The amount of power p(n) allocated to
subcarrier n can be represented by.
0 0
1
( ) max{ , 0}
ln 2 ( )
k
N B
p n
G n
-
= (13)
1. base layer power allocation algorithm
1) Initialization: The remaining power of BS is P
r
= P
I
,
p(n) = 0, n={1, 2, , N}, n e N
bos
denotes the set of
subcarriers is allocated to transmit data of base layer;
2) While ( N
bos
e
) a) find a subcarrier n
-
satisfying
n
-
= orgmox
neN
bos R(n), distribute power to the subcarrier
according to Eq. (13). If p(n
-
) is less than P
r
, then is
chosen such that
_ R
k
-(n) = R
bos
N
bos
n=1
. Otherwise, is
chosen such that
_ p(n) = P
I
N
bos
n=1
; b) P
r
= P
r
- p(n
-
) if
P
r
0, then algorithm end. Otherwise, return to 2.
2. QoS guarantee power allocation algorithm
1) Initialization: set the remaining power of each BS is
P
`
r
= P
r
, and p(n) = 0, n={1, 2, , M}, n e N
cnb
denotes
the set of subcarriers is allocated to transmit data of
enhancement layer;
2) While ( N
cnb
e
, R
k
R
k
rcq
), a) find a user k
-

satisfying k
-
= org mox
keK
R
k
rcq
; b) find a subcarrier n
-

satisfying n
-
= orgmox
neN
cn b I
k
-
cnb
(n), distribute power to
the subcarrier according to Eq. (13)
,
is chosen such that
_ p(n) = P
`
r N
cn b
n=1
; update R
k
- = R
k
- + R
k
-(n
-
) . c)
P
`
r
= P
`
r
- p(n
-
) if P
`
r
0 then algorithm end.
3. enhancement layers power allocation algorithm
The step 1) is the same as 1) of 2. The different of the step
2) in enhancement algorithm is that finds n
-
, k
-
satisfying
(n
-
, k
-
) = org mox
neB
I
k
cnb
(n), while N
cnb
e
. The follow
step is the same as 2.
C.2 Increasing fixed power algorithm with QoS guarantees
In order to reduce complexity, we propose increasing fixed
power Ap

algorithm. IFP-Q is based on the Levin-Campello
algorithm (LC) typically used in unicast OFDM system [11]
The IFP-Q algorithm should be stated as follows:
1. base layer power allocation algorithm
1) Initialization: The remaining power of BS is P
r
= P
I
,
p(n) = 0, n={1, 2, , N}, n e N
bos
denotes the set of
subcarriers is allocated to transmit data of base layer;
2) While ( N
bos
e
) a) find a user k
-
satisfying
k
-
= org mox
keK
R
k
rcq
; b) find a subcarrier n
-
satisfying
n
-
= orgmox
neN
bos (p(n) + Ap)0
k
-(n) , update p(n
-
) =
p(n
-
) + Ap, P
r
= P
r
- Ap, if P
r
0, N
bos
= N
bos
- {n
-
},
otherwise, algorithm end. c) calculate R
k
-, if R
k
- R
k
-
rcq
, go
to b), otherwise, go to a).
2. QoS guarantee power allocation algorithm
1) Initialization: set the remaining power of each BS is
P
`
r
= P
r
, and p(n) = 0, n={1, 2, , M}, n e N
cnb
denotes
the set of subcarriers is allocated to transmit data of
enhancement layer;
2) while ( N
cnb
e
, R
k
R
k
rcq
), a) find a user k
-

satisfying k
-
= org mox
keK
R
k
rcq
; b) find a subcarrier n
-

satisfying n
-
= orgmox
neN
cn b I
k
-
cnb
(n) , update R
k
- =
R
k
- + R
k
-(n
-
). c) update p(n
-
) = p(n
-
) + Ap, P
`
r
= P
`
r
-
p(n
-
) if P
`
r
0 then N
cnb
= N
cnb
- {n
-
} , return to b),
otherwise, algorithm end.
3. enhancement layers power allocation algorithm
The step 1) is the same as 1) of 2. The different of the step
2) in enhancement algorithm is that finds n
-
, k
-
satisfying
(n
-
, k
-
) = org mox
neB
I
k
cnb
(n), while N
cnb
e
. The follow
step is the same as 2.
C.3 Analysis of computational complexity
The computational complexity of MWF-Q is 0(K
N
bos
+
K
cnb
N
cn b
). K
cnb
denotes the number of users who can receive
the data of enhancement. The complexity increases
exponentially with the increment of independent variable. The
algorithms complexity is too high to suitable for practical
implementation. The computation complexity of IFP-Q is
0((K N
bos
) + (K
cnb
N
cnb
)). The complexity increases
linearly with the increment of independent variable. Therefore,
the algorithm is suitable for practical system.
IV. SIMULATION RESULTS
In this section, we simulate the performances of proposed
different subcarrier and power allocation algorithms under
limited feedback scheme. The graph labels, PF-F+MWF-Q,
PF-F+IFP-Q and PF-F+EP (equal power), denote subcarrier
allocation algorithm combined with different power allocation
algorithms, respectively. Then we compare them with Tians
algorithm which exploits full feedback scheme. Tians
algorithm [9] supports the data rates of each subcarrier in a
multicast system are the limited number of constant values.
We employ the system model proposed in Figure 1.
Simulations are performed with the following assumptions.
B=10MHz and the number of subcarriers equals to N. All
users are uniformly distributed in a cell with cell radius is 1km
and the pathloss exponent is 2. The channels between the base
station and the users are modeled as frequency selective
Rayleigh fading channels which are corrupted by AWGN. N
0

is
9
10

W/Hz. All the numerical results presented in this

324
section are averaged over 10000 independent trials.
In Fig. 2, we can obtain some conclusions. Firstly, the
performance of algorithms with FGS video coding is more
than the CMS. It implies the coding scheme can effectively
improve the performance of multicast systems. Since FGS
video coding can provide enhancement layers data to the users
with better channel quality. Secondly, the performance of
PF-F combined with MWF-Q, IFP-Q and EP outperform
Tians algorithm. Since Tians algorithm with the equal power
allocation and the subcarrier allocation algorithm by the
limited number of constant values affects the practical data
rates of each subcarrier. Thirdly, under the same subcarrier
allocation algorithm, the algorithm with MWF-Q has more
throughput than that with IFP-Q and EP. Although the
performance of IFP-Q is slightly less than the MWF-Q, but
the computational complexity of IFP-Q is obviously lower
than the IFP-Q.

Fig. 2 Total throughput vs. Power, N=16, p
l
=0.8, p
h
=0.2.

In Fig. 3, we can observe that the throughput decreases
when the number of users increases. Since the possibility of
the existing users with poor channel quality increase, when
the number of users increases. So, more subcarriers are
allocated to guarantee the rate of base layer for all users. Only
a few subcarriers can be allocated to enhancement layers.

Fig. 3. Total throughput vs. Total number of users, N=16, PT=10 W, pl=0.8 ,
ph=0.2.

In Fig.4 can be observed that, with different number of
users, our proposed limited feedback scheme can reduce 50%
feedback load compared with that of the full feedback scheme,
when p
l
=0.8 and p
h
=0.2. The average feedback load increases
as p
h
increases, when p
l
is fixed.


Fig. 4. Average feedback load vs. Total number of usrs, P
T
=10 W.

V. CONCLUSION
In this paper, we discussed a novel resource allocation
algorithm by exploiting layer coding scheme in the downlink
of OFDMA-based single multicast group. In order to reduce
feedback load, we adopted a limited feedback scheme. Since
the optimal algorithm had very high computational
complexity, we proposed a suboptimal algorithm composed of
two-phase which a subcarrier allocation algorithm and two
power allocation algorithms. In the phase of subcarrier
allocation, we proposed a three-step subcarrier allocation
algorithm. In the phase of power allocation, a modified
water-filling power allocation algorithm was exploited.
Moreover, to further reduce the complexity of power
allocation algorithm, we also proposed an increasing fixed
power allocation algorithm. Simulation results showed that
the proposed suboptimal algorithms significantly
outperformed CMS. Moreover, it achieved the better total
throughput than Tians algorithm. The number of limited
feedback load is less than the full feedback.
ACKNOWLEDGEMENTS
This work was supported by the National Natural Science
Foundation of China (60972076, 61072052) and important
National Science and Technology Specific Projects
(2010ZX03003-004-03).
REFERENCES
[1] Introduction to Multimedia Broadcast and Multicast Services (MBMS)
in Radio Access Network, 3GPP TS 25.346, Rev v7.4.0, Jul. 2007.
[2] IEEE Standard for Local and Metropolitan Area Networks Part 16: Air
Interface for Fixed and Mobile Broadband Wireless Access Systems,
2005. IEEE Standard 802.16 Working Group.
[3] Changho Suh, Jeonghoon Mo, Resource Allocation for Multicast
Services in Multicarrier Wireless Communications, IEEE Trans.
Wireless Communications, vol. 7, pp. 27-31, Jan. 2008.
[4] Hui Deng, Xiaoming Tao, Tengfei Xing, Jianhua Lu, Resource
Allocation for Layered Multicast Streaming in Wireless OFDMA
Networks, in Proc. IEEE ICC, pp. 2607-2611, Jun. 2011.
2 4 6 8 10
0
2
4
6
8
10
Power of BS (w)

T
o
t
a
l

T
h
r
o
u
g
h
p
u
t

(
M
b
p
s
)


PF-F+MWF-Q
PF-F+IFP-Q
PF-F+EP
Tian
CMS
pl= 0.8
ph= 0.2
6 8 10 12 14 16 18 20
0
2
4
6
8
10
12
Total Number of Users
T
o
t
a
l

T
h
r
o
u
g
h
p
u
t
(
M
b
p
s
)


PF-F+MWF-Q
PF-F+IFP-Q
PF-F+EP
Tian
CMS
pl= 0.8
ph= 0.2
2 4 6 8 10 12 14 16 18 20
0
5
10
15
20
Total Number of Users
A
v
e
r
a
g
e

f
e
e
d
b
a
c
k

l
o
a
d


Full feedback
pl=0.8 ph=0.5
pl=0.8 ph=0.2
pl=0.2 ph=0.5
pl=0.2 ph=0.2
325
[5] J.Liu, W.Chen, Z. Cao, Letaief K. B, Dynamic Power and Sub-Carrier
Allocation for OFDMA-Based Wireless Multicast Systems, in Proc.
IEEE ICC, pp. 2607-2611, May 2008.
[6] Ngo D T, Tellambura C, Nguyen H H. Efficient Resource Allocation
for OFDMA Multicast Systems with Fairness Consideration, in Proc.
IEEE RWS, pp. 392-395, Jan. 2009.
[7] Hyungsuk Won, Han Cai, Do Young Eun, Multicast scheduling in
cellular data networks, IEEE Trans.Wireless Communications, vol. 8,
pp. 4540-4549, Sept. 2009.
[8] Suh C, Mo J, Kabal P. Resource Allocation for Multicast Services in
Multicarrier Wireless Communications, IEEE Trans. on Wireless
Communication, vol. 7, pp. 27-37, Jan. 2008.
[9] Lin Tian, Di Pang, Yubo Yang, Jinglin Shi, Gengfa Fang, Eryk
Dutkiewicz Subcarrier Allocation for Multicast Services in
Multicarrier Wireless Systems with QoS Guarantees, in Proc. IEEE
WCNC, pp. 1-6, Apr. 2010.
[10] Sun, Shi-Sheng; Chen, Yi-Chun; Liao, Wang jiun, Utility-Based
Resource Allocation for Layer-Encoded IPTV Multicast Service in
Wireless Relay Networks, in Proc. IEEE ICC, pp. 1-5, Jun. 2011.
[11] Changho Suh, Yunok Cho, and Seokhyun Yoon, Dynamic Subchannel
and Bit Allocation in Multiuser OFDM with a Priority User, IEEE
Spread Spectrum Techniques and Applications, pp. 919-923, Sept. 2004.

326