Open AccessPerformance analysis of a k ‐round contention resolution scheme for WLANs
Author(s) -
Chang Xiaoying,
Liu Kai,
Liu Feng
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.3135
Subject(s) - computer science , throughput , computer network , robustness (evolution) , scheme (mathematics) , node (physics) , distributed coordination function , wireless lan , local area network , wireless network , ieee 802.11 , wireless , hidden node problem , telecommunications , engineering , mathematics , wi fi array , mathematical analysis , biochemistry , chemistry , structural engineering , gene
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.