{'fraction_non_alphanumeric': 0.018556701030927835, 'fraction_numerical': 0.0, 'mean_word_length': 5.092050209205021, '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 wireless channel allocation in networks with mobile base stations

A mobile computing system with no fixed nodes is presented. In traditional cellular systems with fixed base stations the channel reuse pattern is static and deterministic. When the cell layout is dynamic, due to the mobility of base stations, the cluster of cells within co-channel interference range changes with time. Consequently, the channel reuse pattern is highly dynamic, Moreover, base stations also need wireless channels to communicate amongst themselves. A communication session between a pair of nodes may have to switch channels due to the movement of other nodes into the neighborhood. Hence, there is a need for new wireless channel allocation algorithms for virtual cellular systems with mobile base stations. In this paper, principles of mutual exclusion pertaining to distributed computing systems are employed to develop such an algorithm. The inter-base station wireless links are referred to as backbone links while the base station-mobile node links are referred to as short-hop links. The proposed algorithm is distributed, dynamic and deadlock free. Disjoint sets of channels are used for backbone and short-hop links. The distributed nature of the channel allocation scheme leads to robustness as the responsibility is no longer centralized at the MTSO. Instead, it is shared among all the mobile base stations. This also makes the algorithm scalable.