Next Article in Journal
Carbon Oxides Gases for Occupancy Counting and Emergency Control in Fog Environment
Previous Article in Journal
Vision-Based Parking-Slot Detection: A Benchmark and A Learning-Based Approach
Article Menu
Issue 3 (March) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(3), 65; doi:10.3390/sym10030065

Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment

1
Departamento de Física y Matemáticas, Universidad de Alcalá, Escuela Politécnica Superior, 28805 Alcalá de Henares (Madrid), Spain
2
Departamento de Automática, Universidad de Alcalá, Escuela Politécnica Superior, 28805 Alcalá de Henares (Madrid), Spain
*
Author to whom correspondence should be addressed.
Received: 13 February 2018 / Revised: 8 March 2018 / Accepted: 10 March 2018 / Published: 14 March 2018
View Full-Text   |   Download PDF [1129 KB, uploaded 14 March 2018]   |  

Abstract

We introduce and explore a family of vertex-coloring problems, which, surprisingly enough, have not been considered before despite stemming from the problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a matrix of interferences between each pair of colors, the Threshold Spectrum Coloring problem fixes the number of colors available and aims to minimize the interference threshold, i.e., the maximum of the interferences at the vertices. Conversely, the Chromatic Spectrum Coloring problem fixes a threshold and aims to minimize the number of colors for which respecting that threshold is possible. As the main theoretical results, we prove tight upper bounds for the solutions to each problem. Since both problems turn out to be NP-hard, we complete the scene with experimental results. We propose a DSATUR-based heuristic and study its performance to minimize the maximum vertex interference in Wi-Fi channel assignment, both for randomly-generated graphs and for a real-world scenario. Further, for all these graphs, we experimentally check the goodness of the theoretical bounds. View Full-Text
Keywords: graph coloring; interference; chromatic number; DSATUR; frequency assignment; Wi-Fi channel assignment graph coloring; interference; chromatic number; DSATUR; frequency assignment; Wi-Fi channel assignment
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Orden, D.; Gimenez-Guzman, J.M.; Marsa-Maestre, I.; de la Hoz, E. Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment. Symmetry 2018, 10, 65.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top