| IEEE 802.11 WLANs(Wireless Local Area Networks)have been widely developed due to their advantages of easy deployment,simplicity,reliability and extensibility.However,with the dense deployment of WLANs and the increase of network traffic,the interference between APs becomes more and more serious.The traditional channel assignment algorithms using three non-overlapping channels will not keep up with the growing demand for WLANs.Therefore,how to select an appropriate channel assignment algorithm and how to use partially overlapping channels to reduce the interference between adjacent APs and improve the system throughput is particularly important.This paper mainly focuses on distributed channel assignment algorithms for multiple independent APs.Specific work is as follows:Firstly,an interference model is proposed to solve the problem of high-density deployment of APs that cause co-channel interference among neighboring APs,and this interference model consists of major interference factors between APs,including the signal strength value between neighboring APs,users distribution weight in adjacent AP overlapped regions.Based on the interference model,a channel selection algorithm for multiple independent AP in Complicated Environment is proposed,also the interference information capture and channel selection algorithm are implemented.Then,a distributed channel assignment algorithm based on traffic awareness is proposed in this paper to solve the characteristics of dynamic changes in network traffic.This algorithm takes into account the traffic factor and effectively guarantees that the target AP can allocate a channel with the minimum interference weight,and fully utilize 11 channel resources.Thus,reducing the total system interference and improving performance.Finally,the Qualnet network simulation software is used to simulate proposed algorithm.The simulation results show that the proposed algorithm can improve the channel resource utilization,reduce the interference between APs and obtain higher system throughput. |