Block Scheduling for Low-Rate, Real-Time Trafc

in the Downlink Mobile WiMAX System

Tae Sung Choi, Seong Hwan Kim, and Dan Keun Sung.
Department of Electrical Engineering, KAIST,
373-1 Guseong-dong, Yuseong-gu Daejeon 305-701, Korea
E-mail: tschoi@cnr.kaist.ac.kr, shkim@cnr.kaist.ac.kr, dksung@ee.kaist.ac.kr
AbstractWe propose a block scheduling (BLS) scheme
which can signicantly reduce signaling overhead to accom-
modate more users with low-rate, real-time trafc. The basic
concept of the BLS scheme is to allocate the resource to each
user by using resource blocks which are a basic unit of resource
allocation. Since the performance of the BLS scheme depends on
trafc models, we consider two types of trafc: 1) VoIP trafc
- nearly constant packet size; 2) game trafc - variable packet
size. We present an optimization problem to select the size of
resource blocks to minimize the average resource usage per user.
Simulation results show that our proposed scheme outperforms
the dynamic scheduling (DS).
I. INTRODUCTION
Recently, the Mobile WiMAX system [1] has been stan-
dardized to support broadband mobile data services. The
future wireless communication systems will require to support
various applications with different Quality-of-Service (QoS)
requirements. Each application requires an appropriate re-
source allocation scheme to guarantee its QoS requirements
such as delay, data-rate, and packet error rate. In the case
of the WiMAX system, since it is possible to allocate the
resource that ranges from one minimum resource unit (slot)
to the entire frame, the resource allocation is highly exible.
Moreover, the system exibly allocates slots to several users
according to varying channel conditions, trafc load, and
various QoS requirements, in one frame. In the WiMAX
system, MAP messages are used to deliver the information
about the resource allocation as control signaling.
However, if a large number of users share the same frame
simultaneously, it can cause large signaling overhead since the
MAP messages have to contain the detailed information about
resource allocation for all users. Especially, when it comes to
real-time trafc with low data-rate such as VoIP, game trafc,
and machine type communication (MTC) trafc, this problem
becomes more serious [2]. To support these applications and
increase system performance, the MAP messages should be
reduced.
In order to mitigate the above large signaling overhead
problem, orthogonal code hopping multiplexing (OCHM)
systems [3], [4], [5], [6] and a persistent allocation (PA)
scheme [7], [8] have been proposed. The OCHM system
utilizes statistical multiplexing for an orthogonal downlink in
DS/CDMA systems. The PA scheme was designed for real-
time trafc with periodic packet arrivals, particulary focusing
on VoIP trafc. The PA scheme attempts to solve the problem
by allocating resource periodically and using xed modulation
and coding scheme (MCS) level without MAP messages
during a talk burst duration or a silent duration. As shown
in [9], the PA scheme outperforms the conventional dynamic
scheduling (DS) scheme. In the case of downlink (DL) VoIP
tafc, however, the usage of the PA scheme causes a mismatch
problem because the DL VoIP trafc passing through the core
network has signicant network delay jitter and the periodic
packet arrival characteristic is not preserved [10].
In order to mitigate the above large signaling overhead
problem, a persistent allocation (PA) scheme was pro-
posed [7], [8]. This PA scheme was designed for real-time
trafc with periodic packet arrivals, particulary focusing on
VoIP trafc. The PA scheme attempts to solve the problem by
allocating resource periodically and using xed modulation
and coding scheme (MCS) level without MAP messages
during a talk burst duration or a silent duration. As shown
in [9], the PA scheme outperforms the conventional dynamic
scheduling (DS) scheme. In the case of downlink (DL) VoIP
tafc, however, the usage of the PA scheme causes a mismatch
problem because the DL VoIP trafc passing through the core
network has signicant network delay jitter and the periodic
packet arrival characteristic is not preserved [10].
In this paper, we propose a block scheduling (BLS) scheme
in downlink Mobile WiMAX system, which can reduce
the MAP overhead for low-rate, non-periodic data trafc to
accommodate more users than the conventional scheme while
guaranteeing a delay requirement. The basic idea of the BLS
scheme is to signicantly reduce the MAP message by using
a resource block larger than a slot as a basic unit of resource
allocation. In order to maximize the effectiveness of the BLS
scheme, we propose an appropriate DL-MAP format.
This paper is organized as follows: In Section II, we
describe DS and PA schemes and estimate the size of DL-
MAP when the DS scheme is applied. In Section III, we
describe the basic operation of the proposed BLS scheme and
the proposed BLS DL MAP format used for BLS scheme and
formulate an optimization problem to minimize the average
resource usage per user. In Section IV, we introduce a system
model and trafc models for performance comparison and
compare the performance of the BLS scheme with that of the
DS scheme in terms of the amount of MAP and 98 percentile
delay through simulation. Finally, we present conclusion in
Section V.
II. DOWNLINK SCHEDULING IN IEEE 802.16 SYSTEM
Fig. 1 shows the time division duplex (TDD) frame struc-
ture of the Mobile WiMAX system. Each frame is divided
into a DL subframe for supporting the downlink (DL) trafc
and a UL subframe for supporting the uplink (UL) trafc. We
IEEE WCNC 2011 - MAC
978-1-61284-254-7/11/$26.00 2011 IEEE 132
P
r
e
a
m
b
l
e
D
L

