A new channel assignment algorithm for wireless mesh networks

摘要

Purpose - Wireless mesh networks (WMNs) have evolved quickly during the last several years.rnThey are widely used in a lot of fields. Channel allocation provides basic means to guarantee meshrnnetworks' good performance such as efficient routing. The purpose of this paper is to study channel allocation in mesh networks.rnDesign/methodology/approach - First, the papers in channel allocation fields are surveyed, andrnthen the limitations in existing methods noted. Graph theory is used to find a better model tornrepresent the problem and algorithms are proposed based on this model. Simulation proved thatrnalgorithms are better than the previous conflict graph-based approaches.rnFindings - The paper analyzes the conflict graph-based model and finds its limitations, thenrnproposes a bipartite graph-based model. Algorithms were devised based on this model. Simulationrnresults illustrate that the algorithms can reduce the starvation ratio and improve the bandwidthrnutilization, compared with previous conflict graph-based algorithms.rnResearch limitations/implications - The research of this paper is based on an ideal networkrnenvironment without interference or noises. It will be better if the noises are considered in future work.rnPractical implications - To study the routing strategies of WMNs, it is not sufficient to onlyrnconsider path length as routing metric since the nodes are heterogeneous. The routing metrics shouldrninclude the channel bandwidths which are the results of channel allocation.rnOriginality/value - This paper presents a new bipartite graph-based model to represent thernchannel allocation problem in mesh networks. This model is more efficient and includes morerninformation compared with conflict graph model, and it also proposes channel allocation algorithmsrnbased on bipartite graph-based model. The algorithms can reduce starvation ratio and improve thernbandwidth utilization.