Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
Discrete Applied Mathematics(2018)
Abstract
The present work deals with the problem of efficiently assigning Wi-Fi channels in a real-world scenario, the Polytechnic School of the University of Alcal\'a. We first use proximity graphs to model the whole problem as an instance of spectrum graph coloring, we further obtain a simplified model using edge contraction, and we finally use simulated annealing to look for a coloring which optimizes the network throughput. As the main result, we show that the solutions we obtain outperform the de facto standard for Wi-Fi channel assignment, both in terms of network throughput and of computation time.
MoreTranslated text
Key words
Graph coloring,Edge contraction,Frequency assignment,Wi-Fi channels,Spectrum coloring,Simulated annealing
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined