Local search algorithms for wireless mesh networks
share
In a multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (Mobile Computing and Communications Review 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named maximum edge q-coloring and studied in several papers by Feng et. al (TAMC 2007), Adamazek and Popa (ISAAC 2010, Journal of Discrete Algorithms 2016). Later on Larjomaa and Popa (IWOCA 2014, Journal of Graph Algorithms and Applications 2015) define and study an alternative variant, named the min-max edge q-coloring. The above mentioned graph problems, namely the maximum edge q-coloring and the min-max edge q-coloring are studied mainly from the theoretical perspective. In this paper, we study the min-max edge q-coloring problem from a practical perspective. More precisely, we introduce, implement and test three heuristic approximation algorithms for the min-max edge q-coloring problem. These algorithms are based on local search methods like basic hill climbing, simulated annealing and tabu search techniques. Although several algorithms for particular graph classes were proposed by Larjomaa and Popa (e.g., trees, planar graphs, cliques, bi-cliques, hypergraphs), we design the first algorithms for general graphs.
READ FULL TEXT