CSMA/CA networks have often been analyzed using a stylized model that is fully characterized by a vector of back-off rates and an undirected conflict graph. Further, for any achievable throughput vector under this model the existence of a unique vector of back-off rates that achieves this throughput vector has been proven. In this talk we uncover the set of conflict graphs for which a simple explicit expression can be obtained for this unique vector of back-off rates.

You can see the slides of the presentation here

Speaker

Benny van Houdt is professor at the Department of Computer Science.

Time and Place

Friday 2/12/2022 at 11:30am in M.A.143

Registration

Participation is free, but registration is compulsory. Make sure to fill in this form.

References and Related Reading