Abstract: According to the problem that competing node number estimation algorithm of the optimal enhanced IEEE 802.11 Distributed Coordination Function(DCF) protocol is complex and imprecise, this paper proposes a Self-Adaptive Contention Window Adjustment(SACWA) scheme. It is proved that the saturation throughput is almost independent of the competing node number when the collision probability keeps invariable, which is the theoretic foundation of this protocol. Simulation results demonstrate that SACWA can achieve nearly optimal saturation throughput no matter the node number keeps stable or changes rapidly.

Key words: 802.11 Distributed Coordination Function(DCF) protocol, saturation throughput, contention window adjustment

摘要： 针对最优IEEE 802.11分布式协调功能改进协议的竞争节点个数估计算法存在计算复杂、精度较低的问题，提出一种自适应竞争窗调节策略SACWA。证明在碰撞概率保持不变的情况下网络饱和吞吐量与竞争节点个数的近似无关性，以此作为该协议设计的理论基础。仿真结果证明，该协议在节点数稳定和迅速变化的情况下都能达到近乎最优的饱和吞吐量。

关键词: 802.11分布式协调功能协议, 饱和吞吐量, 竞争窗调节

CLC Number: 

• TP393