电子科技大学学报
電子科技大學學報
전자과기대학학보
JOURNAL OF UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA
2014年
5期
653-657
,共5页
带宽分配%穷举搜索%贪婪搜索%最优用户组
帶寬分配%窮舉搜索%貪婪搜索%最優用戶組
대관분배%궁거수색%탐람수색%최우용호조
bandwidth allocation%exhaustive search%greedy search%optimal user group
为满足IEEE 802.16j网络中不同类型业务的带宽需求，同时达到可接入用户数最多的目的，提出了一种基于贪婪搜索的基站、中继站联合带宽分配算法。其中，固定带宽的主动授权业务由中继站分配带宽；基站分配其他类型业务所需的最少带宽。该算法利用贪婪搜索寻求最优用户组，并将剩余带宽分配给该组的用户。仿真结果表明，该贪婪搜索带宽分配算法能保证网络接入的用户数最多，且复杂度低于一般的穷举搜索带宽分配算法。
為滿足IEEE 802.16j網絡中不同類型業務的帶寬需求，同時達到可接入用戶數最多的目的，提齣瞭一種基于貪婪搜索的基站、中繼站聯閤帶寬分配算法。其中，固定帶寬的主動授權業務由中繼站分配帶寬；基站分配其他類型業務所需的最少帶寬。該算法利用貪婪搜索尋求最優用戶組，併將剩餘帶寬分配給該組的用戶。倣真結果錶明，該貪婪搜索帶寬分配算法能保證網絡接入的用戶數最多，且複雜度低于一般的窮舉搜索帶寬分配算法。
위만족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.
