{'fraction_non_alphanumeric': 0.023017902813299233, 'fraction_numerical': 0.0025575447570332483, 'mean_word_length': 5.486187845303867, '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}}
Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols

We investigate the benefits of channel-aware (opportunistic) scheduling of transmissions in ad hoc networks. The key challenge in optimizing the performance of such systems is finding a good compromise among three interdependent quantities: 1) the density of scheduled transmitters; 2) the quality of transmissions; and 3) the long term fairness among nodes. We propose two new channel-aware slotted CSMA protocols opportunistic CSMA and quantile-based CSMA (QT-CSMA) and develop new stochastic geometric models to quantify their performance in terms of spatial reuse and spatial fairness. When properly optimized, these protocols offer substantial improvements in performance relative to CSMA - particularly, when the density of nodes is moderate to high. In addition, we show that a simple version of QT-CSMA can achieve robust performance gains without requiring careful parameter optimization. The quantitative results in this paper suggest that channel-aware scheduling in ad hoc networks can provide substantial benefits which might far outweigh the associated implementation overheads.