通過自適應(yīng)調(diào)整最小競爭窗口最大化IEEE 802.11 DCF的飽和吞吐量
Self-adaptively Adjusting the Minimum Contention Windows to Maximizing the Saturated Throughput of IEEE 802.11 DCF
-
摘要: 最大化802.11 DCF的飽和吞吐量對充分利用無線局域網(wǎng)寶貴的帶寬資源具有重要意義。該文在分析802.11 DCF的飽和吞吐量與最小競爭窗口、最大回退等級、網(wǎng)絡(luò)中競爭信道的節(jié)點數(shù)的關(guān)系的基礎(chǔ)上，推導(dǎo)了根據(jù)網(wǎng)絡(luò)中競爭信道的節(jié)點數(shù)，計算最小競爭窗口的最佳值的簡單公式。給出了估計競爭信道的節(jié)點數(shù)并據(jù)此動態(tài)調(diào)整最小競爭窗口的最佳值的自適應(yīng)算法。同時，該文對估計競爭節(jié)點數(shù)的算法的準(zhǔn)確性和計算最小競爭窗口最佳值的公式的準(zhǔn)確性進(jìn)行了仿真分析，并比較了改進(jìn)后的802.11 DCF的飽和吞吐量與原802.11 DCF的飽和吞吐量的大小。仿真結(jié)果證明了上述公式、算法是準(zhǔn)確和有效的。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.
-
計量
- 文章訪問數(shù): 3096
- HTML全文瀏覽量: 126
- PDF下載量: 1433
- 被引次數(shù): 0
下載:
