Strategies For Effective Distribution Channel Wireless Mesh Network

Wireless mesh network is a new multi-hop wireless network which has many advantagessuch as flexible networking, high network coverage, high robustness, non-line of sight. It is abright future networking technology. In order to improve network throughput and bandwidthutilization by taking advantage of orthogonal channels, channel allocation of resources hasbecome a hotspot research in wireless mesh network.In this paper, starting from the basic technologies of wireless Mesh networks, it detailedintroduced the network model, analyzed and compared with traditional local LAN and Ad Hocnetwork. Then pointed out the advantages and disadvantages of wireless Mesh networks anddescribed the main application. Followed the article summarized several factors in the channelallocation needing to attended and considered based on the channel of wireless Mesh networkallocation algorithm. Then this paper focuses on the research at home and abroad about thetypical algorithm of wireless Mesh channel allocation, emphatically elaborated each kind oftypical algorithms, and analyzes the advantages and disadvantages of various typical algorithms.This paper proposed the algorithm in spatial domain based on the greedy algorithm and thealgorithm considered the transverse interference between the same layer in lay-by-lay algorithmfor multi-channel allocation. The main improvement idea was as follows:Contra posed the algorithm based on the combination of time and space, this paper took thechannel which was allocated in previous sub-time slot when allocated the channel into count andallocated different channel to different radio interface not just allocated by the graph coloringtheory by as possible as using the characteristics of the non-interfering between different channelwhen allocated channel. If there were enough channels for using between in neighboringsub-time slots, the communication could not disconnect in the previous sub-time slot whenallocated the channel to the next sub-time slot. At the same time it could reduce the time andother expenses when switched the channel. Finally the simulations results showed that theperformance of the algorithm had improved significantly and was to achieve the desired effect.In layer-by-layer channel allocation algorithm. Since all traffic gathered up, layer-by-layerenriched, so the requirement gradually became higher to the nodes in the same layer which werenear to the gateway. All this made the dependence between the nodes and the gateway graduallyincrease, so that the problem occurred in one node would affect many nodes rely on the node, thecloser the node which happened problem to the gateway, the more nodes would affect whichrely on the node. At the same time the communication between nodes in the same layer must go through the node in the up one layer or even the up one of the up one layer. If the nodes whowere neighbor could connect directly on the basis of the original channel assignment, theutilization would be improved and the load of the upper node would be reduced. So this paperproposed an improvement algorithm to improve the old algorithm. Finally the simulation resultsshowed that the algorithm performance had improved significantly and achieve the desiredeffect.In conclusion, the article summarized the content and effectiveness of this study, andproposed three directions for future research which was for the improvements for the presentalgorithm based on the current research.