Wireless mesh networks (WMNs) have evolved quickly during the last several years. They are widely used in a lot of fields. Channel allocation provides basic means to guarantee mesh networks’ good performance such as efficient routing. The purpose of this paper is to study channel allocation in mesh networks.

First, the papers in channel allocation fields are surveyed, and then the limitations in existing methods noted. Graph theory is used to find a better model to represent the problem and algorithms are proposed based on this model. Simulation proved that algorithms are better than the previous conflict graph‐based approaches.

The paper analyzes the conflict graph‐based model and finds its limitations, then proposes a bipartite graph‐based model. Algorithms were devised based on this model. Simulation results illustrate that the algorithms can reduce the starvation ratio and improve the bandwidth utilization, compared with previous conflict graph‐based algorithms.

The research of this paper is based on an ideal network environment without interference or noises. It will be better if the noises are considered in future work.

To study the routing strategies of WMNs, it is not sufficient to only consider path length as routing metric since the nodes are heterogeneous. The routing metrics should include the channel bandwidths which are the results of channel allocation.

This paper presents a new bipartite graph‐based model to represent the channel allocation problem in mesh networks. This model is more efficient and includes more information compared with conflict graph model, and it also proposes channel allocation algorithms based on bipartite graph‐based model. The algorithms can reduce starvation ratio and improve the bandwidth utilization.