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 k-round contention resolution (k-CR) scheme is devised. Theoretical analysis of its success probability of selecting only one node p_s and throughput is also presented. Numerical results show that the k-CR scheme can achieve higher p_s than the k-round elimination contention (k-EC) scheme, and higher throughput than the k-EC and IEEE 802.11 DCF schemes in a wireless local area network environment.