-
M
A
P
DL subframe
OFDM symbol number
S
u
b
c
a
r
r
i
e
r

n
u
m
b
e
r
U
L

-
M
A
P
DL Burst #1
DL Burst #3 DL Burst #4
DL Burst #2
DL Burst #5 DL Burst #6
UL subframe
Ranging
Channel
CQI
Channel
UL Burst #1
UL Burst #2
UL Burst #3
UL Burst #4
UL Burst #5
UL Burst #6
Fig. 1. Frame Structure of the IEEE 802.16 System
focus on the DL communication on the DL subframe. The
DL subframe consists of control parts such as a preamble, a
frame control header (FCH), a DL-MAP message, a UL-MAP
message, and DL bursts. The DL-MAP message consists
of a number of DL-MAP information elements (IEs) which
specify the location and size of each DL burst, MCS, etc. The
UL-MAP message also consists of a number of UL-MAP
IEs which include signaling for resource allocation in UL
subframe. We assume that the size of UL-MAP is xed since
we focus on the DL communications. The sizes of preamble
and FCH are also xed since they do not vary according
to the varying number of users in the frame. Resources are
allocated for DL bursts for transmitting downlink data from
a base station (BS) to mobile stations (MSs).
A. Dynamic Scheduling
An MS obtains control information required to decode
its data in DL Burst by reading the MAP message. The
MAP message requires a strong MCS level, for example,
1/12. Therefore, the MAP message is transmitted
reliably to all the MSs in the system. The MAP message occu-
pies approximately tens of slots so that the DL-MAP and the
UL-MAP may signicantly affect the system performance if
a large number of users share the same frame simultaneously.
We can estimate the size of DL-MAP when the DS scheme
is applied. We assume that the DS scheme uses HARQ DL-
MAP IE which is in Table 348 [7]. Then, we can estimate
the number of bits of the DL-MAP IE as [12]:

= 84 + 36

, (1)
where

is the number of users multiplexed in the DL

