通过自适应调整最小竞争窗口最大化IEEE 802.11 DCF的饱和吞吐量  

Self-adaptively Adjusting the Minimum Contention Windows to Maximizing the Saturated Throughput of IEEE 802.11 DCF

作　　者：李云[1] 陈前斌[1] 隆克平[1] 吴诗其[2] 

机构地区：[1]重庆邮电学院光互联网及无线信息网络研究中心,重庆400065 [2]电子科技大学抗干扰国防重点实验室,成都610054

出　　处：《电子与信息学报》2006年第10期1930-1934,共5页Journal of Electronics & Information Technology

基　　金：国家863计划项目(2003AA121540);国家自然科学基金(90304004);重庆市教委科学技术研究基金(050310;KJ050503);重庆市科委自然科学基金项目(8817);人事部2003年度归国人员择优资助项目联合资助课题

摘　　要：最大化802.11DCF的饱和吞吐量对充分利用无线局域网宝贵的带宽资源具有重要意义。该文在分析802.11DCF的饱和吞吐量与最小竞争窗口、最大回退等级、网络中竞争信道的节点数的关系的基础上,推导了根据网络中竞争信道的节点数,计算最小竞争窗口的最佳值的简单公式。给出了估计竞争信道的节点数并据此动态调整最小竞争窗口的最佳值的自适应算法。同时,该文对估计竞争节点数的算法的准确性和计算最小竞争窗口最佳值的公式的准确性进行了仿真分析,并比较了改进后的802.11DCF的饱和吞吐量与原802.11DCF的饱和吞吐量的大小。仿真结果证明了上述公式、算法是准确和有效的。It is important to maximize the saturated throughput of 802. 1 1 DCF for fully utilizing wireless bandwidth. The saturated throughput of 802.11 DCF is related to minimum contention windows, maximum backoff stage and the contending nodes in the networks. Based on the analysis to this relationship, this paper induces a simple formula to calculate the optimized minimum contention windows for maximizing the saturated throughput of 802. 1 1 DCF, and gives a self-adaptive contention nodes estimation algorithm, according to which and the simple formula, the optimized minimum contention windows is adapted dynamically. The accuracy of above formula and algorithm is valuated by simulation. The saturated throughput of improved 802.11 DCF and the saturated throughput of 802.11 DCF are compared in this paper. The simulation results prove that the above formula and algorithm are accurate and effective.

关 键 词：8无线局域网 802.11 分布式协调功能 饱和吞吐量 

分 类 号：TP393.17[自动化与计算机技术—计算机应用技术]