CAJ | 학술논문

为了兼顾用户间公平性的同时最大化总的端到端速率,并克服现有分配算法在实际中难以实现的缺点,提出了一种新的分级资源分配算法.该算法首先根据有限的信息基于纳什议价解(NBS)进行粗分配(CA);其次根据完整的子载波增益信息排序方法进行细分配(FA).仿真结果表明,该算法不仅获得与基于最大速率准则的算法相近的总的端到端速率,而且保证了用户间的公平性;同时,该算法能以更低的复杂度获得与现有算法相近的端到端速率.
위료겸고용호간공평성적동시최대화총적단도단속솔,병극복현유분배산법재실제중난이실현적결점,제출료일충신적분급자원분배산법.해산법수선근거유한적신식기우납십의개해(NBS)진행조분배(CA);기차근거완정적자재파증익신식배서방법진행세분배(FA).방진결과표명,해산법불부획득여기우최대속솔준칙적산법상근적총적단도단속솔,이차보증료용호간적공평성;동시,해산법능이경저적복잡도획득여현유산법상근적단도단속솔.
To maximize the overall end-to-end rate with balancing the fairness among users and overcome the difficulty of existing allocation algorithm in practice, a novel hierarchical resource allocation algorithm is proposed. Firstly, the algorithm performs the coarse allocation (CA) based on Nash bargaining solution (NBS) according to the limited information. Secondly, the fine allocation (FA) utilizes an ordering method with the full information of subcarrier channel gains. Simulation results demonstrate that the algorithm achieves a comparable overall end-to-end rate based on maximal rate criterion, and assures the fairness among the users. Moreover, the algorithm achieves comparable end-to-end rates with the existing resource allocation scheme, and has lower complexity.