frame. The DS scheme is generally efcient for bursty trafc.
However, if input trafc is not bursty and has small-sized
packets, the DS scheme may be inefcient because the MAP
overhead is relatively large for small-sized packets.
B. Persistent Allocation
The persistent allocation (PA) scheme was proposed in
order to mitigate the large signaling overhead for allocating
the required radio resources in a frame. This PA scheme is
mainly focused on periodically generated trafc, especially
for VoIP. Since the PA scheme allocates resources persis-
tently over multiple frames, there is no need to reallocate
the required resource for every frame. Since VoIP packets
t=0
t
Persistently allocated resource
waste the allocated resource
t=k t=k+4 t=k+8 t=k+12
Packet arrival with jitter
Packet departure
Fig. 2. An example of the PA scheme for VoIP trafc with delay jitter
are generated periodically and the size of packets is nearly
constant during a talk period, the allocation information such
as the allocated resource, MCS level, and period of resource
allocation is delivered to users only at the start of talk
period. After transmission of the allocation information, since
the additional MAP messages are not required during the
talk period, this scheme can signicantly reduce the MAP
overhead.
However, if packets do not arrive in a periodic manner,
the PA scheme becomes inefcient. In case of the DL VoIP
trafc, since packets may experience delay jitter while passing
through the core network. Fig. 2 shows the inefciency of the
PA scheme in the case of non-periodic packet arrivals. In this
case, the allocated resource may be wasted due to delay jitter
and the packet arriving later needs to be transmitted using
the next allocated resource. Then, it affects the transmission
of all the subsequent arriving packets. It increases the delay
of all subsequent packets in queue. Though the waste of
the allocated resource can be alleviated if we use a dejitter
buffer, this can be a burden at the BS and the packet delay
problem can not be avoided. If packets exceeding a given
delay requirement are removed in queue, the packet loss rate
increases. As an effort to resolve this problem, a virtually
dedicated resource allocation (VDRA) scheme was originally
proposed in [12].
III. BLOCK SCHEDULING
A. Basic Operation
As mentioned in Section I, since the DL-MAP information
occupies a large amount of resource especially for low data-
rate, small-sized packets, we need a mechanism to reduce
this signaling overhead. We propose a block scheduling (BLS)
scheme which uses a resource block as a basic unit of resource
allocation instead of a slot in order to support periodic/non-
periodic and low data-rate trafc. We can reduce the MAP
overhead through the proposed scheme.
Fig. 3 shows the basic concept of the proposed BLS
scheme. The required information for resource allocation
in the conventional slot-based scheduling scheme includes
user identier (ID), starting and end slots for the allocated
resource, MCS level. Then, the amount of DL MAP resource
required to allocate the resource for transmitting user data can
be expressed as:

+ 2 log
2

, (2)
where

is the amount of resource for identifying the

user, and

is the number of slots for DL bursts.

133
(a) Slot based scheduling (b) Resource block based scheduling
Fig. 3. Basic concept of the proposed scheme
In the proposed resource block based scheduling scheme,
the amount of DL MAP required to allocate the resource for
transmitting downlink user data is expressed as:

, (3)
where is the number of resource blocks required for trans-
mitting a user packet.
We allocate the resource blocks to users in order at each
BLS region. In other words, we do not need to use the
resource block IDs to allocate the resources to users because
the index of each Subburst IE indicates the index of the
allocated resource block. If we select the optimal size of
resource block so that the value of is set to 1, we can reduce
the MAP overhead. It is a basic concept of the proposed
scheme.
Fig. 4 shows an example of DL subframe structure for
the BLS scheme. The DL subframe consists of several DL
BLS bursts for the proposed BLS scheme and DL bursts
for the conventional scheme (DS). Each BLS region has
different characteristics: locations of the BLS region; size
of a resource block; modulation and coding scheme (MCS).
The characteristics of each BLS region are broadcast to users
through MAP messages. As shown in Fig. 4, each BLS region
consists of a number of resource blocks. The number of bits
transmitted to a user in a frame is determined by the size
of resource block and MCS level. The MAP information
containing the size of resource block and MCS level may
vary frame by frame and this dynamic change may increase
MAP overhead. Therefore, the BLS regions are changed
infrequently.
B. Proposed DL-MAP Format
We propose a new DL-MAP format by referring to Tables
1 and 2 [12] to increase the effectiveness of the BLS scheme.
We propose a BLS HARQ DL MAP allocation IE and a BLS
DL HARQ Chase Subburst IE for chase HARQ mode, which
are shown in Tables I and II. The BLS HARQ DL MAP
allocation IE contains the number of BLS regions, location,
size, MCS level for each BLS region, and the size of a
resource block. Each BLS DL HARQ Chase Subburst IE
indicates the user of each resource block in a BLS region.
Actually, there are many types of DL MAP IE and subburst IE
in IEEE 802.16. Although we propose only the MAP structure
for chase HARQ mode, we can also support other types of
MAP structure in a similar way. We can calculate the size
P
r
e
a
m
b
l
e
D
L

