No abstract

No abstract

No abstract

The paper investigates the downlink burst scheduling problem (BSP) in IEEE 802.16 OFDMA systems. To solve the problem, a subchannel-aware burst fragmentation, packing and scheduling (BFPS) algorithm is proposed to schedule the position of each burst with high subchannel utilization and low DL-MAP overhead. BFPS is composed of the burst allocation scheme, burst fragmentation and packing scheme, and the burst swapping scheme. The burst allocation scheme and the burst fragmentation and packing scheme are to reduce the wasted and unused slots in and among bursts, and the DL-MAP control overhead. Moreover, in order for the channel compensation, the burst swapping scheme is used to adjust the positions of bursts. The simulation results highlight that BFPS outperforms other related approaches in the network throughput, DL-MAP IE efficiency, service ratio, and the bandwidth utilization ratio.

This paper aims to investigate the minislot scheduling problem in IEEE 802.16 mesh networks, where a minislot is the atomic unit for bandwidth allocation. Inappropriate minislot selection will cause minislot insufficient problems and the data collision problems. These problems will degrade the network throughput and the minislot utilization. Therefore, a Decentralized Minislot Scheduling Protocol (DMSP) is proposed for throughput gains in IEEE 802.16 mesh networks. DMSP contains Minislot Usage Constraints (MUCs) and Minislot Decision Strategies (MDSs) for Subscriber Stations (SSs) to determine the validity of each minislot and to select minislots from valid minislots for the data transmission, respectively. Simulation results show that DMSP can achieve better performance than related work in terms of the transmission delay, control overhead, minislot utilization, and the network throughput.