| Summary: | 碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 101 === An orthogonal frequency division multiple access (OFDMA) frame of IEEE 802.16e network can be described as a two-dimensional matrix. The burst allocation problem of the IEEE 802.16e network is to explore how to allocate a burst in rectangular shape in an OFDMA frame efficiently. In this thesis, if different subchannels may adopt different modulation coding schemes (MCSs) and the MCS that a burst adopts must be the lowest MCS of all subchannels that the burst allocates, we call such a burst allocation problem the burst allocation problem of different MCSs. When the height of a rectangle becomes lower, the probability of it meeting up with lower MCS gets lower. Therefore, the rectangle height that every burst forms should be as low as possible. In addition, a burst will associate different throughputs when it is allocated in different positions of a frame, so each burst should be allocated on the positions that can generate higher throughputs. Based on these two ideas, we propose a high-performance algorithm for the burst allocation problem of different MCSs in this thesis. Through our algorithm, it is more efficient for a downlink subframe to deliver bursts to every user. In other words, our algorithm may enhance downlink throughput. In fact, computer simulation results show that compared with other existing algorithms for the burst allocation problem of different MCSs, our algorithm may generate higher total throughput.
|
|---|
