{'fraction_non_alphanumeric': 0.02385008517887564, 'fraction_numerical': 0.0068143100511073255, 'mean_word_length': 4.62200956937799, '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}}
Determined Scheduling Algorithms for Channel Access in Wireless Mesh Networks

In this paper we have considered the determined scheduling problem for channel access in wireless mesh networks. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. In the single-channel ad hoc networks, the known best result for this problem is proved to be (K2+1) in arbitrary graphs [2] and 25 K in unit disk graphs [16] with K as the maximum node degree. In this paper we have proposed two fully distributed algorithms for the determined scheduling problem, namely, the one neighbor per cycle (ONPC) algorithm and the all neighbors per cycle (ANPC) algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by 2 K in some special case. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of ANPC is rather better than ONPC.