摘要
为兼顾用户间公平性的同时最大化总的端到端速率,并针对Lee的分配算法计算复杂度高的缺点,提出一种新的分级资源分配算法。该算法首先根据有限的信息基于纳什议价解进行粗分配(CA);其次根据完整的子载波增益信息基于等功率分配的方法进行细分配(FA)。仿真结果表明,提出的算法不仅获得与基于最大速率准则的算法相近的总的端到端速率,而且保证了用户间的公平性;同时,该算法能以更低的复杂度获得与Lee的算法相近的端到端速率。
In order to maximize the overall end-to-end rate with balancing the fairness among users, and overcome Lee＇s allocation algorithm＇s shortcoming of high computational complexity, a novel hierarchical algorithm was proposed. The first process-coarse allocation （CA） is based on Nash bargaining solution according to the limited information; the second process--fine allocation （FA） is based on the equal power allocation method according to the full information of subcarriers ＇channel gains. The simulation results demonstrate that the proposed algorithm not only achieves a comparable overall end-to-end rate with that of maximal rate criterion, but also assures the fairness among the users. Moreover, the proposed algorithm achieves end-to-end rates comparable to Lee＇s resource allocation algorithm, but with lower complexity.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2009年第16期5212-5216,共5页
Journal of System Simulation
基金
Project supported by the Project of Military Hardware Pre-Research Foundation of China(6140540)
关键词
正交频分多址
无线MESH网
资源分配
纳什议价解
公平性
Orthogonal frequency-division multiple-access（OFDMA）
wireless mesh network（WMN）
resource allocation
Nash bargaining solution
fairness
