基于QoS和吞吐量公平的信道分配算法

摘要

The channel allocation with high-density Access Pointt'AP) coexistence is the main challenge to improve the system throughput. It is an unsolved problem to consider both the Quality of Service(QoS) of Basic Service Set(BSS) service and the throughput fairness within BSS. Based on the analysis model in IEEE 802.11e and comprehensively considering the throughput attenuation caused by adjacent AP, this paper puts forward a channel allocation algorithm CAQFT based on minimum spanning tree under the restricted condition to meet maximum fairness and minimum channel interference, which is gained through the introduction of Jain indicator to measure the fairness of throughput within BSS. Numerical analysis indicates that the CAQFT algorithm not only can effectively meet the QoS request in BSS service, but also can improve the overall throughput of system at largest possibility as well as the fairness of system throughput within BSS.%高密度接入点(AP)部署会导致AP工作信道重叠,从而较大地影响无线局域网的吞吐量.为此,在IEEE 802.1le分析模型的基础上,考虑AP受相邻AP干扰造成的吞吐量衰减,引入Jain指标衡量基础服务集(BSS)间系统吞吐量的公平性,在满足最大公平性和最小信道干扰的限制条件下,提出一种基于最小生成树的信道分配算法CAQFT.数值分析结果表明,CAQFT算法能满足BSS内业务的服务质量需求,提高整个系统吞吐量并兼顾BSS间系统吞吐量的公平性.