作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (17): 91-92,1. doi: 10.3969/j.issn.1000-3428.2008.17.033

• 网络与通信 • 上一篇    下一篇

缓解拥塞的IEEE802.11速率选择算法

王 婷,史杏荣   

  1. (中国科学技术大学电子工程与信息科学系信息处理中心,合肥 230027)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-09-05 发布日期:2008-09-05

Congestion-relief IEEE802.11 Rate-choosen Algorithm

WANG Ting, SHI Xing-rong   

  1. (Information Processing Center, Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-09-05 Published:2008-09-05

摘要: IEEE802.11的速率选择算法OAR能有效利用信道条件,但不适合拥塞的网络环境。该文改进OAR算法,通过调整拥塞节点的初始竞争窗口值来增加其获得信道的概率,使其在拥塞时能尽快将分组转发出去,从而缓解了拥塞。仿真结果表明,改进后的OAR在网络负荷大时能有效地提高分组投递率。

关键词: IEEE802.11多速率机制, OAR算法, 拥塞

Abstract: IEEE802.11 multi-rate mechanism OAR can better utilize wireless channel conditions, but it does not work well in the congestion network environment. This paper improves the OAR algorithm, whch increases the probability to obtain the channel of the congestion node by adjusting the initial competition window size. So they can transmit the congestion pakets as soon as possible, thus congestion is relieved. Simulation results indicate the ratio of packet delivering of OAR is improved.

Key words: IEEE802.11 multi-rate mechanism, OAR algorithm, congestion

中图分类号: