Optimized Channel Assignment in Distributed Environment

Channel assignment problem in wireless network is closely related to vertex coloring problem. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimum, which is equivalent to vertex coloring of a graph with minimum number of colors. A proper vertex coloring is a fundamental problem in distributed systems. In this paper, we are describing channel assignment problem as an optimization graph coloring problem with the objective function to minimize the total number of colors used and present an experimental analysis of simple and elegant distributed algorithm for optimized vertex coloring problem. We have proved our results with the help of simulations.