摘要
针对现有IEEE802.11分布式协调功能DCF(Distribute Coordination Function)方式下吞吐量较小、时延较大的缺点,提出了一种优化竞争窗口的算法。该算法通过增加最小竞争窗口和最大竞争窗口,改进其退避算法,并综合考虑到了公平性的问题。经OPNET仿真验证表明,该算法提高了系统的吞吐量,减小了接入时延。
In view of the present IEEES02.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.
出处
《电子技术应用》
北大核心
2011年第7期111-114,共4页
Application of Electronic Technique
基金
航空科学基金资助项目(20095596014)
陕西省自然科学基础研究资助项目(2009JM8001-4)
