Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fairness in Collision-Free WLANs (1302.1697v1)

Published 7 Feb 2013 in cs.NI

Abstract: CSMA/ECA is a contention protocol that makes it possible to construct a collision-free schedule by using a deterministic backoff after successful transmissions. In this paper, we further enhance the CSMA/ECA protocol with two properties that allows to fairly accommodate a large number of contenders in a collision-free schedule. The first property, called hysteresis, instructs the contenders not to reset their contention window after successful transmissions. Thanks to hysteresis, the protocol sustains a high throughput regardless of the number of contenders. The second property, called fair-share, preserves fairness when different nodes use different contention windows. We present simulations results that evidence how these properties account for performance gains that go even further beyond CSMA/CA.

Citations (1)

Summary

We haven't generated a summary for this paper yet.