摘要
为满足IEEE 802.16j网络中不同类型业务的带宽需求,同时达到可接入用户数最多的目的,提出了一种基于贪婪搜索的基站、中继站联合带宽分配算法。其中,固定带宽的主动授权业务由中继站分配带宽;基站分配其他类型业务所需的最少带宽。该算法利用贪婪搜索寻求最优用户组,并将剩余带宽分配给该组的用户。仿真结果表明,该贪婪搜索带宽分配算法能保证网络接入的用户数最多,且复杂度低于一般的穷举搜索带宽分配算法。
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.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2014年第5期653-657,共5页
Journal of University of Electronic Science and Technology of China
基金
航空科学基金(2013ZC15003)
关键词
带宽分配
穷举搜索
贪婪搜索
最优用户组
bandwidth allocation
exhaustive search
greedy search
optimal user group
