Feasibility of Optimally Assigning Channels by Exhaustive Search in Commercial Multi-Radio Wireless Mesh Networks

Date Added: Dec 2009
Format: PDF

Channel assignment problems in multi-radio Wireless Mesh Networks (WMNs) have been shown to be NP-hard in various scenarios in the literature. By far, most of research efforts have focused on developing efficient approximation algorithms that run reasonably fast and provide good quality channel assignment rather than the optimal one. However, from the practical network design and deployment standpoint, engineers care more about whether it is feasible to optimally assign channels in the simplest way (i.e., exhaustive search), as most of existing commercial WMNs are of small/medium scale. In this paper, the authors attempt to answer this practical question. They study the complexity of general channel assignment problems with certain basic and common properties.