Automatic channel assignment is a key technique to mitigate signal interference and to increase network capacity in multi-channel multi-radio wireless mesh networks. Existing algorithms either can not make efficient use of available radio frequency resources, or have channel assignment coupled with routing and thus lack the practicality in the real world. In this paper, we describe the design of a traffic-aware routing-independent channel assignment algorithm, which aims to make a better trade-off between mesh network capacity improvement and the practicality for channel assignment. Our algorithm does not need any explicit knowledge from the routing protocols. It assumes long-term stable traffic demand and measures the traffic load on each network link. It then assigns channels to the radios based on the measured traffic demand on the network. Extensive ns2 simulations demonstrate that, compared to [8], decoupling channel assignment from routing in our algorithm does not result in significant performance degradation.

IEEE 802.11 based wireless mesh networks have recently attracted much attention as they provide a quick and inexpensive way to extend access to the existing wired networks. A significant problem of such networks is their limited capacity due to signal interference. A frequently proposed approach to increasing mesh network capacity is to equip each mesh node with multiple radios, which can work on multiple non-interfering channels simultaneously. In this paper, we characterize the relationship between the mesh network capacity and the number of non-interfering channels as well as the number of radios per node, assuming that each radio works on a statically assigned channel. Our main result is that, given k non-interfering channels and m radios on each node, the network capacity improvement is bound by O(min (k, m2/t)), where t is the average node degree per neighbor (i.e., the average number of common channels shared by a pair of neighboring nodes). The parameter t and the number of neighbors around each node determine the mesh network’s average node degree, which affects the network connectivity. To validate our analysis, we use simulation results of two channel assignment algorithms and find that both can achieve a constant factor of the theoretical upper bound. Our work offers practical insights for designing and evaluating channel assignment algorithms and for deploying 802.11 wireless mesh networks.