2013/02/07 by Luis Sanabria-Russo, Jaume Barcelo, Jaume Barceló +4
Computer Science · #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Wireless Networks and Protocols #cs.NI
paper · pdf · doi:10.48550/arxiv.1302.1697
arxiv created 2013/02/07 · openalex publication_date 2013/02/07 · arxiv updated 2013/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.