Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
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 Alcala. We first use proximity graphs to model the whole problem as an instance of spectrum graph coloring, we further obtain a simplified model using...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universidad de Alcalá (UAH) |
| Repositorio: | e_Buah Biblioteca Digital Universidad de Alcalá |
| Idioma: | inglés |
| OAI Identifier: | oai:ebuah.uah.es:10017/64194 |
| Acceso en línea: | http://hdl.handle.net/10017/64194 https://dx.doi.org/10.1016/j.dam.2018.12.009 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph coloring Edge contraction Frequency assignment Wi-Fi channels Spectrum coloring Simulated annealing Telecomunicaciones Telecommunication |
| Sumario: | 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 Alcala. 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. |
|---|