Adaptive Multi-Color Cellular for repeaters coordination

Wireless communication system covers an entire region by dividing into many regions, and each one with a repeater. The Frequency Assignment Problem(FAP) requires that the same frequency should be shared by the repeater and the users, without being disturbed by other frequency of repeaters. The Conflict-Free Coloring problem is introduced to solve FAP that arises in wireless communication field. To work out the minimum member of repeaters, this paper divides the area into districts of equal regular hexagon, which is known as Cellular networks. By applying our model to the theory of Hypergraph, this paper shares the private line(PL) tones equally and creates out first model. This paper suggests a more efficient algorithm called Adapted Multi-Color Cellular, which allows more users to communicate with each other in the flat area easily. This adaptive algorithm achieves the process of staining according to the population distribution.