2021
DOI: 10.1155/2021/8891020
|View full text |Cite
|
Sign up to set email alerts
|

Novel Bee Colony Optimization with Update Quantities for OFDMA Resource Allocation

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…Liu et al [35] proposed three swarm optimization algorithms: discrete artificial bee colony (DABC), discrete artificial fish swarm (DAFS), and discrete shuffled frog leaping (DSFL) for fair resource allocation in heterogeneous cloud computing systems. Sun et al [36] proposed a novel artificial bee colony algorithm with updated quantities (ABC-UQ) of nectar sources for OFDMA resource allocation.…”
Section: Related Workmentioning
confidence: 99%
“…Liu et al [35] proposed three swarm optimization algorithms: discrete artificial bee colony (DABC), discrete artificial fish swarm (DAFS), and discrete shuffled frog leaping (DSFL) for fair resource allocation in heterogeneous cloud computing systems. Sun et al [36] proposed a novel artificial bee colony algorithm with updated quantities (ABC-UQ) of nectar sources for OFDMA resource allocation.…”
Section: Related Workmentioning
confidence: 99%
“…Traditional methods for resource allocation in wireless cellular networks mainly include iterative algorithms [5], [6], heuristic algorithms [7]- [9], and so on. These methods tend to have relatively high computational burden and computation time [10], and are not feasible to handle the time-varying wireless environments with real time.…”
Section: Introductionmentioning
confidence: 99%