Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 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

On the Distributed Construction of a Collision-Free Schedule in WLANs (1311.0787v1)

Published 4 Nov 2013 in cs.NI

Abstract: In wireless local area networks (WLANs), a media access protocol arbitrates access to the channel. In current IEEE 802.11 WLANs, carrier sense multiple access with collision avoidance (CSMA/CA) is used. Carrier sense multiple access with enhanced collision avoidance (CSMA/ECA) is a subtle variant of the well-known CSMA/CA algorithm that offers substantial performance benefits. CSMA/ECA significantly reduces the collision probability and, under certain conditions, leads to a completely collision-free schedule. The only difference between CSMA/CA and CSMA/ECA is that the latter uses a deterministic backoff after successful transmissions. This deterministic backoff is a constant and is the same for all the stations. The first part of the paper is of tutorial nature, offering an introduction to the basic operation of CSMA/ECA and describing the benefits of this approach in a qualitative manner. The second part of the paper surveys related contributions, briefly summarizing the main challenges and potential solutions, and also introducing variants and derivatives of CSMA/ECA.

Summary

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