Greedy Search Based Bandwidth Allocation Scheme in IEEE 802.16j Network

In this paper, a joint base station and relay station bandwidth allocation algorithm based on greedy search is proposed for IEEE 802.16j network to meet the need of different services and achieve the maximum access users. In the proposed algorithm, the relay station allocates a bandwidth to the unsolicited grant service which has fixed bandwidth, the base station allocates the minimal bandwidth to the other service, and then the greedy search algorithm is utilized to find out the optimal user group and allocate the remaining bandwidth to the users in this group. Simulation results show that the proposed bandwidth allocation algorithm based on greedy search can guarantee the maximum number of admitted users, and the implementation complexity is significantly less than conventional bandwidth allocation algorithms based on exhaustive search.