Performance analysis of a k-round contention resolution scheme for WLANs

摘要

To achieve high efficiency and robustness during the node contention process in medium access control (MAC) protocols, a -round contention resolution (-CR) scheme is devised. Theoretical analysis of its success probability of selecting only one node and throughput is also presented. Numerical results show that the -CR scheme can achieve higher than the -round elimination contention (-EC) scheme, and higher throughput than the -EC and IEEE 802.11 DCF schemes in a wireless local area network environment.