-
M
A
P
Downlink subframe
OFDM symbol number
+ + + + + + + + +
S
u
b
c
a
r
r
i
e
r

n
u
m
b
e
r
U
L

-
M
A
P
DL Burst #1
DL Burst #3 DL Burst #4
DL Burst #2
DL BS Burst #1 DL BS Burst #2
# 1 # 2 # 3
# N1
# 1 # 2 # 3
# N2
...
...
...
...
Fig. 4. An example of the DL subframe structure in the BLS scheme
DL UL DL UL
...
DL UL DL UL
Frame k Frame (k+1) Frame (k+m) Frame (k+m+1)
Information about region change
Subburst IE
Region Allocation Period = m
DL-MAP IE
Fig. 5. Operation of MAP Transmission
of DL-MAP of the BLS scheme based on the new DL-MAP
format. Then, the number of bits of the DL-MAP IE at each
frame is expressed as :

= 17+

=1

73 + 18

, region change occurs

18 + 18

, no region change
0, no packets,
(4)
where

is the number of BLS regions allocated in a

frame.

is the number of users with resources allocated

for data transmission in BLS region . The constant values
are obtained from the proposed DL-MAP formats which are
listed in Tables I and II. We can change the location and size
of BLS region, and the size of a resource block by using a
parameter of Region Change Indicator in the proposed BLS
HARQ DL MAP allocation IE.
Fig. 5 shows an example of MAP transmission. We can
broadcast the attributes of each BLS region in order to reduce
the MAP overhead in a particular period. When data destined
for many users are multiplexed at each BLS region, the
MAP overhead of BLS HARQ DL MAP Allocation IE is
relatively smaller than that of the whole BLS DL HARQ
Chase Subburst IE. If the BLS scheme is used with the DS
scheme, it yields better performance in changing the attributes
of each BLS region every frame. Since the proposed scheme
can remove the waste of resources which are not used in
BLS region and these resources can be used in DS region.
However, we need additional MAP overhead.
134
TABLE I
PROPOSED BLS HARQ DL MAP ALLOCATION IE FORMAT
Syntax Size (bit)
BLS HARQ DL MAP IE() {
Extended-2 DIUC 4
Length 8
ACK region index 1
while(data remain) {
BLS Region ID 5
Region Change Indicator 1
if(Region Change Indicator == 1) {
OFDMA Symbol offset 8
Subchannel offset 7
No. of OFDMA Symbols 7
No. of Subchannels 7
No. of OFDMA symbols for Resource Block 7
No. of Subchannels for Resource Block 7
DIUC 4
Repetition Coding Indication } 2
Mode 4
Subburst IE Length 8
Subburst IE according to HARQ mode } variable
Padding } variable
TABLE II
PROPOSED BLS DL HARQ CHASE SUBBURST IE FORMAT
Syntax Size (bit)
BLS DL HARQ Chase Subburst IE() {
for(i=0;N used resrouce units;i++) {
RCID IE() variable
Boosting 3
ACID { 4
AI SN { 1
Dedicated DL control } variable
Padding } variable
C. Optimization Algorithm
In the BLS scheme, the size of resource blocks has a
critical impact on the system performance because there may
be a waste of resource according to varying size of packets.
Therefore, we need to determine the size of resource block
so that a packet is transmitted using one resource block if
possible.
We can estimate the average number of resource blocks
required for a single packet transmission for the following
parameters: the size of resource block (bits) in the BLS
region ,
,
, and the probability density function of packet
size,

(). Then, The average number of resource blocks

required for a single packet transmission can be expressed as:

,
=

=0
(+1)
,

=1+
,
( + 1)

() (5)
We minimize the resource used by each user, which can
accommodate the maximum number of users. The following
optimization problem is formulated accordingly :
User 1
User Nuser
NRB Resource Blocks
MS 1
MS Nuser
ACK/NACK
Core
Network
Resource
Allocation
Base
Station
Transmission
ACK/NACK
Fig. 6. Packet Transmission Model in the BLS Scheme
arg min

,

(

,
/

)
..
,
=

, = 1, 2, 3, ... (6)
where

is the number of bits transmitted through a slot

in BLS region ,

is the number of bits transmitted

through a slot in MAP region which uses 1/12
for MCS level, and

is the number of bits of MAP

message per user in the BLS scheme.

is the average
number of slots used by a single user for a single packet
transmission. In other words, smaller

values represent
the accommodation of more users. We determine the optimal
size of resource blocks through this optimization formulation
to accommodate more users.
IV. PERFORMANCE EVALUATION
A. Simulation Environment
Fig. 6 shows the DL packet transmission model in the
proposed BLS scheme. We assume that the transmitted pack-
ets are not successfully decoded with probability . If a
received packet is not decoded successfully, BS is requested
to retransmit this packet.
The Mobile WiMAX system is assumed to use 10 MHz
bandwidth. The DL to UL subframe ratio is 26:21 and the DL
subframe is operated in partial usage of subchannels (PUSC)
mode. 360 slots in the DL subframe are used for transmission
of FCH, DL-MAP, UL-MAP and DL data bursts. We assume
that 300 slots are used for transmission of DL-MAP and DL
data bursts. We focus on the accommodation of two types of
trafc depending on the size of packet: 1) VoIP trafc with
delay jitter; 2) game trafc.
VoIP trafc has xed-sized packets. Its resource block size
is determined by the packet size and MCS level. A VoIP
packet with 44 bytes is generated every 20 ms during a
talk period. In addition, delay jitter is considered in DL
network due to delay variation through the core network and
it is modeled using a Laplacian distribution [10]. Thus, VoIP
packets are generated at the instant of +

