通过自适应调整最小竞争窗口最大化IEEE 802.11 DCF的饱和吞吐量
Self-adaptively Adjusting the Minimum Contention Windows to Maximizing the Saturated Throughput of IEEE 802.11 DCF
-
摘要: 最大化802.11 DCF的饱和吞吐量对充分利用无线局域网宝贵的带宽资源具有重要意义。该文在分析802.11 DCF的饱和吞吐量与最小竞争窗口、最大回退等级、网络中竞争信道的节点数的关系的基础上,推导了根据网络中竞争信道的节点数,计算最小竞争窗口的最佳值的简单公式。给出了估计竞争信道的节点数并据此动态调整最小竞争窗口的最佳值的自适应算法。同时,该文对估计竞争节点数的算法的准确性和计算最小竞争窗口最佳值的公式的准确性进行了仿真分析,并比较了改进后的802.11 DCF的饱和吞吐量与原802.11 DCF的饱和吞吐量的大小。仿真结果证明了上述公式、算法是准确和有效的。Abstract: It is important to maximize the saturated throughput of 802.11 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.11 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.
计量
- 文章访问数: 3085
- HTML全文浏览量: 123
- PDF下载量: 1433
- 被引次数: 0