Simulated annealing variants for self-organized resource allocation in small cell networks

  title={Simulated annealing variants for self-organized resource allocation in small cell networks},
  author={Furqan Ahmed and Olav Tirkkonen},
  journal={Appl. Soft Comput.},

Figures from this paper

Combinatorial Optimization for Artificial Intelligence Enabled Mobile Network Automation

Heuristics and metaheuristics based combinatorial optimization algorithms are highly effective in meeting emerging challenges related to network optimization, thereby enabling intelligent automation in mobile networks.

Self-Organizing Algorithms for Interference Coordination in Small Cell Networks

Simulation results in a practical setting show that the proposed pricing-based self-organization can achieve up to 100% improvement in cell-edge data rates when compared to baseline optimization strategies, and the convergence of the proposed algorithms is also proved theoretically.

A Novel Radio Resource Optimization Scheme in Closed Access Femtocell Networks Based on Bat Algorithm

Simulation results verify the convergence of the proposed optimization scheme to the global optimal solution and reveal that the proposed scheme based on modified bat algorithm facilitates the improvement of the femtocell network capacity.

A memory-based simulated annealing algorithm and a new auxiliary function for the fixed-outline floorplanning with soft blocks

Two groups of Matlab simulations show that the proposed memory-based simulated annealing algorithm can achieve better floorplanning results and satisfy both the fixed-outline and non-overlapping constraints while optimizing circuit performance.

Simulated Annealing Method-Based Flight Schedule Optimization in Multiairport Systems

A model to optimize the flight schedules in the MAS with multiple objectives of minimizing the maximum displacement of all flights, the weighted sum of total flight adjustment of each airport, and flight delays is proposed.

List of Publications

s, problems and remarks published [44] A. Gilányi, A characterization of monomial functions, Abstract, Report of Meeting, Aequationes Math. 53 (1997), 169. [45] A. Gilányi, On locally monomial



Algorithms for Self-Organized Resource Allocation in Wireless Networks

The semigreedy distributed local search (SDLS) algorithm, which is a particularly simple algorithm that is proposed here, is shown to outperform other algorithms in several cases and be able to symmetrize the interference coupling between cells, targeting an improvement of the channel quality of cell-edge users.

Distributed Generalized Graph Coloring

It is shown that a distributed algorithm finding a colorable sub graph can outperform distributed greedy local search and investigate a procedure of adding edges to random planar graphs, keeping the color ability.

Self Organized Physical Cell ID Assignment in Multi-Operator Heterogeneous Networks

  • F. AhmedO. Tirkkonen
  • Computer Science
    2015 IEEE 81st Vehicular Technology Conference (VTC Spring)
  • 2015
Simulations results show that the proposed algorithms have good convergence properties and are effective for self-organized PCI assignment in dense multioperator networks with shared spectrum.

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain well-studied domains of combinatorial optimization. Simulated annealing

Distributed Graph Coloring: Fundamentals and Recent Developments

The objective of this monograph is to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model of distributed computing and to stimulate further progress in this exciting area.

Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs

An evolutionary procedure for solving general optimization problems that combines efficiently the mechanism of a simple descent method and of genetic algorithms is presented.

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

This paper discusses annealing and its parameterized generic implementation, describes how this generic algorithm was adapted to the graph partitioning problem, and reports how well it compared to standard algorithms like the Kernighan-Lin algorithm.

Genetic and hybrid algorithms for graph coloring

It is illustrated that genetic operators can fulfill long-term strategic functions for a tabu search implementation that is chiefly founded on short-term memory strategies.

Distributed channel assignment algorithm based on simulated annealing for uncoordinated OSA-enabled WLANs

  • Francisco NovilloR. Ferrús
  • Computer Science, Business
    2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)
  • 2011
A distributed channel assignment algorithm valid for uncoordinated WLAN deployments where access points do not follow any specific planning and they could belong to different administrative domains is developed, based on a distributed adaptation of the simulated annealing metaheuristic algorithm commonly used in global optimization problems.

Frequency planning and ramifications of coloring

This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that