Interference-aware greedy channel assignment in multi-radio multi-channel WMN
Jun Xu, Chengcheng Guo, Jianfeng Yang · 2016
A static channel assignment algorithm in multi-radio multi-channel WMN (Wireless Mesh Network) is proposed aiming to minimize the maximum link interference. The proposed algorithm is an approximation algorithm since the problem is NP-hard. We prove that the greedy channel assignment algorithm is a factor (2-1/k) algorithm, where k is the number of available orthogonal channels. Additionally, the greedy algorithm is compared with the simply sequential and random channel assignment algorithms. The simulation results show that the greedy channel assignment algorithm outperforms the sequential and random channel assignment algorithms.