Graph-Theoretic Optimization of Wi-Fi Channel Assignment: A Simulation-Based Study
SINDANI BUKERIMANZA Moise *
Management Information Systems, Haute Ecole de Commerce de Kinshasa, Kinshasa, DRC.
MUHINDO MASIVI Osee
Management Information Systems, Haute Ecole de Commerce de Kinshasa, Kinshasa, DRC.
MUHINDO MUYALO Noe
Department of Mathematics, Institut Superieur Pedagogique de Goma, Goma, DRC.
*Author to whom correspondence should be addressed.
Abstract
This paper presents a simulation-based approach to Wi-Fi channel allocation using weighted interference graphs. A synthetic 12–AP network modeled with a load-distance metric yields an initial interference cost of 0.4276. Applying Greedy, Welsh–Powell, and DSATUR produces zero-interference solutions (Interf = 0), showing that the network is fully 3-colorable. The results confirm the efficiency of graph-coloring methods for Wi-Fi channel optimization. The findings also suggest that graph-based channel assignment can serve as a practical decision-support tool for optimizing real-world indoor Wi-Fi deployments.
Keywords: Wi-Fi networks, interference graph, graph coloring, channel assignment, interference minimization, DSATUR, Welsh—Powell, Greedy algorithm, integer linear programming, wireless simulation