Simulated annealing variants for self-organized resource allocation in small cell networks
Small cell networks can be effectively modeled using planar graphs. Distributed graph coloring can enable self-organized orthogonal resource allocation. Simulated annealing variants are important metaheuristics for distributed coloring of planar graphs.
simulated annealing self-organization resource allocation small cell networks distributed graph coloring