{'fraction_non_alphanumeric': 0.025018395879323033, 'fraction_numerical': 0.0, 'mean_word_length': 5.384976525821596, '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}}
Strategic subchannel resource allocation for cooperative OFDMA Wireless Mesh Networks

Wireless Mesh Networks (WMNs) are emerging as a key solution to provide broadband and mobile wireless connectivity in a flexible and cost effective way. In suburban areas, a common deployment model relies on OFDMA communications between mesh routers (MRs), with one MR installed at each user premises. In this paper, we investigate a possible user cooperation path to implement strategic resource allocation in OFDMA WMNs, under the assumption that users want to control their interconnection. In this case, a novel strategic situation appears: how much a MR can demand, how much it can obtain and how this shall depend on the interference with its neighbors. Strategic interference management and resource allocation mechanisms are needed to avoid performance degradation during congestion cases between MRs. In this paper, we model the problem as a bankruptcy game taking into account the interference between MRs. We identify possible solutions from cooperative game theory, namely the Shapley value and the Nucleolus, and show that they outperform two state-of-the-art schemes, namely Centralized-Dynamic Frequency Planning, C-DFP, and Frequency-ALOHA, F-ALOHA. In particular, the Nucleolus solution offers best performance overall in terms of throughput and fairness.