当前位置: X-MOL 学术Wirel. Commun. Mob. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Novel Bee Colony Optimization with Update Quantities for OFDMA Resource Allocation
Wireless Communications and Mobile Computing ( IF 2.146 ) Pub Date : 2021-07-21 , DOI: 10.1155/2021/8891020
Ming Sun 1 , Yujing Huang 1 , Shumei Wang 2 , Yaoqun Xu 2
Affiliation  

In recent years, large usage of wireless networks puts forward challenge to the utilization of spectrum resources, and it is significant to improve the spectrum utilization and the system sum data rates in the premise of fairness. However, the existing algorithms have drawbacks in efficiency to maximize the sum data rates of orthogonal frequency division multiple access (OFDMA) systems in the premise of fairness threshold. To address the issue, a novel artificial bee colony algorithm with update quantities of nectar sources is proposed for OFDMA resource allocation in this paper. Firstly, the population of nectar sources is divided into several groups, and a different update quantity of nectar sources is set for each group. Secondly, based on the update quantities of nectar sources set for these groups, nectar sources are initialized by a greedy subcarrier allocation method. Thirdly, neighborhood searches and updates are performed on dimensions of nectar sources corresponding to the preset update quantities. The proposed algorithm can not only make the initialized nectar sources maintain high levels of fairness through the greedy subcarrier allocation but also use the preset update quantities to reduce dimensions of the nectar sources to be optimized by the artificial bee colony algorithm, thereby making full use of both the local optimization of the greedy method and the global optimization of the artificial bee colony algorithm. The simulation results show that, just in the equal-power subcarrier allocation stage, the proposed algorithm can achieve the required fairness threshold and effectively improve the system sum data rates.

中文翻译:

具有更新数量的 OFDMA 资源分配的新型蜂群优化

近年来,无线网络的大量使用对频谱资源的利用提出了挑战,在公平的前提下提高频谱利用率和系统总数据速率具有重要意义。然而,现有算法在公平阈值的前提下最大化正交频分多址(OFDMA)系统的总数据速率的效率存在缺陷。针对该问题,本文提出了一种新的具有更新花蜜源数量的人工蜂群算法用于OFDMA资源分配。首先将蜜源种群划分为若干组,每组设置不同的蜜源更新量。其次,根据为这些群体设置的蜜源更新量,花蜜源由贪婪的子载波分配方法初始化。第三,对预设更新量对应的蜜源维度进行邻域搜索和更新。该算法不仅可以通过贪婪的子载波分配使初始化的花蜜源保持高度的公平性,而且可以利用预设的更新量来降低人工蜂群算法优化的花蜜源的维度,从而充分利用贪婪方法的局部优化和人工蜂群算法的全局优化。仿真结果表明,仅在等功率子载波分配阶段,该算法就可以达到要求的公平性阈值,有效提高系统总数据速率。
更新日期:2021-07-21
down
wechat
bug