A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

The interference imposes a significant negative impact on the performance of wireless networks. With thecontinuous deployment of larger and more sophisticated wireless networks, reducing interference in suchnetworks is quickly being focused upon as a problem in today’s world. In this paper we analyze theinterference reduction problem from a graph theoretical viewpoint. A graph coloring methods areexploited to model the interference reduction problem. However, additional constraints to graph coloringscenarios that account for various networking conditions result in additional complexity to standardgraph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.