Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fairness in Collision-Free WLANs

Published 7 Feb 2013 in cs.NI | (1302.1697v1)

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

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.