English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

This paper proposes a Markovian model of 1-persistent CSMA/CA protocols withK-Exponential Backoff scheduling algorithms. The input buffer of each accessnode is modeled as a Geo/G/1 queue, and the service time distribution of eachindividual head-of-line packet is derived from the Markov chain of theunderlying scheduling algorithm. From the queuing model, we derive thecharacteristic equation of network throughput and obtain the stable throughputand bounded delay regions with respect to the retransmission factor. Ourresults show that the stable throughput region of the exponential backoffscheme exists even for an infinite population. Moreover, we find that thebounded delay region of exponential backoff is only a sub-set of its stablethroughput region due to the large variance of the service time of inputpackets caused by the capture effect. All analytical results presented in thispaper are verified by simulations.

Performance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocols with Exponential Backoff Scheduling