摘要
为了兼顾用户间公平性的同时最大化总的端到端速率,并克服现有分配算法在实际中难以实现的缺点,提出了一种新的分级资源分配算法。该算法首先根据有限的信息基于纳什议价解(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.
出处
《数据采集与处理》
CSCD
北大核心
2010年第1期61-65,共5页
Journal of Data Acquisition and Processing
基金
国家高技术研究发展计划("八六三"计划)(2007AAOIZ267)资助项目
国家自然科学基金(60672079)资助项目
关键词
正交频分复用多址
无线MESH网
资源分配
纳什议价解
公平性
orthogonal frequency division multiple access （OFDMA）
wireless mesh network （WMN）
resource allocation
Nash bargaining solution
fairness
