Performance analysis of collision alleviating distributed coordination function protocol in congested wireless networks – a Markov chain analysis

Abstract

IEEE 802.11 is the most popular wireless local area network (WLAN) standard in use. WLANs support broadband multimedia communication and hence providing quality of service requirements such as good throughput and minimum endto-end delay are the two main challenging issues in designing of WLAN protocols for supporting real-time applications. Until now, several Markov chain models have been developed to evaluate and to enhance the performance of the IEEE 802.11 distributed coordination function (DCF) protocol. However, these models cannot accurately predict the performance of the network. Also, the existing models suffer with high packet collisions resulting in degradation of throughput and end-to-end delay particularly under congested environments. This study proposes an exact Markov chain model to accurately predict the performance of the wireless networks. To alleviate the collisions and to avoid channel capture effect, the authors introduce a post-backoff stage to provide inter packet backoff (IPB) delay between successive packet transmissions. The analysis is carried out by considering the non-saturated traffic and the impact of channel errors because of Rayleigh fading. Results show significant improvement in throughput and reduction in delay using the proposed model when compared with the existing models.

An Adaptive Channel Access Method for Dynamic Super Dense Wireless Sensor Networks

“…According to work in [11,27,28], the contention of accessing the channel can be modeled as a discrete time stochastic process that includes three states: idle slot state, successful packet transmission state including RTS/CTS/DATA/ACK and failed transmission state indicated by a failed RTS. The probabilities of the above states are three basic parameters in CSMA/CA based channel access schemes.…”

Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network

“…The first case is the probability where no station is using the shared medium, or an idle status of the channel can be determined with P idle [6]. The second case is the indication of at least a single station within a randomly selected slot of time transmits a data packet can be determined through the probability of P tr [7,42,43]. The third case is the probability that a packet is successfully transmitted is determined with P s [7,43].…”

Performance analysis of an adaptive OFDMA‐based CSMA/CA scheme on a wireless network

“…Several works have immensely contributed to the enhancement of throughput performance of IEEE 802.11 DCF by reducing collisions and packet errors and solving the exposed node problem [6, 8–11]. To improve the performance of DCF, Gottapu et al .…”