{'fraction_non_alphanumeric': 0.024844720496894408, 'fraction_numerical': 0.0, 'mean_word_length': 5.403973509933775, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Modeling CSMA/CA network under asymmetric conditions

Prior work reveals that unfairness in CSMA networks is mainly caused by three asymmetries: (i) information asymmetry; (ii) channel asymmetry; and (iii) rate asymmetry. In this paper, we develop a simple yet accurate analytical model that jointly characterizes all three asymmetric conditions. Our model allows us to estimate the throughput of two contending flows, given the contention window (CW) values. The model can be applied to remedy unfair issues in these topologies, by enabling CW tuning mechanisms to quantify the resulting throughput. The model is flexible enough to support three different fairness objectives. Further, we illustrate how to apply our CW tuning mechanism to an extensive set of asymmetric topologies. Using simulations and testbed measurements, we show that our CW tuning mechanism is effective in mitigating unfairness in the presence of the three fundamental asymmetric conditions.