, where is
a VoIP frame interval of 20 ms, denotes the VoIP frame
index and

= +80 is the DL network delay jitter. The

Laplacian distribution is used as a reference model for the
135
0 5 10 15
5
10
15
20
25
30
Size of Resource Block (slots)
A
v
e
r
a
g
e

n
u
m
b
e
r

o
f

s
l
o
t
s

u
s
e
d

f
o
r

a

p
a
c
k
e
t

t
r
a
n
s
m
i
s
s
i
o
n


QPSK 1/2
16QAM 1/2
16QAM 3/4
Fig. 7. An example of the optimization problem for game trafc
TABLE III
MCS LEVELS USED IN THE EVALUATION
Modulation and Resource block size Resource block size
coding rate -xed packet size- -variable packet size-
QPSK 1/2 8 slots 10 slots
16 QAM 1/2 4 slots 5 slots
16 QAM 3/4 3 slots 3 slots
DL network delay jitter, :

=
1
2

, = 5.11
80 80 (7)
Since the size of packets in game trafc is variable, we
determine the optimal size of resource block. The extreme
distribution [11] is used as a reference model for determining
the size of packet for game trafc:
() =
1

, > 0 (8)
where , are the parameter of extreme distribution. In game
trafc, these parameters can be set to: = 45 , =
5.7 .
We can calculate the average number of slots used by a
single user for a single packet transmission,

by using
Eq. 6. Fig. 7 shows the

value for varying the size

of resource block and the supported MCS levels. The result
shows that the optimal size of resource block is 10, 5, and
3 slots for 1/2, 16 1/2, and 16 3/4,
respectively. Table III shows the size of resource block for
varying MCS levels.
B. User Capacity
We choose user capacity as a performance measure. We
dene the user capacity as the number of users which can
be accommodated in the system under the condition that a
98 percentile value of packet delay is smaller than or equal
to a pre-dened delay constraint value (

) [12]. The 98
percentile value of the packet delay (
98
) can be expressed
as:

98

