Study on the L(2,1)-labeling problem based on simulated annealing algorithm

Abstract

L(2, 1)-labeling problem of a graph G = (V, E ) is a problem to find an efficient way to distribute radio frequencies to various wireless equipments in wireless networks. In this work, we suggest a Simulated Annealing algorithm that can be applied to the L(2, 1)-labeling problem. By applying the suggested algorithm to various graphs we will try to show the efficiency of our algorithm.