一种802.11eEDCA机制的优化算法  

An Optimization Algorithm for 802.11e EDCA Mechanism

作　　者：王鹭[1] 蒋阳[1] 郎保才[1] 韩飞飞[1] 

机构地区：[1]重庆大学通信工程学院,重庆400044

出　　处：《计算机工程》2013年第6期111-114,共4页Computer Engineering

基　　金：重庆大学研究生科技创新基金资助项目(CDJXS11160020)

摘　　要：IEEE 802.11e增强型分布式信道访问机制对高优先级业务服务质量的保证,是通过牺牲低优先级业务服务质量来实现的。为避免这种信道资源分配不公平的现象,提出一种优化算法。将信道中部分时隙合并起来构成合并时隙,高优先级和低优先级业务在合并时隙中被先后发送,而单个时隙通常只发送低优先级业务。仿真结果表明,该算法可以提高业务的吞吐量,当站点数目增多时,高优先级业务和低优先级业务的吞吐量均表现稳定,可达到各种业务公平利用信道资源的目的。IEEE 802.11 e Enhanced Distributed Channel Access（EDCA） guarantees the Quality of Service（QoS） of high priority traffic, at the same time low priority traffic is sacrificed. For the phenomenon of unfair distribution resources in the channel, an optimization algorithm is proposed in this paper. This algorithm combines part of time slot into Merge Time Slot（MTS）. High and low priority traffics are sended in chronological order, while single usually sends low priority traffic. Simulation results show that this algorithm can improve the throughput of traffic, in the growing number of stations, the throughput performance of high and low priority traffics is stable, all kinds of traffic reach the purpose of fairly using channel resources.

关 键 词：无线局域网 IEEE802.1le协议 增强型分布式信道访问 服务质量 合并时隙 单个时隙 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]