Spectrum allocation based on an improved gravitational search algorithm (Q2331409)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spectrum allocation based on an improved gravitational search algorithm |
scientific article; zbMATH DE number 7123844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spectrum allocation based on an improved gravitational search algorithm |
scientific article; zbMATH DE number 7123844 |
Statements
Spectrum allocation based on an improved gravitational search algorithm (English)
0 references
29 October 2019
0 references
Summary: In cognitive radio networks (CRNs), improving system utility and ensuring system fairness are two important issues. In this paper, we propose a spectrum allocation model to construct CRNs based on graph coloring theory, which contains three classes of matrices: available matrix, utility matrix, and interference matrix. Based on the model, we formulate a system objective function by jointly considering two features: system utility and system fairness. Based on the proposed model and the objective problem, we develop an improved gravitational search algorithm (IGSA) from two aspects: first, we introduce the pattern search algorithm (PSA) to improve the global optimization ability of the original gravitational search algorithm (GSA); second, we design the Chebyshev chaotic sequences to enhance the convergence speed and precision of the algorithm. Simulation results demonstrate that the proposed algorithm achieves better performance than traditional methods in spectrum allocation.
0 references
GSA
0 references
spectrum allocation
0 references
CRNs
0 references
PSA
0 references
Chebyshev chaotic sequences
0 references
0.781135082244873
0 references
0.7672106623649597
0 references
0.7582839131355286
0 references
0.7565537691116333
0 references