Abstract
This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implemented
to guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genetic algorithm can approximately achieve the optimum bandwidth efficiency whilst requiring only 24% of the computation effort
of the exhaustive search in the investigated network.
to guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genetic algorithm can approximately achieve the optimum bandwidth efficiency whilst requiring only 24% of the computation effort
of the exhaustive search in the investigated network.
Original language | English |
---|---|
Title of host publication | Multiple Access Communications |
Subtitle of host publication | th International Workshop, MACOM 2015, Helsinki, Finland, September 3-4, 2015, Proceedings |
Editors | Magnus Jonsson, Alexey Vinel, Boris Bellalta, Olav Tirkkonen |
Publisher | Springer International Publishing AG |
Pages | 123-134 |
Number of pages | 12 |
ISBN (Electronic) | 9783319234403 |
ISBN (Print) | 9783319234397 |
DOIs | |
Publication status | Published - 3 Sept 2015 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer International Publishing |
Volume | 9305 |
ISSN (Print) | 0302-9743 |
Keywords
- Multi-cell
- Exhaustive search
- Genetic algorithm
- Frequency reuse
- Cooperative transmission