Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms

Zihan Luo, Simon Armour, Joe McGeehan

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

256 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationMultiple Access Communications
Subtitle of host publicationth International Workshop, MACOM 2015, Helsinki, Finland, September 3-4, 2015, Proceedings
EditorsMagnus Jonsson, Alexey Vinel, Boris Bellalta, Olav Tirkkonen
PublisherSpringer International Publishing AG
Number of pages12
ISBN (Electronic)9783319234403
ISBN (Print)9783319234397
Publication statusPublished - 3 Sep 2015

Publication series

NameLecture Notes in Computer Science
PublisherSpringer International Publishing
ISSN (Print)0302-9743


  • Multi-cell
  • Exhaustive search
  • Genetic algorithm
  • Frequency reuse
  • Cooperative transmission


Dive into the research topics of 'Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms'. Together they form a unique fingerprint.

Cite this