首页 | 本学科首页   官方微博 | 高级检索  
     

基于IEEE802.11 DCF的优化竞争窗口算法
引用本文:张锋,向新,杨宝强,裴冬冬. 基于IEEE802.11 DCF的优化竞争窗口算法[J]. 电子技术应用, 2011, 37(7)
作者姓名:张锋  向新  杨宝强  裴冬冬
作者单位:空军工程大学工程学院,陕西西安,710038
基金项目:航空科学基金资助项目,陕西省自然科学基础研究资助项目
摘    要:针对现有IEEE802.11分布式协调功能DCF(Distribute Coordination Function)方式下吞吐量较小、时延较大的缺点,提出了一种优化竞争窗口的算法。该算法通过增加最小竞争窗口和最大竞争窗口,改进其退避算法,并综合考虑到了公平性的问题。经OPNET仿真验证表明,该算法提高了系统的吞吐量,减小了接入时延。

关 键 词:IEEE802.11分布式协调功能  竞争窗口  二进制退避算法

A calculation optimizing for contention window based on IEEE802.11 DCF
Zhang Feng,Xiang Xin,Yang Baoqiang,Pei Dongdong. A calculation optimizing for contention window based on IEEE802.11 DCF[J]. Application of Electronic Technique, 2011, 37(7)
Authors:Zhang Feng  Xiang Xin  Yang Baoqiang  Pei Dongdong
Abstract:In view of the present IEEE802.11 DCF(Distribute Coordination Function) with the weakness of system through be smaller and connected delay be bigger,a calculation optimizing the contention window is proposed.This calculation increased the minimal contention window and enlarged the maximal contention window,also improved the original backoff mechanism,considered the problem of equity comprehensively.The new method is imitated by OPNET.Simulation results show that system through can be improved,and connected delay declines.
Keywords:IEEE802.11 DCF  contention window  binary exponential backoff
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号