{'fraction_non_alphanumeric': 0.021966527196652718, 'fraction_numerical': 0.0020920502092050207, 'mean_word_length': 5.38, '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}}
Distributed Scheduling in a Time-Varying Ad Hoc Network

This paper studies opportunistic distributed scheduling in an ad hoc wireless network, assuming partial orthogonality among multiple transmitters. The approach is based on game theory. A fair distributed scheduling scheme in a time-correlated channel is defined using a synchronous game for highly orthogonal transmitters and using an asynchronous game based on one-at-a-time transmission otherwise. Distributed game heuristics only require local node level information but still achieve a significant portion (at least 80 % in example cases) of the sum of rates obtained using coalitional uplink proportional fair scheduling for a wide range of orthogonality factors. An asynchronous game based on one-at-a-time transmission performs well relative to PFS for non-orthogonal transmitters. In addition to noncooperative game models, a cooperative game model for threshold-based scheduling is studied.