{'fraction_non_alphanumeric': 0.017777777777777778, 'fraction_numerical': 0.0022222222222222222, 'mean_word_length': 5.788944723618091, '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}}
An adaptive scheduling scheme for inhomogeneously distributed wireless ad hoc networks

An efficient scheduling strategy guarantees the simultaneous transmission and successful reception by the scheduled nodes even inside a congested wireless ad hoc network. Owing to the dispersed nature of ad hoc networks, the node packing algorithm needs to be implementable without having network-wide channel state information and should additionally be able to pack the optimum number of successful transmissions. The proposed algorithm, for a network with nonhomogeneously distributed nodes, makes the decision to either inhibit or permit an active interferer around an active receiver based on the interferer’s transmission power. The analysis evidenced that the suggested scheme provides an estimated 100 times superior transmission capacity when equated to the random aloha scheme. Moreover, the proposed strategy proved its vitality by demonstrating substantial improvement in transmission and transport capacity in comparison to the preexisting renowned scheduling schemes for distributed networks. The final results present a closed-form formula for the best possible exclusion-zone size multiplier factor in terms of the network parameters, i.e. the network’s path-loss exponent, spreading gain, SINR threshold, outage constraint, and Tx-Rx separation.