{'fraction_non_alphanumeric': 0.01800327332242226, 'fraction_numerical': 0.0, 'mean_word_length': 5.870786516853933, '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 Multi-Interface Multi-Channel Random Access

The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC operates over a distinct orthogonal frequency channel. Most of the recently proposed channel assignment algorithms are based on formulating combinatorial channel assignment problems. The key is to assign exactly one frequency channel to each NIC. However, combinatorial channel assignment models may result in computationally complicated algorithms as well as inefficient utilization of the available frequency spectrum. In this paper, we revisit channel assignment problem by formulating a novel continuous multi-interface multi-channel random access model. This includes elaborate modeling of the link data rates for various multi-interface multi-channel networking scenarios. We then propose a fast, fully distributed and easy to implement multi- interface multi-channel random access algorithm. Simulation results show that our proposed algorithm significantly outperforms combinatorial channel assignment algorithms in terms of achieved network utility and aggregate network throughput.