() 0.98 (9)
50 100 150 200
0
5
10
15
20
25
30
35
40
The number of users
T
h
e

9
8
t
h

p
e
r
c
e
n
t
i
l
e

d
e
l
a
y

(
f
r
a
m
e

t
i
m
e
)


Dynamic Scheduling
Block Scheduling
150
172
Delay
Constraint
(a) 98 percentile packet delay
50 100 150 200
200
300
400
500
600
700
800
900
1000
1100
Number of users
M
e
a
n

n
u
m
b
e
r

o
f

b
i
t
s

o
f

D
L

M
A
P

I
E

(
b
i
t
s
)


Dynamic Scheduling
Block Scheduling
(b) Mean number of bits of DL-MAP IE
Fig. 8. Comparison of the BLS scheme with the dynamic scheduling scheme
for VoIP trafc
where is the packet delay of which value is measured in
frame-times, and

() represents the aggregated packet

delay distribution. We evaluate the 98 percentile value of
packet delay through computer simulation. Then, the user
capacity in the Mobile WiMAX system is the maximum
number of users accommodated under a delay condition of

98

.
C. Numerical Results
In this section, we compare the performance of the pro-
posed BLS scheme with that of the DS schemes through
computer simulation. Fig. 8(a) shows the 98 percentile value
of the packet delay for varying the number of users with
VoIP trafc. The 98 percentile delay of both the BLS scheme
and DS scheme is approximately one frame-time when the
number of users is small, which is below 100 users. It
implies that most arriving packets are transmitted at the next
transmission time. As the number of users increases, however,
the 98 percentile delay of the DS scheme increases more
rapidly than that of the BLS scheme because the portion of
DL burst in the DL subframe decreases due to large size of
DL-MAP IE supporting a large number of users. Fig. 8(b)
shows the mean number of bits of DL-MAP IE. The size of
136
240 250 260 270 280 290 300 310 320 330 340
0
5
10
15
20
25
30
35
40
45
50
Number of users
T
h
e

9
8
t
h

p
e
r
c
e
n
t
i
l
e

d
e
l
a
y

(
f
r
a
m
e

t
i
m
e
)


Dynamic Scheduling
Block Scheduling
303 312
Delay
Constraint
(a) 98 percentile packet delay
240 250 260 270 280 290 300 310 320 330 340
500
600
700
800
900
1000
1100
1200
Number of users
M
e
a
n

n
u
m
b
e
r

o
f

b
i
t
s

o
f

D
L

M
A
P

I
E

(
B
i
t
s
)


