Graph Coloring Applicable to Channel Assignment for Future Wireless Communication

Abstract

It has been pointed out that the coloring problem in graph theory can be applied to channel assignment in wireless communication, and numerous studies have been carried out. Initially, the study was conducted in the framework of the cellular system, assuming a car phone. Since then, wireless communication has advanced and a wide range of applications is being considered. Graph coloring is expected to be applicable to wireless communication, but it is not sufficient at present. Therefore, in this paper, we will introduce the past of channel assignment and graph coloring, which is expected to support advanced wireless communication in the future. Finally, we illustrate graph examples that can be applied to wireless sensor networks.