On optimizing backoff counter reservation and classifying stations for the IEEE 802.11 distributed wireless LANs

In this paper, we propose a novel contention-based protocol called backoff counter reservation and classifying stations for the IEEE 802.11 distributed coordination function (DCF). In the proposed scheme, each station has three states: idle, reserved, and contentious. A station is in the idle state if it has no frame ready to transmit. A station is in the reserved state if it has a frame ready to transmit and this frame's backoff counter has been successfully announced through the previous successfully transmitted frame so that other stations know this information. A station is in the contentious state if it has a frame ready to transmit, but this frame's backoff counter has not been successfully announced to other stations. All the stations in the idle state, the reserved state, and the contentious state form an idle group, a reserved group, and a contentious group, respectively. Two backoff schemes are proposed in the BCR-CS protocol based on the number of stations in the contentious group including the optimal pseudo-p-persistent scheme. The proposed schemes are compared with the DCF and the enhanced collision avoidance (ECA) scheme in the literature. Extensive simulations and some analytical analysts are carried out. Our results show that all proposed schemes outperform both the DCF and the ECA, and the BCR-CS with optimal pseudo-p-persistent scheme is the best scheme among the four schemes