Dynamic Scheduling
Block Scheduling
(b) Mean number of bits of DL-MAP IE
Fig. 9. Comparison of both the BLS scheme and the dynamic scheduling
scheme for game trafc
DL-MAP IE of the DS scheme is much larger than that of
the BLS shceme and it increases more rapidly than that of
the BLS scheme. However, the size of DL-MAP IE of the DS
scheme decreases when the number of users is large. This is
because delayed packets in queue are aggregated so that only
one DL-MAP IE can support multiple packets. Therefore,
the size of DL-MAP IE decreases as the number of users
increases. However, delayed packets do not satisfy the given
delay requirement. Moreover, the size of DL-MAP IE of the
BLS scheme is smaller than that of the DS scheme. As a
result, the delay performance of the BLS scheme is better
than that of the DS scheme. If we assume that the pre-dened
delay constraint is set to 10 frame-times, i.e., 100 ms, we can
derive that the user capacities of the BLS and DS schemes
are approximately 150, and 172, respectively.
Figs. 9(a) and 9(b) show the 98 percentile value of packet
delay and the mean number of bits of DL-MAP IE for varying
the number of users with game trafc. The BLS scheme yields
slightly better performance than the DS scheme. When the
size of packets is variable, the BLS scheme wastes some
amount of resource due to the mismatch between the packet
size and the resource block size. Therefore, the BLS scheme
applied to game trafc yields less performance gain than that
applied to VoIP trafc. If we assume that the pre-dened delay
constraint is set to 10 frame-times, i.e., 100 ms, we can derive
the user capacities of approximately 303 and 312 for the BLS
and DS schemes, respectively.
V. CONCLUSIONS
In this paper, we proposed a block scheduling (BLS)
scheme to reduce the MAP overhead and compared the
performance of the proposed scheme with that of the dynamic
scheduling (DS) scheme for real-time, low-rate trafc in terms
of the 98 percentile packet delay, size of DL-MAP IE, and
user capacity. The proposed scheme yields a larger user
capacity than the DS scheme for xed-sized packets, likely
VoIP trafc. Moreover, for variable packet size with small
variation, the proposed BLS scheme yields better performance
in terms of user capacity and signaling overhead than the DS
scheme. The proposed optimization problem can be applied
to various types of trafc.
ACKNOWLEDGMENT
This research was supported by the MKE(The Ministry of
Knowledge Economy), Korea, under the ITRC(Information
Technology Research Center) support program supervised by
the NIPA(National IT Industry Promotion Agency) (NIPA-
2010(C1090-1011-0005))
REFERENCES
[1] IEEE Std. 802.16e-2005, IEEE standard for local and metropolitan area
networks part 16: air interface for xed and mobile broadband wireless
access systems, Amendment2 and Corrigendum 1, IEEE, Dec. 2005
[2] J. So, Performance analysis of VoIP services in the IEEE 802.16e
OFDMA system with inband signaling, in IEEE Trans. Vehicular
Technology, vol. 57, no. 3, pp. 1876-1886, May 2008.
[3] S. Park, D. K. Sung, Orthogonal Code Hopping Multiplexing, in IEEE
Communications Letters, Vol. 6, No.12, pp. 529-531, Dec. 2002.
[4] S. H. Moon, D. K. Sung, Performance Analysis of Orthogonal Fre-
quency and Code Hopping Multiplexing, in IEEE Trans. on Wireless
Communications, Vol. 6, Issue 10, pp. 3803-3815, 2007.
[5] B. C. Jung, D. K. Sung, Performance Analysis of Orthogonal-Code
Hopping Multiplexing Systems With Repetition, Convolutional, and
Turbo Coding Schemes, in IEEE Trans. on Vehcular Technology, Vol.
57, Issue 2, pp. 932-944, 2008.
[6] S. H. Moon, S. Park, J. K. Kwon, D. K. Sung, Capacity Improvement
in CDMA Downlink with Orthogonal Code-Hopping Multiplexing, in
IEEE Trans. on Vehicular Technology, Vol. 55, No. 2, pp. 510-527, Mar.
2006.
[7] IEEE P802.16Rev2/D7, Draft standard for local and metropolitan area
networks part 16: air interface for xed and mobile broadband wireless
access systems, IEEE, Oct. 2008
[8] S. Shrivastava and R. Vannithamby, Performance analysis of persistent
scheduling for VoIP in WiMAX networks, in IEEE 10th annual Wireless
and Microwave Technology Conference, 2009, pp. 1-5, 20-21, April
2009.
[9] M. H. Fong, R. Novak, S. Mcbeath, and R. Srinivasan, Improved
VoIP capacity in mobile WiMAX systems using persistent resource
allocation, in IEEE Communication Magazine, Vol. 46, No. 10, pp.
50-57, Oct. 2008.
[10] R. Srinivasan, J. Zhuang, L. Jalloul, R. Novak, and J. H. Park,
IEEE 802.16m Evaluation Methodology Document, in IEEE 802.16m-
08/004r3, March. 2008.
[11] R. Srinivasan, J. Zhuang, L. Jalloul, R. Novak, and J. H. Park,
IEEE 802.16m Evaluation Methodology Document, in IEEE 802.16m-
08/004r5, Jan. 2009.
[12] Young Ik Seo, and Dan Keun Sung, Virtually Dedicated Resource
Allocation for VoIP Trafc in the Downlink Mobile WiMAX System
with Hybrid ARQ, in IEEE Trans. on Vehicular Technology (accepted).
137